Related papers: A Reverse Minkowski Theorem

Let $\Lb$ be a lattice in an $n$-dimensional Euclidean space $E$ and let $\Lb'$ be a Minkowskian sublattice of $\Lb$, that is, a sublattice having a basis made of representatives for the Minkowski successive minima of $\Lb$. We consider the…

Originating in the work of A.M. Semikhatov and D. Adamovi\'c, inverse reductions are embeddings involving W-algebras corresponding to the same Lie algebra but different nilpotent orbits. Here, we show that an inverse reduction embedding…

We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by…

This short note gives an elementary alternative proof for a theorem of Danilov and Koshevoy on Minkowski summation and unimodularity in discrete convex analysis. It is intended to disseminate this fundamental theorem and make its proof…

There are three aims of this note. The first one is to report some advances around the dynamical Mordell-Lang (=DML) conjecture. Second, we generalize some known results. For example, the Dynamical Mordell-lang conjecture was known for…

In a previous paper (El. J. Combin. 6 (1999), R37), the author generalized Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vertices, we use its…

We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…

We show that there are infinitely many counterexamples to Minkowski's conjecture in positive characteristic regarding uniqueness of the upper bound of the multiplicative covering radius, $\mu$, by constructing a sequence of compact $A$…

For a compact set $A \subset {\mathbb R}^d$ and an integer $k\ge 1$, let us denote by $$ A[k] = \left\{a_1+\cdots +a_k: a_1, \ldots, a_k\in A\right\}=\sum_{i=1}^k A$$ the Minkowski sum of $k$ copies of $A$. A theorem of Shapley, Folkmann…

For any $n>1$ and $0<\varepsilon<1/2$, we show the existence of an $n^{O(1)}$-point subset $X$ of $\mathbb{R}^n$ such that any linear map from $(X,\ell_2)$ to $\ell_2^m$ with distortion at most $1+\varepsilon$ must have $m = \Omega(\min\{n,…

Suppose $\Omega\subseteq\RR^d$ is a bounded and measurable set and $\Lambda \subseteq \RR^d$ is a lattice. Suppose also that $\Omega$ tiles multiply, at level $k$, when translated at the locations $\Lambda$. This means that the…

We identify a notion of reducibility between predicates, called instance reducibility, which commonly appears in reverse constructive mathematics. The notion can be generally used to compare and classify various principles studied in…

We provide new conditions under which the alternating projection sequence converges in norm for the convex feasibility problem where a linear subspace with finite codimension $N\geq 2$ and a lattice cone in a Hilbert space are considered.…

We establish a general normal subgroup theorem for commensurators of lattices in locally compact groups. While the statement is completely elementary, its proof, which rests on the original strategy of Margulis in the case of higher rank…

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…

We notice that Haynes-Hedetniemi-Slater Conjecture is true (i.e. $\gamma(G) \leq \frac{\delta}{3\delta -1}n$ for every graph $G$ of size $n$ with minimum degree $\delta \geq 4$, where $\gamma(G)$ is the domination number of $G$). Because…

Motivated by the well-known conjecture of Ryser which relates maximum matchings to minimum vertex covers in $r$-partite $r$-uniform hypergraphs, Lov\'asz formulated a stronger conjecture. It states that one can always reduce the matching…

We verify conjecture 5.11 of Panyushev [\emph{Antichains in weight posets associated with gradings of simple Lie algebras}, Math Z 281(3):1191--1214, 2015].

The Minkowski length of a lattice polytope $P$ is a natural generalization of the lattice diameter of $P$. It can be defined as the largest number of lattice segments whose Minkowski sum is contained in $P$. The famous Ehrhart theorem…

In 1945-46, C. L. Siegel proved that an $n$-dimensional lattice $\Lambda $ of determinant ${\rm det}(\Lambda )$ has at most $m^{n^2}$ different sublattices of determinant $m\cdot {\rm det}(\Lambda )$. In 1997, the exact number of the…