English
Related papers

Related papers: On the Davenport-Mahler bound

200 papers

A complex unit gain graph is a simple graph in which each orientation of an edge is given a complex number with modulus 1 and its inverse is assigned to the opposite orientation of the edge. In this article, first we establish bounds for…

Combinatorics · Mathematics 2019-10-04 Ranjit Mehatari , M. Rajesh Kannan , Aniruddha Samanta

We prove that certain sequences of Laurent polynomials, obtained from a fixed Laurent polynomial P by monomial substitutions, give rise to sequences of Mahler measures which converge to the Mahler measure of P. This generalizes previous…

Number Theory · Mathematics 2025-02-11 François Brunault , Antonin Guilloux , Mahya Mehrabdollahei , Riccardo Pengo

The complexity of graph homomorphism problems has been the subject of intense study. It is a long standing open problem to give a (decidable) complexity dichotomy theorem for the partition function of directed graph homomorphisms. In this…

Computational Complexity · Computer Science 2010-08-06 Jin-Yi Cai , Xi Chen

We establish the existence of hypersurfaces with constant mean curvature and a prescribed boundary in Euclidean space, represented as radial graphs over domains of the unit sphere. Under the assumptions that the mean curvature of the…

Differential Geometry · Mathematics 2025-07-25 Flávio Cruz , José T. Cruz , Jocel Oliveira

M. Beck, J. De Loera, M. Develin, J. Pfeifle and R. Stanley found that the roots of the Ehrhart polynomial of a d-dimensional lattice polytope are bounded above in norm by 1+(d+1)!. We provide an improved bound which is quadratic in d and…

Combinatorics · Mathematics 2010-07-23 Benjamin Braun

We prove asymptotically optimal bounds on the number of edges a graph $G$ must have in order that any $r$-colouring of $E(G)$ has a colour class which contains every $D$-degenerate graph on $n$ vertices with bounded maximum degree. We also…

Combinatorics · Mathematics 2022-11-30 Peter Allen , Julia Böttcher

We prove that the graph of a continuous function $f$, defined on a domain of ${\mathbb C}^n$, is pluripolar if and only if $f$ is holomorphic.

Complex Variables · Mathematics 2013-02-25 N. V. Shcherbina

We study the existence and regularity of invariant graphs for bundle maps (or bundle correspondences with generating bundle maps motivated by ill-posed differential equations) having some relative partial hyperbolicity on non-trivial and…

Dynamical Systems · Mathematics 2020-10-14 Deliang Chen

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

Computational Complexity · Computer Science 2012-10-30 Nicolas de Rugy-Altherre

We prove that the discrete harmonic function corresponding to smooth Dirichlet boundary conditions on orthodiagonal maps, that is, plane graphs having quadrilateral faces with orthogonal diagonals, converges to its continuous counterpart as…

Probability · Mathematics 2019-06-05 Ori Gurel-Gurevich , Daniel C. Jerison , Asaf Nachmias

In this paper, we develop a new index theory for manifolds with polyhedral boundary. As an application, we prove Gromov's dihedral extremality conjecture regarding comparisons of scalar curvatures, mean curvatures and dihedral angles…

Differential Geometry · Mathematics 2023-03-09 Jinmin Wang , Zhizhang Xie , Guoliang Yu

In this paper, we will construct formulas and bounds for Neighborhood Degree-based indices of graphs and describe graphs that attain the bounds. Furthermore, we will establish a lower bound for the spectral radius of any graph.

Combinatorics · Mathematics 2024-11-21 Sanju Vaidya , Jeff Chang

We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…

Combinatorics · Mathematics 2021-09-29 Alberto Espuny Díaz , Viresh Patel , Fabian Stroh

We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…

Dynamical Systems · Mathematics 2022-03-30 Daniel Smania

In a recent paper, Bruns and von Thaden established a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves…

Combinatorics · Mathematics 2021-02-10 Michael von Thaden

Let $M$ be a non-compact connected manifold with a cocompact and properly discontinuous action of a discrete group $G$. We establish a Poincar\'{e}-Hopf theorem for a bounded vector field on $M$ satisfying a mild condition on zeros. As an…

Geometric Topology · Mathematics 2024-12-18 Tsuyoshi Kato , Daisuke Kishimoto , Mitsunobu Tsutaya

The Mahler measure of a polynomial is a measure of complexity formed by taking the modulus of the leading coefficient times the modulus of the product of its roots outside the unit circle. The roots of a real degree $N$ polynomial chosen…

Mathematical Physics · Physics 2015-07-01 Christopher D. Sinclair , Maxim L. Yattselev

We investigate the possibility of proving upper bounds on Hadwiger's number of a graph with partial information, mirroring several known upper bounds for the chromatic number. For each such bound we determine whether the corresponding bound…

Discrete Mathematics · Computer Science 2009-03-17 Gabriel Istrate

In this paper, we study the compactness of a boundary value problem for hyperkaehler 4-manifolds. We show that under certain topological conditions and the positive mean curvature condition on the boundary, a sequence of hyperkaehler…

Differential Geometry · Mathematics 2022-02-16 Hongyi Liu

Let $p(x)=a_0 + a_1 x + \ldots + a_n x^n$ be a polynomial with all roots real and satisfying $x \leq -\delta$ for some $0<\delta <1$. We show that for any $0 < \epsilon <1$, the value of $p(1)$ is determined within relative error $\epsilon$…

Combinatorics · Mathematics 2018-06-21 Alexander Barvinok