Related papers: Signed graphs: from modulo flows to integer-valued…

A rich $k$-flow is a nowhere-zero $k$-flow $\phi$ such that, for every pair of adjacent edges $e$ and $f$, $|\phi(e)| \neq |\phi(f)|$. A graph is rich flow admissible if it admits a rich $k$-flow for some integer $k$. In this paper, we…

In this paper we give rates of convergence for the $p$-curve shortening flow for $p\geq 1$ an integer, which improves on the known estimates and which are probably sharp.

Framing triangulations of unit flow polytopes have received a great deal of recent study with rich connections to various generalizations of Catalan and Cambrian combinatorics as well as volume and h*-polynomial formulas. This story has…

Caroline Series' [{\em The modular surface and continued fractions}, J. Lond. Math. Soc. (2), {\bf 31}, no.~1, (1985), 69--80] gives a clear framework linking, in a deceptively simple way, the dynamics of the geodesic flow on the modular…

The one-way measurement model is a framework for universal quantum computation, in which algorithms are partially described by a graph G of entanglement relations on a collection of qubits. A sufficient condition for an algorithm to perform…

We introduce a new graph invariant \Lambda(G) that we call maxmaxflow, and put it in the context of some other well-known graph invariants, notably maximum degree and its relatives. We prove the equivalence of two "dual" definitions of…

The low-energy expansion of closed-string scattering amplitudes at genus one introduces infinite families of non-holomorphic modular forms called modular graph forms. Their differential and number-theoretic properties motivated Brown's…

The Fischer, Krieger, and fiber product covers of sofic beta-shifts are constructed and used to show that every strictly sofic beta-shift is $2$-sofic. Flow invariants based on the covers are computed, and shown to only depend on an single…

This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R^n. The results have implications for the possibility of multiple fixed points of maps and…

In this paper, we propose a new numerical scheme for a spatially discrete model of constrained total variation flows, which are total variation flows whose values are constrained in a Riemannian manifold. The difficulty of this problem is…

We give an explicit calculation of the Wu invariants for immersions of a finite graph into the plane and classify all generic immersions of a graph into the plane up to regular homotopy by the Wu invariant. This result is a generalization…

Temporal interaction networks capture the history of activities between entities along a timeline. At each interaction, some quantity of data (money, information, kbytes, etc.) flows from one vertex of the network to another. Flow-based…

We construct a topological invariant for a Morse-Smale flow on a 3-manifold and prove that the flows are topologically equivalent iff their invariants are same.

Our aim is to study the Total Variation Flow in Metric Graphs. First, we define the functions of bounded variation in Metric Graphs and their total variation, we also give an integration by parts formula. We prove existence and uniqueness…

A computational flow is a pair consisting of a sequence of computational problems of a certain sort and a sequence of computational reductions among them. In this paper we will develop a theory for these computational flows and we will use…

A one-parameter family of coupled flows depending on a parameter $\kappa>0$ is introduced which reduces when $\kappa=1$ to the coupled flow of a metric $\omega$ with a $(1,1)$-form $\alpha$ due recently to Y. Li, Y. Yuan, and Y. Zhang. It…

The celebrated Antezana-Pujals-Stojanoff Theorem states that the iterated Aluthge transforms of an arbitrary matrix converge to a normal matrix. We introduce a family of matrix flows that share this convergence property by defining them…

This paper concerns the tau constant, which is an important invariant of a metrized graph, and which has applications to arithmetic properties of curves. We give several formulas for the tau constant, and show how it changes under graph…

Lov\'{a}sz et al. proved that every $6$-edge-connected graph has a nowhere-zero $3$-flow. In fact, they proved a more technical statement which says that there exists a nowhere zero $3$-flow that extends the flow prescribed on the incident…

This paper deals with Fountain codes, and especially with their encoding matrices, which are required here to be invertible. A result is stated that an encoding matrix induces a permutation. Also, a result is that encoding matrices form a…