Related papers: On cyclic descents for tableaux
We extend work of McKay, Morse, and Wilf by giving exact formulas and asymptotic formulas for the number of skew Young tableaux T in two situations: (1) the "inside shape" and total number of cells of T are fixed, and (2) the inside shape…
We develop a theory of \emph{reduced} Gromov-Witten and stable pair invariants of surfaces and their canonical bundles. We show that classical Severi degrees are special cases of these invariants. This proves a special case of the MNOP…
We prove the positivity of the top Lyapunov exponent of the twisted (spectral) cocycle, associated with IETs, with respect to a family of natural invariant measures. The proof relies on relating the top exponent to limits of exponents along…
Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their reduced decompositions. This paper generalizes that result with a detailed study of permutations via their reduced decompositions and the notion of…
In this thesis we prove Schur-positivity of certain graph families. In addition, we exlpor existence of cyclic descent extensions on several families of Schur-positive sets.
The descent method is one of the approaches to study the Brauer--Manin obstruction to the local--global principle and to weak approximation on varieties over number fields, by reducing the problem to ``descent varieties''. In recent lecture…
Over the past years, major attention has been drawn to the question of identifying Schur-positive sets, i.e. sets of permutations whose associated quasisymmetric function is symmetric and can be written as a non-negative sum of Schur…
We give a bijective proof that the Betti numbers of a minimal free resolution of the Stanley-Reisner ring of a cycle graph (viewed as a one-dimensional simplicial complex) are given by the number of standard Young tableaux of a given shape.
A permutation $\sigma=\sigma_1 \sigma_2 \cdots \sigma_n$ has a descent at $i$ if $\sigma_i>\sigma_{i+1}$. A descent $i$ is called a peak if $i>1$ and $i-1$ is not a descent. The size of the set of all permutations of $n$ with a given…
Descent theory (a modern formulation of Fermat's classical method of infinite descent) is a powerful tool in arithmetic geometry. In this article, we reinterpret descent theory through the lens of quotient stacks and apply it in the setting…
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…
Set-valued standard Young tableaux are a generalization of standard Young tableaux due to Buch (2002) with applications in algebraic geometry. The enumeration of set-valued SYT is significantly more complicated than in the ordinary case,…
A fourientation of a graph is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. Fixing a total order on the edges and a reference orientation of the graph, we…
Monotone triangles are a rich extension of permutations that biject with alternating sign matrices. The notions of weak order and descent sets for permutations are generalized here to monotone triangles, and shown to enjoy many analogous…
We provide simple necessary and sufficient conditions for the existence of a standard Young tableau of a given shape and major index $r$ mod $n$, for all $r$. Our result generalizes the $r=1$ case due essentially to (1974) and proves a…
We devise an abstract, modular scheme to prove continuity of the Lyapunov exponents for a general class of linear cocycles. The main assumption is the availability of appropriate large deviation type (LDT) estimates which are uniform in the…
There are two main constructions in classical descent theory: the category of algebras and the descent category, which are known to be examples of weighted bilimits. We give a formal approach to descent theory, employing formal consequences…
Let $V$ be a linear representation of a connected complex reductive group $G$. Given a choice of character $\theta$ of $G$, Geometric Invariant Theory defines a locus $V^{ss}_\theta(G) \subseteq V$ of semistable points. We give necessary,…
Taking transposes of Standard Young Tableaux defines a natural involution on the set $I(n)$ of involutions of length $n$ via the the Robinson-Schensted correspondence. In some cases, this involution can be defined without resorting to the…
Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…