Related papers: Combinatorics of Multicompositions
We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…
A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…
Generally, combinatorial design concerns with the arrangement of a finite set of elements into patterns (subsets, words, arrays) according to specified rules. The usefulness of this design method is that the number of input combination can…
Compositional data are commonly known as multivariate observations carrying relative information. Even though the case of vector or even two-factorial compositional data (compositional tables) is already well described in the literature,…
If $S$ is a cofinite set of positive integers, an "$S$-restricted composition of $n$" is a sequence of elements of $S$, denoted $\vec{\lambda}=(\lambda_1,\lambda_2,...)$, whose sum is $n$. For uniform random $S$-restricted compositions, the…
Partitions without sequences of consecutive integers as parts have been studied recently by many authors, including Andrews, Holroyd, Liggett, and Romik, among others. Their results include a description of combinatorial properties,…
Partitions with distinct even parts have long been the subject of extensive research. In this paper, We present some new perspectives on such partitions from a combinatorial viewpoint, and connect them with signed partitions and bicolored…
Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of…
In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…
A k-composition of n is a sequence of length k of positive integers summing up to n. In this paper, we investigate the number of k-compositions of n satisfying two natural coprimality conditions. Namely, we first give an exact asymptotic…
This paper aims to undertake an exploration of the behavior of the moduli space of line arrangements while establishing its combinatorial interplay with the incidence structure of the arrangement. In the first part, we investigate…
This paper is an introduction to a series of papers in which we give combinatorial models for certain important operads (including A-infinity and E-infinity operads, the little n-cubes operads, and the framed little disks operad) and…
This paper introduces a novel recurrent model for music composition that is tailored to the structure of polyphonic music. We propose an efficient new conditional probabilistic factorization of musical scores, viewing a score as a…
Combinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number $n_g$ of numerical…
Let $\fg$ be the Lie superalgebra $\fgl(m,n).$ Algorithms for computing the composition factors and multiplicities of Kac modules for $\fg$ were given by the second author in 1996, and by J. Brundan in 2003. We give a combinatorial proof of…
We present a simplified formulation of open intersection numbers, as an alternative to the theory initiated by Pandharipande, Solomon and Tessler. The relevant moduli spaces consist of Riemann surfaces (either with or without boundary) with…
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…
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…
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robustness and compression capability. Asymptotically, these codes provide better compression efficiency as the order of the underlying Fibonacci…
We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.