Related papers: Non-crossing linked partitions and multiplication …
We construct "stochastic mappings" between power law probability distributions (PD's) and Gaussian ones. To a given vector $N$, Gaussian distributed (respectively $Z$, exponentially distributed), one can associate a vector $X$, "power law…
Inspired by the intimate relationship between Voiculescu's noncommutative probability theory (of type A) and large-N matrix models in physics, we look for physical models related to noncommutative probability theory of type B. These turn…
We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In…
Exceptional sequences are certain ordered sequences of quiver representations. We use noncrossing edge-labeled trees in a disk with boundary vertices (expanding on T. Araya's work) to classify exceptional sequences of representations of Q,…
We investigate the analytic structure of scattering amplitudes in theories in which Lorentz invariance is spontaneously broken. We do so by computing and studying the S-matrix for a simple example: a superfluid described by a complex scalar…
We initiate the S-matrix bootstrap analysis of theories with non-invertible symmetries in (1+1) dimensions. Our previous work showed that crossing symmetry of S-matrices in such theories is modified, with modification characterized by the…
This paper introduces a new and simple statistic on noncrossing partitions that expresses each coordinate of the toric $h$-vector of a cubical complex, written in the basis of the Adin $h$-vector entries, as the total weight of all…
We develop the connection of Berg partitions with special substitution tilings of two tiles. We obtain a new proof that the number of Berg partitions with a fixed connectivity matrix is equal to half of the sum of its entries, \cite{S-W}.…
In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…
Let $G$ be a finite tree with root $r$ and associate to the internal vertices of $G$ a collection of transition probabilities for a simple nondegenerate Markov chain. Embedd $G$ into a graph $G^\prime$ constructed by gluing finite linear…
Reflection groups, geometry of the discriminant and noncrossing partitions. When W is a well-generated complex reflection group, the noncrossing partition lattice NCP_W of type W is a very rich combinatorial object, extending the notion of…
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…
It is a well-known fact that an exchangeable sequence has empirical distributions that form a reverse-martingale. This paper is devoted to proof of the converse statement. As a byproduct of the proof for the binary case, we introduce and…
In this article we tackle the combinatorics of coloured hard-dimer objects. This is achieved by identifying coloured hard-dimer configurations with a certain class of rooted trees that allow for an algebraic treatment in terms of…
In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…
The correspondence between the braid group on a solid torus of arbitrary genus and the algebra of Yang-Baxter and reflection equation operators is shown. A representation of this braid group in terms of $R$-matrices is given. The…
We derive a new representation of the Brownian disk in terms of a forest of labeled trees, where labels correspond to distances from a subset of the boundary. We then use this representation to obtain a spatial Markov property showing that…
In the design and analysis of political redistricting maps, it is often useful to be able to sample from the space of all partitions of the graph of census blocks into connected subgraphs of equal population. There are influential Markov…
We present a structure theorem for the multiple non-cyclotomic irreducible factors appearing in the family of all univariate polynomials with a given set of coefficients and varying exponents. Roughly speaking, this result shows that the…
We give a closed formula for the number of partitions $\lambda$ of $n$ such that the corresponding irreducible representation $V_\lambda$ of $S_n$ has non-trivial determinant. We determine how many of these partitions are self-conjugate and…