About

A half-century ago enumerative combinatorics was considered to be mostly a collection of isolated results and methods, mainly originating with Euler. Since then enumerative combinatorics has been transformed into a rich and important research area in mathematics, partly due to its deep connections with other fields of research. The pioneering work of Stanley, especially the two-volume Enumerative Combinatorics, and the book of Flajolet and Sedgewick on Analytic Combinatorics (also, see the Handbook of Enumerative Combinatorics by Bóna and Combinatorial Enumeration by Goulden and Jackson), helped to shape and popularize the subject. Inspired in particular by these books, and more generally by the many fine papers in the subject, we introduce this Journal, Enumerative Combinatorics and Applications.

Enumerative Combinatorics and Applications (ECA) is a fully-refereed (peer reviewed) scientific electronic journal with very high standards, devoted to the publication of research articles of the highest quality. Therefore, the journal will consider only submissions that contain new insights/ideas/methods/concepts/bijections/applications related to enumeration. The journal covers research from the field of Enumerative Combinatorics as well as research resulting from the rich interplay between enumerations, applications, and other branches of mathematics and science.

The scope of ECA includes enumerative aspects of combinatorial structures and their connections to various areas of mathematics (linear algebra, probability theory, complex analysis, commutative algebra, representation theory, algebraic geometry, algebraic topology), physics, chemistry, computer science, etc. ECA publishes high quality full papers, reviews, surveys, historical papers and biographies of mathematicians. Our main objective is to help amplify the trend of high quality research in enumerative combinatorics by providing a medium dedicated to this exciting field of mathematics and making it publicly available and free of charge to all researchers across the globe, that means there are no Article Processing Charges (APC).

ECA was founded in 2020, by Toufik Mansour and Armend Sh. Shabani. The online subscription to ECA is free. Full-text access to all papers is available for free. ECA journal is hosted at University of Haifa and Kosovar Mathematical Society.

Publisher: University of Haifa, Department of Mathematics, Address of the publisher: 199 Abba Khoushy Ave, 3498838 Haifa, Israel.

The Abbreviation of the journal’s title is “Enumer. Combin. Appl.”.
The websites http://ecajournal.haifa.ac.il and https://ecajournal.kms-ks.org are copy of each another.


Editorial Team

Editor-in-Chief Toufik Mansour, University of Haifa, Israel; tmansour@univ.haifa.ac.il
Managing Editors Mark Dukes, University College Dublin, Ireland, mark.dukes@ucd.ie and Armend Sh. Shabani, University of Prishtina, Republic of Kosova, armend.shabani@uni-pr.edu

Honorary Board

Noga Alon, Princeton University, USA and Tel Aviv University, Israel.
Gil Kalai, Hebrew University, Israel.
Michelle Wachs, University of Miami, USA.
Doron Zeilberger, Rutgers University, USA.

Editorial Board

Ron Adin, Bar-Ilan University, Israel. Eli Bagno, Jerusalem College of Technology, Israel. Gill Barequet, Technion, Israel. Jean-Luc Baril, Université de Bourgogne Franche-Comté, France. Alexander Burstein, Howard University, USA. Nenad Cakić, University of Belgrade, Serbia. David Callan, University of Wisconsin-Madison, USA. Gi-Sang Cheon, Sungkyunkwan University, Korea. Chak-On Chow, Hong Kong. Rosena Ruo Xia Du, East China Normal University, China. Mark Dukes, University College Dublin, Ireland. David Garber, Holon Institute of Technology, Israel. Qing-Hu Hou, Tianjin University, China. Alexander Kasprzyk, University of Nottingham, UK. Sergey Kitaev, University of Strathclyde, United Kingdom. Ilias Kotsireas, Wilfrid Laurier University, Canada. Arnold Knopfmacher, University of the Witwatersrand, South Africa. Vsevolod Lev, University of Haifa, Israel. Shi-Mei Ma, Northeast University At Qinhuangdao Campus, China. Anna Melnikov, University of Haifa, Israel. Emanuele Munarini, Politecnico di Milano, Italy. Kieka Mynhardt, University of Victoria, Canada. Lara Pudwell, Valparaiso University, USA. Jose L. Ramirez, Universidad Nacional de Colombia, Colombia. Reza Rastegar, University of Tulsa, USA. Yuval Roichman, Bar-Ilan University, Israel. Michael J. Schlosser, University of Vienna, Austria. Matthias Schork, Germany. Mark Shattuck, University of Tennessee, USA. Rebecca Smith, SUNY Brockport University, USA. Chunwei Song, Peking University, China. Einar Steingrímsson, University of Strathclyde, United Kingdom. Alek Vainshtein, University of Haifa, Israel. Vincent Vajnovszki, Université de Bourgogne, France. Vincent Vatter, University of Florida, USA. Catherine Yan, Texas A&M University, USA. Sherry H.F. Yan, Zhejiang Normal University, China. Gökhan Yıldırım, Bilkent University, Turkey. Raphael Yuster, University of Haifa, Israel.

