SearcharxivSearch

arXiv subjects

Ariel Bruner

Publications and source records attributed to Ariel Bruner.

3 recordsLinked to original sources

FBApro: A fast, simple linear transformation for diverse metabolic modeling tasks

Constraint-based metabolic modeling is the predominant framework for simulating cellular metabolism. The central assumption of these models is that metabolism operates at a steady state, meaning that the production and consumption rates of each metabolite are balanced. This assumption imposes linear constraints on the fluxes of biochemical reactions. Flux Balance Analysis (FBA), a fundamental method in the field, is formulated as an optimization problem maximizing a cellular objective (e.g., growth) over the resulting linear subspace of steady state fluxes. Many other methods in the field are expressed either as a modification to FBA, or use FBA as a black box within an algorithm. Here, we propose a general alternative to optimization called FBApro. For any given vector of reference fluxes, FBApro finds the closest flux vector within the steady-state subspace, and accounts for both partially given reference fluxes and exact constraints on reactions. While FBApro is the solution to a quadratic program, we show that it can be implemented as a single linear operation using orthogonal projections to corresponding affine spaces and sets of linear equations. The overall approach is computationally efficient, does not require a cellular objective, and is easy to implement. We formally derive the closed-form expressions for FBApro and simpler variants, and validate it on both synthetic and real cancer cell line data.

q-bio.QM

A note on the distinct distances problem over finite fields

We study a finite-field analogue of the Erd\H{o}s distinct distances problem under the Hamming metric. For a set \(S\subseteq \mathbb{F}_q^n\) let $\Delta(S)$ denote the set of Hamming distances determined by \(S\). We prove the lower bound \[ |\Delta(S)| \;\ge\; \frac{\log |S|}{2\log(2nq)}, \] and show this bound is tight when \(|S|=O(\text{poly}(n))\), where the constant of proportionality depends only on $q$. We then also study the problem of finding a large \emph{rainbow set}, that is, a subset \(S\subseteq \mathbb{F}_q^n\) for which all \(\binom{|S|}{2}\) pairwise Hamming distances spanned by $S$ are distinct. In contrast to the Euclidean setting, we show that a set with many distinct distances does not imply the existence of a large rainbow set, by giving an explicit construction. Nevertheless, we establish the existence of large rainbow sets, and prove that every large set in \(\mathbb{F}_q^n\) necessarily contains a non-trivial rainbow subset.

math.CO

Distinct distances between a collinear set and an arbitrary set of points

We consider the number of distinct distances between two finite sets of points in ${\bf R}^k$, for any constant dimension $k\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary points, such that no hyperplane orthogonal to $l$ and no hypercylinder having $l$ as its axis contains more than $O(1)$ points of $P_2$. The number of distinct distances between $P_1$ and $P_2$ is then $$ Ω\left(\min\left\{ n^{2/3}m^{2/3},\; \frac{n^{10/11}m^{4/11}}{\log^{2/11}m},\; n^2,\; m^2\right\}\right) . $$ Without the assumption on $P_2$, there exist sets $P_1$, $P_2$ as above, with only $O(m+n)$ distinct distances between them.

math.CO