Related papers: On the least common multiple of random $q$-integer…

We study the asymptotic properties of parameter estimation and predictive inference under the exchangeable Gibbs partition, characterized by a discount parameter $\alpha\in(0,1)$ and a triangular array $v_{n,k}$ satisfying a backward…

Addressing a problem posed by W. Li and A. Wei (2009), we investigate the average number of (complex) zeros of a random harmonic polynomial $p(z) + \overline{q(z)}$ sampled from the Kac ensemble, i.e., where the coefficients are independent…

Let $\mathbb{F}_q[t]$ be the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements, and let $p$ be the characteristic of $\mathbb{F}_q$. We denote $\widetilde{G}_q(k)$ to be the least integer $t_0$ with the property that…

Fix an integer $r\geq 3$. Let $q$ be a large positive integer and $a_1,...,a_r$ be distinct residue classes modulo $q$ that are relatively prime to $q$. In this paper, we establish an asymptotic formula for the logarithmic density…

Let $E$ be a Moran set on $\mathbb{R}^1$ associated with a closed interval $J$ and two sequences $(n_k)_{k=1}^\infty$ and $(\mathcal{C}_k=(c_{k,j})_{j=1}^{n_k})_{k\geq1}$. Let $\mu$ be the infinite product measure (Moran measure) on $E$…

It is well known that the proportion of pairs of elements of $\operatorname{SL}(n,q)$ which generate the group tends to $1$ as $q^n\to \infty$. This was proved by Kantor and Lubotzky using the classification of finite simple groups. We give…

The Kahane--Salem--Zygmund inequality is a probabilistic result that guarantees the existence of special matrices with entries $1$ and $-1$ generating unimodular $m$-linear forms $A_{m,n}:\ell_{p_{1}}^{n}\times…

Let $U$ be a Morse function on a compact connected $m$-dimensional Riemannian manifold, $m \geq 2,$ satisfying $\min U=0$ and let $\mathcal{U} = \{x \in M \: : U(x) = 0\}$ be the set of global minimizers. Consider the stochastic algorithm…

De Loera, O'Neill and Wilburne introduced a general model for random numerical semigroups in which each positive integer is chosen independently with some probability p to be a generator, and proved upper and lower bounds on the expected…

We study generalized additive partial linear models, proposing the use of polynomial spline smoothing for estimation of nonparametric functions, and deriving quasi-likelihood based estimators for the linear parameters. We establish…

We prove that the number of copies of any given permutation pattern $q$ has an asymptotically normal distribution in random permutations.

For a family X of k-subsets of the set 1,...,n, let |X| be the cardinality of X and let Gamma(X,mu) be the expected maximum weight of a subset from X when the weights of 1,...,n are chosen independently at random from a symmetric…

Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…

In this paper, we study the structure of the complete asymptotic expansion of the probability that a large combinatorial object is connected or consists of a given number of connected components. For rapidly growing labeled families of…

We consider random mappings on n = kr nodes with preimage sizes restricted to a set of the form {0,k}, where k = k(r) is greater than 1. We prove that T, the least common multiple of the cycle lengths, and B= the product of the cycle…

Let $A$ be a $n \times n$ symmetric matrix with $(A_{i,j})_{i\leq j} $, independent and identically distributed according to a subgaussian distribution. We show that $$\mathbb{P}(\sigma_{\min}(A) \leq \varepsilon/\sqrt{n}) \leq C…

Given a partition $\{E_0,\ldots,E_n\}$ of the set of primes and a vector $\mathbf{k} \in \mathbb{N}_0^{n+1}$, we compute an asymptotic formula for the quantity $|\{m \leq x: \omega_{E_j}(m) = k_j \ \forall \ 0 \leq j \leq n\}|$ uniformly in…

In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime $p$ less than $x$, the basic idea is to fix a constant $q\propto x^{1-\varepsilon}$, pick a uniformly…

We consider the problem of estimating the $L_1$ distance between two discrete probability measures $P$ and $Q$ from empirical data in a nonasymptotic and large alphabet setting. When $Q$ is known and one obtains $n$ samples from $P$, we…

Let X1, ..., Xn be arbitrary non-negative independent random variables with respective expected values $\mu_{i}$ at most one. We sketch but do not prove an equivalent conjecture to Feige's Conjecture $\mathbb{P} \left( \sum_{i=1}^{n} X_{i}…