相关论文: On the Limiting Distribution for the Longest Alter…
We study long $r$-twins in random words and permutations. Motivated by questions posed in works of Dudek-Grytczuk-Ruci\'nski, we obtain the following. For a uniform word in $[k]^n$ we prove sharp one-sided tail bounds showing that the…
We study a classical multitype Galton--Watson process with mutation and selection. The individuals are sequences of fixed length over a finite alphabet. On the sharp peak fitness landscape together with independent mutations per locus, we…
We consider Ewens random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$ and to study the asymptotic behaviour as $n\to\infty$. We obtain very precise information on the joint distribution of…
Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…
Let $S_n$ denote the set of permutations of $[n]:=\{1,\cdots, n\}$, and denote a permutation $\sigma\in S_n$ by $\sigma=\sigma_1\sigma_2\cdots \sigma_n$. For $l\ge2$ an integer, let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set…
An involution in a Coxeter group has an associated set of involution words, a variation on reduced words. These words are saturated chains in a partial order first considered by Richardson and Springer in their study of symmetric varieties.…
The extension of pattern avoidance from ordinary permutations to those on multisets gave birth to several interesting enumerative results. We study permutations on regular multisets, i.e., multisets in which each element occurs the same…
Quite recently, in [8] the authoor of this paper considered the distribution of primes in the sequence $(S_n)$ whose $n$th term is defined as $S_n=\sum_{k=1}^{2n}p_k$, where $p_k$ is the $k$th prime. Some heuristic arguments and the…
This paper presents a new methodology for generating continuous statistical distributions, integrating the exponentiated odds ratio within the framework of survival analysis. This new method enhances the flexibility and adaptability of…
Popular deterministic approximations of posterior distributions from, e.g. the Laplace method, variational Bayes and expectation-propagation, generally rely on symmetric approximating families, often taken to be Gaussian. This choice…
We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator…
Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We study generating functions for the number…
We provide upper and lower bounds for the expected length $\mathbb E(L_{n,m})$ of the longest common pattern contained in $m$ random permutations of length $n$. We also address the tightness of the concentration of $L_{n,m}$ around $\mathbb…
A regenerative random composition of integer $n$ is constructed by allocating $n$ standard exponential points over a countable number of intervals, comprising the complement of the closed range of a subordinator $S$. Assuming that the…
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation grows to infinity.
We present a new perspective of assessing the rates of convergence to the Gaussian and Poisson distributions in the Erd\"os-Kac theorem for additive arithmetic functions $\psi$ of a random integer $J_n$ uniformly distributed over…
We study the random sequential adsorption of $k$-mers on the fully-connected lattice with $N=kn$ sites. The probability distribution $T_n(s,t)$ of the time $t$ needed to cover the lattice with $s$ $k$-mers is obtained using a generating…
Br\"{a}nd\'{e}n and Claesson introduced the concept of mesh patterns in 2011, and since then, these patterns have attracted significant attention in the literature. Subsequently, in 2015, Hilmarsson \emph{et al.} initiated the first…
The paper deals with three generalized dependent setups arising from a sequence of Bernoulli trials. Various distributional properties, such as probability generating function, probability mass function and moments are discussed for these…
We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…