Author Index – Alphabetical List

A

• Dillan Agrawal
  • Chip-firing on infinite k-ary trees
• Antoine Abram
  • On a lemma of Schensted
• Ayomikun Adeniran
  • Pattern avoidance in parking functions
• Per Alexandersson
  • Peaks are preserved under run-sorting
• Amal Alofi
  • Parallelogram polyominoes and rectangular EW-tableaux: Correspondences through the Sandpile model
• Aruzhan Amanbayeva
  • The convex hull of parking functions of length n
• Tewodros Amdeberhan
  • Proofs of three Geode conjectures
• Glenn D. Appleby
  • Perforated tableaux in type A_n-1 crystal graphs and the RSK correspondence
• Kassie Archer
  • Pattern-restricted one-cycle permutations with a pattern-restricted cycle form
  • Pattern avoidance in non-crossing and non-nesting permutations
• Ilani Axelrod-Freed
  • 312-Avoiding reduced valid hook configurations and duck words
• Arvind Ayyer
  • The number of inversions of permutations with fixed shape

B

• Eli Bagno
  • On the sparseness of the downsets of permutations via their number of separators
  • Counting king permutations on the cylinder
• Koustav Banerjee
  • Positivity of the second shifted difference of partitions and overpartitions: a combinatorial approach
• Naya Banerjee
  • The number of inversions of permutations with fixed shape
• Kiril Bangachev
  • Enumerative and structural aspects of anagrams without fixed letters
• Elena Barcucci
  • Non-overlapping matrices via Dyck words
• Jean-Luc Baril
  • Transformation à la Foata for special kinds of descents and excedances
  • Enumeration of partial Łukasiewicz paths
  • Grand zigzag Knight's paths
• Marilena Barnabei
  • Pattern avoiding alternating involutions
• Kei Beauduin
  • Old and new powerful tools for the normal ordering problem and noncommutative binomials
• Nikolai Beluhov
  • One curious identity counting graceful labelings
  • Snake paths in king and knight graphs
  • Powers of 2 in balanced grid colourings
• Beáta Bényi
  • Poly-Cauchy numbers of the second kind – the combinatorics behind
• Sudip Bera
  • Combinatorialization of Sury and McLaughlin identities and general linear recurrences by a unified approach
• François Bergeron
  • Combinatorics of triangular partitions
• Nantel Bergeron
  • The Gröbner basis of a Catalan path ideal
• Zhanar Berikkyzy
  • On the correspondence between integer sequences and vacillating tableaux
• Antonio Bernini
  • Non-overlapping matrices via Dyck words
• Stefano Bilotta
  • Non-overlapping matrices via Dyck words
• Flavio Bonetti
  • Pattern avoiding alternating involutions
• Ethan Borsh
  • Pattern-restricted one-cycle permutations with a pattern-restricted cycle form
• Samuel Braunfeld
  • Logical limit laws for layered permutations and related structures
• Jensen Bridges
  • Pattern-restricted one-cycle permutations with a pattern-restricted cycle form
• Taylor Brysiewicz
  • The degree of Stiefel manifolds
• AJ Bu
  • Automated counting of restricted Motzkin paths

C

• Niccoló Castronuovo
  • Pattern avoiding alternating involutions
• Yikai Chao
  • Revisiting dice relabeling using cyclotomic polynomials
• William Y.C. Chen
  • Breaking cycles, the odd versus the even
• Douglas M. Chen
  • Permutation invariant parking assortments
• Yuji Choi
  • Highly sorted permutations with respect to a 312-avoiding stack
• Yunseo Choi
  • Highly sorted permutations with respect to a 312-avoiding stack
• Chak-On Chow
  • New proofs of interlacing of zeros of Eulerian polynomials. III
• Laura Colmenarejo
  • Counting k-Naples parking functions through permutations and the k-Naples area statistic
• Michael Coopman
  • An equidistribution involving invisible inversions
• Sylvie Corteel
  • Partitions with constrained ranks and lattice paths

D

• Dennis E. Davenport
  • An invitation to the Riordan group
