Related papers: Counting basis extensions in a lattice

We introduce a flexible framework for making inferences about general linear forms of a large matrix based on noisy observations of a subset of its entries. In particular, under mild regularity conditions, we develop a universal procedure…

We investigate the Whitney numbers of the first kind of rank-metric lattices, which are closely linked to the open problem of enumerating rank-metric codes having prescribed parameters. We apply methods from the theory of hyperovals and…

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…

We provide a "soft" proof for non-trivial bounds on spherical, hyperbolic and unipotent Fourier coefficients of a fixed Maass form for a general co-finite lattice $\Gamma$ in $PGL(2,R)$. We use the amplification method based on the Airy…

We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula…

Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…

It is shown how Dedekind cuts can be used to introduce the extended real numbers along with sound arithmetic laws via one simple rule for the addition of sets. The crucial idea is that the use of the lower and the upper part of the cuts,…

We will give new upper bounds for the number of solutions to the inequalities of the shape $|F(x , y)| \leq h$, where $F(x , y)$ is a sparse binary form, with integer coefficients, and $h$ is a sufficiently small integer in terms of the…

Let S=(s_1,s_2,..., s_m) and T = (t_1,t_2,..., t_n) be vectors of non-negative integers with sum_{i=1}^{m} s_i = sum_{j=1}^n t_j. Let B(S,T) be the number of m*n matrices over {0,1} with j-th row sum equal to s_j for 1 <= j <= m and k-th…

The similar sublattices of a planar lattice can be classified via its multiplier ring. The latter is the ring of rational integers in the generic case, and an order in an imaginary quadratic field otherwise. Several classes of examples are…

Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…

We consider the problem of counting lattice points contained in domains in $\mathbb{R}^d$ defined by products of linear forms and we show that the normalized discrepancies in these counting problems satisfy non-degenerate Central Limit…

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

Under the Riemann Hypothesis, we improve the error term in the asymptotic formula related to the counting lattice problem studied in a first part of this work. The improvement comes from the use of Weyl's bound for exponential sums of…

We improve the error terms of some estimates related to counting lattices from recent work of L. Fukshansky, P. Guerzhoy and F. Luca (2017). This improvement is based on some analytic techniques, in particular on bounds of exponential sums…

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…

Beyond planarity concepts (prominent examples include k-planarity or fan-planarity) apply certain restrictions on the allowed patterns of crossings in drawings. It is natural to ask, how much the number of crossings may increase over the…

We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…

For any positive integer $n$ along with parameters $\alpha$ and $\nu$, we define and investigate $\alpha$-shifted, $\nu$-offset, floor sequences of length $n$. We find exact and asymptotic formulas for the number of integers in such a…

We study the number of representations of an integer n=F(x_1,...,x_s) by a homogeneous form in sufficiently many variables. This is a classical problem in number theory to which the circle method has been succesfully applied to give an…