Related papers: RSK-Complete Cycle Decompositions

We provide a unique decomposition of every 4-connected graph into parts that are either quasi-5-connected, cycles of triangle-torsos and 3-connected torsos on $\leq 5$ vertices, generalised double-wheels, or thickened $K_{4,m}$'s. The…

We study the structure of hypersurface orbital varieties of sl(N,C) (those that are hypersurfaces in the nilradical of some parabolic subalgebra) and how information about this structure is encoded in the standard Young tableau associated…

We find canonical decompositions for finitely presented groups which specialize to the classical JSJ-decomposition when restricted to the fundamental groups of Haken manifolds. The decompositions that we obtain are invariant under…

We classify static manifolds which admit more than one static decomposition whenever a condition on the curvature is fullfilled. For this, we take a standard static vector field and analyze its associated one parameter family of projections…

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…

Informed by our understanding of the tt-geometry of permutation modules, we investigate the proper definition of the `stable permutation category' of a finite group. Then we prove that this category decomposes over cyclic and generalized…

We investigate combinatorial aspects of exceptional sequences in the derived category of coherent sheaves on certain smooth and complete algebraic surfaces. We show that to any such sequence there is canonically associated a complete toric…

We construct a Zariski decomposition for cycle classes of arbitrary codimension. This decomposition is an analogue of well-known constructions for divisors. Examples illustrate how Zariski decompositions of cycle classes reflect the…

This paper initiates the study of shortening universal cycles (u-cycles) and universal words (u-words) for permutations either by using incomparable elements, or by using non-deterministic symbols. The latter approach is similar in nature…

The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of a linear permutation. Callan initiated the study of…

Let $(X_n)_{n \ge 0}$ be an irreducible, aperiodic, homogeneous Markov chain, with state space an ordered finite alphabet of size $m$. Using combinatorial constructions and weak invariance principles, we obtain the limiting shape of the…

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 use $K^*_n$ to denote the bidirected complete graph on $n$ vertices. A nomadic Hamiltonian decomposition of $K^*_n$ is a Hamiltonian decomposition, with the additional property that ``nomads'' walk along the Hamiltonian cycles (moving…

Let $\mathbb{F}_q$ be a finite field of odd characteristic. We study R\'edei functions that induce permutations over $\mathbb{P}^1(\mathbb{F}_q)$ whose cycle decomposition contains only cycles of length $1$ and $j$, for an integer $j\geq…

Consider the process of random transpositions on the complete graph. We use representation theory to give an exact, simple formula for the expected number of cycles of size k at time t, in terms of an incomplete Beta function. Using this we…

We provide an algorithmic framework for the computation of explicit representing matrices for all irreducible representations of a generalized symmetric group $\Grin_n$, i.e., a wreath product of cyclic group of order $r$ with the symmetric…

This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…

This note will give an enumeration of $n$-cycles in the symmetric group ${\mathcal S}_n$ by their degree (also known as their cyclic descent number) and studies similar counting problems for the conjugacy classes of $n$-cycles under the…

We extend the author's and CPTVV's correspondence between shifted symplectic and Poisson structures to establish a correspondence between exact shifted symplectic structures and non-degenerate shifted Poisson structures with formal…

We introduce an object called a decorated Young tableau which can equivalently be viewed as a continuous time trajectory of Young diagrams or as a non-intersecting line ensemble. By a natural extension of the Robinson-Schensted…