• Kristina Dedndreaj
  • On the activities and partitions of the vertex subsets of graphs
• Colin Defant
  • Highly sorted permutations and Bell numbers
• Priyavrat Deshpande
  • A combinatorial statistic for labeled threshold graphs
  • A branch statistic for trees: interpreting coefficients of the characteristic polynomial of braid deformations
• Emeric Deutsch
  • The degree of asymmetry of sequences
• Hiranya Kishore Dey
  • q-Enumeration of type B and type D Eulerian polynomials based on parity of descents
  • A descent-excedance correspondence in colored permutation groups
• Robert G. Donnelly
  • Sign-alternating Gibonacci Polynomials
• Robert Dougherty-Bliss
  • The (symbolic and numeric) computational challenges of counting 0-1 balanced matrices
• Theo Douvropoulos
  • Hurwitz numbers for reflection groups I: generatingfunctionology
• Gérard H. E. Duchamp
  • Hausdorff moment problem for combinatorial numbers of Brown and Tutte: exact solution
• Andrzej Dudek
  • Largest bipartite sub-matchings of a random ordered matching or a problem with socks
• Mark Dukes
  • Parallelogram polyominoes and rectangular EW-tableaux: Correspondences through the Sandpile model
• Molly W. Dunkum
  • Sign-alternating Gibonacci Polynomials

E

• Christian Ehrenborg
  • Sharing pizza among a two power number of friends
• Didrik Ehrenborg
  • Sharing pizza among a two power number of friends
• Michaël Ehrenborg
  • Sharing pizza among a two power number of friends
• Richard Ehrenborg
  • Catalan--Spitzer permutations
  • Generating functions for the cd-indices of simplices and cubes
  • Sharing pizza among a two power number of friends
• Estrella Eisenberg
  • On the sparseness of the downsets of permutations via their number of separators
  • Counting king permutations on the cylinder
• Shalosh B. Ekhad (Computer)
  • There are EXACTLY 149380...9556 ways to derange a standard deck of cards (ignoring suits) [and many other such useful facts]
• Jennifer Elder
  • On graphs of sets of reduced words
• Sergi Elizalde
  • The degree of asymmetry of sequences
  • Partitions with constrained ranks and lattice paths
  • Canon permutations and generalized descents of standard Young tableaux
• Rebecca Embar
  • Counting condorcet
• Nicholas Ercolani
  • Non-recursive counts of graphs on surfaces
• William Q. Erickson
  • The sum of width-one tensors
  • The Demazure product extended to biwords

F

• Melanie Ferreri
  • Bijections for generalized Wilf equivalences
• Eldar Fischer
  • Counting finite topologies
• Nicolas Folinsbee
  • Euler Characteristics and Duality in Riemann Functions and the Graph Riemann-Roch Rank
• Spencer J. Franks
  • Counting parking sequences and parking assortments through permutations
• Shakuan K. Frankson
  • An invitation to the Riordan group
• Joel Friedman
  • Euler Characteristics and Duality in Riemann Functions and the Graph Riemann-Roch Rank
• Shishuo Fu
  • Rooted quasi-Stirling permutations of general multisets
• Markus Fulmek
  • Generating functions of Lozenge tilings for hexagonal regions via nonintersecting lattice paths
  • Hankel determinants of convoluted Catalan numbers and nonintersecting lattice paths: A bijective proof of Cigler's conjecture

G

• Josh Gabel
  • Revisiting dice relabeling using cyclotomic polynomials
• Christian Gaetz
  • Curious cyclic sieving on increasing tableaux
• Shiliang Gao
  • The Kostka semigroup and its Hilbert basis
• Yibo Gao
  • Tree snumeration polynomials on separable permutations
• Selena Ge
  • Chip-firing on infinite k-ary trees
• Fulvio Gesmundo
  • The degree of Stiefel manifolds
• Juan B. Gil
  • Restricted Grassmannian permutations
• Marcel K. Goh
  • On the homology of several number-theoretic set families
