Related papers: Palindromic and Colored Superdiagonal Compositions

For quadratic spaces which represent 1 there is a characterization of hermitian compositions in the language of algebras-with-involutions using the even Clifford algebra. We extend this notion to define a generalized composition based on…

Given integers $a_1, a_2, ..., a_n$, with $a_1 + a_2 + ... + a_n \geq 1$, a symmetrically constrained composition $\lambda_1 + lambda_2 + ... + lambda_n = M$ of $M$ into $n$ nonnegative parts is one that satisfies each of the the $n!$…

We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.

The present note considers a certain family of sums indexed by the set of fixed length compositions of a given number. The sums in question cannot be realized as weighted compositions. However they can be be related to the hypergeometric…

Polypolyhedra (after R. Lang) are compounds of edge-transitive 1-skeleta. There are 54 topologically different polypolyhedra, and each has icosidodecahedral, cuboctahedral, or tetrahedral symmetry, all are realizable as modular origami…

In this paper, we construct the supersymmetric spinning polynomials. These are orthogonal polynomials that serve as an expansion basis for the residue or discontinuity of four-point scattering amplitudes, respecting four-dimensional super…

We study three classes of combinatorial sums involving central binomial coefficients and harmonic numbers, odd harmonic numbers, and even indexed harmonic numbers, respectively. In each case we use summation by parts to derive recursive…

The colored quasisymmetric functions, like the classic quasisymmetric functions, are known to form a Hopf algebra with a natural peak subalgebra. We show how these algebras arise as the image of the algebra of colored posets. To effect this…

In this paper we introduce mixed coloured permutation, permutations with certain coloured cycles, and study the enumerative properties of these combinatorial objects. We derive the generating function, closed forms, recursions and…

Sudoku grids can be thought of as graphs where the vertices are the squares of the grid, and edges join vertices in the same row, column, or sub-grid. A Sudoku puzzle corresponds to a partial proper coloring of the Sudoku graph. We provide…

In this paper, we show that there is a one-to-one correspondence between the set of compositions (resp. prime compositions) of $n$ and the set of circulant digraphs (resp. connected circulant digraphs) of order $n$. We also show that there…

A simply colored coalgebra is a coassociative counital coalgebra $C$ over an arbitrary ring $R$, which can be decomposed into a direct sum of two $R$-modules: one generated by set-like elements and another consisting of conilpotent…

The purpose of this paper is twofold. Firstly, we generalize the notion of characteristic polynomials of hyperplane and toric arrangements to those of certain abelian Lie group arrangements. Secondly, we give two interpretations for the…

An upward planar order on an acyclic directed graph $G$ is a special linear extension of the edge poset of $G$ that satisfies the nesting condition. This order was introduced to combinatorially characterize upward plane graphs and…

A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…

We generalize the notion of a coloring complex of a graph to linearized combinatorial Hopf monoids. We determine when a linearized combinatorial Hopf monoid has such a construction, and discover some inequalities that are satisfied by the…

In this paper we consider particular generalized compositions of a natural number with a given number of parts. Its number is a weighted polynomial coefficient. The number of all generalized compositions of a natural number is a weighted…

Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…