English
Related papers

Related papers: Flow polynomials as Feynman amplitudes and their $…

200 papers

We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…

Combinatorics · Mathematics 2025-11-19 Vincent Brugidou

In the pathbreaking article \cite{LED16}, an integral representation of the derivatives of entropy along the heat flow of a probability measure was established under suitable moment conditions. These integral representations have found…

Combinatorics · Mathematics 2025-10-28 Paul Mansanarez

Let $(h_t)_{t\in \mathbb{R}}$ be the horocycle flow acting on $(M,\mu)=(\Gamma \backslash \text{SL}(2,\mathbb{R}),\mu)$, where $\Gamma$ is a co-compact lattice in $\text{SL}(2,\mathbb{R})$ and $\mu$ is the homogeneous probability measure…

Dynamical Systems · Mathematics 2020-03-25 Adam Kanigowski , Davide Ravotti

A $d$-dimensional nowhere-zero $r$-flow on a graph $G$, an $(r,d)$-NZF from now on, is a flow where the value on each edge is an element of $\mathbb{R}^d$ whose (Euclidean) norm lies in the interval $[1,r-1]$. Such a notion is a natural…

Combinatorics · Mathematics 2023-04-28 Davide Mattiolo , Giuseppe Mazzuoccolo , Jozef Rajník , Gloria Tabarelli

The Tutte polynomial is an important invariant of graphs and matroids. Chen and Guo \emph{[Adv. in Appl. Math. 166 (2025) 102868.]} proved that for a $(k+1)$-edge connected graph $G$ and for any $i$ with $0\leq i <\frac{3(k+1)}{2}$,…

Combinatorics · Mathematics 2025-09-29 Xiaxia Guan , Xian'an Jin , Tianlong Ma , Weihua Yang

The flow semigroup, introduced by John Rhodes, is an invariant for digraphs and a complete invariant for graphs. After collecting together previous partial results, we refine and prove Rhodes's conjecture on the structure of the maximal…

Combinatorics · Mathematics 2017-08-18 Gábor Horváth , Chrystopher L. Nehaniv , Károly Podoski

We initiate the study of nowhere-zero flow reconfiguration. The natural question is whether any two nowhere-zero $k$-flows of a given graph $G$ are connected by a sequence of nowhere-zero $k$-flows of $G$, such that any two consecutive…

Let $\mathbb{H}$ be the sub-Riemannian Heisenberg group. That $\mathbb{H}$ supports a rich family of quasiconformal mappings was demonstrated by Kor\'{a}nyi and Reimann using the so-called flow method. Here we supply further evidence of the…

Classical Analysis and ODEs · Mathematics 2020-01-31 Alex D. Austin

We introduce a new family of symmetric polynomials $\mathfrak{G}^{(\mathbf{u},\mathbf{v})}_{\lambda}$ arising from exactly solvable lattice models associated with the quantised loop algebra $\mathcal{U}_{q}(\mathfrak{sl}_{2}[z^\pm])$. The…

Combinatorics · Mathematics 2025-12-05 Ajeeth Gunna , Michael Wheeler , Paul Zinn-Justin

It is well known that the 2-variable Tutte polynomials contain chromatic polynomial and flow polynomial of graphs, i.e. the cases of $y=0$ and $x=0$. In 2013, K\'{a}lm\'{a}n introduced the interior and exterior polynomials which generalized…

Combinatorics · Mathematics 2026-05-26 Tianlong Ma , Xiaxia Guan , Xian'an Jin

An edge-weighted graph $G$, possibly with loops, is said to be antiferromagnetic if it has nonnegative weights and at most one positive eigenvalue, counting multiplicities. The number of graph homomorphisms from a graph $H$ to an…

Combinatorics · Mathematics 2025-06-18 Joonkyung Lee , Jaeseong Oh , Jaehyeon Seo

We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory…

Combinatorics · Mathematics 2011-05-16 Beifang Chen

We find new properties of the topological transition polynomial of embedded graphs, $Q(G)$. We use these properties to explain the striking similarities between certain evaluations of Bollob\'as and Riordan's ribbon graph polynomial,…

Combinatorics · Mathematics 2014-06-10 Joanna A. Ellis-Monaghan , Iain Moffatt

In 1983, Bouchet conjectured that every flow-admissible signed graph admits a nowhere-zero 6-flow. We verify this conjecture for the class of flow-admissible signed graphs possessing a spanning even Eulerian subgraph, which includes as a…

Combinatorics · Mathematics 2025-10-10 Chao Wen , Qiang Sun , Chao Zhang

In this paper, we study the pointwise convergence of centain continuous-time polynomial ergodic averages. Our approach is based on the topological models of measurable flows. One of the main results of this paper is as follows: Let $a\in…

Dynamical Systems · Mathematics 2025-02-14 Wen Huang , Song Shao , Rongzhong Xiao

Tittmann, Averbouch and Makowsky [P. Tittmann, I. Averbouch, J.A. Makowsky, The enumeration of vertex induced subgraphs with respect to the number of components, European Journal of Combinatorics, 32 (2011) 954-974], introduced the subgraph…

Combinatorics · Mathematics 2013-12-03 Yunhua Liao , Yaoping Hou

Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…

Combinatorics · Mathematics 2026-05-13 Matias von Bell , Cesar Ceballos

Let $\Gamma$ be a graph, $A$ an abelian group, $\mathcal{D}$ a given orientation of $\Gamma$ and $R$ a unital subring of the endomorphism ring of $A$. It is shown that the set of all maps $\varphi$ from $E(\Gamma)$ to $A$ such that…

Combinatorics · Mathematics 2021-11-16 Jun-Yang Zhang , Na Lu

We prove that for every countable discrete group $G$, there is a $G$-flow on $\omega^*$ that has every $G$-flow of weight $\leq\! \aleph_1$ as a quotient. It follows that, under the Continuum Hypothesis, there is a universal $G$-flow of…

General Topology · Mathematics 2018-02-07 Will Brian

Let $K$ be an algebraically closed field with characteristic zero, and $\mathfrak{g}$ a Lie algebra. Let $Y(\mathfrak{g})$ be the subalgebra of the symmetric algebra $S(\mathfrak{g})=K[\mathfrak{g}^*]$ made of the polynomials which are…

Representation Theory · Mathematics 2020-10-20 Kenny Phommady