Related papers: The combinatorics of k-marked Durfee symbols
George Andrews and Mohamed El Bachraoui recently explored identities for two-color partitions. In particular, they studied the connection between two-colored partitions and overpartitions. Their proofs were analytical, but they conjectured…
This paper gives bijective proofs of some novel coinversion identities first discovered by Ayyer, Mandelshtam, and Martin (arxiv:2011.06117) as part of their proof of a new combinatorial formula for the modified Macdonald polynomials…
In a previous work [arXiv:2211.02945] we made an attempt to set up a discrete octonionic Stokes' formula. Due to an algebraic property that we have not considered in that attempt, the formula however turned out to involve an associator term…
The notion of the spt-crank of a vector partition, or an $S$-partition, was introduced by Andrews, Garvan and Liang. Let $N_S(m,n)$ denote the number of $S$-partitions of $n$ with spt-crank $m$. Andrews, Dyson and Rhoades conjectured that…
This paper contributes to the study of rank-metric codes from an algebraic and combinatorial point of view. We introduce $q$-polymatroids, the $q$-analogue of polymatroids, and develop their basic properties. We associate a pair of…
We prove that a curious generating series identity implies Faber's intersection number conjecture (by showing that it implies a combinatorial identity already given in arXiv:1902.02742) and give a new proof of Faber's conjecture by directly…
We propose and develop a theory of Ferrers diagrams and their $q$-rook polynomials solely based on their diagonals. We show that the cardinalities of the diagonals of a Ferrers diagram are equivalent information to their rook numbers,…
In this note we give some identities which involve the Mertens function M(n). Our proofs are combinatorial with relatively prime subsets as a main tool.
Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, in the form of a continued fraction, for a fourteen-parameter family of such sequences and interpret these in…
An identity that is reminiscent of the Littlewood identity plays a fundamental role in recent proofs of the facts that alternating sign triangles are equinumerous with totally symmetric self-complementary plane partitions and that…
We study combinatorial properties of a rational Dyck path by decomposing it into a tuple of Dyck paths. The combinatorial models such as $b$-Stirling permutations, $(b+1)$-ary trees, parenthesis presentations, and binary trees play central…
This paper describes a method to find a connection between combinatorial identities and hypergeometric series with a number of examples. Combinatorial identities can often be written as hypergeometric series with unit argument. In a number…
We present a method for proving q-series identities by combinatorial telescoping, in the sense that one can transform a bijection or a classification of combinatorial objects into a telescoping relation. We shall illustrate this method by…
The goal of this contribution is to explain the analogy between combinatorial Dyson-Schwinger equations and inductive data types to a readership of mathematical physicists. The connection relies on an interpretation of combinatorial…
Associate a unique numerical sequence called the modular signature with each positive integer, using modular residues of each integer under the prime numbers, and distinguishing between the core seed primes and non-core seed primes used to…
The need to test whether two random vectors are independent has spawned a large number of competing measures of dependence. We are interested in nonparametric measures that are invariant under strictly increasing transformations, such as…
Recently, Andrews gave a detailed study of partitions with even parts below odd parts in which only the largest even part appears an odd number of times. In this paper, we provide a combinatorial proof of the generating function identity of…
Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…
Springer numbers are an analog of Euler numbers for the group of signed permutations. Arnol'd showed that they count some objects called snakes, that generalize alternating permutations. Hoffman established a link between Springer numbers,…
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…