Related papers: Integral Matrices of Fixed Rank over Number Fields

We establish a general result about extending a right invertible row over a Banach algebra to an invertible matrix. This is applied to the computation of right topological stable rank of a split exact sequence. We also introduce a…

In this paper we study various versions of extension complexity for polygons through the study of factorization ranks of their slack matrices. In particular, we develop a new asymptotic lower bound for their nonnegative rank, shortening the…

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

The Hermite Normal Form (HNF) is a canonical representation of matrices over any principal ideal domain. Over the integers, the distribution of the HNFs of randomly looking matrices is far from uniform. The aim of this article is to present…

Let $G$ be a linear semisimple Lie group without compact factors. We show that uniform approximate lattices $\Lambda$ arising as regular model sets in $G$ determine the ambient group $G$ in a strong sense. Specifically, for every…

We establish lower bounds on the rank of matrices in which all but the diagonal entries lie in a multiplicative group of small rank. Applying these bounds we show that the distance sets of finite pointsets in $\mathbb{R}^d$ generate high…

In this memoir, we study the even unimodular lattices of rank at most 24, as well as a related collection of automorphic forms of the orthogonal, symplectic and linear groups of small rank. Our guide is the question of determining the…

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

The book is devoted to investigation of arithmetic of the matrix rings over certain classes of commutative finitely generated principal ideals domains. We mainly concentrate on constructing of the matrix factorization theory. We reveal a…

Let $n \in \mathbb{Z}_{\geq 3}.$ Given any Borel subset $A$ of $\mathbb{R}^n$ with finite and nonzero measure, we prove that the probability that the set of primitive points of a random full-rank unimodular lattice in $\mathbb{R}^n$ does…

We study the limits of inductive sequences (A_i,\phi_i) where each A_i is a direct sum of full matrix algebras over compact metric spaces and each partial map of \phi_i is diagonal. We give a new characterisation of simplicity for such…

Low-rank matrix completion addresses the problem of completing a matrix from a certain set of generic specified entries. Over the complex numbers a matrix with a given entry pattern can be uniquely completed to a specific rank, called the…

We propose a construction of lattices from (skew-) polynomial codes, by endowing quotients of some ideals in both number fields and cyclic algebras with a suitable trace form. We give criteria for unimodularity. This yields integral and…

The problem of finding short vectors in Euclidean lattices is a central hard problem in complexity theory. The case of module lattices (i.e., lattices which are also modules over a number ring) is of particular interest for cryptography and…

The asymptotic behavior of graded Betti numbers of powers of homogeneous ideals in a polynomial ring over a field has recently been reviewed. We extend quasi polynomial behavior of graded Betti numbers of powers of homogenous ideals to…

We generalize a recent result of Clausen: For a number field with integers O, we compute the K-theory of locally compact O-modules. For the rational integers this recovers Clausen's result as a special case. Our method of proof is quite…

For fixed positive integers $n,m$, let $\mathrm{Mat}_{n\times m}(\mathbb{C})$ be the affine space consisting of all $n\times m$ complex matrices, and let $\mathbb{C}[\mathbf{x}_{n\times m}]$ be its coordinate ring. For $0\le…

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…

We introduce geometric and homological finiteness properties for countable approximate groups via coarse geometry and then study these finiteness properties for S-arithmetic reductive approximate groups. For S-arithmetic approximate groups…

An interval matrix is a matrix whose entries are intervals in the set of real numbers. We generalize this concept, which has been broadly studied, to other fields. Precisely we define a rational interval matrix to be a matrix whose entries…