Related papers: Counting nonsingular matrices with primitive row v…

In this paper, we study the complexity of computing the determinant of a matrix over a non-commutative algebra. In particular, we ask the question, "over which algebras, is the determinant easier to compute than the permanent?" Towards…

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…

An $(n-1)$-tuple $a = (a(1), \dots, a(n-1))$ consisting of positive integers is said to be asymptotically hollow if there exist infinitely many positive integers $N$ such that the convex hull, $K(a(n))$, in $n$-dimensional Euclidean space…

We study the asymptotics of representations of a fixed compact Lie group. We prove that the limit behavior of a sequence of such representations can be described in terms of certain random matrices; in particular operations on…

We analyze the representation of $A^{n}$ as a linear combination of $A^{j},\ 0\leq j\leq k-1,$ where $A$ is a $k\times k$ matrix. We obtain a first order asymptotic approximation of $A^{n}$ as $n\to\infty,$ without imposing any special…

We consider the probability of two large gaps (intervals without eigenvalues) in the bulk scaling limit of the Gaussian Unitary Ensemble of random matrices. We determine the multiplicative constant in the asymptotics. We also provide the…

Let $n$ and $m$ be positive integers such that $n<m$. In this paper we compute the density of rectangular unimodular $n$ by $m$ matrices over the ring of algebraic integers of a number field.

There are several methods to treat ensembles of random matrices in symmetric spaces, circular matrices, chiral matrices and others. Orthogonal polynomials and the supersymmetry method are particular powerful techniques. Here, we present a…

We investigate one-dimensional families of diagonal forms, considering the evolution of the asymptotic formula and error term. We then discuss properties of the average asymptotic formula obtained. The subsequent second moment analysis…

We classify certain non-symmetric commutative association schemes. As an application, we determine all the primitive weakly distance-regular circulant digraphs.

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

We give simple criteria to identify the exponential order of magnitude of the absolute value of the determinant for wide classes of random matrix models, not requiring the assumption of invariance. These include Gaussian matrices with…

We prove explicit versions of the Kronecker-Weyl theorems, both in a discrete and a continuous settings, without any linear independence hypothesis. As an application, we propose an alternative approach to problems concerning asymptotic…

Asymptotic properties of matrices are, in general, difficult to analyze with classical mathematical techniques. In very specific cases, there is a well-known connection between the asymptotic behavior of a matrix's leading eigenvector and…

Meta-elliptical copulas are often proposed to model dependence between the components of a random vector. They are specified by a correlation matrix and a map $g$, called density generator. While the latter correlation matrix can easily be…

For an irreducible polynomial $\chi(x)\in \mathcal{O}_k[x]$ of degree $n$, where $k$ is a number field and $\mathcal{O}_k$ its ring of integers, let $N(X, T)$ denote the number of $n \times n$ integral matrices whose characteristic…

Motivated by complexity questions in integer programming, this paper aims to contribute to the understanding of combinatorial properties of integer matrices of row rank $r$ and with bounded subdeterminants. In particular, we study the…

We consider a particular type of matrices which belong at the same time to the class of Hessenberg and Toeplitz matrices, and whose determinants are equal to the number of a type of compositions of natural numbers. We prove a formula in…

We consider n by n real matrices whose entries are non-degenerate random variables that are independent but non necessarily identically distributed, and show that the probability that such a matrix is singular is O(1/sqrt{n}). The purpose…

The asyptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids. The connection to a result of Lefmann, Roedl, Phelps is explored. The latter states that almost all…