Related papers: Combinators: A Centennial View
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
We introduce two new binary operations with combinatorial species; the arithmetic product and the modified arithmetic product. The arithmetic product gives combinatorial meaning to the product of Dirichlet series and to the Lambert series…
Conrey, Farmer, Keating, Rubinstein and Snaith have given a recipe that conjecturally produces, among others, the full moment polynomial for the Riemann zeta function. The leading term of this polynomial is given as a product of a factor…
In 2017, Davis, Nelson, Petersen, and Tenner [Discrete Math. 341 (2018),3249--3270] initiated the combinatorics of pinnacles in permutations. We provide a simple and efficient recursion to compute $p_n(S)$, the number of permutations of…
In 1920, P. A. MacMahon generalized the (classical) notion of divisor sums by relating it to the theory of partitions of integers. In this paper, we extend the idea of MacMahon. In doing so we reveal a wealth of divisibility theorems and…
What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…
Let the formal power series f in d variables with coefficients in an arbitrary field be a symmetric function decomposed as a series of Schur functions, and let f be a rational function whose denominator is a product of binomials of the form…
Schur multipliers were introduced by Schur in the early 20th century and have since then found a considerable number of applications in Analysis and enjoyed an intensive development. Apart from the beauty of the subject in itself, sources…
We present combinatorial operators for the expansion of the Kronecker product of irreducible representations of the symmetric group. These combinatorial operators are defined in the ring of symmetric functions and act on the Schur functions…
In the first section of this article, we recall Keel's well-known presentation of $Pic(\overline{\mathfrak{M}}_{0,n})$ using irreducible boundary divisors of $\overline{\mathfrak{M}}_{0,n}$ as generators, and describe a basis for…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…
Algebraic Combinatorics originated in Algebra and Representation Theory, studying their discrete objects and integral quantities via combinatorial methods which have since developed independent and self-contained lives and brought us some…
We find an explicit combinatorial gradient vector field on the well known complex S (Salvetti complex) which models the complement to an arrangement of complexified hyperplanes. The argument uses a total ordering on the facets of the…
The numerical Hilbert series combinatorics and the comodule Hilbert series combinatorics are introduced, and some applications are presented, including the MacMahon Master Theorem.
In the 1970's, Balas introduced the concept of disjunctive programming, which is optimization over unions of polyhedra. One main result of his theory is that, given linear descriptions for each of the polyhedra to be taken in the union, one…
A number of problems in theoretical physics share a common nucleus of combinatoric nature. It is argued here that Hopf algebraic concepts and techiques can be particularly efficient in dealing with such problems. As a first example, a brief…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix, Pach, and Pollack…
Lots of research focuses on the combinatorics behind various bases of cluster algebras. This paper studies the natural basis of a type A cluster algebra, which consists of all cluster monomials. We introduce a new kind of combinatorial…