相关论文: Lattice convex chains in the plane

Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…

In this letter, the 6-vertex model on dynamical random lattices is defined via a matrix model and rewritten (following I. Kostov) as a deformation of the O(2) model. In the large N planar limit, an exact solution is found at criticality.…

MacMahon enumerated the plane partitions in an $a \times b \times c$ box. These are in bijection to lozenge tilings of a hexagon, to certain perfect matchings, and to families of non-intersecting lattice paths. In this work we consider more…

Solutions of a variational inequality are found by giving conditions for the monotone convergence with respect to a cone of the Picard iteration corresponding to its natural map. One of these conditions is the isotonicity of the projection…

I present two independent proofs of the Riemann Hypothesis considered by many the greatest unsolved problem in mathematics. I find that the admissible domain of complex zeros of the Riemann Zeta Function is the critical line. The methods…

For $A\in\mathbb{Z}^{m\times n}$ we investigate the behaviour of the number of lattice points in $P_A(b)=\{x\in\mathbb{R}^n:Ax\leq b\}$, depending on the varying vector $b$. It is known that this number, restricted to a cone of constant…

We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…

A lattice L is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. We prove that there exists a positive constant C such that, up to similarity, the number of planar diagrams of these…

We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions…

We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers $V_{\lambda}^{\otimes N}$ of an irreducible representation $V_{\lambda}$ of a compact connected Lie group $G$. The weights are…

We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and…

This paper studies systems of linear difference equations on the lattice $\Z^n$ that are invariant under a finite group of symmetries, and shows that there exist solutions to such systems that are also invariant under this group of…

The statistical convergence is defined for sequences with the asymptotic density on the natural numbers, in general. In this paper, we introduce the statistical convergence for nets in Riesz spaces by using the finite additive measures on…

We address the six vertex model on a random lattice, which in combinatorial terms corresponds to the enumeration of weighted 4-valent planar maps equipped with an Eulerian orientation. This problem was exactly, albeit non-rigorously solved…

The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…

Using Chebyshev polynomials combined with some mild combinatorics, we provide a new formula for the analytical planar limit of a random matrix model with a one-cut potential $V$. For potentials $V(x)=x^{2}/2-\sum_{n\ge1}a_{n}x^{n}/n$, as a…

The current paper is a short review of rigorous results for the 1-2 model. The 1-2 model on the hexagonal lattice is a model of statistical mechanics in which each vertex is constrained to have degree either 1 or 2. It was proposed in a…

We introduce the arithmetic width of a convex body, defined as the number of distinct values a linear functional attains on the lattice points within the body. Arithmetic width refines lattice width by detecting gaps in the lattice point…

We present drawings on the complex plane of the lines Im(zeta(s))=0 and Re(zeta(s))=0. This allow to illustrate many properties of the zeta function of Riemann. This is an expository paper. It does not pretend to prove any new result about…

In this paper, we deal with analytic and geometric properties of orthogonally convex sets. We establish a Blaschke-type theorem for path-connected and orthogonally convex sets in the plane using orthogonally convex paths. The separation of…