Related papers: Counting basis extensions in a lattice

We consider the problem of counting the number of answers to a first-order formula on a finite structure. We present and study an extension of first-order logic in which algorithms for this counting problem can be naturally and conveniently…

We establish an error estimate for counting lattice points in Euclidean norm balls (associated to an arbitrary irreducible linear representation) for lattices in simple Lie groups of real rank at least two. Our approach utilizes refined…

Orders and fractional ideals in number fields provide interesting examples of lattices. We ask: what lattices arise from orders in number fields? We prove that all nontrivial multiplicative constraints on successive minima of orders come…

Let $\mathcal{B} = (B_1,\ldots, B_h)$ be an $h$-tuple of sets of positive integers. Let $g_{\mathcal{B} }(n)$ count the number of representations of $n$ in the form $n = b_1\cdots b_h$, where $b_i \in B_i$ for all $i \in \{1,\ldots, h\}$.…

In this paper, we show that for each lattice basis, there exists an equivalent basis which we describe as ``strongly reduced''. We show that bases reduced in this manner exhibit rather ``short'' basis vectors, that is, the length of the…

We present the result of calculations of the Witten index for a supersymmetric lattice model on lattices of various type and size. Because the model remains supersymmetric at finite lattice size, the Witten index can be calculated using…

We represent the Riemann zeta function in the half-plane $\Re s >1$ via series whose terms admit geometrically decreasing bounds. Due to an underlying recurrence relation, which is used to compute coefficients entering into the terms, the…

Linnik type problems concern the distribution of projections of integral points on the unit sphere as their norm increases, and different generalizations of this phenomenon. Our work addresses a question of this type: we prove the uniform…

We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…

We investigate in this paper the distribution of the discrepancy of various lattice counting functions. In particular, we prove that the number of lattice points contained in certain domains defined by products of linear forms satisfies a…

We prove the existence of a 1/N expansion in unitary multimatrix models which are Gibbs perturbations of the Haar measure, and express the expansion coefficients recursively in terms of the unique solution of a noncommutative initial value…

Let $\psi$ and $F$ be positive definite forms with integral coefficients of equal degree. Using the circle method, we establish an asymptotic formula for the number of identical representations of $\psi$ by $F$, provided $\psi$ is…

We classify one-element extensions of a hyperplane arrangement by the induced adjoint arrangement. Based on the classification, several kinds of combinatorial invariants including Whitney polynomials, characteristic polynomials, Whitney…

These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will…

On the circle of radius $R$ centred at the origin, consider a ``thin'' sector about the fixed line $y = \alpha x$ with edges given by the lines $y = (\alpha \pm \epsilon) x$, where $\epsilon = \epsilon_R \rightarrow 0$ as $ R \to \infty $.…

We investigate similarity classes of arithmetic lattices in the plane. We introduce a natural height function on the set of such similarity classes, and give asymptotic estimates on the number of all arithmetic similarity classes,…

Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…

This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the…

We prove an asymptotic formula for the number of fixed rank matrices with integer coefficients over a number field K/Q and bounded norm. As an application, we derive an approximate Rogers integral formula for discrete sets of module…

The aim of the present article is to explore the possibilities of representing positive integers as sums of other positive integers and highlight certain fundamental connections between their multiplicative and additive properties. In…