English
Related papers

Related papers: Cyclotomic shuffles

200 papers

We evaluate the probabilities of various events under the uniform distribution on the set of 312-avoiding permutations of 1,...,N. We derive exact formulas for the probability that the ith element of a random permutation is a specific value…

Probability · Mathematics 2014-11-11 Neal Madras , Lerna Pehlivan

We develop several applications of the fact that the Yokonuma--Hecke algebra of the general linear group GL is isomorphic to a direct sum of matrix algebras associated to Iwahori--Hecke algebras of type A. This includes a description of the…

Representation Theory · Mathematics 2016-05-16 N. Jacon , L. Poulain d'Andecy

Aldous' spectral gap conjecture, proven by Caputo, Liggett and Richthammer, states the following: for any set of transpositions in the symmetric group $\mathrm{Sym}(n)$, the spectral gap of the corresponding random walk on the group -- an…

Probability · Mathematics 2026-03-03 Gil Alon , Doron Puder

In random-matrix ensembles that interpolate between the three basic ensembles (orthogonal, unitary, and symplectic), there exist correlations between elements of the same eigenvector and between different eigenvectors. We study such…

Mesoscale and Nanoscale Physics · Physics 2009-11-07 Shaffique Adam , Piet W. Brouwer , James P. Sethna , Xavier Waintal

We study the distribution of cycle lengths in models of nonuniform random permutations with cycle weights. We identify several regimes. Depending on the weights, the length of typical cycles grows like the total number $n$ of elements, or a…

Probability · Mathematics 2011-01-06 Volker Betz , Daniel Ueltschi , Yvan Velenik

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…

Combinatorics · Mathematics 2009-11-19 Michael Lugo

We establish a Murnaghan--Nakayama rule for the irreducible characters of the cyclotomic Hecke algebra $\mathscr H_{m,n}(q,u)$ on Shoji's standard elements. Combined with Shoji's determinacy result, our formula provides a direct…

Representation Theory · Mathematics 2026-03-12 Naihuan Jing , Ning Liu

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

Combinatorics · Mathematics 2007-05-23 Robert Guralnick , David Perkinson

A particle moves among the vertices of an $(m+1)$-gon which are labeled clockwise as $0,1,...,m$. The particle starts at 0 and thereafter at each step it moves to the adjacent vertex, going clockwise with a known probability $p$, or…

Probability · Mathematics 2007-06-13 Jyotirmoy Sarkar

We prove the BMM symmetrising trace conjecture for the exceptional complex reflection groups $G_4,\,G_5,\,G_6,\,G_7,\,G_8$ using a combination of algorithms programmed in different languages (C++, SAGE, GAP3, Mathematica). Our proof depends…

Representation Theory · Mathematics 2019-04-04 Christina Boura , Eirini Chavli , Maria Chlouveraki , Konstantinos Karvounis

Let {D_x} be a family of unbounded self-adjoint Fredholm operators representing an element of K^1(M). Consider the first two components of the Chern character of the family. It is known that these correspond to the spectral flow of the…

K-Theory and Homology · Mathematics 2012-02-08 Ronald G. Douglas , Jerome Kaminker

We determine the eigenvalues with multiplicity of each element of an alternating group in any irreducible representation. This is equivalent to determining the decomposition of cyclic representations of alternating groups into irreducibles.…

Representation Theory · Mathematics 2024-09-10 Amrutha P , Amritanshu Prasad , Velmurugan S

We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we…

Probability · Mathematics 2007-05-23 Jianjun Tian , Xiao-Song Lin

We extend results of Brewster and Graves for switching $m$-edge coloured graphs with respect to a cyclic group to switching $(m, n)$-mixed graphs with respect to an Abelian group. In particular, we establish the existence of a $(m,…

Combinatorics · Mathematics 2021-10-05 E. Leclerc , G. MacGillivray , J. M. Warren

In studying the end-to-end distribution function $G(r,N)$ of a worm like chain by using the propagator method we have established that the combinatorial problem of counting the paths contributing to $G(r,N)$ can be mapped onto the problem…

Soft Condensed Matter · Physics 2009-11-07 Semjon Stepanow , Gunter M. Schuetz

Consider the tesselation of the hyperbolic plane by m-gons, l per vertex. In its 1-skeleton, we compute the growth series of vertices, geodesics, tuples of geodesics with common extremities. We also introduce and enumerate "holly trees", a…

Group Theory · Mathematics 2009-11-27 Laurent Bartholdi , Tullio G. Ceccherini-Silberstein

In this work, we examine spectral properties of Markov transition operators corresponding to Gaussian perturbations of discrete time dynamical systems on the circle. We develop a method for calculating asymptotic expressions for eigenvalues…

Probability · Mathematics 2009-08-10 John Mayberry

The endomorphism algebras of the permutation modules for transitive permutation groups, known as Hecke algebras, are fundamental objects in representation theory. While group algebras are known to be symmetric over any field, it is natural…

Representation Theory · Mathematics 2026-02-04 Jiawei He , Xiaogang Li

We consider a class of random banded Hessenberg matrices with independent entries having identical distributions along diagonals. The distributions may be different for entries belonging to different diagonals. For a sequence of $n\times n$…

Probability · Mathematics 2023-08-30 Abey López-García , Vasiliy A. Prokhorov

Let G be a free product of a finite family of finite groups, with the set of generators being formed by the union of the finite groups. We consider a transient nearest-neighbour random walk on G. We give a new proof of the fact that the…

Probability · Mathematics 2007-05-23 Jean Mairesse , Frédéric Mathéus
‹ Prev 1 8 9 10 Next ›