Volumes and issues


Volume 1 (2021): Number 1, Number 2, Number 3

Volume 2 (2022): Number 1, Number 2, Number 3, Number 4 (Special Issue: Permutation Patterns 2021)

Volume 3 Issue 1 (In progress)

Submission of Manuscript

Manuscripts should be written in English, prepared in LaTeX, and must be submitted as a PDF file in an email attachment to Editor-in-chief: tmansour@univ.haifa.ac.il

Within a week you will receive acknowledgment that your submission has been received.

Submitted manuscripts to ECA will be refereed according to the highest standards. Initially, to make sure the submitted manuscript complies with the quality standards of ECA, your manuscript will be first reviewed by some of the members of the Editorial Board. After that, the manuscript will be sent to at least one referee and we will contact you as soon as we receive their reports. The median time from submission to publication is 6 months. Thus, we ask kindly not to send questions about your manuscript if it has been under consideration for less than 6 months.

After a manuscript is accepted and the final version of the accepted paper is received, it will be published within a few days.

Notes: If your file is larger than 8 MB, contact the Editor-in-chief. Also, in case you did not receive an acknowledgment within a week, then again contact the Editor-in-chief.

When submitting a manuscript, the (corresponding) author, should make sure that the manuscript contains:
(1) Title of the manuscript. The title should be concise and indicate as clearly as possible the subject of the manuscript.
(2) Author names and affiliations. The affiliation should include the postal address, country, and email address of each author.
(3) Abstract. The abstract should describe the problem studied and the main results. It should be concise, informative, and self-contained. It should not contain equation numbers, citations, or references.
(4) Keywords. Specify 2 to 5 keywords.
(5) Mathematics Subject Classification. Include one or more Math. Subj. Class. codes - see https://mathscinet.ams.org/mathscinet/msc/msc2020.html

By submitting the manuscript, the authors confirm that:
- The manuscript has not been previously published.
- The manuscript is not under consideration elsewhere, nor will it be submitted for publication elsewhere while it is being handled by EAC.
- If the manuscript is accepted by ECA, then it will not be published elsewhere.
- The submission file is in PDF document file format.

Upon acceptance of the paper author/s will provide the document in the LaTeX style provided by ECA. The final version Manuscripts accepted for publication must be prepared in LaTeX according to the ECA format example.tex. The LaTex version of the paper should be executed without errors. When submitting the LaTex version of the paper, please send also all ‘supplementary files’. The recommended format for image files is PDF, but EPS format is also acceptable. Regarding references, authors should use the abbreviations of the journals’ names, provided by MathSciNet. Also, make sure that all your references are carefully formatted following the examples provided in the sample file.

In addition to the above, the authors should pay attention to the following matters: When submitting a manuscript, the corresponding author may suggest some potential referees, who have not coauthored with them during the last 5 years. The editorial office may or may not use such suggestions.

Open Access and Copyright Articles in Enumerative Combinatorics and Applications are published under Creative Commons Attribution 4.0 International License. https://creativecommons.org/licenses/by-nd/4.0/ (CC BY-ND). After the paper is accepted, the corresponding author will be required the following: Ensure when sending the final version of the manuscript, adding the following to your email: "All authors agree that their article is licensed and released under the CC BY-ND LICENSE; CREATIVE COMMONS ATTRIBUTION 4.0 INTERNATIONAL LICENSE." Authors retain the copyright and full publishing rights without restrictions.

Publication Ethics Enumerative Combinatorics and Applications adheres to the following documents regarding the Publication Ethics.
(1) Policy Statement on Ethical Guidelines, American Mathematical Society
(2) Best Current Practices for Journals, International Mathematical Union
(3) Code of Practice, European Mathematical Society (EMS) Ethics Committee
(4) EMS Ethics Committee Comments on the EMS Code of Practice

Repository The authors can deposit their versions of manuscripts (not the one that includes ECA styles) in arXiv or in other repository pages.


