相关论文: Asymptotics of Moore exponent sets

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

Let $Q$ be a set of primes with relative density $\delta$. We count integers in $[1,x]$ with prime factors all in $Q$ that also have a divisor in $(y,2y]$. We establish the order of magnitude for all $\delta \in (0,1]$. This generalizes the…

This paper derives the rate of convergence and asymptotic distribution for a class of Kolmogorov-Smirnov style test statistics for conditional moment inequality models for parameters on the boundary of the identified set under general…

Asymptotic normality is frequently observed in large combinatorial structures, rigorously established for many quantities such as cycles or inversions in random permutations, the number of prime factors of random integers, and various…

We consider properties of determinants of some random symmetric matrices issued from multivariate statistics: Wishart/Laguerre ensemble (sample covariance matrices), Uniform Gram ensemble (sample correlation matrices) and Jacobi ensemble…

In this paper we consider the degree/diameter problem, namely, given natural numbers {\Delta} \geq 2 and D \geq 1, find the maximum number N({\Delta},D) of vertices in a graph of maximum degree {\Delta} and diameter D. In this context, the…

Asymptotic formulae are established for the number of natural numbers $m$ with largest square-free divisor not exceeding $m^{\vartheta}$, for any fixed positive parameter $\vartheta$. Related counting functions are also considered.

In this paper we consider a family $\mathcal{F}$ of $16$-dimensional $\mathbb{F}_q$-linear rank metric codes in $\mathbb{F}_q^{8\times8}$, arising from the polynomial $x^{q^s}+\delta x^{q^{4+s}}\in\mathbb{F}_{q^8}[x]$. Examples of MRD codes…

An exponent matrix is an $n\times n$ matrix $A=(a_{ij})$ over ${\mathbb N}^0$ satisfying (1) $a_{ii}=0$ for all $i=1,\ldots, n$ and (2) $a_{ij}+a_{jk}\geq a_{ik}$ for all pairwise distinct $i,j,k\in\{1,\dots, n\}$. In the present paper we…

A sum-rank-metric code attaining the Singleton bound is called maximum sum-rank distance (MSRD). MSRD codes have been constructed for some parameter cases. In this paper we construct a linear MSRD code over an arbitrary field ${\bf F}_q$…

In this paper, we propose a computationally simple estimator of the asymptotic covariance matrix of the Principal Components (PC) factors valid in the presence of cross-correlated idiosyncratic components. The proposed estimator of the…

We consider the NP-hard problem of minimizing a separable concave quadratic function over the integral points in a polyhedron, and we denote by D the largest absolute value of the subdeterminants of the constraint matrix. In this paper we…

We study the Moran process as adapted by Lieberman, Hauert and Nowak. This is a model of an evolving population on a graph or digraph where certain individuals, called "mutants" have fitness r and other individuals, called non-mutants have…

Rosengren and Schlosser introduced notions of ${\it R}_N$-theta functions for the seven types of irreducible reduced affine root systems, ${\it R}_N={\it A}_{N-1}$, ${\it B}_{N}$, ${\it B}^{\vee}_N$, ${\it C}_{N}$, ${\it C}^{\vee}_N$, ${\it…

Let $n, m$ be positive integers, $n\geq m$. We make several remarks on the relationship between approximate differentiability of higher order and Morse-Sard properties. For instance, among other things we show that if a function…

The discriminator of an integer sequence $\textbf{s} = (s(i))_{i \geq 0}$, introduced by Arnold, Benkoski, and McCabe in 1985, is the function $D_{\textbf{s}} (n)$ that sends $n$ to the least integer $m$ such that the numbers $s(0), s(1),…

In this paper we introduce an inductive method to study $\mathrm{OI}$-modules presented in finite degrees, where $\mathrm{OI}$ is a skeleton of the category of finitely totally ordered sets and strictly increasing maps. As an application,…

In this paper, the maximum L$q$-likelihood estimator (ML$q$E), a new parameter estimator based on nonextensive entropy [Kibernetika 3 (1967) 30--35] is introduced. The properties of the ML$q$E are studied via asymptotic analysis and…

Let $n$ be a nonnegative integer and $I$ be a finite set of positive integers. In 1915, MacMahon proved that the number of permutations in the symmetric group $\mathfrak{S}_n$ with descent set $I$ is a polynomial in $n$. We call this the…

Hayes equivalence is defined on monic polynomials over a finite field $\fq$ in terms of the prescribed leading coefficients and the residue classes modulo a given monic polynomial $Q$. We study the distribution of the number of zeros in a…