Related papers: On Expected Factors in Reduced Decompositions in T…

We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…

In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…

Given a finite irreducible Coxeter group $W$, a positive integer $d$, and types $T_1,T_2,...,T_d$ (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions $c=\si_1\si_2 cdots\si_d$ of a Coxeter…

Let $(W,R)$ be an arbitrary Coxeter system. We determine the number of elements of $W$ that have a unique reduced expression.

We present a simple formula for the expected number of inversions in a permutation of size $n$ obtained by applying $t$ random (not necessarily adjacent) transpositions to the identity permutation. More general, for any finite irreducible…

We investigate decomposable combinatorial labeled structures more fully, focusing on the exp-log class of type a=1 or 1/2. For instance, the modal length of the second longest cycle in a random n-permutation is (0.2350...)n, whereas the…

Stanley's formula for the number of reduced expressions of a permutation regarded as a Coxeter group element raises the question of how to enumerate the reduced expressions of an arbitrary Coxeter group element. We provide a framework for…

Using the standard Coxeter presentation for the symmetric group $S_n$, two reduced expressions for the same group element are said to be commutation equivalent if we can obtain one expression from the other by applying a finite sequence of…

An element of a Coxeter group $W$ is called fully commutative if any two of its reduced decompositions can be related by a series of transpositions of adjacent commuting generators. In the preprint "Fully commutative elements in finite and…

The excess of an element $w$ of a finite Coxeter group $W$ is the minimal value of $l(x) + l(y) - l(w)$, where $x$, $y$ are elements of $W$ such that $x^2 = y^2 = 1$ and $w = xy$. Every element of a finite Coxeter group is either an…

In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we…

Irrespective of whether n is prime, prime power with exponent >1, or composite, the group U_n of units of Z_n can sometimes be obtained as the direct product of cyclic groups generated by x, x+k and x+2k, for x, k in Z_n. Indeed, for many…

The construction elements of the factorised form of the Yang-Baxter R operator acting on generic representations of q-deformed sl(n+1) are studied. We rely on the iterative construction of such representations by the restricted class of…

In an experiment designed to search for and study very rare two-body decay modes of the K-long, we have observed four examples of the decay K-long -> e+ e-, where the expected background is 0.17+-0.10 events. This observation translates…

We introduce skein theoretic techniques to compute the Yang-Baxter (YB) homology and cohomology groups of the R-matrix corresponding to the Jones polynomial. More specifically, we show that the YB operator $R$ for Jones, normalized for…

We calculate form factors relevant for rare B decays using moving-NRQCD for the b quark and the AsqTad action for the light quarks. Moving NRQCD allows us to work directly with the physical b quark mass and go to higher recoil momentum…

We search for the factorization-suppressed decays B -> chi_c0 K(*) and B -> chi_c2 K(*), with chi_c0 and chi_c2 decaying into J/psi gamma using a sample of 124 10^6 BBbar events collected with the BABAR detector at the PEP-II storage ring…

In this paper, we give the general forms of the minimal $L$ matrix (the elements of the $L$-matrix are $c$ numbers) associated with the Boltzmann weights of the $A_{n-1}^1$ interaction-round-a-face (IRF) model and the minimal representation…

In any Coxeter group, the conjugates of elements in its Coxeter generating set are called reflections and the reflection length of an element is its length with respect to this expanded generating set. In this article we give a simple…

We show that for the simple random walk on a Coxeter group generated by the Coxeter generators and identity, the likelihoods of being at any pair of states respect the weak Bruhat order. That is, after any number of steps, the most likely…