Related papers: Combinatorics of Tableau Inversions
An increasing tableau is a semistandard tableau with strictly increasing rows and columns. It is well known that the Catalan numbers enumerate both rectangular standard Young tableaux of two rows and also Dyck paths. We generalize this to a…
Tabular data is a fundamental form of data structure. The evolution of table analysis tools reflects humanity's continuous progress in data acquisition, management, and processing. The dynamic changes in table columns arise from…
A number $s$ is the sum of the entries of the inverse of an $n \times n, (n \geq 3)$ upper triangular matrix with entries from the set $\{0, 1\}$ if and only if $s$ is an integer lying between $2-F_{n-1}$ and $2+F_{n-1}$, where $F_n$ is the…
For coherent families of crystals of affine Lie algebras of type B^{(1)}_n, D^{(1)}_n, A^{(2)}_{2n} and D^{(2)}_{n+1} we describe the combinatorial R matrix using column insertion algorithms for B,C,D Young tableaux.
We consider an integral series f(X,t) which depends on the choice of a set X of labelled planar rooted trees. We prove that its inverse for composition is of the form f(Z,t) for another set Z of trees, deduced from X. The proof is…
In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…
We determine all pairs of positive integers $(a,b)$ such that $a+b$ and $a \times b$ have the same decimal digits in reverse order: \[ (2,2), (9,9), (3,24), (2,47), (2,497), (2,4997), (2,49997), \ldots \] We use deterministic finite…
We provide two shifted analogues of the tableau switching process due to Benkart, Sottile, and Stroomer, the shifted tableau switching process and the modified shifted tableau switching process. They are performed by applying a sequence of…
The matrix inversion is an interesting topic in algebra mathematics. However, to determine an inverse matrix from a given matrix is required many computation tools and time resource if the size of matrix is huge. In this paper, we have…
Obtaining the inverse of a large symmetric positive definite matrix $\mathcal{A}\in\mathbb{R}^{p\times p}$ is a continual challenge across many mathematical disciplines. The computational complexity associated with direct methods can be…
We introduce the notion of a combinatorial inverse system in non-commutative variables. We present two important examples, some conjectures and results. These conjectures and results were suggested and supported by computer investigations.
Permutation tableaux were introduced by Steingr\'{\i}msson and Williams. Corteel and Kim defined the sign of a permutation tableau in terms of the number of unrestricted columns. The sign-imbalance of permutation tableaux of length $n$ is…
Tableau sequences of bounded height have been central to the analysis of k-noncrossing set partitions and matchings. We show here that familes of sequences that end with a row shape are particularly compelling and lead to some interesting…
We give a formula for the inverse matrix to an infinite matrix with possibly noncommutative entries, generalizing the Newton interpolation formula and the Taylor formula.
This paper consists of a few results, discovered and proved during the 2012-2013 research group at Eastern Oregon University. Inertia tables are a visual representation of the possible inertias of a given graph. The inertia of a graph…
The RSK correspondence is a bijection between permutations and pairs of standard Young tableaux with identical shape, where the tableaux are commonly denoted $P$ (insertion) and $Q$ (recording). It has been an open problem to demonstrate $$…
We introduce two generalizations of bracket vectors from binary trees to permutrees. These new vectors help describe algebraic and geometric properties of the rotation lattice of permutrees defined by Pilaud and Pons. The first…
We consider a generalization of the Springer resolution studied in earlier work of the authors, called the extended Springer resolution. In type $A$, this map plays a role in Lusztig's generalized Springer correspondence comparable to that…
We discuss some applications of fusion rules and intertwining operators in the representation theory of cyclic orbifolds of the triplet vertex operator algebra. We prove that the classification of irreducible modules for the orbifold vertex…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…