English
Related papers

Related papers: The distribution on permutations induced by a rand…

200 papers

This paper focuses on the size-biased permutation of $n$ independent and identically distributed (i.i.d.) positive random variables. This is a finite dimensional analogue of the size-biased permutation of ranked jumps of a subordinator…

Probability · Mathematics 2015-09-30 Jim Pitman , Ngoc M. Tran

A permutation $\sigma$ of a multiset is called Stirling permutation if $\sigma(s)\ge \sigma(i)$ as soon as $\sigma(i)=\sigma(j)$ and $i<s<j.$ In our paper we study Stirling polynomials that arise in the generating function for descent…

Combinatorics · Mathematics 2013-08-27 Askar Dzhumadil'daev , Damir Yeliussizov

Consider a uniform random rooted tree on vertices labelled by $[n] = \{1,2,\ldots,n\}$, with edges directed towards the root. We imagine that each node of the tree has space for a single car to park. A number $m \le n$ of cars arrive one by…

Probability · Mathematics 2019-03-06 Christina Goldschmidt , Michał Przykucki

For each $n$, let $X_n \in \{0,\ldots,n\}$ be a random variable with mean $\mu_n$, standard deviation $\sigma_n$, and let \[ P_n(z) = \sum_{k=0}^n \mathbb{P}( X_n = k) z^k ,\] be its probability generating function. We show that if none of…

Probability · Mathematics 2018-06-13 Marcus Michelen , Julian Sahasrabudhe

Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…

Probability · Mathematics 2008-02-29 Terence Tao , Van Vu

We consider the probability $p(S_n)$ that a pair of random permutations generates either the alternating group $A_n$ or the symmetric group $S_n$. Dixon (1969) proved that $p(S_n)$ approaches $1$ as $n\to\infty$ and conjectured that…

Group Theory · Mathematics 2017-07-14 Sean Eberhard , Stefan-Christoph Virchow

An \emph{$(r,k)$-parking function} of length $n$ may be defined as a sequence $(a_1,\dots,a_n)$ of positive integers whose increasing rearrangement $b_1\leq\cdots\leq b_n$ satisfies $b_i\leq k+(i-1)r$. The case $r=k=1$ corresponds to…

Combinatorics · Mathematics 2018-05-18 Richard Stanley , Yinghui Wang

Given a strictly increasing sequence $\mathbf{t}$ with entries from $[n]:=\{1,\ldots,n\}$, a parking completion is a sequence $\mathbf{c}$ with $|\mathbf{t}|+|\mathbf{c}|=n$ and $|\{t\in \mathbf{t}\mid t\le i\}|+|\{c\in \mathbf{c}\mid c\le…

For each $n$, let $A_n=(\sigma_{ij})$ be an $n\times n$ deterministic matrix and let $X_n=(X_{ij})$ be an $n\times n$ random matrix with i.i.d. centered entries of unit variance. In the companion article Cook et al., we considered the…

Probability · Mathematics 2020-07-31 Nicholas A. Cook , Walid Hachem , Jamal Najim , David Renfrew

Classical parking functions are defined as the parking preferences for $n$ cars driving (from west to east) down a one-way street containing parking spaces labeled from $1$ to $n$ (from west to east). Cars drive down the street toward their…

Given a permutation $\pi$ chosen uniformly from $S_n$, we explore the joint distribution of $\pi(1)$ and the number of descents in $\pi$. We obtain a formula for the number of permutations with $\des(\pi)=d$ and $\pi(1)=k$, and use it to…

Combinatorics · Mathematics 2007-05-23 Mark Conger

We define and study positional marked patterns, permutations $\tau$ where one of elements in $\tau$ is underlined. Given a permutation $\sigma$, we say that $\sigma$ has a $\tau$-match at position $i$ if $\tau$ occurs in $\sigma$ in such a…

Combinatorics · Mathematics 2023-06-22 Sittipong Thamrongpairoj , Jeffrey B. Remmel

We study Haar unitary random matrices with permuted entries. For a sequence of permutations $\left(\sigma_N\right)_N$, where $\sigma_N$ acts on $N\times N$ matrices we identify conditions under which the $\ast$--distribution of permuted…

Probability · Mathematics 2021-02-23 James A. Mingo , Mihai Popa , Kamil Szpojankowski

Kreweras proved that the reversed sum enumerator for parking functions of length $n$ is equal to the inversion enumerator for labeled trees on $n+1$ vertices. Recently, Perkinson, Yang, and Yu gave a bijective proof of this equality that…

Combinatorics · Mathematics 2019-12-24 Petar Gaydarov , Sam Hopkins

In a recent paper J. Haglund showed that a certain symmetric function expresion enumerates by t^{area} q^{dinv} of the parking functions whose diagonal word is in the shuffle of 12...j and j+1...j+n with k of the cars j+1,...,j+n in the…

Combinatorics · Mathematics 2012-05-29 Adrian Duane , Adriano M. Garsia , Mike Zabrocki

Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…

Combinatorics · Mathematics 2007-05-23 Jinho Baik , Eric M. Rains

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. For $z\geqslant 0$, let $G(n;z)$ denote the number of those indexes $j$ such that $p_{j+1}(n)>p_j(n)^{\exp z}$. We show uniform…

Number Theory · Mathematics 2021-07-06 Régis de la Bretèche , Gérald Tenenbaum

We study a generalization of the Wigner function to arbitrary tuples of hermitian operators. We show that for any collection of hermitian operators A1...An , and any quantum state there is a unique joint distribution on R^n, with the…

Quantum Physics · Physics 2020-07-09 René Schwonnek , Reinhard F. Werner

Let $W$ be an irreducible finite complex reflection group acting on a complex vector space $V$. For a positive integer $k$, we consider a class function $\varphi_k$ given by $\varphi_k(w) = k^{\dim V^w}$ for $w \in W$, where $V^w$ is the…

Combinatorics · Mathematics 2015-08-28 Yosuke Ito , Soichi Okada

In this paper, we complete the enumeration of the number of parking functions of length $n$ avoiding, in the sense defined by Qiu and Remmel, a permutation of length 3, answering several questions of Adeniran and Pudwell. Additionally, we…

Combinatorics · Mathematics 2026-05-26 Ben Adenbaum
‹ Prev 1 4 5 6 7 8 10 Next ›