Related papers: Lattice convex chains in the plane
Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…
We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.
We present a complex matrix gauge model defined on an arbitrary two-dimensional orientable lattice. We rewrite the model's partition function in terms of a sum over representations of the group U(N). The model solves the general…
We explore the relationship between lattice field theory and graph theory, placing special emphasis on the interplay between Dirac and scalar lattice operators and matrices within the realm of spectral graph theory. Beyond delving into…
Every convex body K in R^n has a coordinate projection PK that contains at least vol(0.1 K) cells of the integer lattice PZ^n, provided this volume is at least one. Our proof of this counterpart of Minkowski's theorem is based on an…
Laplace problems on planar domains can be solved by means of least-squares expansions associated with polynomial or rational approximations. Here it is shown that, even in the context of an analytic domain with analytic boundary data, the…
The Polynomial Freiman-Ruzsa conjecture is one of the central open problems in additive combinatorics. If true, it would give tight quantitative bounds relating combinatorial and algebraic notions of approximate subgroups. In this note, we…
Given a primitive collection of vectors in the integer lattice, we count the number of ways it can be extended to a basis by vectors with sup-norm bounded by $T$, producing an asymptotic estimate as $T \to \infty$. This problem can be…
It is known that random convex polygonal lines on $\mathbb{Z}_+^2$ (with the endpoints fixed at $0=(0,0)$ and $n=(n_1,n_2)\to\infty$) have a limit shape with respect to the uniform probability measure, identified as the parabola arc…
To evaluate Riemann's zeta function is important for many investigations related to the area of number theory, and to have quickly converging series at hand in particular. We investigate a class of summation formulae and find, as a special…
Laman graphs model planar frameworks that are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. Such realizations can be seen as solutions of…
We use a discrete worldline representation in order to study the continuum limit of the one-loop expectation value of dimension two and four local operators in a background field. We illustrate this technique in the case of a scalar field…
We consider a variation of Dyck paths, where additionally to steps $(1,1)$ and $(1,-1)$ down-steps $(1,-j)$, for $j\ge2$ are allowed. We give credits to Emeric Deutsch for that. The enumeration of such objects living in a strip is…
In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…
In 1925, Jarnik defined a sequence of convex polygons for use in constructing curves containing many lattice points relative to their curvatures. Properly scaled, these polygons converge to a certain limiting curve. In this paper we…
Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…
We study the error of the number of points of a unimodular lattice that fall in a strictly convex and analytic set having the origin and that is dilated by a factor $t$. The aim is to generalize the result of a previous article. We first…
A wonderful compactification of an orbit under the action of a semi-simple and simply connected group is a smooth projective variety containing the orbit as a dense open subset, and where the added boundary divisor is simple normal…
Which convex subsets of the complex plane are the numerical range W(A of some matrix A? This paper gives a precise characterization of these sets. In addition to this we show that for any A there exists a symmetric matrix B of the same size…
A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…