English
Related papers

Related papers: Rook placements in Young diagrams and permutation …

200 papers

This paper considers the probabilistic representation of the solutions of ordinary differential equations (ODEs) by the generation of marked random trees in which marks can be interpreted as mutant types in population genetics models. We…

Probability · Mathematics 2025-11-11 Qiao Huang , Nicolas Privault

The $q$-commutation relations, formulated in the setting of the $q$-Fock space of Bo\.zjeko and Speicher, interpolate between the classical commutation relations (CCR) and the classical anti-commutation relations (CAR) defined on the…

Mathematical Physics · Physics 2011-02-04 Natasha Blitvić

It is shown that the combinatorics of commutation relations is well suited for analyzing the convergence rate of certain Markov chains. Examples studied include random walk on irreducible representations, a local random walk on partitions…

Probability · Mathematics 2008-01-21 Jason Fulman

This paper studies the generalizations of the Stirling numbers of both kinds and the Lah numbers in association with the normal order problem in the Weyl algebra $W=\langle x,D|Dx-xD=1\rangle$. Any word $\omega\in W$ with $m$ $x$'s and $n$…

Combinatorics · Mathematics 2017-01-04 Sen-Peng Eu , Tung-Shan Fu , Yu-Chang Liang , Tsai-Lien Wong

Inspired by Gansner's elegant $k$-trace generating function for rectangular plane partitions, we introduce two novel operators, $\varphi_{z}$ and $\psi_{z}$, along with their combinatorial interpretations. Through these operators, we derive…

Combinatorics · Mathematics 2024-12-06 Jingxuan Li , Feihu Liu , Guoce Xin

We report some properties of heavy-tailed Sibuya-like distributions related to thinning, self-decomposability and branching processes. Extension of the thinning operation of on-negative integer-valued random variables to scaling by…

Probability · Mathematics 2022-05-03 Lev B. Klebanov , Michal Šumbera

We consider conjugation action of symmetric group on the semigroup of all partial functions and develop a machinery to investigate character formulas and multiplicities. In particular, we determine nilpotent matrices whose orbit under…

Representation Theory · Mathematics 2017-04-05 Mahir Bilen Can

We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…

Combinatorics · Mathematics 2020-06-02 Colin Defant , Michael Engen , Jordan A. Miller

In this paper we consider two pointsets in $\mathrm{PG}(2,q^n)$ arising from a linear set $L$ of rank $n$ contained in a line of $\mathrm{PG}(2,q^n)$: the first one is a linear blocking set of R\'edei type, the second one extends the…

Combinatorics · Mathematics 2021-12-23 Vito Napolitano , Olga Polverino , Paolo Santonastaso , Ferdinando Zullo

We study $r$-differential posets, a class of combinatorial objects introduced in 1988 by the first author, which gathers together a number of remarkable combinatorial and algebraic properties, and generalizes important examples of ranked…

Combinatorics · Mathematics 2012-05-01 Richard P. Stanley , Fabrizio Zanello

We study the repartition of the roots of a random p-adic polynomial in an algebraic closure of Qp.We prove that the mean number of roots generating a fixed finite extension K of Qp depends mostly on the discriminant of K, an extension…

Number Theory · Mathematics 2021-10-11 Xavier Caruso

We consider a Markovian evolution on point processes, the $\Psi$--process, on the unit interval in which points are added according to a rule that depends only on the spacings of the existing point configuration. Having chosen a spacing, a…

Probability · Mathematics 2020-07-01 Pascal Maillard , Elliot Paquette

We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…

Probability · Mathematics 2016-07-06 Richard Arratia , Stephen DeSalvo

We study the enumeration problem for different kind of tree parking functions introduced recently, called tree parking functions, tree parking distributions, prime tree parking functions, and prime tree parking distributions, for rooted…

Combinatorics · Mathematics 2020-07-30 Alois Panholzer

We start with a random polynomial $P^{N}(z)$ of degree $N$ with independent coefficients. We then consider a new polynomial $P_{t}^{N}$ obtained by $\lceil Nt\rceil$ applications of a fractional differential operator of the form $z^{a}…

Probability · Mathematics 2026-05-05 Brian C. Hall , Ching-Wei Ho , Jonas Jalowy , Zakhar Kabluchko

We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…

Combinatorics · Mathematics 2019-09-20 Michael Albert , Mathilde Bouvel , Valentin Féray

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

Combinatorics · Mathematics 2020-10-14 Antoine Abram , Nathan Chapelier-Laget , Christophe Reutenauer

Tandem duplication is an evolutionary process whereby a segment of DNA is replicated and proximally inserted. The different configurations that can arise from this process give rise to some interesting combinatorial questions. Firstly, we…

Combinatorics · Mathematics 2016-11-25 L Penso-Dolfin , CD Greenman

We derive the continued fraction form of the generating function of some new $q$-analogs of the Eulerian numbers $\hat{E}_{k,n}(q)$ introduced by Lauren Williams building on work of Alexander Postnikov. They are related to the number of…

Combinatorics · Mathematics 2007-05-23 Sylvie Corteel

Several popular language models represent local contexts in an input text $x$ as bags of words. Such representations are naturally encoded by a sequence graph whose vertices are the distinct words occurring in $x$, with edges representing…

Data Structures and Algorithms · Computer Science 2025-07-14 Sammy Khalife , Yann Ponty , Laurent Bulteau