相关论文: Nowhere-Zero Flow Polynomials

This paper discusses the location of zeros of polynomials in a polynomial sequence $\{P_n(z)\}$ generated by a three-term recurrence relation of the form $P_n(z)+ B(z)P_{n-1}(z) +A(z) P_{n-k}(z)=0$ with $k>2$ and the standard initial…

Let $f_i$ be polynomials in $n$ variables without a common zero. Hilbert's Nullstellensatz says that there are polynomials $g_i$ such that $\sum g_if_i=1$. The effective versions of this result bound the degrees of the $g_i$ in terms of the…

Using a continuous unitary transformation recently proposed by Wegner \cite{Wegner} together with an approximation that neglects irrelevant contributions, we obtain flow equations for Hamiltonians. These flow equations yield a diagonal or…

The dynamics of gradient and Hamiltonian flows with particular application to flows on adjoint orbits of a Lie group and the extension of this setting to flows on a loop group are discussed. Different types of gradient flows that arise from…

We consider the three dimensional Heisenberg nilflows. Under a full measure set Diophantine condition on the generator of the flow we construct Bufetov functionals which are asymptotic to ergodic integrals for sufficiently smooth functions,…

Identities obtained by elementary finite Fourier analysis are used to derive a variety of evaluations of the Tutte polynomial of a graph G at certain points (a,b) where (a-1)(b-1) equals 2 or 4. These evaluations are expressed in terms of…

In the chip-firing variant, Diffusion, chips flow from places of high concentration to places of low concentration (or equivalently, from the rich to the poor). We explore this model on complete graphs, determining the number of different…

In this paper we propose a spectral flow for graph Laplacians, and prove that it counts the number of nodal domains for a given Laplace eigenvector. This extends work done for Laplacians on $\mathbb{R}^n$ to the graph setting. We mention…

We study quasipolynomials enumerating proper colorings, nowhere-zero tensions, and nowhere-zero flows in an arbitrary CW-complex $X$, generalizing the chromatic, tension and flow polynomials of a graph. Our colorings, tensions and flows may…

We analyze the action of the spectral flows on N=2 twisted topological theories. We show that they provide a useful mapping between the two twisted topological theories associated to a given N=2 superconformal theory. This mapping can also…

We investigate the evolution of the empirical distribution of the complex roots of high-degree random polynomials, when the polynomial undergoes the heat flow. In one prominent example of Weyl polynomials, the limiting zero distribution…

An unsplittable multiflow routes the demand of each commodity along a single path from its source to its sink node. As our main result, we prove that in series-parallel digraphs, any given multiflow can be expressed as a convex combination…

We associate a graph to a possible non-zero zero-divisor in the group algebra of a torsion-free group.

In this paper we describe protocols which use a standard deck of cards to provide a perfectly sound zero-knowledge proof for Hamiltonian cycles and Flow Free puzzles. The latter can easily be extended to provide a protocol for a…

We introduce the ``trivariate Tutte polynomial" of a signed graph as an invariant of signed graphs up to vertex switching that contains among its evaluations the number of proper colorings and the number of nowhere-zero flows. In this, it…

We consider the PDE flow associated to Riemann zeta and general Dirichlet $L$-functions. These are models characterized by nonlinearities appearing in classical number theory problems, and generalizing the classical holomorphic Riemann flow…

An (r,alpha)-bounded excess flow ((r,alpha)-flow) in an orientation of a graph G=(V,E) is an assignment of a real "flow value" between 1 and r-1 to every edge. Rather than 0 as in an actual flow, some flow excess, which does not exceed…

The nullity of a graph is the multiplicity of the eigenvalues zero in its spectrum. A signed graph is a graph with a sign attached to each of its edges. In this paper, we obtain the coefficient theorem of the characteristic polynomial of a…

We give counterexamples to the Brown-Colbourn conjecture on reliability polynomials, in both its univariate and multivariate forms. The multivariate Brown-Colbourn conjecture is false already for the complete graph K_4. The univariate…

It is known that complete graphs and complete multipartite graphs have modularity zero. We show that the least number of edges we may delete from the complete graph $K_n$ to obtain a graph with non-zero modularity is $\lfloor n/2\rfloor…