Related papers: On the Davenport-Mahler bound

We prove a Riemann-Roch theorem for real divisors on edge-weighted graphs over the reals, extending the result of Baker and Norine for integral divisors on graphs with multiple edges.

Given an unbounded domain $\Omega$ of a Hadamard manifold $M$, it makes sense to consider the problem of finding minimal graphs with prescribed continuous data on its cone-topology-boundary, i.e., on its ordinary boundary together with its…

The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity…

In this paper we partially settle our conjecture from [1] (math.SP/0701143) on roots of eigenpolynomials for degenerate exactly-solvable operators. Namely, for any such operator, we establish a lower bound (which supports our conjecture)…

We prove a sharp degree bound for polynomials constant on a hyperplane with a fixed number of distinct monomials for dimensions 2 and 3. We study the connection with monomial CR maps of hyperquadrics and prove similar bounds in this setup…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

Known results on the generalized Davenport constant related to zero-sum sequences over a finite abelian group are extended to the generalized Noether number related to the rings of polynomial invariants of an arbitrary finite group. An…

We investigate the multiplier rigidity problem for polynomial automorphisms of $\mathbf{C}^2$. A first result states that a complex H\'enon map of given degree is determined up to finitely many choices by its multiplier spectrum, or more…

Tropical geometry gives a bound on the ranks of divisors on curves in terms of the combinatorics of the dual graph of a degeneration. We show that for a family of examples, curves realizing this bound might only exist over certain…

Let $ D $ be a finite digraph, and let $ V_0,\dots,V_{k-1} $ be nonempty subsets of $ V(D) $. The (strong form of) Edmonds' branching theorem states thatthere are pairwise edge-disjoint spanning branchings $ \mathcal{B}_0,\dots,…

We prove a new lower bound for the Mahler measure of a polynomial in one and in several variables that depends on the complex coefficients, and the number of monomials. In one variable our result generalizes a classical inequality of…

An existence theorem for stationary discs of strongly pseudoconvex domains in almost complex manifolds is proved. More precisely, it is shown that, for all points of a suitable neighborhood of the boundary and for any vector belonging to…

We give a multivariate version of Descartes' rule of signs to bound the number of positive real roots of a system of polynomial equations in n variables with n+2 monomials, in terms of the sign variation of a sequence associated both to the…

For any finite, undirected, non-bipartite, vertex-transitive graph, we establish an explicit lower bound for the smallest eigenvalue of its normalised adjacency operator, which depends on the graph only through its degree and its…

We develop the tools to bound extreme roots of multivariate real zero polynomials globally. This is done through the use of a relaxation that approximates their rigidly convex sets. This relaxation can easily be constructed using the degree…

We define ruling invariants for even-valence Legendrian graphs in standard contact three-space. We prove that rulings exist if and only if the DGA of the graph, introduced by the first two authors, has an augmentation. We set up the usual…

Univariate polynomials are called stable with respect to a domain $D$ if all of their roots lie in $D$. We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always…

Let G be a graph in a 3-manifold M. We compress the pair (M,G) along admissible 2-spheres as long as possible. What we get is a root of (M,G). Our main result is that for any pair (M,G) the root exists and is unique. As a corollary we get…

We prove an upper bound on the number of pairwise strongly cospectral vertices in a normal Cayley graph, in terms of the multiplicities of its eigenvalues. We use this to determine an explicit bound in Cayley graphs of $\mathbb{Z}_2^d$ and…

Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial…