Combinatorics of geometrically distributed random variables: Inversions and a parameter of Knuth

Combinatorics of geometrically distributed random variables: Value and position of the r-th left-to-right maximum

For words of length n, generated by independent geometric random variables, we consider the average value and the average position of the r-th left-to-right maximum, for fixed r and large n.

Combinatorics of geometrically distributed random variables: Value and position of large left-to-right maxima

For words of length n, generated by independent geometric random variables, we consider the average value and the average position of the r-th left-to-right maximum counted from the right, for fixed r and n->oo. This complements previous research where the analogous questions were considered for the r-th left-to-right maximum counted from the left.

Box-ball systems and Robinson-Schensted-Knuth correspondence

The box-ball system is studied from the viewpoint of combinatorics of words and tableaux. Each state of the box-ball system can be transformed into a pair of tableaux $(P,Q)$ by the Robinson-Schensted-Knuth correspondence. In the language of tableaux, the $P$-symbol gives rise to a conserved quantity of the box-ball system, and the $Q$-symbol evolves independently of the $P$-symbol. The time evolution of the $Q$-symbol is described explicitly in terms of the box-labels.

通过 $A$ 型箭图表示的组合学对 RSK 的扩展推广

An extended generalization of RSK via the combinatorics of type $A$ quiver representations

本文通过揭示 $A$ 型箭图表示的组合学性质，构造了一族由对称群中 Coxeter 元参数化的双射，将整数划分 $λ$ 的任意填充映射到反向平面划分，并在特定参数选择下恢复了经典的 Robinson--Schensted--Knuth 对应。

Combinatorics of geometrically distributed random variables: New q-tangent and q-secant numbers

Up-down permutations are counted by tangent resp. secant numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all coincide with the classical version. In this way, we get some new q-tangent and q-secant functions. Some of them also have nice continued fraction expansions; in one particular case, we could not find a proof for it. Divisibility results a la Andrews/Foata/Gessel are also discussed.

Combinatorics of patience sorting piles

Despite having been introduced in 1962 by C.L. Mallows, the combinatorial algorithm Patience Sorting is only now beginning to receive significant attention due to such recent deep results as the Baik-Deift-Johansson Theorem that connect it to fields including Probabilistic Combinatorics and Random Matrix Theory. The aim of this work is to develop some of the more basic combinatorics of the Patience Sorting Algorithm. In particular, we exploit the similarities between Patience Sorting and the Schensted Insertion Algorithm in order to do things that include defining an analog of the Knuth relati…