Related papers: Restricted Successive Minima

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

In Part I we gave a polynomial growth lower-bound for the number of nodal domains of a Hecke-Maass cuspform in a compact part of the modular surface, assuming a Lindel\"of hypothesis. That was a consequence of a topological argument and…

Let $D$ be a regular strictly convex bounded domain of $\mathbb{R}^3$, and consider a regular Jordan curve $\Gamma \subset \partial D$. Then, for each $\epsilon>0$, we obtain the existence of a complete proper minimal immersion…

We study spurious second-order stationary points and local minima in a nonconvex low-rank formulation of sum-of-squares optimization on a real variety $X$. We reformulate the problem of finding a spurious local minimum in terms of syzygies…

In this paper we study convex subcomplexes of spherical buildings. We pay special attention to fixed point sets of type-preserving isometries of spherical buildings. This sets are also convex subcomplexes of the natural polyhedral structure…

We show that finite lattices with arbitrary boundaries may support large degenerate subspaces, stemming from the underlying translational symmetry of the lattice. When the lattice is coupled to an environment, a potentially large number of…

We show that minimizing a convex function over the integer points of a bounded convex set is polynomial in fixed dimension.

Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs. We conclude by…

Let M be an irreducible Riemannian symmetric space. The index of M is the minimal codimension of a (non-trivial) totally geodesic submanifold of M. We prove that the index is bounded from below by the rank of the symmetric space. We also…

We pursue the study of a model convex functional with orthotropic structure and nonstandard growth conditions, this time focusing on the sub-quadratic case. We prove that bounded local minimizers are locally Lipschitz. No restriction on the…

Integrable cut-off constraints for semidiscrete Toda lattice are studied in this paper. Lax presentation for semidiscrete analog of the $C$-series Toda lattice is obtained. Nonlocal variables that allow to express symmetries of the infinite…

We consider Newton's problem of minimal resistance, in particular we address the problem arising in the limit if the height goes to infinity. We establish existence of solutions and lack radial symmetry of solutions. Moreover, we show that…

We explore upper bounds on the covering radius of non-hollow lattice polytopes. In particular, we conjecture a general upper bound of $d/2$ in dimension $d$, achieved by the "standard terminal simplices" and direct sums of them. We prove…

Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…

We study the smallest convex lattice generated by a finite set of points. To analyze this structure, we introduce the notion of a point configuration, defined via the relative lattice. Under a suitable completeness condition, this lattice…

We introduce several classes of set-valued maps with generalized convexity. We obtain minimax theorems for set-valued maps which satisfy the introduced properties and are not continuous, by using a fixed point theorem for weakly naturally…

A polygon C is an intersecting polygon for a set O of objects in the plane if C intersects each object in O, where the polygon includes its interior. We study the problem of computing the minimum-perimeter intersecting polygon and the…

We prove various estimates for the mean square lattice point discrepancy for dilates of a convex body.

Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…

In this note, we study several inequalities involving geometric functionals for lattice point-free planar convex sets. We focus on the previously not addressed cases perimeter--diameter and perimeter--circumradius.