Related papers: Average number of distinct part sizes in a random …
Proposed in 1937, the Collatz conjecture has remained in the spotlight for mathematicians and computer scientists alike due to its simple proposal, yet intractable proof. In this paper, we propose several novel theorems, corollaries, and…
We investigate the joint convergence of independent random Toeplitz matrices with complex input entries that have a pair-correlation structure, along with deterministic Toeplitz matrices and the backward identity permutation matrix.…
There is a well-known asymptotic formula, due to W. M. Schmidt (1968) for the number of full-rank integer lattices of index at most $V$ in $\mathbb{Z}^n$. This set of lattices $L$ can naturally be partitioned with respect to the factor…
In order to understand the structure of the `typical' element of an automorphism group, one has to study how large the conjugacy classes of the group are. When typical is meant in the sense of Baire category, a complete description of the…
An inequality for the variance of an additive function defined on random decomposable structures, called assemblies, is established. The result generalizes estimates obtained earlier in the cases of permutations and mappings of a finite set…
The Collatz variations pattern seems not to have any recurrence relation between numbers. But knowing that there is at least a natural number that converges after several iterations we construct a function $f_{X,Y}$ that is equal to the…
In this paper we consider particular generalized compositions of a natural number with a given number of parts. Its number is a weighted polynomial coefficient. The number of all generalized compositions of a natural number is a weighted…
Bernoulli sieve is a recursive construction of a random composition (ordered partition) of integer $n$. This composition can be induced by sampling from a random discrete distribution which has frequencies equal to the sizes of component…
In this paper, we introduce and study {\it Carlitz polyominoes}. In particular, we show that, as $n$ grows to infinity, asymptotically the number of \begin{enumerate} \item column-convex Carlitz polyominoes with perimeter $2n$ is \beq…
We propose an aproach for asymptotic analysis of plane partition statistics related to counts of parts whose sizes exceed a certain suitably chosen level. In our study, we use the concept of conjugate trace of a plane partition of the…
A structured approach for the Collatz conjecture is presented using just the odd integers that are, in turn, divided into categories based on the roles they play such as Starter, Intermediary and Terminal. The expression 4x+1 is used as a…
We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…
The norm of an integer partition is defined as the product of its parts. This statistic was recently introduced by Schneider in connection to partition zeta functions. In this note, we use the method of moments to study the distribution of…
This article investigates integer sequences that partition the sequence into blocks of various lengths - irregular arrays. The main result of the article is explicit formulas for numbering of irregular arrays. A generalization of Cantor…
The random networks enriched with additional structures as metric and group-symmetry in background metric space are investigated. The important quantities like he clustering coefficient as well as the mean degree of separation in such…
We consider a class of non-homogeneous Markov chains, that contains many natural examples. Next, using martingale methods, we establish some deviation and moment inequalities for separately Lipschitz functions of such a chain, under moment…
In the present paper, we are interested in classifying of Collatz sequences on based to the different behavior of these sequences when their lengths tend to infinity. A Collatz infinite sequence can be defined as an infinite ordered set of…
Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).
We analytically calculate the average value of i-th largest Schmidt coefficient for random pure quantum states. Schmidt coefficients, i.e., eigenvalues of the reduced density matrix, are expressed in the limit of large Hilbert space size…
In this paper, we study the condition number of a random Toeplitz matrix. Since a Toeplitz matrix is a diagonal constant matrix, its rows or columns cannot be stochastically independent. This situation does not permit us to use the classic…