Related papers: Effective module lattices and their shortest vecto…

Let $A$ be an $N\times n$ random matrix whose entries are coordinates of an isotropic log-concave random vector in $\mathbb{R}^{Nn}$. We prove sharp lower tail estimates for the smallest singular value of $A$ in the following cases: (1)…

We establish a number of results which say, roughly, that interpretation functors preserve algebraic complexity. First we show that representation embeddings between categories of modules of finite-dimensional algebras induce embeddings of…

A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe well-rounded full-rank sublattices of ${\mathbb Z}^2$, as well as their determinant and minima sets. We…

We present a new inductive rule for verifying lower bounds on expected values of random variables after execution of probabilistic loops as well as on their expected runtimes. Our rule is simple in the sense that loop body semantics need to…

Lattices defined as modules over algebraic rings or orders have garnered interest recently, particularly in the fields of cryptography and coding theory. Whilst there exist many attempts to generalise the conditions for LLL reduction to…

We prove a uniform effective density theorem as well as an effective counting result for a generic system comprising a polynomial with a mild homogeneous condition and several linear forms using Roger's second moment formula for the Siegel…

The problem of maximizing non-negative submodular functions has been studied extensively in the last few years. However, most papers consider submodular set functions. Recently, several advances have been made for the more general case of…

Precise asymptotics for moderate deviation probabilities are established for open convex sets in both the finite- and infinite-dimensional settings. Our results are based on the existence of dominating points for these sets, a related…

The conjectured hardness of Boolean matrix-vector multiplication has been used with great success to prove conditional lower bounds for numerous important data structure problems, see Henzinger et al. [STOC'15]. In recent work, Larsen and…

We exhibit algorithms for calculating Tits' buildings and orbits of vectors in a lattice $L$ for certain subgroups of $\operatorname{O}(L)$. We discuss how these algorithms can be applied to understand the configuration of boundary…

In this paper, we propose new classes of trapdoor functions to solve the closest vector problem in lattices. Specifically, we construct lattices based on properties of polynomials for which the closest vector problem is hard to solve unless…

Due to their importance in both data analysis and numerical algorithms, low rank approximations have recently been widely studied. They enable the handling of very large matrices. Tight error bounds for the computationally efficient…

We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…

Bobkov (J. Theoret. Probab. 18(2) (2005) 399-412) investigated an approximate de Finetti representation for probability measures, on product measurable spaces, which are symmetric under permutations of coordinates. One of the main results…

A short proof of a theorem of M.H. Albert, and its application to lattices.

We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…

We investigate the almost sure asymptotic properties of vector martingale transforms. Assuming some appropriate regularity conditions both on the increasing process and on the moments of the martingale, we prove that normalized moments of…

Representing lattices L by equivalence relations amounts to embed them into the lattice Part(V) of all partitions of a set V, and has a long history. Here we are concerned with MODULAR lattices L and aim for sets V as small as possible,…

We investigate lattice-counting problems associated with symplectic forms from the perspective of homogeneous dynamics. In the qualitative direction, we establish an analog of Margulis theorem for symplectic forms, proving density results…