Related papers: Effective module lattices and their shortest vecto…

Communication lower bounds have long been established for matrix multiplication algorithms. However, most methods of asymptotic analysis have either ignored the constant factors or not obtained the tightest possible values. Recent work has…

Maximally monotone operators and firmly nonexpansive mappings play key roles in modern optimization and nonlinear analysis. Five years ago, it was shown that if finitely many firmly nonexpansive operators are all asymptotically regular…

Approximate lattices are aperiodic generalisations of lattices of locally compact groups that were first studied in seminal work of Yves Meyer. They are defined as those uniformly discrete approximate subgroups (symmetric subsets stable…

For coprime integers $N,a,b,c$, with $0<a<b<c<N$, we define the set $$ \{ (na \! \! \! \! \pmod{N}, nb \! \! \! \! \pmod{N}, nc \! \! \! \! \pmod{N}) : 0 \leq n < N\}. $$ We study which parameters $N,a,b,c$ generate point sets with long…

Consider a point process in Euclidean space obtained by perturbing the integer lattice with independent and identically distributed random vectors. Under mild assumptions on the law of the perturbations, we construct a translation-invariant…

Recently, there has been considerable progress on designing algorithms with provable guarantees -- typically using linear algebraic methods -- for parameter learning in latent variable models. But designing provable algorithms for inference…

Let $p$ be a prime number and $r$ a non-negative integer. In this paper, we prove that there exists an anti-equivalence between the category of weak $(\varphi,\hat{G})$-modules of height $r$ and a certain subcategory of the category of…

Emergent lattices at mesoscopic length scales have evoked interest in several recent contexts, e.g., in crystalline arrangements of skyrmions. It is a challenging task to determine their collective excitations as the unit cells are large…

We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to…

We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…

Inspired by the work of Izakhian and Rhodes, a theory of representation of hereditary collections by boolean matrices is developed. This corresponds to representation by finite $\vee$-generated lattices. The lattice of flats, defined for…

We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

Given a simple Lie group $G$, we show that the lattices in $G$ are weakly uniformly discrete. This is a strengthening of the Kazhdan-Margulis theorem. Our proof however is straightforward --- considering general IRS rather than lattices…

Let $S$ be a finite set of primes. For sufficiently large $n$ and $d$, Lawrence and Venkatesh proved that in the moduli space of hypersurfaces of degree $d$ in $\mathbb{P}^n$, the locus of points with good reduction outside $S$ is not…

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…

We initiate in this article the study of weakly exact structures, a generalization of Quillen exact structures. We introduce weak counterparts of one-sided exact structures and show that a left and a right weakly exact structure generate a…

In this paper we develop a theory of convexity for a free Abelian group M (the lattice of integer points), which we call theory of discrete convexity. We characterize those subsets X of the group M that could be call "convex". One property…

The Shortest Lattice Vector (SLV) problem is in general hard to solve, except for special cases (such as root lattices and lattices for which an obtuse superbase is known). In this paper, we present a new class of SLV problems that can be…

Temporal Point Processes (TPP) with partial likelihoods involving a latent structure often entail an intractable marginalization, thus making inference hard. We propose a novel approach to Maximum Likelihood Estimation (MLE) involving…