English
Related papers

Related papers: Shuffle-compatible permutation statistics

200 papers

Cylindric skew Schur functions, a generalization of skew Schur functions, are closely related to the famous problem finding a combinatorial formula for the 3-point Gromov-Witten invariants of Grassmannian. In this paper, we prove cylindric…

Combinatorics · Mathematics 2017-06-15 Seung Jin Lee

We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…

Probability · Mathematics 2020-11-10 Jacopo Borga , Erik Slivken

In this paper we use a probabilistic approach to derive the expressions for the characteristic functions of basic statistics defined on permutation tableaux. Since our expressions are exact, we can identify the distributions of basic…

Combinatorics · Mathematics 2009-04-09 Pawel Hitczenko , Svante Janson

Because the stochastic calculus yields rarely random variables with laws defined by explicit closed formulas, probabilistic numerical computations are done most often by simulation. The simulation by the shift, whose field of application is…

Probability · Mathematics 2007-05-23 Nicolas Bouleau

This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…

High Energy Physics - Theory · Physics 2008-02-03 Israel Gelfand , D. Krob , Alain Lascoux , B. Leclerc , V. S. Retakh , J. -Y. Thibon

R. Stanley has found a nice combinatorial formula for characters of irreducible representations of the symmetric group of rectangular shape. Then, he has given a conjectural generalisation for any shape. Here, we will prove this formula…

Combinatorics · Mathematics 2010-01-25 Valentin Féray

We give a new semi-combinatorial proof for the equality of the number of ballot permutations of length $n$ and the number of odd order permutations of length $n$, which is due to Bernardi, Duplantier and Nadeau. Spiro conjectures that the…

Combinatorics · Mathematics 2020-01-22 David G. L. Wang , Jerry J. R. Zhang

We give a bird's-eye view of the plastic deformation of crystals aimed at the statistical physics community, and a broad introduction into the statistical theories of forced rigid systems aimed at the plasticity community. Memory effects in…

In certain situations that shall be undoubtedly more and more common in the Big Data era, the datasets available are so massive that computing statistics over the full sample is hardly feasible, if not unfeasible. A natural approach in this…

Machine Learning · Statistics 2015-01-12 Stéphan Clémençon , Patrice Bertail , Emilie Chautru , Guillaume Papa

Savage and Sagan have recently defined a notion of st-Wilf equivalence for any permutation statistic st and any two sets of permutations $\Pi$ and $\Pi'$. In this paper we give a thorough investigation of st-Wilf equivalence for the charge…

Combinatorics · Mathematics 2012-04-17 Kendra Killpatrick

We give a convergence proof for the approximation by sparse collocation of Hilbert-space-valued functions depending on countably many Gaussian random variables. Such functions appear as solutions of elliptic PDEs with lognormal diffusion…

Numerical Analysis · Mathematics 2017-03-29 Oliver G. Ernst , Björn Sprungk , Lorenzo Tamellini

We investigate the quantum properties of a non-random Hamiltonian with a step-like singularity. It is shown that the eigenfunctions are multifractals and, in a certain range of parameters, the level statistics is described exactly by…

Disordered Systems and Neural Networks · Physics 2009-11-11 Antonio M. Garcia-Garcia , Jiao Wang

We establish a stability result for the Shannon-McMillan-Breiman theorem on the one-sided finite shift space. For any shift-invariant probability measure P and any data-dependent parsing whose number of blocks is sublinear in N almost…

Information Theory · Computer Science 2026-04-16 Raphael Grondin

The family of skew-symmetric distributions is a wide set of probability density functions obtained by combining in a suitable form a few components which are selectable quite freely provided some simple requirements are satisfied. Intense…

Probability · Mathematics 2010-12-22 Adelchi Azzalini , Giuliana Regoli

We provide a purely local computation of the (elliptic) twisted (by "transpose-inverse") character of the representation \pi=I(\1) of PGL(3) over a p-adic field induced from the trivial representation of the maximal parabolic subgroup. This…

Representation Theory · Mathematics 2007-11-29 Yuval Z. Flicker , Dmitrii Zinoviev

The shifted Schur measure introduced by Tracy and Widom is a measure on the set of all strict partitions, which is defined by Schur $Q$-functions. The main aim of this paper is to calculate the correlation function of this measure, which is…

Combinatorics · Mathematics 2007-05-23 Sho Matsumoto

We introduce a new basis of the non-commutative symmetric functions whose commutative images are Schur functions. Dually, we build a basis of the quasi-symmetric functions which expand positively in the fundamental quasi-symmetric functions…

Combinatorics · Mathematics 2016-11-08 Chris Berg , Nantel Bergeron , Franco Saliola , Luis Serrano , Mike Zabrocki

Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their reduced decompositions. This paper generalizes that result with a detailed study of permutations via their reduced decompositions and the notion of…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

Transmutation is a technique for extending classical probability distributions in order to give them more flexibility. In this paper, we are interested in cubic transmutations of the Pareto distribution. We establish a general formula that…

Methodology · Statistics 2025-03-14 Edoh Katchekpele , Issa Cherif Geraldo , Tchilabalo Abozou Kpanzou

In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem…

Combinatorics · Mathematics 2017-05-15 Yan Zhuang