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

For integer q>1, we derive edge q-colouring models for (i) the Tutte polynomial of a graph G on the hyperbola H_q, (ii) the symmetric weight enumerator of the set of group-valued q-flows of G, and (iii) a more general vertex colouring model…

We consider specific linear combinations of two loop modular graph functions on the toroidal worldsheet with $2s$ links for $s=2, 3$ and $4$. In each case, it satisfies an eigenvalue equation with source terms involving $E_{2s}$ and $E_s^2$…

The one-way model of quantum computation is an alternative to the circuit model. A one-way computation is driven entirely by successive adaptive measurements of a pre-prepared entangled resource state. For each measurement, only one outcome…

The Sinai billiard flow on the two-torus, i.e., the periodic Lorentz gas, is a continuous flow, but it is not everywhere differentiable. Assuming finite horizon, we relate the equilibrium states of the flow with those of the Sinai billiard…

To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…

The chromatic polynomial is a well studied object in graph theory. There are many results and conjectures about the log-concavity of the chromatic polynomial and other polynomials related to it. The location of the roots of these…

We generalise to signed graphs a classical result of Tutte [Canad. J. Math. 8 (1956), 13--28] stating that every integer flow can be expressed as a sum of characteristic flows of circuits. In our generalisation, the r\^ole of circuits is…

We propose a supersymmetric gradient flow in ${\cal N}=1$ SQCD in four dimensions. The flow equation is derived in the superfield formalism and is also given for component fields of the Wess-Zumino gauge in a gauge covariant manner. We find…

The Tutte polynomial of a graph is a two-variable polynomial whose zeros and evaluations encode many interesting properties of the graph. In this article we investigate the zeros of the Tutte polynomials of graphs, and show that they form a…

Let $G$ be a bridgeless graph, $C$ is a circuit of $G$. Fan proposed a conjecture that if $G/C$ admits a nowhere-zero 4-flow, then $G$ admits a 4-flow $(D,f)$ such that $E(G)-E(C)\subseteq$ supp$(f)$ and $|\textrm{supp}(f)\cap…

Continuing from Part 1 (Hern\'andez \emph{et al.}, \emph{arXiv:2108.12395}, 2021), a generalized quasilinear (GQL) approximation is studied in turbulent channel flow using a flow decomposition defined with spanwise Fourier modes: the flow…

It is well known, due to Lindstr\"om, that the minors of a (real or complex) matrix can be expressed in terms of weights of flows in a planar directed graph. Another classical fact is that there are plenty of homogeneous quadratic relations…

We study connections among polynomials, differential equations and streams over a field K, in terms of algebra and coalgebra. We first introduce the class of (F,G)-products on streams, those where the stream derivative of a product can be…

We provide an explicit probability measure on $\mathbb{R}$ for which the fifth time derivative of the entropy along the heat flow is positive at some time. This disproves the Gaussian completely monotone (GCM) conjecture (Cheng-Geng '15)…

We show a flow-augmentation algorithm in directed graphs: There exists a randomized polynomial-time algorithm that, given a directed graph $G$, two vertices $s,t \in V(G)$, and an integer $k$, adds (randomly) to $G$ a number of arcs such…

For an $r$-graph $F$, define Sidorenko exponent $s(F)$ as $$s(F):= \sup \{s \geq 0: \exists \text{$r$-graph $H$ s.t. } t_F(H) = t_{K^{(r)}_r} (H)^s > 0\},$$ where $t_{H_1}(H_2)$ denotes the homomorphism density of $H_1$ in $H_2$. The…

This study examines the convexification version of the backward differential flow algorithm for the global minimization of polynomials, introduced by O. Arikan \textit{et al} in \cite{ABK}. It investigates why this approach might fail with…

Gelfand-Tsetlin polytopes are prominent objects in algebraic combinatorics. The number of integer points of the Gelfand-Tsetlin polytope $\mathrm{GT}(\lambda)$ is equal to the dimension of the corresponding irreducible representation of…

The $q$-analogue of the binomial coefficient, known as a $q$-binomial coefficient, is typically denoted $\left[{n \atop k}\right]_q$. These polynomials are important combinatorial objects, often appearing in generating functions related to…

It has been known since the work of Tutte that the value of the chromatic polynomial of planar triangulations at $(3+\sqrt{5})/2$ has a number of remarkable properties. We investigate to what extent Tutte's relations characterize planar…