Related papers: Asymptotics of Moore exponent sets

In 2017 Jordanova and co-authors consider probabilities for p-outside values, and later on, they use them in order to construct distribution sensitive IPO estimators. These works do not take into account the asymmetry of the distribution.…

Consider the set of all error--correcting block codes over a fixed alphabet with $q$ letters. It determines a recursively enumerable set of points in the unit square with coordinates $(R,\delta)$:= {\it (relative transmission rate, relative…

We study the computational complexity of two hard problems on determinantal point processes (DPPs). One is maximum a posteriori (MAP) inference, i.e., to find a principal submatrix having the maximum determinant. The other is probabilistic…

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

Let R be a standard graded ring over a commutative Noetherian ring with unity and I a graded ideal of R. Let M be a finitely generated graded R-module. We prove that there exist integers e and \rho_M(I) such that for all large n, reg(I^nM)=…

We fix a maximal order $\mathcal O$ in $\F=\R,\C$ or $\mathbb{H}$, and an $\F$-hermitian form $Q$ of signature $(n,1)$ with coefficients in $\mathcal O$. Let $k\in\N$. By applying a lattice point theorem on the $\F$-hyperbolic space, we…

We obtain an asymptotic formula in q for the number of MDS codes of length n and dimension k over a finite field with q elements.

In Ruckdeschel[10], we derive an asymptotic expansion of the maximal mean squared error (MSE) of location M-estimators on suitably thinned out, shrinking gross error neighborhoods. In this paper, we compile several consequences of this…

Skew polynomial rings provide a fundamental example of noncommutative principal ideal domains. Special quotients of these rings yield matrix algebras that play a central role in the theory of rank-metric codes. Recent breakthroughs have…

The Thue--Morse sequence $\{t(n)\}_{n\geqslant 1}$ is the indicator function of the parity of the number of ones in the binary expansion of positive integers $n$, where $t(n)=1$ (resp. $=0$) if the binary expansion of $n$ has an odd (resp.…

An (n,d)-permutation code is a subset C of Sym(n) such that the Hamming distance d_H between any two distinct elements of C is at least equal to d. In this paper, we use the characterisation of the isometry group of the metric space…

This preprint is of a chapter to appear in {\it Combinatorics and finite fields: Difference sets, polynomials, pseudorandomness and applications. Radon Series on Computational and Applied Mathematics}, K.-U. Schmidt and A. Winterhof (eds.).…

The equator of a graph is the length of a longest isometric cycle. We bound the order $n$ of a graph from below by its equator $q$, girth $g$ and minimum degree $\delta$ - and show that this bound is sharp when there exists a Moore graph…

The classical matrix-tree theorem was discovered by G.~Kirchhoff in 1847. It relates the principal minor of the Laplace (nxn)-matrix to a particular sum of monomials indexed by the set of trees with n vertices. The aim of this paper is to…

We study a family of polynomials which are orthogonal with respect to the varying, highly oscillatory complex weight function $e^{ni\lambda z}$ on $[-1,1]$, where $\lambda$ is a positive parameter. This family of polynomials has appeared in…

We present the theory of rank-metric codes with respect to the 3-tensors that generate them. We define the generator tensor and the parity check tensor of a matrix code, and describe the properties of a code through these objects. We define…

We study the asymptotics for the Fourier coefficients of a broad class of eta-quotients, $$\prod_{r=1}^R \left(\prod_{k\ge 1}\left(1-q^{m_r k}\right)\right)^{\delta_r},$$ where $m_1,\ldots,m_R$ are $R$ distinct positive integers and…

Let $K$ be a proper (i.e., closed, pointed, full convex) cone in ${\Bbb R}^n$. An $n\times n$ matrix $A$ is said to be $K$-primitive if there exists a positive integer $k$ such that $A^k(K \setminus \{0 \}) \subseteq$ int $K$; the least…

We establish an asymptotic formula for the number of integer solutions to the Markoff-Hurwitz equation \[ x_{1}^{2}+x_{2}^{2}+\ldots+x_{n}^{2}=ax_{1}x_{2}\ldots x_{n}+k. \] When $n\geq4$ the previous best result is by Baragar (1998) that…

An integer matrix $\mathbf{A}$ is $\Delta$-modular if the determinant of each $\text{rank}(\mathbf{A}) \times \text{rank}(\mathbf{A})$ submatrix of $\mathbf{A}$ has absolute value at most $\Delta$. The study of $\Delta$-modular matrices…