English
Related papers

Related papers: Permutons from Demazure Products

200 papers

We introduce the shuffle of deformed permutahedra (a.k.a. generalized permutahedra), a simple associative operation obtained as the Cartesian product followed by the Minkowski sum with the graphical zonotope of a complete bipartite graph.…

Combinatorics · Mathematics 2025-06-30 Frédéric Chapoton , Vincent Pilaud

We revisit the transfer-matrix approach to directed polymers in random media and show that a single ensemble of random transfer-matrix products provides a unified realization of the canonical one-point fluctuation laws in $(1+1)$…

Soft Condensed Matter · Physics 2026-03-17 Sen Mu , Abbas Ali Saberi , Roderich Moessner , Mehran Kardar

The main aim of the present set of notes is to give new, short and essentially self-contained proofs of some classical, as well as more recent, results about random walks on groups. For instance, we shall see that the drift characterization…

Dynamical Systems · Mathematics 2014-07-08 Michael Björklund

In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in [Knuth] in connection to sorting algorithms. A natural generalization of this set leads us…

Combinatorics · Mathematics 2007-10-29 Sergi Elizalde

We characterise the embedding of the spatial product of two Arveson systems into their tensor product using the random set technique. An important implication is that the spatial tensor product does not depend on the choice of the reference…

Operator Algebras · Mathematics 2014-09-10 Volkmar Liebscher

We consider the problem of structured tensor denoising in the presence of unknown permutations. Such data problems arise commonly in recommendation system, neuroimaging, community detection, and multiway comparison applications. Here, we…

Statistics Theory · Mathematics 2025-01-14 Chanwoo Lee , Miaoyan Wang

In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many…

Discrete Mathematics · Computer Science 2021-11-05 Elizabeth Hartung , Hung Phuc Hoang , Torsten Mütze , Aaron Williams

We study the isoperimetric profiles of certain families of finitely generated groups defined via marked Schreier graphs and permutation wreath products. The groups we study are among the "simplest" examples within a much larger class of…

Probability · Mathematics 2015-10-30 Laurent Saloff-Coste , Tianyi Zheng

Knutson and Zinn-Justin recently found a puzzle rule for the expansion of the product $\mathfrak{G}_{u}(x,t)\cdot \mathfrak{G}_{v}(x,t)$ of two double Grothendieck polynomials indexed by permutations with separated descents. We establish…

Combinatorics · Mathematics 2025-10-15 Neil J. Y. Fan , Peter L. Guo , Rui Xiong

Polynomial ensembles are a sub-class of probability measures within determinantal point processes. Examples include products of independent random matrices, with applications to Lyapunov exponents, and random matrices with an external…

Mathematical Physics · Physics 2020-11-11 Gernot Akemann , Eugene Strahov , Tim R. Würfel

We study probability measures on partitions based on symmetric Grothendieck polynomials. These deformations of Schur polynomials introduced in the K-theory of Grassmannians share many common properties. Our Grothendieck measures are analogs…

Probability · Mathematics 2024-03-26 Svetlana Gavrilova , Leonid Petrov

We study the local asymptotics at the edge for particle systems arising from: (i) eigenvalues of sums of unitarily invariant random Hermitian matrices and (ii) signatures corresponding to decompositions of tensor products of representations…

Probability · Mathematics 2023-02-22 Andrew Ahn

We introduce and study a new random permutation model that generalizes the $k$-card minimum model defined by Travers and the Mallows model. We calculate the permuton limit of such a sequence of random permutations. As a corollary, we deduce…

Probability · Mathematics 2025-02-26 Joanna Jasińska , Balázs Ráth

Let $A = \Bbbk Q / I$ be the path algebra of any finite quiver $Q$ modulo any two-sided ideal $I$ of relations and let $R$ be any reduction system satisfying the diamond condition for $I$. We introduce an intrinsic notion of deformation of…

Quantum Algebra · Mathematics 2023-04-18 Severin Barmeier , Zhengfang Wang

We prove one-to-one correspondences between certain decreasing Loewner chains in the upper half-plane, a special class of real-valued Markov processes, and quantum stochastic processes with monotonically independent additive increments.…

Operator Algebras · Mathematics 2021-01-06 Uwe Franz , Takahiro Hasebe , Sebastian Schleißinger

The blow-up construction by L. G. Kov\'acs has been a very useful tool to study embeddings of finite primitive permutation groups into wreath products in product action. In the present paper we extend the concept of a blow-up to finite…

Group Theory · Mathematics 2007-05-23 Robert W. Baddeley , Cheryl E. Praeger , Csaba Schneider

By a 2-group we mean a groupoid equipped with a weakened group structure. It is called split when it is equivalent to the semidirect product of a discrete 2-group and a one-object 2-group. By a permutation 2-group we mean the 2-group…

Category Theory · Mathematics 2014-02-05 Josep Elgueta

We review product form blocking measures in the general framework of nearest neighbor asymmetric one dimensional misanthrope processes. This class includes exclusion, zero range, bricklayers, and many other models. We characterize the cases…

Probability · Mathematics 2018-02-20 Márton Balázs , Ross Bowen

The goal of this paper is to analyse the asymptotic behavior of the cycle process and the total number of cycles of weighted and generalized weighted random permutations which are relevant models in physics and which extend the Ewens…

Probability · Mathematics 2011-05-13 Ashkan Nikeghbali , Dirk Zeindler

One method to generate random permutations involves using Gaussian elimination with partial pivoting (GEPP) on a random matrix $A$ and storing the permutation matrix factor $P$ from the resulting GEPP factorization $PA=LU$. We are…

Probability · Mathematics 2024-11-19 John Peca-Medlin , Chenyang Zhong
‹ Prev 1 8 9 10 Next ›