Related papers: Random index of codivisibility
Given two identical linear codes $\mathcal C$ over $\mathbb F_q$ of length $n$, we independently pick one codeword from each codebook uniformly at random. A $\textit{sumset}$ is formed by adding these two codewords entry-wise as integer…
We show that for large integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the number of prime factors follows an approximate normal distribution, with mean $C \log_2 n$ and variance $V \log_2 n$,…
The Hermite Normal Form (HNF) is a canonical representation of matrices over any principal ideal domain. Over the integers, the distribution of the HNFs of randomly looking matrices is far from uniform. The aim of this article is to present…
Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$…
The prime numbers look like a randomly chosen sequence of natural numbers, but there is still no strict theory to determine 'Randomness'. In these years, cryptography has developed a battery of statistical tests for randomness. In this…
Randomness is a central concept to statistics and physics. Here, a statistical analysis shows experimental evidence that tossing coins and finding last digits of prime numbers are identical regarding statistics for equally likely outcomes.…
An equivalent condition for the product of elements of an independent random sample on a compact algebraic group converging in distribution to some random variable as the sample size increases is obtained. Namely, a limit distribution…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
Benford's Law describes the prevalence of small numbers as the leading digits of numbers in many sets of integers. We prove a variant of Benford's law for many positive-density subsets of the primes. This follows from a more general result…
A random dense countable set is characterized (in distribution) by independence and stationarity. Two examples are `Brownian local minima' and `unordered infinite sample'. They are identically distributed; the former ad hoc proof of this…
Let $R=k[|t^a,t^b,t^c|]$ be a complete intersection numerical semigroup ring over an infinite field $k$, where $a,b,c\in\BN$. The generalized Loewy length, which is Auslander's index in this case, is computed in terms of the minimal…
In this paper, we study VC-density over indiscernible sequences (denoted VC_ind-density). We answer an open question in [1], showing that VC_ind-density is always integer valued. We also show that VC_ind-density and dp-rank coincide in the…
We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in…
High dimensional data can have a surprising property: pairs of data points may be easily separated from each other, or even from arbitrary subsets, with high probability using just simple linear classifiers. However, this is more of a rule…
This note examines the infinite divisibility of density-based transformations of normal random variables. We characterize a class of density-based transformations of normal variables which produces non-infinitely divisible distributions. We…
In discriminating between objects from different classes, the more separable these classes are the less computationally expensive and complex a classifier can be used. One thus seeks a measure that can quickly capture this separability…
Subfactor standard invariants encode quantum symmetries. The small index subfactor classification program has been a rich source of interesting quantum symmetries. We give the complete classification of subfactor standard invariants to…
TThe problem is to identify a probability associated with a set of natural numbers, given an infinite data sequence of elements from the set. If the given sequence is drawn i.i.d. and the probability mass function involved (the target)…
The minimum average number of bits need to describe a random variable is its entropy, assuming knowledge of the underlying statistics On the other hand, universal compression supposes that the distribution of the random variable, while…
Let $f(n)=\min_{p} |n-p|$, where $p$ is a prime. We show that there is a positive constant $\delta$ such that for any large integer $N$ there exist two positive integers $n_1$ and $n_2$ such that $N=n_1 + n_2$ and $f(n_i)\gg \ln N (\ln\ln…