Related papers: Asymptotics of Moore exponent sets

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…

There has been significant interest in studying the asymptotics of certain generalised moments, called the moments of moments, of characteristic polynomials of random Haar-distributed unitary and symplectic matrices, as the matrix size $N$…

Let $p_{1}<p_2<... <p_{\nu}<...$ be the sequence of prime numbers and let $m$ be a positive integer. We give a strong asymptotic formula for the distribution of the set of integers having prime factorizations of the form…

For any admissible value of the parameters $n$ and $k$ there exist $[n,k]$-Maximum Rank distance ${\mathbb F}_q$-linear codes. Indeed, it can be shown that if field extensions large enough are considered, almost all rank distance codes are…

For any positive integer $q\geq 2$ and any real number $\delta\in(0,1)$, let $\alpha_q(n,\delta n)$ denote the maximum size of a subset of $\mathbb{Z}_q^n$ with minimum Hamming distance at least $\delta n$, where…

This paper improves previously known bounds on the determinant of 0-1 matrices where each row has fixed support size. This uses a method based on Scheinerman's, with new analyses to improve upon his conjectures.

E. Heine in the 19th century studied a system of orthogonal polynomials associated with the weight $\left[x(x-\alpha)(x-\beta)\right]^{-\frac{1}{2}}$, $x\in[0,\alpha]$, $0<\alpha<\beta$. A related system was studied by C. J. Rees in 1945,…

The concept of linear set in projective spaces over finite fields was introduced by Lunardon in 1999 and it plays central roles in the study of blocking sets, semifields, rank-distance codes and etc. A linear set with the largest possible…

The purpose of this paper is to compute the asymptotics of determinants of finite sections of operators that are trace class perturbations of Toeplitz operators. For example, we consider the asymptotics in the case where the matrices are of…

In this article, we investigate the statistical distribution and asymptotic behavior of the family of monic integer polynomials of degree $n$ having at least one root in a fixed number field $K$. Although the framework of thin sets implies…

We consider Cantor measures on the line, with contraction factor $N^{-1}=p^{-\alpha}$ (where $p$ a positive prime, $\alpha$ a positive integer) and $m$ positive integer digits lying in distinct residue classes modulo $N$. We obtain a…

The error exponent in lossy source coding characterizes the asymptotic decay rate of error probability with respect to blocklength. The Marton's error exponent provides the theoretically optimal bound on this rate. However, computation…

We consider a compact smooth manifold $X$ of dimension $n+1$ with boundary $M=\partial X$. In a collar neighborhood of $M$, we assume that the metric has the form $g=u^{-\alpha}\bar g$, where $u$ is a boundary defining function, $\alpha\in…

Given a sequence of integers $a_j, j\ge 1,$ a multiset is a combinatorial object composed of unordered components, such that there are exactly $a_j$ one-component multisets of size $j.$ When $a_j\asymp j^{r-1} y^j$ for some $r>0$, $y\geq…

In 1848, Hermite introduced a reduction theory for binary forms of degree $n$ which was developed more fully in the seminal 1917 treatise of Julia. This canonical method of reduction made use of a new, fundamental, but irrational…

Datasets from the fields of bioinformatics, chemometrics, and face recognition are typically characterized by small samples of high-dimensional data. Among the many variants of linear discriminant analysis that have been proposed in order…

In this paper, we consider the relationship between the Mahler measure of a polynomial and its separation. In 1964, Mahler proved that if $f(x) \in \mathbb{Z}[x]$ is separable of degree $n$, then $\operatorname{sep}(f) \gg_n M(f)^{-(n-1)}$.…

Let $f$ be a half-integral weight cusp form of level $4N$ for odd and squarefree $N$ and let $a(n)$ denote its $n^{\rm th}$ normalized Fourier coefficient. Assuming that all the coefficients $a(n)$ are real, we study the sign of $a(n)$ when…

We study the number of prime polynomials of degree $n$ over $\mathbb{F}_q$ in which the $i^{th}$ coefficient is either preassigned to be $a_i \in \mathbb{F}_q$ or outside a small set $S_i \subset \mathbb{F}_q$. This serves as a function…

Intersecting codes are a classical object in coding theory whose rank-metric analogue has recently been introduced. Although the definition formally parallels the Hamming-metric case, the structure and parameter constraints of rank-metric…