Related papers: Effective module lattices and their shortest vecto…
In this paper we focus on modules over a finite chain ring $\mathcal{R}$ of size $q^s$. We compute the density of free modules of $\mathcal{R}^n$, where we separately treat the asymptotics in $n,q$ and $s$. In particular, we focus on two…
For a given reciprocal matrix A, we give a union of matrix intervals in which any consistent matrix obtained from an efficient vector for A lies, and, conversely, any consistent matrix in this union comes from an efficient vector for A. The…
We present an analysis of sets of matrices with rank less than or equal to a specified number $s$. We provide a simple formula for the normal cone to such sets, and use this to show that these sets are prox-regular at all points with rank…
Given a compact subset $\Sigma \subset \mathbb{R}$ (or $\mathbb{C}$) with logarithmic capacity greater than zero, we construct an explicit family of probability measures supported on $\Sigma$ such that their closure is all the possible weak…
We introduce a new class of algorithms for finding a short vector in lattices defined by codes of co-dimension $k$ over $\mathbb{Z}_P^d$, where $P$ is prime. The co-dimension $1$ case is solved by exploiting the packing properties of the…
In this paper we study algebraic and asymptotic properties of generating sets of algebras over orders in number fields. Let $A$ be an associative algebra over an order $R$ in an algebraic number field. We assume that $A$ is a free…
We show tight lower bounds for the entire trade-off between space and query time for the Approximate Near Neighbor search problem. Our lower bounds hold in a restricted model of computation, which captures all hashing-based approaches. In…
We explore the use of correlation with simple functions to get lower bounds for arithmetic quantities. In particular, we apply this idea to the power moments of the error term when counting visible lattice points in large spheres.
We show that strong approximate lattices in higher-rank semi-simple algebraic groups are arithmetic.
We formulate and prove the extension of the Rogers integral formula to the adeles of number fields. We also prove the second moment formulas for a few important cases, enabling a number of classical and recent applications of the formula to…
Rate-independent systems arise in a number of applications. Usually, weak solutions to such problems with potentially very low regularity are considered, requiring mathematical techniques capable of handling nonsmooth functions. In this…
Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…
There has been significant work recently on integer programs (IPs) $\min\{c^\top x \colon Ax\leq b,\,x\in \mathbb{Z}^n\}$ with a constraint marix $A$ with bounded subdeterminants. This is motivated by a well-known conjecture claiming that,…
We provide a unified approach, via deformations of incidence algebras, to several important types of representations with finiteness conditions, as well as the combinatorial algebras which produce them. We show that over finite dimensional…
This work concerns finite free complexes with finite length homology over a commutative noetherian local ring $R$. The focus is on complexes that have length $\mathrm{dim}\, R$, which is the smallest possible value, and in particular on…
In this monograph, we prove an asymptotic approximation for integrals of probability densities over sets in finite dimensional euclidean space, which are far away from the origin (asymptotic sets). We use this approximation to investigate…
In this article, discrete variants of several results from vector calculus are studied for classical finite difference summation by parts operators in two and three space dimensions. It is shown that existence theorems for scalar/vector…
Modular lattices, introduced by R. Dedekind, are an important subvariety of lattices that includes all distributive lattices. Heitzig and Reinhold developed an algorithm to enumerate, up to isomorphism, all finite lattices up to size 18.…
Weakly orthomodular and dually weakly orthomodular lattices were introduced by the authors in a recent paper. Similarly as for orthomodular lattices we try to introduce an implication in these lattices which can be easily axiomatized and…
The classical branch-and-bound algorithm for the integer feasibility problem has exponential worst case complexity. We prove that it is surprisingly efficient on reformulated problems, in which the columns of the constraint matrix are…