Related papers: The Descent Set and Connectivity Set of a Permutat…
Recently, Kitaev and Remmel [Classifying descents according to parity, Annals of Combinatorics, to appear 2007] refined the well-known permutation statistic ``descent'' by fixing parity of one of the descent's numbers. Results in that paper…
Higher-rank versions of Wold decomposition are shown to hold for doubly commuting isometric representations of product systems of C*-correspondences over N^k, generalising the classical result for a doubly commuting pair of isometries due…
In this article pattern statistics of typical cubical cut and project sets are studied. We give estimates for the rate of convergence of appearances of patches to their asymptotic frequencies. We also give bounds for repetitivity and…
The notion of a descent polynomial, a function in enumerative combinatorics that counts permutations with specific properties, enjoys a revived recent research interest due to its connection with other important notions in combinatorics,…
A neutral fixed point of a real iteration map $u$ becomes a super attracting fixed point using a suitable double newtonisation. The map $u$ is so transformed into a map $w$ which is here called the standard accelerator of $u$. The map $w$…
We consider the (2, 0) supersymmetric theory of tensor multiplets and self-dual strings in six space-time dimensions. Space-time diffeomorphisms that leave the string world-sheet invariant appear as gauge transformations on the normal…
We review work on `decomposition,' a property of two-dimensional theories with 1-form symmetries and, more generally, d-dimensional theories with (d-1)-form symmetries. Decomposition is the observation that such quantum field theories are…
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…
We will exhibit several instances of the cyclic sieving phenomenon involving statistics and involutions on the following combinatorial families of objects: permutations, set partitions, perfect matchings, D-permutations (and its…
Discriminating data classes emanating from sensors is an important problem with many applications in science and technology. We describe a new transform for pattern identification that interprets patterns as probability density functions,…
We consider a generalization of the Ewens measure for the symmetric group, calculating moments of the characteristic polynomial and similar multiplicative statistics. In addition, we study the asymptotic behavior of linear statistics (such…
Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…
A four-variable distribution on permutations is derived, with two dual combinatorial interpretations. The first one includes the number of fixed points "fix", the second the so-called "pix" statistic. This shows that the duality between…
Let G be a connected reductive group. We define a map from the set of unipotent classes in G to the set of conjugacy classes in the Weyl group (assuming that the characteristic is not bad). This map is a one sided inverse of a map in the…
We consider statistics on permutations chosen uniformly at random from fixed parabolic double cosets of the symmetric group. We show that the distribution of fixed points is asymptotically Poisson and establish central limit theorems for…
The duality symmetries of WZW and coset models are discussed. The exact underlying symmetry responsible for semiclassical duality is identified with the symmetry under affine Weyl transformations. This identification unifies the treatement…
In this paper we look at polynomials arising from statistics on the classes of involutions, $I_n$, and involutions with no fixed points, $J_n$, in the symmetric group. Our results are motivated by F. Brenti's conjecture which states that…
The Robinson-Schensted correspondence can be viewed as a map from permutations to partitions. In this work, we study the number of inversions of permutations corresponding to a fixed partition $\lambda$ under this map. Hohlweg characterized…
We study the cycle structure of words in several random permutations. We assume that the permutations are independent and that their distribution is conjugation invariant, with a good control on their short cycles. If, after successive…
We consider distributed detection problems over adaptive networks, where dispersed agents learn continually from streaming data by means of local interactions. The simultaneous requirements of adaptation and cooperation are achieved by…