English
Related papers

Related papers: Flows on Simplicial Complexes

200 papers

For an abelian group $\Gamma$, a graph $G$ is said to be $\Gamma$-flow-critical if $G$ does not admit a nowhere-zero $\Gamma$-flow, but for each edge $e\in E(G)$, the contraction $G/e$ has a nowhere-zero $\Gamma$-flow. A bound on the…

Combinatorics · Mathematics 2022-12-06 Zdeněk Dvořák , Bojan Mohar

Unitary flows $T_t$ of dynamic origin are proposed such that for every countable subset $Q\subset (0,+\infty)$ the tensor product $\bigotimes_{q\in Q} T_q $ has simple spectrum. This property is generic for flows preserving the sigma-finite…

Dynamical Systems · Mathematics 2022-05-17 Valery V. Ryzhikov

We study the partition function Z_{G(nk,k)}(Q,v) of the Q-state Potts model on the family of (non-planar) generalized Petersen graphs G(nk,k). We study its zeros in the plane (Q,v) for 1<= k <= 7. We also consider two specializations of…

Mathematical Physics · Physics 2015-10-07 Jesper Lykke Jacobsen , Jesus Salas

Assume that the vertices of a graph $G$ are always operational, but the edges of $G$ fail independently with probability $q \in[0,1]$. The \emph{all-terminal reliability} of $G$ is the probability that the resulting subgraph is connected.…

Combinatorics · Mathematics 2018-10-01 J. I. Brown , C. D. C. DeGagne

Let $\mathfrak{F}_m$ be the set of all cuspidal automorphic representations of $\mathrm{GL}_m(\mathbb{A}_{\mathbb{Q}})$, and let $F(s,\boldsymbol{\pi})$ be a polynomial in the derivatives of $L$-functions associated with representations…

Number Theory · Mathematics 2025-12-30 Anji Dong , Nawapan Wattanawanichkul , Alexandru Zaharescu

Let $G$ be a graph. A zero-sum flow of $G$ is an assignment of non-zero real numbers to the edges of $G$ such that the sum of the values of all edges incident with each vertex is zero. Let $k$ be a natural number. A zero-sum $k$-flow is a…

Combinatorics · Mathematics 2016-01-29 Fan Yang , Xiangwen Li

We initiate the study of a multivariate graph polynomial $\Phi_G(x,y,z)$ that interpolates between classical counting polynomials for matchings and for cycle structures arising in the Harary--Sachs expansion of the characteristic…

Combinatorics · Mathematics 2026-02-10 Gabriel Coutinho , Paula M. S. Fialho

In 1981 Seymour proved his famous 6-flow theorem asserting that every 2-edge-connected graph has a nowhere-zero flow in the group ${\mathbb Z}_2 \times {\mathbb Z}_3$ (in fact, he offers two proofs of this result). In this note we give a…

Combinatorics · Mathematics 2023-02-20 Matt DeVos , Jessica McDonald , Kathryn Nurse

We study two notions of expansiveness for continuous semiflows: expansiveness in the sense of Alves, Carvalho and Siqueira (2017), and an adaptation of positive expansiveness in the sense of Artigue (2014). We prove that if $X$ is a metric…

Dynamical Systems · Mathematics 2021-09-14 Sebastián Herrero , Nelda Jaque

Let $G$ be a graph. A zero-sum flow in $G$ is an assignment of nonzero real number to the edges such that the sum of the values of all edges incident with each vertex is zero. Let $k$ be naturel number. A zero-sum $k$-flow is a flow with…

Combinatorics · Mathematics 2015-03-13 S. Akbari , N. Ghareghani , G. B. Khosrovshahi , S. Zare

In this work we prove that certain entire $q$-functions have infinitely many nonzero roots $\left\{ \rho_{n}\right\} _{n=1}^{\infty}$, as $n\to+\infty$ the moduli $\left|\rho_{n}\right|$ grow at least exponentially. Applications to entire…

Complex Variables · Mathematics 2024-01-31 Ruiming Zhang

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…

Combinatorics · Mathematics 2026-01-23 Robert Lukoťka

We study a function field version of a classical problem concerning square-free values of polynomials evaluated at primes. We show that for a square-free polynomial $f\in \mathbb{F}_q[t][x]$, there is a limiting density as $n\to \infty$ of…

Number Theory · Mathematics 2015-06-02 Guy Lando

The Q-state Potts model can be extended to noninteger and even complex Q in the FK representation. In the FK representation the partition function,Z(Q,a), is a polynomial in Q and v=a-1(a=e^-T) and the coefficients of this…

Statistical Mechanics · Physics 2009-11-07 Seung-Yeon Kim , Richard J. Creswick

Let X be a vector field on a compact connected manifold M. An important question in dynamical systems is to know when a function g:M -> R is a coboundary for the flow generated by X, i.e. when there exists a function f: M->R such that Xf=g.…

Dynamical Systems · Mathematics 2015-07-23 Livio Flaminio , Giovanni Forni

Tutte's 3-flow conjecture asserts that every 4-edge-connected graph has a nowhere-zero 3-flow. In this note we prove that every regular graph of valency at least four admitting a solvable arc-transitive group of automorphisms admits a…

Combinatorics · Mathematics 2014-05-27 Xiangwen Li , Sanming Zhou

Let $Q$ be a smooth compact orientable 3--manifold with smooth boundary $\partial Q$. Let $\mathcal{B}$ be the set of exact 2--forms $B\in\Omega^2(Q)$ such that $j_{\partial Q}^*B=0$, where $j_{\partial Q}:{\partial Q}\to Q$ is the…

Dynamical Systems · Mathematics 2017-03-10 Elena A. Kudryavtseva

Adapting Lindstr\"om's well-known construction, we consider a wide class of functions which are generated by flows in a planar acyclic directed graph whose vertices (or edges) take weights in an arbitrary commutative semiring. We give a…

Combinatorics · Mathematics 2012-01-31 Vladimir I. Danilov , Alexander V. Karzanov , Gleb A. Koshevoy

We introduce the notion of a generalized flow on a graph with coefficients in a R-representation and show that the module of flows is isomorphic to the first derived functor of the colimit. We generalize Kirchhoff's laws and build an exact…

Category Theory · Mathematics 2023-06-27 A. A. Husainov , H. Calisici

The theory of flows was used as a crucial tool in the recent proof by Margolis, Rhodes and Schilling that Krohn-Rhodes complexity is decidable. In this paper we begin a systematic study of aperiodic flows. We give the foundations of the…

Dynamical Systems · Mathematics 2025-02-04 Stuart Margolis , John Rhodes