Related papers: A symmetry theorem on a modified jeu de taquin
We define mosaics, which are naturally in bijection with Knutson-Tao puzzles. We define an operation on mosaics, which shows they are also in bijection with Littlewood-Richardson skew-tableaux. Another consequence of this construction is…
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…
In 2010, Turaev introduced knotoids as a variation on knots that replaces the embedding of a circle with the embedding of a closed interval with two endpoints which here we call poles. We define generalized knotoids to allow arbitrarily…
We propose a strengthening of the conclusion in Tur\'an's (3,4)-conjecture in terms of algebraic shifting, and show that its analogue for graphs does hold. In another direction, we generalize the Mantel-Tur\'an theorem by weakening its…
This is the first of a series of papers about \emph{quantization} in the context of \emph{derived algebraic geometry}. In this first part, we introduce the notion of \emph{$n$-shifted symplectic structures}, a generalization of the notion…
If one attaches shifted copies of a skew tableau to the right of itself and rectifies, at a certain point the copies no longer experience vertical slides, a phenomenon called tableau stabilization. While tableau stabilization was originally…
We present some new Stokes' type theorems on complete non-compact manifolds that extend, in different directions, previous work by Gaffney and Karp and also the so called Kelvin-Nevanlinna-Royden criterion for (p-)parabolicity. Applications…
Our main result is a limit shape theorem for the two-dimensional surface defined by a uniform random n-by-n square Young tableau. The analysis leads to a calculus of variations minimization problem that resembles the minimization problems…
In this paper, we first study the shape algebra and the reduced shape algebra for the Lie superalgebra $\mathfrak{sl}(m,n)$. We define the quasistandard tableaux, their collection is the diamond cone for $\mathfrak{sl}(m,n)$, which is a…
Given two vectors $u$ and $v$, their outer sum is given by the matrix $A$ with entries $A_{ij} = u_{i} + v_{j}$. If the entries of $u$ and $v$ are increasing and sufficiently generic, the total ordering of the entries of the matrix is a…
Building on prior work that established Matrix Quasi-tree Theorems for special embedded graphs, in this paper, we develop a comprehensive theory applicable to all embedded graphs. We introduce symbolic skew-adjacency matrices and reduction…
Standard set-valued Young tableaux are a generalization of standard Young tableaux in which cells may contain more than one integer, with the added conditions that every integer at position $(i,j)$ must be smaller than every integer at…
The (generalized & expanded) Sierpinski graph, S(n,m), and the Hamming graph have the same set of vertices (n-tuples from the set {0,1,...,m-1}. The edges of both are (unordered) pairs of vertices. Each set of edges is defined by a…
In 1991, Yannakakis (J. Comput. System Sci., 1991) proved that no symmetric extended formulation for the matching polytope of the complete graph K_n with n nodes has a number of variables and constraints that is bounded subexponentially in…
Refined canonical stable Grothendieck polynomials were introduced by Hwang, Jang, Kim, Song, and Song. There exist two combinatorial models for these polynomials: one using hook-valued tableaux and the other using pairs of a semistandard…
Quasi-Yamanouchi tableaux connect the two most studied types of tableaux. They are a subset of semistandard Young tableaux that are also a refinement on standard Young tableaux, and they can be used to improve the fundamental quasisymmetric…
We consider a game in which a blindfolded player attempts to set $n$ counters lying on the vertices of a rotating regular $n$-gon table simultaneously to $0$. When the counters count$\pmod{m}$ we simplify the argument of Bar Yehuda, Etzion,…
We generalize the following simple geometric fact: the only centrally symmetric convex curve of constant width is a circle. Billiard interpretation of the condition of constant width reads: a planar curve has constant width, if and only if,…
This article reviews the development of Legendrian graph theory in the standard contact 3-sphere ($S^3, \xi_{std}$). We provide a generalized criterion under which the total Thurston-Bennequin invariant of a Legendrian graph (sum of tb of…
A symmetry of $(t,q)$-Eulerian numbers of type $B$ is combinatorially proved by defining an involution preserving many important statistics on the set of permutation tableaux of type $B$. This involution also proves a symmetry of the…