相关论文: Deciding whether a Lattice has an Orthonormal Basi…

We prove a fairly general inequality that estimates the number of lattice points in a ball of positive radius in general position in a Euclidean space. The bound is uniform over lattices induced by a matrix having a bounded operator norm.

We study separated nets that correspond to substitution tilings of the Euclidean space. We give a simple condition, in terms of the eigenvalues and eigenspaces of the substitution matrix, to know whether the separated net is a bounded…

In this paper we characterize the slack matrices of cones and polytopes among all nonnegative matrices. This leads to an algorithm for deciding whether a given matrix is a slack matrix. The underlying decision problem is equivalent to the…

Real-stable, Lorentzian, and log-concave polynomials are well-studied classes of polynomials, and have been powerful tools in resolving several conjectures. We show that the problems of deciding whether a polynomial of fixed degree is real…

Given a group $G$ and a subgroup $H$, we let $\mathcal{O}_G(H)$ denote the lattice of subgroups of $G$ containing $H$. This paper provides a classification of the subgroups $H$ of $G$ such that $\mathcal{O}_{G}(H)$ is Boolean of rank at…

A lattice polytope $P$ is called IDP if any lattice point in its $k$th dilate is a sum of $k$ lattice points in $P$. In 1991 Stanley proved a strong inequality in Ehrhart theory for IDP lattice polytopes. We show that his conclusion holds…

A lattice equable quadrilateral is a quadrilateral in the plane whose vertices lie on the integer lattice and which is equable in the sense that its area equals its perimeter. This paper treats the tangential and extangential cases. We show…

We introduce and study the \emph{Lattice Distortion Problem} (LDP). LDP asks how "similar" two lattices are. I.e., what is the minimal distortion of a linear bijection between the two lattices? LDP generalizes the Lattice Isomorphism…

We give necessary and sufficient conditions for an integral polynomial without linear factors to be the characteristic polynomial of an isometry of some even, unimodular lattice of given signature. This gives rise to Hasse principle…

We give a new proof of a theorem of Loos stating that a Riemannian symmetric space X with rectangular unit lattice is a symmetric R-space. For this we construct explicitly an isometric extrinsically symmetric embedding of X in a Euclidean…

Let \Gamma be a lattice in G=SL(n,R) and X=G/S a homogeneous space of G, where S is a closed subgroup of G which contains a real algebraic subgroup H such that G/H is compact. We establish uniform distribution of orbits of \Gamma in X…

A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every…

Zilber's Theorem states that a finite lattice $L$ is planar if{}f it has a complementary order relation. We provide a new proof for this crucial result and discuss some applications, including a canonical form for finite planar lattices and…

Leibniz algebras are a non-anticommutative version of Lie algebras. They play an important role in different areas of mathematics and physics and have attracted much attention over the last thirty years. In this paper we investigate whether…

Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…

A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…

For P a poset or lattice, let Id(P) denote the poset, respectively, lattice, of upward directed downsets in P, including the empty set, and let id(P)=Id(P)-\{\emptyset\}. This note obtains various results to the effect that Id(P) is always,…

In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…

This paper studies the \emph{unimodular isomorphism problem} (UIP) of convex lattice polytopes: given two convex lattice polytopes $P$ and $P'$, decide whether there exists a unimodular affine transformation mapping $P$ to $P'$. We show…

Let $G$ be a complete edge-weighted graph on $n$ vertices. To each subset of vertices of $G$ assign the cost of the minimum spanning tree of the subset as its weight. Suppose that $n$ is a multiple of some fixed positive integer $k$. The…