• Katarzyna Górska
  • Hausdorff moment problem for combinatorial numbers of Brown and Tutte: exact solution
• Christina Graves
  • Pattern-restricted one-cycle permutations with a pattern-restricted cycle form
• Jate Greene
  • Chip-firing on infinite k-ary trees
• Carla Groenland
  • The lengths for which bicrucial square-free permutations exist
• Jonathan L. Gross
  • Enumerating graph embeddings and partial-duals by genus and Euler genus
• Jarosław Grytczuk
  • Largest bipartite sub-matchings of a random ordered matching or a problem with socks

H

• Petros Hadjicostas
  • On the number of bracelets whose co-periods divide a given integer
• Pamela E. Harris
  • Counting k-Naples parking functions through permutations and the k-Naples area statistic
  • On the outcome map of MVP parking functions: Permutations avoiding 321 and 3412, and Motzkin paths
  • Counting parking sequences and parking assortments through permutations
  • Permutation invariant parking assortments
  • On the correspondence between integer sequences and vacillating tableaux
• Kimberly J. Harry
  • Counting parking sequences and parking assortments through permutations
• Nathanaël Hassler
  • Grand zigzag Knight's paths
• Graeme Henrickson
  • A cyclic sieving phenomenon for symplectic tableaux
• Orli Herscovici
  • Harary polynomials
• Gàbor Hetyei
  • Catalan--Spitzer permutations
• Takayuki Hibi
  • The regularity and h-polynomial of Cameron-Walker graphs
• Alexander Hock
  • Genus permutations and genus partitions
• Brian Hopkins
  • Euler's Enumerations
  • Refining Blecher and Knopfmacher's integer partition fixed points
• Sam Hopkins
  • Combinatorial reciprocity for non-intersecting paths
• Su Ji Hong
  • Combinatorics for certain skew tableaux, Dyck paths, triangulations, and dissections
• Andrzej Horzela
  • Hausdorff moment problem for combinatorial numbers of Brown and Tutte: exact solution
• Jia Huang
  • Associative-commutative spectra for some varieties of groupoids
• Murray L. Huber
  • Sign-alternating Gibonacci Polynomials
• Mark Huibregtse
  • Bootstrap percolation, indecomposable permutations, and the n-kings problem

I

• Ryota Inagaki
  • Chip firing on directed k-ary trees
• Erik Insko
  • A combinatorial model for lane merging: Limited capacity lanes

J

• Millie Jeske
  • Pattern-restricted one-cycle permutations with a pattern-restricted cycle form
• Caleb Ji
  • Brussels sprouts, noncrossing trees, and parking functions
• Katie Johnson
  • A combinatorial model for lane merging: Limited capacity lanes
• Tom Johnston
  • The lengths for which bicrucial square-free permutations exist
• Zakiya Jones
  • Counting k-Naples parking functions through permutations and the k-Naples area statistic

K

• Frether Getachew Kebede
  • Parity alternating permutations starting with an odd integer
• Brian M. Kamau
  • On the outcome map of MVP parking functions: Permutations avoiding 321 and 3412, and Motzkin paths
• Nathan Kaplan
  • The expected embedding dimension, type and weight of a numerical semigroup
• Hemanshu Kaul
  • The DP color function of clique-gluings of graphs
  • Counting packings of list-colorings of graphs
  • List coloring the cartesian product of a complete graph and complete bipartite graph
• Christo Keller
  • Counting k-Naples parking functions through permutations and the k-Naples area statistic
• Tanya Khovanova
  • Ending states of a special variant of the chip-firing algorithm
  • Chip firing on directed k-ary trees
  • Chip-firing on infinite k-ary trees
• Joshua Kiers
  • The Kostka semigroup and its Hilbert basis
• Dohun Kim
  • Chip-firing on infinite k-ary trees
• Kyouko Kimura
  • The regularity and h-polynomial of Cameron-Walker graphs
• Sergey Kirgizov
  • Transformation à la Foata for special kinds of descents and excedances
  • Grand zigzag Knight's paths
• Sergey Kitaev
  • The combinatorics of Jeff Remmel
