Related papers: Asymptotics of Moore exponent sets

Left and right idealizers are important invariants of linear rank-distance codes. In the case of maximum rank-distance (MRD for short) codes in $\mathbb{F}_q^{n\times n}$ the idealizers have been proved to be isomorphic to finite fields of…

In 1916, MacMahon showed that permutations in $S_n$ with a fixed descent set $I$ are enumerated by a polynomial $d_I(n)$. Diaz-Lopez, Harris, Insko, Omar, and Sagan recently revived interest in this descent polynomial, and suggested the…

Let $\mathbb{F}_q$ denote the finite field with $q=p^\lambda$ elements. Maximum Rank-metric codes (MRD for short) are subsets of $M_{m\times n}(\mathbb{F}_q)$ whose number of elements attains the Singleton-like bound. The first MRD codes…

For a complex polynomial $P$ of degree $n$ and an $m$-tuple of distinct complex numbers $\Lambda=(\lambda_1,\ldots,\lambda_m)$, the dope matrix $D_P(\Lambda)$ is defined as the $m \times (n+1)$ matrix $(c)_{ij}$ with $c_{ij} =1$ if…

Scattered polynomials of a given index over finite fields are intriguing rare objects with many connections within mathematics. Of particular interest are the exceptional ones, as defined in 2018 by the first author and Zhou, for which…

In a celebrated paper of 1893, Hadamard established the maximal determinant theorem, which establishes an upper bound on the determinant of a matrix with complex entries of norm at most $1$. His paper concludes with the suggestion that…

We present an upper bound on the exponent of the asymptotic behaviour of the tensor rank of a family of tensors defined by the complete graph on $k$ vertices. For $k\geq4$, we show that the exponent per edge is at most 0.77, outperforming…

The Moore bound constitutes both an upper bound on the order of a graph of maximum degree $d$ and diameter $D=k$ and a lower bound on the order of a graph of minimum degree $d$ and odd girth $g=2k+1$. Graphs missing or exceeding the Moore…

An n\times n matrix M is called a fooling-set matrix of size n, if its diagonal entries are nonzero, whereas for every k\ne \ell we have M_{k,\ell} M_{\ell,k} = 0. Dietzfelbinger, Hromkovi\v{c}, and Schnitger (1996) showed that n \le (\rk…

Let a be an integer and q a prime number. In this paper, we find an asymptotic formula for the number of positive integers n < x with the property that no divisor d > 1 of n lies in the arithmetic progression a modulo q.

A set of nonnegative matrices $\mathcal{M}=\{M_1, M_2, \ldots, M_k\}$ is called primitive if there exist indices $i_1, i_2, \ldots, i_m$ such that $M_{i_1} M_{i_2} \ldots M_{i_m}$ is positive (i.e. has all its entries $>0$). The length of…

Let $A$ be a local complete intersection ring. Let $M,N$ be two finitely generated $A$-modules and $I$ an ideal of $A$. We prove that \[ \bigcup_{i\geqslant 0}\bigcup_{n \geqslant 0}\mathrm{Ass}_A\left(\mathrm{Ext}_A^i(M,N/I^n N)\right) \]…

Let $R$ be a Noetherian $\mathbb{N}$-graded ring. Let $L$, $M$ and $N$ be finitely generated graded $R$-modules with $N \subseteq M$. For a homogeneous ideal $I$, and for each fixed $k \in \mathbb{N}$, we show the asymptotic linearity of…

Consider a linear program of the form $\max\;c^{\top}x:Ax\leq b$, where $A$ is an $m\times n$ integral matrix. In 1986 Cook, Gerards, Schrijver, and Tardos proved that, given an optimal solution $x^{*}$, if an optimal integral solution…

The parametric complexity is the key quantity in the minimum description length (MDL) approach to statistical model selection. Rissanen and others have shown that the parametric complexity of a statistical model approaches a simple function…

We analyze the large degree asymptotic behavior of matrix valued orthogonal polynomials (MVOPs), with a weight that consists of a Jacobi scalar factor and a matrix part. Using the Riemann-Hilbert formulation for MVOPs and the Deift-Zhou…

A classic question in analytic number theory is to find asymptotics for $\sigma_{k}(x)$ and $\pi_{k}(x)$, the number of integers $n\leq x$ with exactly $k$ prime factors, where $\pi_{k}(x)$ has the added constraint that all the factors are…

The determination of the maximal length of maximum distance separable (MDS) codes arising from elliptic curves is a central problem in coding theory. For an elliptic curve $E$ over $\mathbb{F}_q$, let $\operatorname{MEC}(k,q)$ denote the…

Consider the problem of detecting one of M i.i.d. Gaussian signals corrupted in white Gaussian noise. Conventionally, matched filters are used for detection. We first show that the outputs of the matched filter form a set of asymptotically…

Asymptotic tensor rank is notoriously difficult to determine. Indeed, determining its value for the $2\times 2$ matrix multiplication tensor would determine the matrix multiplication exponent, a long-standing open problem. On the other…