相关论文: Lattice convex chains in the plane
We prove Riemann hypothesis. Method is to show the convexity of function which has zeros on open critical strip the same as zeta function.
A complete formulation is given of an exact kinetic theory for lattice gases. This kinetic theory makes possible the calculation of corrections to the usual Boltzmann / Chapman-Enskog analysis of lattice gases due to the buildup of…
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…
Recent work of Brlek \textit{et al.} gives a characterization of digitally convex polyominoes using combinatorics on words. From this work, we derive a combinatorial symbolic description of digitally convex polyominoes and use it to analyze…
This paper is about integral zonotopes. It is proven that large zonotopes in a convex cone have a limit shape, meaning that, after suitable scaling, the overwhelming majority of the zonotopes are very close to a fixed convex set. Several…
The model with the fermions coupled in the non - minimal way to the gauge theory of Lorentz group is considered. The lattice regularization is suggested. It is argued that this model may exist in the phase with broken chiral symmetry and…
This paper introduces a new method for the efficient computation of oscillatory multidimensional lattice sums in geometries with boundaries. Such sums are ubiquitous in both pure and applied mathematics, and have immediate applications in…
We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…
Wigner limits are given formally as the difference between a lattice sum, associated to a positive definite quadratic form, and a corresponding multiple integral. To define these limits, which arose in work of Wigner on the energy of static…
In this paper we investigate iteration of maps on lattices and the corresponding polynomial-like iterative equation. Since a lattice need not have a metric space structure, neither the Schauder fixed point theorem nor the Banach fixed point…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
The full lattice convergence on a locally solid Riesz space is an abstraction of the topological, order, and relatively uniform convergences. We investigate four modifications of a full convergence $\mathbb{c}$ on a Riesz space. The first…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
We study upper bounds on the number of lattice points for convex bodies having their centroid at the origin. For the family of simplices as well as in the planar case we obtain best possible results. For arbitrary convex bodies we provide…
We provide a complete combinatorial and asymptotic analysis of positive linear systems of equations in one catalytic variable that appear in several combinatorial problems such as in lattice path counting or stack-sortable permutation…
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
We construct an infinite commutative lattice of groups whose dual spaces give Kauffman finite-type invariants of long virtual knots. The lattice is based "horizontally" upon the Polyak algebra and extended "vertically" using Manturov's…
Gardner, Gronchi and Zong posed the problem to find a discrete analogue of M. Meyer's inequality bounding the volume of a convex body from below by the geometric mean of the volumes of its slices with the coordinate hyperplanes. Motivated…
We present further results on a class of sums which involve complex powers of the distance to points in a two-dimensional square lattice and trigonometric functions of their angle, supplementing those in a previous paper (McPhedran {\em et…