Related papers: Flow Polynomials and their Asymptotic Limits for L…
In this note we give asymptotic estimates for the volume growth associated to suitable infinite graphs. Our main application is to give an asymptotic estimate for volume growth associated to translation surfaces.
In this paper are discussed the results of new numerical experiments on zero distribution of type I Hermite-Pad\'e polynomials of order $n=200$ for three different collections of three functions $[1,f_1,f_2]$. These results are obtained by…
In this paper we consider a ``flow'' of nonparametric solutions of the volume constrained Plateau problem with respect to a convex planar curve. Existence and regularity is obtained from standard elliptic theory, and convexity results for…
Let U be a homogeneous variety over Q of a linear algebraic group. Choose an integral model and assume the existence of infinitely many integral points. Then one would like to give an asymptotic count of integral points of bounded height…
Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…
The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we make use of the fact that these polynomials can be realized as Ehrhart polynomials of inside-out…
Adjacency polytopes appear naturally in the study of nonlinear emergent phenomena in complex networks. The "PQ-type" adjacency polytope, denoted $\nabla^{\mathrm{PQ}}_G$ and which is the focus of this work, encodes rich combinatorial…
In this short note, we are interested in discussing characteristics of finite generating sets for $\mathcal{F}$, the set of all semiflows with non negative coefficients of a Petri Net. By systematically positioning these results over semi…
We study the zero-temperature partition function of the Potts antiferromagnet (i.e., the chromatic polynomial) on a torus using a transfer-matrix approach. We consider square- and triangular-lattice strips with fixed width L, arbitrary…
We study cumulants of numbers of $q$-step walks on Erd\"os-R\'enyi-type random graphs of long-range percolation radius model in the limit when the number of vertices $N$, concentration $c$, and the interaction radius $R$ tend to infinity.…
The Tutte polynomial of a graph, or equivalently the $q$-state Potts model partition function, is a two-variable polynomial graph invariant of considerable importance in both combinatorics and statistical physics. The computation of this…
In the case of polynomial potentials all solutions to 1-D Schroedinger equation are entire functions totally determined by loci of their roots and their behaviour at infinity. In this paper a description of the first of the two properties…
Galluccio--Loebl and Tesler showed that the perfect-matching polynomial of a graph embedded in an orientable surface of genus $g$ can be written as a linear combination of at most $4^g$ Pfaffians. We show that, in general, exponentially…
We introduce a natural weighted enumeration of lattice points in a polytope, and give a Brion-type formula for the corresponding generating function. The weighting has combinatorial significance, and its generating function may be viewed as…
In this note a definition of umbilic point at infinity is proposed, at least for surfaces that are homogeneous polynomial graphs over a plane in Euclidean 3-space. This is a stronger definition than that of Toponogov in his study of…
In this paper a description of the small-$\hbar$ limit of loci of zeros of fundamental solutions for polynomial potentials is given. The considered cases of the potentials are bounded to the ones which provided us with simple turning points…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…
The independence polynomial $I(G,x)$ of a finite graph $G$ is the generating function for the sequence of the number of independent sets of each cardinality. We investigate whether, given a fixed number of vertices and edges, there exists…
We provide a complete analysis of the asymptotics for the semi-infinite Schur flow: $\alpha_j(t)=(1- |\alpha_j(t)|^2) (\alpha_{j+1}(t)-\alpha_{j-1}(t))$ for $\alpha_{-1}(t)= 1$ boundary conditions and $n=0,1,2,...$, with initial condition…
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…