Jessica Striker
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Jessica Striker has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Oliver Pechenik
University of Waterloo
5 shared publications - Amanda Welch
Department of Mathematics and Computer Science, Eastern Illinois University, Charleston, USA
4 shared publications - Erin McNicholas
Willamette University
4 shared publications - Nadia Lafrenière
Department of Mathematics Dartmouth College
3 shared publications - Alejandro H. Morales
Universite du Quebec a Montreal Montreal Quebec Canada
2 shared publications - Christian Gaetz
Department of Mathematics, University of California, Berkeley, USA
2 shared publications
Latest Publications
- 10 November 2025
- Published by Springer Nature in Inventiones Mathematicae
- Vol. 243 (2) , 703-804
Rotation-invariant web bases from hourglass plabic graphs
- 10 November 2025
- Published by Springer Nature in Inventiones Mathematicae
- Vol. 243 (2) , 703-804
Rotation-invariant web bases from hourglass plabic graphs
- 20 September 2025
- Published by Springer Nature in Annals of Combinatorics
- Vol. 30 (1) , 195-225
Enumeration of Pattern-Avoiding Alternating Sign Matrices: An Asymptotic Dichotomy
- 20 September 2025
- Published by Springer Nature in Annals of Combinatorics
- Vol. 30 (1) , 195-225
Enumeration of Pattern-Avoiding Alternating Sign Matrices: An Asymptotic Dichotomy
- Open Access
Orbitmesy and promotion on self-dual posets
We introduce the notion of orbitmesy, which is related to homomesy, a central phenomenon in dynamical algebraic combinatorics. An orbit $O$ is said to be orbitmesic with respect to a statistic if the orbit's average statistic value is equal to the global average. We particularly focus on the action of promotion on increasing labelings of certain fence posets called zig-zag posets, and two statistics, the antipodal sum statistic and the total sum statistic. We classify all of the orbitmesic promotion orbits for the zig-zag poset with four elements. Along the way, we investigate how homomesy of one action can be used to find orbitmesic orbits for another action, for the same fixed statistic. We prove several general results which can be used to find infinite families of orbitmesic orbits for any self-dual poset.Open AccessOrbitmesy and promotion on self-dual posets
We introduce the notion of orbitmesy, which is related to homomesy, a central phenomenon in dynamical algebraic combinatorics. An orbit $O$ is said to be orbitmesic with respect to a statistic if the orbit's average statistic value is equal to the global average. We particularly focus on the action of promotion on increasing labelings of certain fence posets called zig-zag posets, and two statistics, the antipodal sum statistic and the total sum statistic. We classify all of the orbitmesic promotion orbits for the zig-zag poset with four elements. Along the way, we investigate how homomesy of one action can be used to find orbitmesic orbits for another action, for the same fixed statistic. We prove several general results which can be used to find infinite families of orbitmesic orbits for any self-dual poset. - Open Access
Promotion digraphs
Work of Gaetz, Pechenik, Pfannerer, Striker, and Swanson (2024) introduced promotion permutations for a rectangular standard Young tableau $T$. These promotion permutations encode important features of $T$ and its orbit under Schützenberger's promotion operator. Indeed, the promotion permutations uniquely determine the tableau $T$. We introduce more general promotion digraphs for both standard and increasing tableaux of arbitrary shape. For rectangular standard tableaux, this construction recovers the functional digraphs of the promotion permutations. Among other facts, we show that promotion digraphs uniquely determine $T$ when $T$ is standard of arbitrary shape or increasing of rectangular shape, but not when $T$ is increasing and general shape. We completely characterize the promotion digraphs for two-row rectangular increasing tableaux. We use promotion digraphs for three-row rectangular increasing tableaux to conjecture a connection between their dynamics and the flamingo webs recently introduced by Kim to give a diagrammatic basis of the Specht module $S^{(k^3,1^{n-3k})}$.Open AccessPromotion digraphs
Work of Gaetz, Pechenik, Pfannerer, Striker, and Swanson (2024) introduced promotion permutations for a rectangular standard Young tableau $T$. These promotion permutations encode important features of $T$ and its orbit under Schützenberger's promotion operator. Indeed, the promotion permutations uniquely determine the tableau $T$. We introduce more general promotion digraphs for both standard and increasing tableaux of arbitrary shape. For rectangular standard tableaux, this construction recovers the functional digraphs of the promotion permutations. Among other facts, we show that promotion digraphs uniquely determine $T$ when $T$ is standard of arbitrary shape or increasing of rectangular shape, but not when $T$ is increasing and general shape. We completely characterize the promotion digraphs for two-row rectangular increasing tableaux. We use promotion digraphs for three-row rectangular increasing tableaux to conjecture a connection between their dynamics and the flamingo webs recently introduced by Kim to give a diagrammatic basis of the Specht module $S^{(k^3,1^{n-3k})}$. - Open Access
Enumeration of interval-closed sets via Motzkin paths and quarter-plane walks
We find a generating function for interval-closed sets of the product of two chains poset by constructing a bijection to certain bicolored Motzkin paths. We also find a functional equation for the generating function of interval-closed sets of truncated rectangle posets, including the type $A$ root poset, by constructing a bijection to certain quarter-plane walks.Open AccessEnumeration of interval-closed sets via Motzkin paths and quarter-plane walks
We find a generating function for interval-closed sets of the product of two chains poset by constructing a bijection to certain bicolored Motzkin paths. We also find a functional equation for the generating function of interval-closed sets of truncated rectangle posets, including the type $A$ root poset, by constructing a bijection to certain quarter-plane walks. - Open Access
- 18 November 2024
- Published by Springer Nature in Annals of Combinatorics
- p. 1-38
Totally Symmetric Self-Complementary Plane Partition Matrices and Related Polytopes
Plane partitions in the totally symmetric self-complementary symmetry class (TSSCPPs) are known to be equinumerous with $$n\times n$$ alternating sign matrices, but no explicit bijection is known. In this paper, we give a bijection from these plane partitions to $$\{0,1,-1\}$$ -matrices we call magog matrices, some of which are alternating sign matrices. We explore enumerative properties of these matrices related to natural statistics such as inversion number and number of negative ones. We then investigate the polytope defined as their convex hull. We show that all the magog matrices are extreme and give a partial inequality description. Finally, we define another TSSCPP polytope as the convex hull of TSSCPP boolean triangles and determine its dimension, inequalities, vertices, and facets.- 18 November 2024
- Published by Springer Nature in Annals of Combinatorics
- p. 1-38
Open AccessTotally Symmetric Self-Complementary Plane Partition Matrices and Related Polytopes
Plane partitions in the totally symmetric self-complementary symmetry class (TSSCPPs) are known to be equinumerous with $$n\times n$$ alternating sign matrices, but no explicit bijection is known. In this paper, we give a bijection from these plane partitions to $$\{0,1,-1\}$$ -matrices we call magog matrices, some of which are alternating sign matrices. We explore enumerative properties of these matrices related to natural statistics such as inversion number and number of negative ones. We then investigate the polytope defined as their convex hull. We show that all the magog matrices are extreme and give a partial inequality description. Finally, we define another TSSCPP polytope as the convex hull of TSSCPP boolean triangles and determine its dimension, inequalities, vertices, and facets. - Open Access
- 27 September 2024
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 4 (2)
Promotion permutations for tableaux
We introduce fluctuating tableaux, which subsume many classes of tableaux that have been previously studied, including (generalized) oscillating, vacillating, rational, alternating, standard, and transpose semistandard tableaux. Our main contribution is the introduction of promotion permutations and promotion matrices, which are new even for standard tableaux. We provide characterizations in terms of Bender-Knuth involutions, jeu de taquin, and crystals. We prove key properties in the rectangular case about the behavior of promotion permutations under promotion and evacuation. We also give a full development of the basic combinatorics and representation theory of fluctuating tableaux.Our motivation comes from our companion paper, where we use these results in the development of a new rotation-invariant \(\operatorname{SL}_4\)-web basis. Basis elements are given by certain planar graphs and are constructed so that important algebraic operations can be performed diagrammatically. These planar graphs are indexed by fluctuating tableaux, tableau promotion corresponds to graph rotation, and promotion permutations correspond to key graphical information.Mathematics Subject Classifications: 05E10, 05E18Keywords: Tableaux, promotion, jeu de taquin, Bender-Knuth involutions, growth diagrams, crystals- 27 September 2024
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 4 (2)
Open AccessPromotion permutations for tableaux
We introduce fluctuating tableaux, which subsume many classes of tableaux that have been previously studied, including (generalized) oscillating, vacillating, rational, alternating, standard, and transpose semistandard tableaux. Our main contribution is the introduction of promotion permutations and promotion matrices, which are new even for standard tableaux. We provide characterizations in terms of Bender-Knuth involutions, jeu de taquin, and crystals. We prove key properties in the rectangular case about the behavior of promotion permutations under promotion and evacuation. We also give a full development of the basic combinatorics and representation theory of fluctuating tableaux.Our motivation comes from our companion paper, where we use these results in the development of a new rotation-invariant \(\operatorname{SL}_4\)-web basis. Basis elements are given by certain planar graphs and are constructed so that important algebraic operations can be performed diagrammatically. These planar graphs are indexed by fluctuating tableaux, tableau promotion corresponds to graph rotation, and promotion permutations correspond to key graphical information.Mathematics Subject Classifications: 05E10, 05E18Keywords: Tableaux, promotion, jeu de taquin, Bender-Knuth involutions, growth diagrams, crystals - Open Access
- 29 January 2024
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 12, e17
A Pipe Dream Perspective on Totally Symmetric Self-Complementary Plane Partitions
We characterize totally symmetric self-complementary plane partitions (TSSCPP) as bounded compatible sequences satisfying a Yamanouchi-like condition. As such, they are in bijection with certain pipe dreams. Using this characterization and the recent bijection of Gao–Huang between reduced pipe dreams and reduced bumpless pipe dreams, we give a bijection between alternating sign matrices and TSSCPP in the reduced, 1432-avoiding case. We also give a different bijection in the 1432- and 2143-avoiding case that preserves natural poset structures on the associated pipe dreams and bumpless pipe dreams.
- 29 January 2024
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 12, e17
Open AccessA Pipe Dream Perspective on Totally Symmetric Self-Complementary Plane Partitions
We characterize totally symmetric self-complementary plane partitions (TSSCPP) as bounded compatible sequences satisfying a Yamanouchi-like condition. As such, they are in bijection with certain pipe dreams. Using this characterization and the recent bijection of Gao–Huang between reduced pipe dreams and reduced bumpless pipe dreams, we give a bijection between alternating sign matrices and TSSCPP in the reduced, 1432-avoiding case. We also give a different bijection in the 1432- and 2143-avoiding case that preserves natural poset structures on the associated pipe dreams and bumpless pipe dreams.
- Open Access
Toggling, rowmotion, and homomesy on interval-closed sets
Interval-closed sets of a poset are a natural superset of order ideals. We initiate the study of interval-closed sets of finite posets from enumerative and dynamical perspectives. In particular, we use the generalized toggle group to define rowmotion on interval-closed sets as a product of these toggles. Our main theorem is an intricate global characterization of rowmotion on interval-closed sets, which we show is equivalent to the toggling definition. We also study specific posets; we enumerate interval-closed sets of ordinal sums of antichains, completely describe their rowmotion orbits, and prove a homomesy result involving the signed cardinality statistic. Finally, we study interval-closed sets of product of chains posets, proving further results about enumeration and homomesy.
Open AccessToggling, rowmotion, and homomesy on interval-closed sets
Interval-closed sets of a poset are a natural superset of order ideals. We initiate the study of interval-closed sets of finite posets from enumerative and dynamical perspectives. In particular, we use the generalized toggle group to define rowmotion on interval-closed sets as a product of these toggles. Our main theorem is an intricate global characterization of rowmotion on interval-closed sets, which we show is equivalent to the toggling definition. We also study specific posets; we enumerate interval-closed sets of ordinal sums of antichains, completely describe their rowmotion orbits, and prove a homomesy result involving the signed cardinality statistic. Finally, we study interval-closed sets of product of chains posets, proving further results about enumeration and homomesy.
- 3 August 2023
- Published by Elsevier in European Journal of Combinatorics
- Vol. 115, 103776
-strict promotion and -partition rowmotion: The graded case- 3 August 2023
- Published by Elsevier in European Journal of Combinatorics
- Vol. 115, 103776
-strict promotion and -partition rowmotion: The graded case