Related papers: Introduction to the combinatorial atlas
Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…
Using generating functions, we derive many identities involving balancing and Lucas-balancing polynomials. By relating these polynomials to Chebyshev polynomials of the first and second kind, and Fibonacci and Lucas numbers, we offer some…
We introduce poly-Cauchy permutations that are enumerated by the poly-Cauchy numbers. We provide combinatorial proofs for several identities involving poly-Cauchy numbers and some of their generalizations. The aim of this work is to…
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…
We establish, for every family of orthogonal polynomials in the $ q $-Askey scheme and the Askey scheme, a combinatorial model for mixed moments and coefficients in terms of paths on the lecture hall graph. This generalizes the previous…
Using the algebraic structure of the Stone-Cech compactification of the integers, Furstenberg and Glasner proved that for arbitrary k, every piecewise syndetic set contains a piecewise syndetic set of k-term arithmetic progressions. We…
In this note, we discuss recently discovered counterexamples to Mordell's Pellian Equation Conjecture and the Ankeny-Artin-Chowla-Conjecture. We provide a verification of the counterexample to Mordell's Pellian Equation Conjecture that can…
Certain famous combinatorial sequences, such as the Catalan numbers and the Motzkin numbers, when taken modulo a prime power, can be computed by finite automata. Many theorems about such sequences can therefore be proved using Walnut, which…
We give a new construction of a Hopf algebra defined first by Reading whose bases are indexed by objects belonging to the Baxter combinatorial family (i.e., Baxter permutations, pairs of twin binary trees, etc.). Our construction relies on…
Shapiro proved an elegant convolution formula involving Catalan numbers of even index. This paper gives a simple combinatorial proof of his formula. In addition, we show that it is equivalent with the alternating convolution formula of…
In two articles by Barthel, Brasselet, Fieseler and Kaup, and, Bressler and Lunts, a combinatorial theory of intersection cohomology and perverse sheaves has been developed on fans. In the first one, one tried to present everything on an…
We show the Alon-Tarsi conjecture on Latin squares is equivalent to a very special case of a conjecture made independently by Hadamard and Howe, and to the non-vanishing of some interesting integrals over SU(n). Our investigations were…
In this paper we discuss algebraic, combinatorial and topological properties of singular virtual braids. On the algebraic side we state the relations between classical and virtual singular objects, in addition we discuss a Birman-like…
It is shown how the Beneath-and-Beyond algorithm can be used to yield another proof of the equivalence of V- and H-representations of convex polytopes. In this sense this paper serves as the sketch of an introduction to polytope theory with…
Sury's 2014 proof of an identity for Fibonacci and Lucas numbers (Identity 236 of Benjamin and Quinn's 2003 book: {\em Proofs that count: The art of combinatorial proof}) has excited a lot of comment. We give an alternate, telescoping,…
Generalizing the famous Bernstein-Kushnirenko Theorem, Khovanskii proved in 1978 a combinatorial formula for the arithmetic genus of the compactification of a generic complete intersection associated to a family of lattice polytopes.…
Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…
The purpose of this short note is to demonstrate how some techniques from additive combinatorics recently developed by Peluse and Peluse-Prendiville can be applied to give an alternative proof for a trilinear smoothing inequality originally…
We consider a dominance order on positive vectors induced by the elementary symmetric polynomials. Under this dominance order we provide conditions that yield simple proofs of several monotonicity questions. Notably, our approach yields a…
A well-known combinatorial theorem says that a set of n non-collinear points in the plane determines at least n distinct lines. Chen and Chv\'atal conjectured that this theorem extends to metric spaces, with an appropriated definition of…