Related papers: Flow Polynomials and their Asymptotic Limits for L…
We present exact calculations of chromatic polynomials for families of cyclic graphs consisting of linked polygons, where the polygons may be adjacent or separated by a given number of bonds. From these we calculate the (exponential of the)…
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…
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…
Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer $L$, an {\em $L$-bounded flow} is a flow between $s$ and $t$ that can be decomposed into paths of length at most $L$. In the {\em maximum $L$-bounded flow…
Let $G$ be a bridgeless graph. In 2011 Kung and Royle showed that all roots of the flow polynomial $F(G,\lambda)$ of $G$ are integers if and only if $G$ is the dual of a chordal and plane graph. In this article, we study whether a…
We give the asymptotic behavior of the zeros of orthogonal polynomials, after appropriate scaling, for which the orthogonality measure is supported on the $q$-lattice $\{q^k, k=0,1,2,3,\ldots\}$, where $0 < q < 1$. The asymptotic…
The main results of this paper are limit theorems for horocycle flows on compact surfaces of constant negative curvature. One of the main objects of the paper is a special family of horocycle-invariant finitely-additive Hoelder measures on…
Let $r \geq 2$ be a real number. A complex nowhere-zero $r$-flow on a graph $G$ is an orientation of $G$ together with an assignment $\varphi\colon E(G)\to \mathbb{C}$ such that, for all $e \in E(G)$, the modulus of the complex number…
The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dimensional polytope, where admissibility is a powerful but…
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…
This paper presents new analytical formulae for flow in a channel with one or both walls patterned with a longitudinal array of ridges and arbitrarily protruding menisci. Derived from a matched asymptotic expansion, they extend results by…
The intersection distribution of a polynomial $f$ over finite field $\mathbb{F}_q$ was recently proposed in Li and Pott (arXiv:2003.06678v1), which concerns the collective behaviour of a collection of polynomials $\{f(x)+cx \mid c \in…
We consider the problem of Data Flow Analysis over monotone data flow frameworks with a finite lattice. The problem of computing the Maximum Fixed Point (MFP) solution is shown to be P-complete even when the lattice has just four elements.…
The Chan-Robbins-Yuen polytope can be thought of as the flow polytope of the complete graph with netflow vector $(1, 0, \ldots, 0, -1)$. The normalized volume of the Chan-Robbins-Yuen polytope equals the product of consecutive Catalan…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
We present exact calculations of the Potts model partition function Z(G,q,v) for arbitrary q and temperature-like variable v on n-vertex strip graphs G of the triangular lattice for a variety of transverse widths equal to L vertices and for…
For a function g(w) analytic and univalent in {w:1<|w|<\infty} with a simple pole at \infty and a continuous extension to {w:|w|\geq 1}, we consider the Faber polynomials F_n(z), n=0,1,2,..., associated to g(w) via their generating function…
We calculate exponential growth constants $\phi$ and $\sigma$ describing the asymptotic behavior of spanning forests and connected spanning subgraphs on strip graphs, with arbitrarily great length, of several two-dimensional lattices,…
Graph polynomials which are definable in Monadic Second Order Logic (MSOL) on the vocabulary of graphs are Fixed-Parameter Tractable (FPT) with respect to clique-width. In contrast, graph polynomials which are definable in MSOL on the…
In contrast to ordinary graphs, the number of the nowhere-zero group-flows in a signed graph may vary with different groups, even if the groups have the same order. In fact, for a signed graph $G$ and non-negative integer $d$, it was shown…