Author Index

  • 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
  • Ilani Axelrod-Freed
          312-Avoiding reduced valid hook configurations and duck words
  • Arvind Ayyer
          The number of inversions of permutations with fixed shape
  • Eli Bagno
          On the sparseness of the downsets of permutations via their number of separators
          Counting king permutations on the cylinder
  • Naya Banerjee
          The number of inversions of permutations with fixed shape
  • 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
  • Marilena Barnabei
          Pattern avoiding alternating involutions
  • Nikolai Beluhov
          One curious identity counting graceful labelings
  • 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
  • Antonio Bernini
          Non-overlapping matrices via Dyck words
  • Stefano Bilotta
          Non-overlapping matrices via Dyck words
  • Flavio Bonetti
          Pattern avoiding alternating involutions
  • Samuel Braunfeld
          Logical limit laws for layered permutations and related structures
  • Taylor Brysiewicz
          The degree of Stiefel manifolds
  • AJ Bu
          Automated counting of restricted Motzkin paths
  • Niccoló Castronuovo
          Pattern avoiding alternating involutions
  • Laura Colmenarejo
          Counting k-Naples parking functions through permutations and the k-Naples area statistic
  • Michael Coopman
          An equidistribution involving invisible inversions
  • 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
  • Robert G. Donnelly
          Sign-alternating Gibonacci Polynomials
  • Theo Douvropoulos
          Hurwitz numbers for reflection groups I: generatingfunctionology
  • Mark Dukes
          Parallelogram polyominoes and rectangular EW-tableaux: Correspondences through the Sandpile model
  • Molly W. Dunkum
          Sign-alternating Gibonacci Polynomials
  • 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]
  • Sergi Elizalde
          The degree of asymmetry of sequences
  • Rebecca Embar
          Counting condorcet
  • Shishuo Fu
          Rooted quasi-Stirling permutations of general multisets
  • Markus Fulmek
          Generating functions of Lozenge tilings for hexagonal regions via nonintersecting lattice paths
  • Christian Gaetz
         Curious cyclic sieving on increasing tableaux
  • Fulvio Gesmundo
          The degree of Stiefel manifolds
  • Juan B. Gil
          Restricted Grassmannian permutations
  • 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
  • Pamela E. Harris
          Counting k-Naples parking functions through permutations and the k-Naples area statistic
  • Orli Herscovici
          Harary polynomials
  • Takayuki Hibi
          The regularity and $h$-polynomial of Cameron-Walker graphs
  • Brian Hopkins
          Euler's Enumerations
  • Murray L. Huber
          Sign-alternating Gibonacci Polynomials
  • Caleb Ji
          Brussels sprouts, noncrossing trees, and parking functions
  • 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
  • Frether Getachew Kebede
          Parity alternating permutations starting with an odd integer
  • Christo Keller
          Counting k-Naples parking functions through permutations and the k-Naples area statistic
  • Kyouko Kimura
          The regularity and $h$-polynomial of Cameron-Walker graphs
  • Sergey Kirgizov
          Transformation à la Foata for special kinds of descents and excedances
  • Sergey Kitaev
          The combinatorics of Jeff Remmel
  • Christoph Koutschan
          There are EXACTLY 149380...9556 Ways to Derange a Standard Deck of Cards (Ignoring Suits) [and Many Other Such Useful Facts]
  • Lee Knupp
          Sign-alternating Gibonacci Polynomials
  • Matthew Kukla
          Logical limit laws for layered permutations and related structures
  • 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)
  • Joel Brewster Lewis
          Hurwitz numbers for reflection groups I: generatingfunctionology
  • Rupert Li
          Vincular pattern avoidance on cyclic permutations
  • Runqiao Li
          Schmidt type partitions
  • Yanlin Li
          Rooted quasi-Stirling permutations of general multisets
  • William Linz
          s-Catalan numbers and Littlewood-Richardson polynomials
  • John Machacek
          Lattice walks ending on a coordinate hyperplane avoiding backtracking and repeats
  • Johann A. Makowsky
          Harary polynomials
  • Kostas Manes
          Bijections for Dyck paths with colored hills.
  • Kazunori Matsuda
          The regularity and $h$-polynomial of Cameron-Walker 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
  • Xavier Mootoo,       The Grőbner basis of a Catalan path ideal
  • Alejandro H. Morales
          Hurwitz numbers for reflection groups I: generatingfunctionology
  • Sajal Mukherjee
          Counting on matrices
  • Sanjay Mukherjee
          Counting on matrices
  • Shashikant Mulay
          Semi-invariants of binary forms and symmetrized graph-monomials
  • Olivia Nabawanda
          Peaks are preserved under run-sorting
  • Oliver Pechenik
         Curious cyclic sieving on increasing tableaux
  • Ross G. Pinsky
          A view from the bridge spanning combinatorics and probability
  • Renzo Pinzani
          Non-overlapping matrices via Dyck words
  • Helmut Prodinger
          Retakh's Motzkin paths and some combinatorial comments
          Philippe Flajolet's early work in combinatorics
          Enumeration of partial Łukasiewicz paths
  • James Propp
          Brussels sprouts, noncrossing trees, and parking functions
  • 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
  • Shulamit Reches
          On the sparseness of the downsets of permutations via their number of separators
          Counting king permutations on the cylinder
  • Andrés Ramos Rodríguez
          Counting k-Naples parking functions through permutations and the k-Naples area statistic
  • Martin Rubey
          An equidistribution involving invisible inversions
  • Matthias Schork
          Recent developments in combinatorial aspects of normal ordering
  • Alfred Schreiber
          Inverse relations and reciprocity laws involving partial Bell polynomials and related extensions
  • Mark Shattuck
          A formula relating Bell polynomials and Stirling numbers of the first kind
  • 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
  • Mark Skandera
          Generating functions for monomial characters of wreath products ℤ/dℤ≀ 𝕾_n
  • Chunwei Song
          On combinatorial rectangles with minimum -discrepancy
  • George Spahn
          Automatic counting of generalized Latin rectangles and trapezoids
  • Einar Steingrímsson
          The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
  • Zachary Stier
          Dihedral sieving on cluster complexes
  • Jessica Striker
         Curious cyclic sieving on increasing tableaux
  • Eunice Sukarto
          Counting k-Naples parking functions through permutations and the k-Naples area statistic
  • 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
  • Joshua P. Swanson
         Curious cyclic sieving on increasing tableaux
  • Ioannis Tasoulas
          Bijections for Dyck paths with colored hills.
  • Bridget E. Tenner
          Forced perimeter in Elnitksy polygons
          Boolean intersection ideals of permutations in the Bruhat order
  • Peter Tittmann
          On the activities and partitions of the vertex subsets of graphs
  • Jessica A. Tomasko
          Restricted Grassmannian permutations
  • 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
  • Andrés R. Vindas-Meléndez
          Counting k-Naples parking functions through permutations and the k-Naples area statistic
  • Vedarth Vyas,       The Grőbner basis of a Catalan path ideal
  • Danielle Wang
          The convex hull of parking functions of length n
  • Julian Wellman
          Dihedral sieving on cluster complexes
  • Zixuan Xu
          Dihedral sieving on cluster complexes
  • Bowen Yao
          On combinatorial rectangles with minimum -discrepancy
  • Ae Ja Yee
          Schmidt type partitions
  • Doron Zeilberger
          There are EXACTLY 149380...9556 Ways to Derange a Standard Deck of Cards (Ignoring Suits) [and Many Other Such Useful Facts]
          Automatic counting of generalized Latin rectangles and trapezoids
          Counting condorcet
  • Di Zhao
          Symmetric and asymmetric peaks or valleys in (partial) Dyck paths



  • Interviews in ECA

    Usually, we decide which person we want to interview. Sometimes we are advised to interview some well-known researchers in combinatorics. For example, Stanley suggested interviewing Knuth! (and some others.)
    How do we make it? We have a list of (almost) similar questions to all mathematicians we interview. We screen the page, papers, history etc, related to the person we interview, and on our judgment, we ask specific questions (which could take several days). We never do tricks of asking the same questions. However, we do not exclude the possibility of a similar question being asked before.
    After fixing the file of the questions, we ask the interviewee to fill in by writing all the questions (the interviewee has the right not to answer all the questions) in his/her suitable time. When we at ECA receive the file with the answers, do the following procedure:
    (1) Making the style of the journal by adding a profile picture that is fixed by the interviewee. Sometimes some questions and some answers are removed to make the interview more interesting and less repeated. During editing, we usually suggest some footnotes (references/links) to clarify the text to the readers.
    (2) Our language team, makes proofreading the interview and prepares the final version (this could take a few days).
    (3) After all, the file will be sent to the interviewee, for his proof. There could be more than one round. In this step, always we ask the interviewee to agree with "This is to confirm that I do agree that the article (including the photos and figures) with the interview I had with Toufik Mansour for ECA is licensed and released under the CC BY-ND LICENSE; CREATIVE COMMONS ATTRIBUTION 4.0 INTERNATIONAL LICENSE".

    Interview Index

    Karim Adiprasito, Michael Albert, Noga Alon, George E. Andrews, Edward A. Bender, Maria Chudnovsky, Ira Gessel, Larry Guth, Gil Kalai, Don Knuth, Igor Pak, Greta Panova, Peter Paule, Tomaž Pisanski, Helmut Prodinger, Andrei Raigorodskii, Amitai Regev, Victor Reiner, Bruce Sagan, Carla D. Savage, Jeffrey Shallit, Richard P. Stanley, Einar Steingrímsson, Volker Strehl, Xavier Viennot, Van Vu, Lauren K. Williams, Doron Zeilberger, Yufei Zhao

    Volume 1 (2021), Number 1

    Back

    Volume 1 (2021), Number 2

    Back

    Volume 1 (2021), Number 3

    Back

    Volume 2 (2022), Number 1

    Back

    Volume 2 (2022), Number 2

    Back

    Volume 2 (2022), Number 3

    Back

    Volume 2 (2022), Number 4

    Special Issue: Permutation Patterns 2021
    Issue editors: David Bevan, Sergey Kitaev, and Einar Steingrímsson

    Back