Related papers: Inversions of Semistandard Young Tableaux
The classical hook length formula counts the number of standard tableaux of straight shapes. In 1996, Okounkov and Olshanski found a positive formula for the number of standard Young tableaux of a skew shape. We prove various properties of…
The Sherman-Woodbury-Morrison (SWM) formula gives an explicit formula for the inverse perturbation of a matrix in terms of the inverse of the original matrix and the perturbation. This formula is useful for numerical applications. We have…
A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general…
The search for inversion asymmetric topological insulators (IATIs) persists as an effect for realizing new topological phenomena. However, so for only a few IATIs have been discovered and there is no IATI exhibiting a large band gap…
An inversion sequence of length $n$ is an integer sequence $(a_1, \ldots, a_n)$ such that $0 \le a_i < i$ for all $i$. The study of pattern-avoiding inversion sequences was initiated in 2015 by Mansour and Shattuck and in 2016 by Corteel,…
Given a sequence $s=(s_1,s_2,\ldots)$ of positive integers, the inversion sequences with respect to $s$, or $s$-inversion sequences, were introduced by Savage and Schuster in their study of lecture hall polytopes. A sequence…
In our joint paper with W. Fulton (math.AG/9804041) we prove a formula for the cohomology class of a quiver variety. This formula involves a new class of generalized Littlewood-Richardson coefficients, all of which surprisingly seem to be…
An invertible matrix is called a Perron similarity if one of its columns and the corresponding row of its inverse are both nonnegative or both nonpositive. Such matrices are of relevance and import in the study of the nonnegative inverse…
A novel numerical method for solving inverse scattering problem with fixed-energy data is proposed. The method contains a new important concept: the stability index of the inversion problem. This is a number, computed from the data, which…
Let $(P,\preceq)$ be a lattice and $f$ a complex-valued function on $P$. We define meet and join matrices on two arbitrary subsets $X$ and $Y$ of $P$ by $(X,Y)_f=(f(x_i\wedge y_j))$ and $[X,Y]_f=(f(x_i\vee x_j))$ respectively. Here we…
Normalizing flows attempt to model an arbitrary probability distribution through a set of invertible mappings. These transformations are required to achieve a tractable Jacobian determinant that can be used in high-dimensional scenarios.…
The aim of this article is to investigate the issues of multiplicative inverses and composition in the set of formal Laurent series. We show the lack of general uniqueness of inverses of formal Laurent series; necessary and sufficient…
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.…
A direct solver is introduced for solving overdetermined linear systems involving nonuniform discrete Fourier transform matrices. Such matrices can be transformed into a Cauchy-like form that has hierarchical low rank structure. The rank…
The study of permutation and partition statistics is a classical topic in enumerative combinatorics. The major index statistic on permutations was introduced a century ago by Percy MacMahon in his seminal works. In this extended abstract,…
Quasi-Yamanouchi tableaux are a subset of semistandard Young tableaux and refine standard Young tableaux. They are closely tied to the descent set of standard Young tableaux and were introduced by Assaf and Searles to tighten Gessel's…
For integers g >= 3, k >= 2, call a number N a (g,k)-reverse multiple if the reversal of N in base g is equal to k times N. The numbers 1089 and 2178 are the two smallest (10,k)-reverse multiples, their reversals being 9801 = 9x1089 and…
Intertwiner is a homomorphism between two existing dynamical R matrices, first introduced by Baxter in eight vertex-SOS correspondence, we develop certain equivalence relations among R matrices using intertwiners. Twist is a homomorphism…
We examine a few families of semistandard Young tableaux, for which we observe the cyclic sieving phenomenon under promotion. The first family we consider consists of stretched hook shapes, where we use the cocharge generating polynomial as…
A cyclic descent function on standard Young tableaux of size $n$ is a function that restricts to the usual descent function when $n$ is omitted, such that the number of standard Young tableaux of given shape with cyclic descent set…