Related papers: Lattice points in rotated convex domains

We give new bounds on the Erdos-Szekeres theorems for convex bodies of Bisztriczky and Fejes Toth and of Pach and Toth. We derive them from a combinatorial characterization of convex position of a family of planar convex bodies. This…

For a positive integer n, we denote by SUB (resp., SUBn) the class of all lattices that can be embedded into the lattice Co(P) of all order-convex subsets of a partially ordered set P (resp., P of length at most n). We prove the following…

A linear quadratic Dirichlet control problem posed on a possibly non-convex polygonal domain is analyzed. Detailed regularity results are provided in classical Sobolev (Slobodetskii) spaces. In particular, it is proved that in the presence…

In this paper we investigate the regularity properties of weighted Bergman projections for smoothly bounded pseudo-convex domains of finite type in $\mathbb{C}^{n}$. The main result is obtained for weights equal to a non negative rational…

The aim of this paper is to study lattice properties of the sharp partial order for complex matrices having index at most 1. We investigate the down-set of a fixed matrix $B$ under this partial order via isomorphisms with two different…

The periodic Toda lattice with $N$ sites is globally symplectomorphic to a two parameter family of $N-1$ coupled harmonic oscillators. The action variables fill out the whole positive quadrant of $\R^{N-1}$. We prove that in the interior of…

We consider the problem of counting lattice points contained in domains in $\mathbb{R}^d$ defined by products of linear forms and we show that the normalized discrepancies in these counting problems satisfy non-degenerate Central Limit…

For $n\in [-2,2]$ the $O(n)$ model on a random lattice has critical points to which a scaling behaviour characteristic of 2D gravity interacting with conformal matter fields with $c\in [-\infty,1]$ can be associated. Previously we have…

In this paper we show that the set of closure relations on a finite poset P forms a supersolvable lattice, as suggested by Rota. Furthermore this lattice is dually isomorphic to the lattice of closed sets in a convex geometry (in the sense…

It is shown that, given any $k$-dimensional lattice $\Lambda$, there is a lattice sequence $\Lambda_w$, $w\in \mathbb Z$, with sub-orthogonal lattice $\Lambda_o \subset \Lambda$, converging to $\Lambda$ (unless equivalence), also we discuss…

We give an explicit description of the lattice $\Semistar(D)$ of all semistar operations on any Dedekind domain $D$ from its set $\Max(D)$ of maximal ideals. This descpription is constructive if $\Max(D)$ is finite. As a corollary we show…

A theory of local convexity for a second order differential equation (SODE) on a Lie algebroid is developed. The particular case when the SODE is homogeneous quadratic is extensively discussed.

Among integral polytopes (vertices with integral coordinates), lattice-free polytopes - intersecting the lattice ONLY at their vertices- are of particular interestin combinatorics and geometry of numbers. A natural question is to measure…

We prove that every finite distributive lattice $D$ can be represented as the congruence lattice of a rectangular lattice $K$ in which all congruences are principal. We verify this result in a stronger form as an extension theorem.

In 2012 Gubeladze (Adv.\ Math.\ 2012) introduced the notion of k-convex-normal polytopes to show that integral polytopes all of whose edges are longer than 4d(d+1) have the integer decomposition property. In the first part of this paper we…

Given a convex domain $C$, a $C$-polygon is an intersection of $n\geq 2$ homothets of $C$. If the homothets are translates of $C$ then we call the intersection a translative $C$-polygon. This paper proves that if $C$ is a strictly convex…

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…

We investigate the problem $$-\Delta u = \lambda b(x)|u|^{q-2}u +a(x)|u|^{p-2}u \mbox{ in } \Omega, \quad \frac{\partial u}{\partial \mathbf{n}} = 0 \mbox{ on } \partial \Omega, \leqno{(P_\lambda)} $$ where $\Omega$ is a bounded smooth…

We show that a smooth bounded domain in $\mathbb{C}^n$ admitting partial pseudoconvex exhaustion remains partial pseudoconvex. The main ingredient of the proof is based on a new characterization of hyper-$q$-convex domains. Furthermore, we…