• Grant Kopitzke
  • The Gini index in the representation theory of the general linear group
• Christoph Koutschan
  • There are EXACTLY 149380...9556 ways to derange a standard deck of cards (ignoring suits) [and many other such useful facts]
  • The (symbolic and numeric) computational challenges of counting 0-1 balanced matrices
• Yujia Kang
  • On Friendship and Cyclic Parking Functions
• Lee Knupp
  • Sign-alternating Gibonacci Polynomials
• Jan Kretschmann
  • Counting parking sequences and parking assortments through permutations
  • The sum of width-one tensors
• Matthew Kukla
  • Logical limit laws for layered permutations and related structures
• Masamichi Kuroda
  • The characteristic quasi-polynomials of hyperplane arrangements over residually finite Dedekind domains

L

• Gilbert Labelle
  • The mathematical life of Pierre Leroux
• Tri Lai
  • Ratio of tiling generating functions of semi-hexagons and quartered hexagons with dents
  • Errata: "Ratio of Tiling Generating Functions of Semi-hexagons and Quartered Hexagons with Dents" (ECA 2:1 (2022) Article #S2R5)
• Carlye Larson
  • Revisiting dice relabeling using cyclotomic polynomials
• Robert P. Laudone
  • Pattern avoidance in non-crossing and non-nesting permutations
• Joceline Lega
  • Non-recursive counts of graphs on surfaces
• Erkko Lehtonen
  • Associative-commutative spectra for some varieties of groupoids
• Cristobal Lemus-Vidales
  • Bootstrap percolation, indecomposable permutations, and the $n$-kings problem, ECA 6:1 (2026) Article S2R6
• Joel Brewster Lewis
  • Hurwitz numbers for reflection groups I: generatingfunctionology
• Rupert Li
  • Vincular pattern avoidance on cyclic permutations
• Runqiao Li
  • Schmidt type partitions
• Teresa Xueshan Li
  • Some linear transformations on symmetric functions arising from a Formula of Thiel and Williams
• Yanlin Li
  • Rooted quasi-Stirling permutations of general multisets
• Yifei Li
  • Homology of Segre powers of boolean and subspace lattices
• William Linz
  • s-Catalan numbers and Littlewood-Richardson polynomials
• Siyu Liu
  • Tree snumeration polynomials on separable permutations
• Vadim Lozin
  • Extremal boolean functions with long prime implicants
• Austin Luo
  • Chip firing on directed k-ary trees

M

• John Machacek
  • Lattice walks ending on a coordinate hyperplane avoiding backtracking and repeats
• Johann A. Makowsky
  • Harary polynomials
  • Counting finite topologies
• Rajarshi Mandal
  • Chip-firing on infinite k-ary trees
• Kostas Manes
  • Bijections for Dyck paths with colored hills
• Leonardo Marciaga
  • List coloring the cartesian product of a complete graph and complete bipartite graph
• Kazunori Matsuda
  • The regularity and $h$-polynomial of Cameron-Walker graphs
• Michael Maxfield
  • The DP color function of clique-gluings of graphs
• Mikhail Mazin
  • Combinatorics of triangular partitions
• Douglas M. McKenna
  • Fibbinary zippers in a monoid of toroidal Hamiltonian cycles that generate Hilbert-style square-filling curves
• Anthony Mendes
  • The combinatorics of Jeff Remmel
• Krishna Menon
  • A combinatorial statistic for labeled threshold graphs
  • Pattern avoidance and dominating compositions
  • A branch statistic for trees: interpreting coefficients of the characteristic polynomial of braid deformations
• Jared Mi
  • Partially restricted stacks as functions
• Xavier Mootoo
  • The Gröbner basis of a Catalan path ideal
• Alejandro H. Morales
  • Hurwitz numbers for reflection groups I: generatingfunctionology
• J. Carlos Martínez Mori
  • On the outcome map of MVP parking functions: Permutations avoiding 321 and 3412, and Motzkin paths
  • Permutation invariant parking assortments
• Gregory J. Morrow
  • Some probability distributions and integer sequences related to rook paths
• Lili Mu
  • Some linear transformations on symmetric functions arising from a Formula of Thiel and Williams
• Jeffrey A. Mudrock
  • The DP color function of clique-gluings of graphs
  • Counting packings of list-colorings of graphs
  • List coloring the cartesian product of a complete graph and complete bipartite graph
• Sajal Mukherjee
  • Counting on matrices
• Sanjay Mukherjee
  • Counting on matrices
• Shashikant Mulay
  • Semi-invariants of binary forms and symmetrized graph-monomials
• Henri Mühle
  • Refined lattice path enumeration and combinatorial reciprocity

N

• Olivia Nabawanda
  • Peaks are preserved under run-sorting
• George D. Nasr
  • Combinatorics for certain skew tableaux, Dyck paths, triangulations, and dissections
  • Revisiting dice relabeling using cyclotomic polynomials

O

• Gidon Orelowitz
  • The Kostka semigroup and its Hilbert basis

P

• Eric J. Pabón-Cancel
  • Permutation invariant parking assortments
• Qiongqiong Pan
  • Enumerating colored permutations by the parity of descent positions
• Jay Pantone
  • The enumeration of inversion sequences avoiding the patterns 201 and 210
• Tanish Parida
  • Chip-firing on infinite k-ary trees
• Oliver Pechenik
  • Curious cyclic sieving on increasing tableaux
• Karol A. Penson
  • Hausdorff moment problem for combinatorial numbers of Brown and Tutte: exact solution
• Ross G. Pinsky
  • A view from the bridge spanning combinatorics and probability
• Renzo Pinzani
  • Non-overlapping matrices via Dyck words
• Olga Postnova
  • Counting filter restricted paths in ℤ² lattice
• Svetlana Poznanović
  • Descent polynomials for labeled trees
• Helmut Prodinger
  • Retakh's Motzkin paths and some combinatorial comments
  • Philippe Flajolet's early work in combinatorics
  • Enumeration of partial Łukasiewicz paths
  • k-Non-crossing trees and edge statistics modulo k
• James Propp
  • Brussels sprouts, noncrossing trees, and parking functions
• Lara Pudwell
  • Pattern avoidance in parking functions
• Anirudh Pulugurtha
  • Chip-firing on infinite k-ary trees
• Anna Pun
  • On the correspondence between integer sequences and vacillating tableaux

Q

• No authors listed.

R

• Vsevolod Rakita
  • Harary polynomials
• Fanja Rakotondrajao
  • Parity alternating permutations starting with an odd integer
• José L. Ramírez
  • Poly-Cauchy numbers of the second kind - the combinatorics behind
  • Grand zigzag Knight's paths
• Margaret Readdy
  • Catalan--Spitzer permutations
• Shulamit Reches
  • On the sparseness of the downsets of permutations via their number of separators
  • Counting king permutations on the cylinder
• Gordon Redwine
  • Chip-firing on infinite k-ary trees
• Christophe Reutenauer
  • On a lemma of Schensted
• Andrés Ramos Rodríguez
  • Counting k-Naples parking functions through permutations and the k-Naples area statistic
• Maria Rodriguez Hertz
  • Descent polynomials for labeled trees
• Martin Rubey
  • An equidistribution involving invisible inversions
  • Fixed points and cycles of parking functions
• Andrzej Ruciński
  • Largest bipartite sub-matchings of a random ordered matching or a problem with socks

S

• Manjil P. Saikia
  • Hook-length biases in t-regular partitions
• Jonah Saks
  • On the homology of several number-theoretic set families
• Soham Samanta
  • Chip-firing on infinite k-ary trees
• Gabriel Sargent
  • Permutation invariant parking assortments
• Carla Savage
  • Partitions with constrained ranks and lattice paths
• Matthias Schork
  • Recent developments in combinatorial aspects of normal ordering
• Alfred Schreiber
  • Inverse relations and reciprocity laws involving partial Bell polynomials and related extensions
  • On the formal power series of involutory functions
• Thomas Selig
  • On Friendship and Cyclic Parking Functions
• Umesh Shankar
  • q-Enumeration of type B and type D Eulerian polynomials based on parity of descents
  • A descent-excedance correspondence in colored permutation groups
• Louis W. Shapiro
  • An invitation to the Riordan group
• Mark Shattuck
  • A formula relating Bell polynomials and Stirling numbers of the first kind
  • Subword patterns in smooth words
• Ethan Shelburne
  • Schur-positivity for generalized nets
• Wenle Shi
  • Symmetric and asymmetric peaks or valleys in (partial) Dyck paths
• Moriah Sigron
  • On the sparseness of the downsets of permutations via their number of separators
  • Counting king permutations on the cylinder
• Matteo Silimbani
  • Pattern avoiding alternating involutions
• Anurag Singh
  • A combinatorial statistic for labeled threshold graphs
  • Pattern avoidance and dominating compositions
• Deepesh Singhal
  • The expected embedding dimension, type and weight of a numerical semigroup
• Sivaramakrishnan Sivasubramanian
  • q-Enumeration of type B and type D Eulerian polynomials based on parity of descents
  • A descent-excedance correspondence in colored permutation groups
• Mark Skandera
  • Generating functions for monomial characters of wreath products ℤ/dℤ≀S_n
• Dmitry Solovyev
  • Counting filter restricted paths in ℤ² lattice
• Chunwei Song
  • On combinatorial rectangles with minimum ∞-discrepancy
• George Spahn
  • Automatic counting of generalized Latin rectangles and trapezoids
  • Counting permutations where the difference between entries located r places apart can never be s
• Richard P. Stanley
  • Some linear transformations on symmetric functions arising from a Formula of Thiel and Williams
  • Some enumerative applications of cyclotomic polynomials
• Einar Steingrímsson
  • The history of the Gothenburg–Reykjavík–Strathclyde combinatorics group
• Zachary Stier
  • Dihedral sieving on cluster complexes
• Anna Stokke
  • A cyclic sieving phenomenon for symplectic tableaux
• Jessica Striker
  • Curious cyclic sieving on increasing tableaux
• Eunice Sukarto
  • Counting k-Naples parking functions through permutations and the k-Naples area statistic
• Shaun Sullivan
  • A combinatorial model for lane merging: Limited capacity lanes
• Nathan Sun
  • A complete enumeration of Ballot permutations avoiding sets of small patterns
• Yidong Sun
  • Symmetric and asymmetric peaks or valleys in (partial) Dyck paths
• Sheila Sundaram
  • Homology of Segre powers of boolean and subspace lattices
• Joshua P. Swanson
  • Curious cyclic sieving on increasing tableaux

T

• Prabal Talukdar
  • Hook-length biases in t-regular partitions
• Ioannis Tasoulas
  • Bijections for Dyck paths with colored hills
• Bridget E. Tenner
  • Forced perimeter in Elnitsky polygons
  • Boolean intersection ideals of permutations in the Bruhat order
• Natalya Ter-Saakov
  • The (symbolic and numeric) computational challenges of counting 0-1 balanced matrices
• Seth Thomason
  • The DP color function of clique-gluings of graphs
• Roger Tian
  • On the outcome map of MVP parking functions: Permutations avoiding 321 and 3412, and Motzkin paths
• Brandon Tippings
  • Non-recursive counts of graphs on surfaces
• Peter Tittmann
  • On the activities and partitions of the vertex subsets of graphs
• Jessica A. Tomasko
  • Restricted Grassmannian permutations
• Shuhei Tsujie
  • The characteristic quasi-polynomials of hyperplane arrangements over residually finite Dedekind domains
• Thomas W. Tucker
  • Enumerating graph embeddings and partial-duals by genus and Euler genus
• Adam Van Tuyl
  • The regularity and h-polynomial of Cameron-Walker graphs
• Eleni Tzanaki
  • Refined lattice path enumeration and combinatorial reciprocity

U

• No authors listed.

V

W

X

X

Y

Z