Related papers: On the Young-Fibonacci insertion algorithm
We present new combinatorial and probabilistic identities relating three random processes: the oriented swap process on $n$ particles, the corner growth process, and the last passage percolation model. We prove one of the probabilistic…
The Lie algebra of Feynman graphs gives rise to two natural representations, acting as derivations on the commutative Hopf algebra of Feynman graphs, by creating or eliminating subgraphs. Insertions and eliminations do not commute, but…
We study the monoid algebra ${}_{n}\mathcal{T}_{m}$ of semistandard Young tableaux, which coincides with the Gelfand--Tsetlin semigroup ring $\mathcal{GT}_{n}$ when $m = n$. Among others, we show that this algebra is commutative,…
An important result in quasi-category theory due to Lurie is the that cocartesian fibrations are exponentiable, in the sense that pullback along a cocartesian fibration admits a right Quillen right adjoint that moreover preserves cartesian…
A homotopy commutative algebra, or $C_{\infty}$-algebra, is defined via the Tornike Kadeishvili homotopy transfer theorem on the vector space generated by the set of Young tableaux with self-conjugated Young diagrams. We prove that this…
The purpose of this paper is to forge a direct link between the hit problem for the action of the Steenrod algebra A on the polynomial algebra P(n)=F_2[x_1,...,x_n], over the field F_2 of two elements, and semistandard Young tableaux as…
In O'Connell-Pei(2013) a q-weighted version of the Robinson-Schensted algorithm was introduced. In this paper we show that this algorithm has a symmetry property analogous to the well known symmetry property of the normal Robinson-Schensted…
We study restricted chain-order polytopes associated to Young diagrams using combinatorial mutations. These polytopes are obtained by intersecting chain-order polytopes with certain hyperplanes. The family of chain-order polytopes…
We construct an explicit minimal model for an algebra over the cobar-construction of a differential graded operad. The structure maps of this minimal model are expressed in terms of sums over decorated trees. We introduce the appropriate…
We study the Chow classes of arbitrary matroids in the Grassmannian. We develop a new combinatorial approach for computing them, by first focusing on snake matroids and then extending our results via valuativity to any matroid. Our main…
We conjecture a strong property for the up and down maps U and D in an r-differential poset: DU+tI and UD+tI have Smith normal forms over Z[t]. In particular, this would determine the integral structure of the maps U, D, UD, DU, including…
We present an approach for the description of fluctuations that are due to finite system size induced correlations in the Kuramoto model of coupled oscillators. We construct a hierarchy for the moments of the density of oscillators that is…
This thesis finds its place in the interplay between algebraic and geometric combinatorics. We focus on studying two different families of lattices in relation to the weak order: the permutree lattices and the $s$-weak order. The first part…
We introduce and study some affine Hecke algebras of type ADE, generalising the affine Hecke algebras of GL. We construct irreducible calibrated representations and describe the calibrated spectrum. This is done in terms of new families of…
We consider the hierarchy of higher-order Riccati equations and establish their connection with the Gambier equation. Moreover we investigate the relation of equations of the Gambier family to other nonlinear differential systems. In…
We explain how genomic tableaux [Pechenik-Yong '15] are a semistandard complement to increasing tableaux [Thomas-Yong '09]. From this perspective, one inherits genomic versions of jeu de taquin, Knuth equivalence, infusion and Bender-Knuth…
We introduce a new diagrammatic approach to perturbative quantum field theory, which we call flow-oriented perturbation theory (FOPT). Within it, Feynman graphs are replaced by strongly connected directed graphs (digraphs). FOPT is a…
By considering the specialisation $s_{\lambda}(1,q,q^2,...,q^{n-1})$ of the Schur function, Stanley was able to describe a formula for the number of semistandard Young tableaux of shape $\lambda$ in terms of two properties of the boxes in…
The Novelli-Pak-Stoyanovskii algorithm is a sorting algorithm for Young tableaux of a fixed shape that was originally devised to give a bijective proof of the hook-length formula. We obtain new asymptotic results on the average case and…
The recollement approach to the representation theory of sequences of algebras is extended to pass basis information directly through the globalisation functor. The method is hence adapted to treat sequences that are not necessarily towers…