Related papers: On the Davenport-Mahler bound

The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…

Let C be some class of objects equipped with a set of simplifying moves. When we apply these to a given object M in C as long as possible, we get a root of M. Our main result is that under certain conditions the root of any object exists…

Motivated by the Cauchy-Davenport theorem for sumsets, and its interpretation in terms of Cayley graphs, we prove the following main result : There is a universal constant e > 0 such that, if G is a connected, regular graph on n vertices,…

In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…

In this article we prove an upper bound for a Hilbert polynomial on quaternionic Kaehler manifolds of positive scalar curvature. As corollaries we obtain bounds on the quaternionic volume and the degree of the associated twistor space.…

We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.

We generalize two main theorems of matching polynomials of undirected simple graphs, namely, real-rootedness and the Heilmann-Lieb root bound. Viewing the matching polynomial of a graph $G$ as the independence polynomial of the line graph…

We provide a purely variational proof of the existence of eigenvalues below the bottom of the essential spectrum for the Schr\"odinger operator with an attractive $\delta$-potential supported by a star graph, i.e. by a finite union of rays…

We obtain a Bernstein theorem for special Lagrangian graphs in n-dimensional complex space for arbitrary n only assuming bounded slope, but no quantitative restriction.

For signed graphs we provide a cubic polynomial upper bound on the multiplicity of its eigenvalues. We show that this bound is sharp by providing examples of signed graphs in which it is attained. We also discuss particular cases in which…

We consider the Dirichlet boundary value problem for graphical maximal submanifolds inside Lorentzian type ambient spaces, and obtain general existence and uniqueness results which apply to any codimension.

Inspired by Viennot's observation that matching polynomials are numerators of branched continued fractions we present a proof of the Heilmann-Lieb Theorem.

We prove that, if f:R^n\to R satisfies Fr\'echet's functional equation and f(x_1,...,x_n) is not an ordinary algebraic polynomial in the variables x_1,...,x_n, then f is unbounded on all non-empty open set U of R^n. Furthermore, the closure…

We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.

We prove that Allard's regularity theorem holds for rectifiable $n$-dimensional varifolds $V$ assuming a weaker condition on the first variation. This, in the special case when $V$ is a smooth manifold translates to the following: If…

We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…

In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation,…

In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colors. The bound relates both numbers using power of 2, while…

In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the…