English
Related papers

Related papers: Statistics on monotonically ordered non-crossing p…

200 papers

We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing…

Probability · Mathematics 2017-06-30 Igor Kortchemski , Cyril Marzouk

We study the distribution of several statistics of large non-crossing partitions. First, we prove the Gaussian limit theorem for the number of blocks of a given fixed size. In contrast to the properties of usual set partitions, we show that…

Probability · Mathematics 2019-07-02 Vladislav Kargin

We introduce and study a noncommutative two-parameter family of noncommutative Brownian motions in the free Fock space. They are associated with Kesten laws and give a continuous interpolation between Brownian motions in free probability…

Quantum Algebra · Mathematics 2014-07-25 Romuald Lenczewski , Rafal Salapata

Certain mathematical structures make a habit of reoccuring in the most diverse list of settings. Some obvious examples exhibiting this intrusive type of behavior include the Fibonacci numbers, the Catalan numbers, the quaternions, and the…

Combinatorics · Mathematics 2007-05-23 Jon McCammond

We introduce several statistics on ordered partitions of sets, that is, set partitions where the blocks are permuted arbitrarily. The distribution of these statistics is closely related to the q-Stirling numbers of the second kind. Some of…

Combinatorics · Mathematics 2019-04-26 Einar Steingrimsson

The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Susan Y. J. Wu , Catherine Yan

We derive a formula for the expected number of blocks of a given size from a non-crossing partition chosen uniformly at random. Moreover, we refine this result subject to the restriction of having a number of blocks given. Furthermore, we…

Combinatorics · Mathematics 2012-03-16 Octavio Arizmendi

The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…

Combinatorics · Mathematics 2020-11-17 Olivia Nabawanda , Fanja Rakotondrajao

The expectation is an example of a descriptive statistic that is monotone with respect to stochastic dominance, and additive for sums of independent random variables. We provide a complete characterization of such statistics, and explore a…

Theoretical Economics · Economics 2024-08-06 Xiaosheng Mu , Luciano Pomatto , Philipp Strack , Omer Tamuz

Motivated by recent work on mixtures of classical and free probabilities, we introduce and study the notion of $\epsilon$-noncrossing partitions. It is shown that the set of such partitions forms a lattice, which interpolates as a poset…

Combinatorics · Mathematics 2018-12-06 Kurusch Ebrahimi-Fard , Frederic Patras , Roland Speicher

Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…

Quantum Physics · Physics 2007-05-23 Allan I. Solomon , Pawel Blasiak , Gerard Duchamp , Andrzej Horzela , Karol A. Penson

In this paper, we introduce polynomial time algorithms that generate random 3-noncrossing partitions and 2-regular, 3-noncrossing partitions with uniform probability. A 3-noncrossing partition does not contain any three mutually crossing…

Combinatorics · Mathematics 2009-10-15 Jing Qin , Christian M. Reidys

We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of minimal block elements and maximal block…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Eva Y. P. Deng , Rosena R. X. Du , Richard P. Stanley , Catherine H. Yan

We consider free multiple stochastic measures in the combinatorial framework of the lattice of all diagonals of an n-dimensional space. In this free case, one can restrict the analysis to only the noncrossing diagonals. We give definitions…

Operator Algebras · Mathematics 2007-05-23 Michael Anshelevich

In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…

Combinatorics · Mathematics 2009-11-17 Jing Qin , Christian M. Reidys

We study statistics on ordered set partitions whose generating functions are related to $p,q$-Stirling numbers of the second kind. The main purpose of this paper is to provide bijective proofs of all the conjectures of \stein…

Combinatorics · Mathematics 2007-12-12 Anisse Kasraoui , Jiang Zeng

This paper will be devoted to study weighted (deformed) free Poisson random variables from the viewpoint of orthogonal polynomials and statistics of non-crossing partitions. A family of weighted (deformed) free Poisson random variables will…

Probability · Mathematics 2025-09-03 Nobuhiro Asai , Hiroaki Yoshida

We find exact and asymptotic formulas for the average values of several statistics on set partitions: of Carlitz's $q$-Stirling distributions, of the numbers of crossings in linear and circular representations of set partitions, of the…

Combinatorics · Mathematics 2013-04-18 Anisse Kasraoui

We consider $m$-divisible non-crossing partitions of $\{1,2,\ldots,mn\}$ with the property that for some $t\leq n$ no block contains more than one of the first $t$ integers. We give a closed formula for the number of multi-chains of such…

Combinatorics · Mathematics 2023-02-07 Christian Krattenthaler , Henri Mühle

This paper studies partitions in the space of antimonotonic boolean functions on sets of n elements. The antimonotonic functions are the antichains of the partially ordered set of subsets. We analyse and characterise a natural partial…

Number Theory · Mathematics 2011-03-16 Patrick De Causmaecker , Stefan De Wannemacker
‹ Prev 1 2 3 10 Next ›