相关论文: Self-similar and Markov composition structures
Let $G=(\mathbb Z/n\mathbb Z) \oplus (\mathbb Z/n\mathbb Z)$. Let $\mathsf {s}_{\leq k}(G)$ be the smallest integer $\ell$ such that every sequence of $\ell$ terms from $G$, with repetition allowed, has a nonempty zero-sum subsequence with…
We study the resonance (or Gamow) eigenstates of open chaotic systems in the semiclassical limit, distinguishing between left and right eigenstates of the non-unitary quantum propagator, and also between short-lived and long-lived states.…
We show that any binary $(n=2^m-3, 2^{n-m}, 3)$ code $C_1$ is a part of an equitable partition (perfect coloring) $\{C_1,C_2,C_3,C_4\}$ of the $n$-cube with the parameters $((0,1,n-1,0)(1,0,n-1,0)(1,1,n-4,2)(0,0,n-1,1))$. Now the…
Let $K\subseteq\mathbb{R}$ be the unique attractor of an iterated function system. We consider the case where $K$ is an interval and study those elements of $K$ with a unique coding. We prove under mild conditions that the set of points…
In this paper, we consider convergence properties of a second order Markov chain. Similar to a column stochastic matrix is associated to a Markov chain, a so called {\em transition probability tensor} $P$ of order 3 and dimension $n$ is…
This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed…
For a set of nonnegative integers $S$ let $R_{S}(n)$ denote the number of unordered representations of the integer $n$ as the sum of two different terms from $S$. In this paper we focus on partitions of the natural numbers into two sets…
We discuss scaling limits of large bipartite planar maps. If p is a fixed integer strictly greater than 1, we consider a random planar map M(n) which is uniformly distributed over the set of all 2p-angulations with n faces. Then, at least…
In two-parameter bifurcation diagrams of piecewise-linear continuous maps on $\mathbb{R}^N$, mode-locking regions typically have points of zero width known as shrinking points. Near any shrinking point, but outside the associated…
The nature of the alignment with gaps corresponding to a longest common subsequence (LCS) of two independent iid random sequences drawn from a finite alphabet is investigated. It is shown that such an optimal alignment typically matches…
When considering binary strings, it's natural to wonder how many distinct subsequences might exist in a given string. Given that there is an existing algorithm which provides a straightforward way to compute the number of distinct…
We consider uniformly random set partitions of size $n$ with exactly $k$ blocks, and uniformly random permutations of size $n$ with exactly $k$ cycles, under the regime where $n-k \sim t\sqrt{n}$, $t>0$. In this regime, there is a simple…
We study a family of measures originating from the signatures of the irreducible components of representations of the unitary group, as the size of the group goes to infinity. Given a random signature $\lambda$ of length $N$ with counting…
We give a bijection between the set of self-conjugate partitions and that of ordinary partitions. Also, we show the relation between hook lengths of self conjugate partition and corresponding partition via the bijection. As a corollary, we…
We present the discovery of a fundamental composition law governing conjugate observables in the Random Permutation Sorting System (RPSS). The law links the discrete permutation count Np and the continuous elapsed time T through a…
Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrence of $w$ in the binary expansion of $n$ as a scattered subsequence. We study the behavior of the partial sum…
A theory of structure is formulated for systems of many structureless classical particles with stable local interactions in Euclidean space. Such systems are shown to have their structure in thermodynamic equilibrium determined exactly by a…
Recently introduced and studied in arXiv:2407.07888, a self-similar Markov tree (ssMt) is a random decorated tree that vastly generalises the fragmentation tree. We study here the critical case that was left aside in arXiv:2407.07888.…
We study the synchronization behavior of discrete-time Markov chains on countable state spaces. Representing a Markov chain in terms of a random dynamical system, which describes the collective dynamics of trajectories driven by the same…
We investigate the properties of uniform doubly stochastic random matrices, that is non-negative matrices conditioned to have their rows and columns sum to 1. The rescaled marginal distributions are shown to converge to exponential…