Related papers: Palindromic and Colored Superdiagonal Compositions
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…
Steingrimsson's coloring complex and Jonsson's unipolar complex are interpreted in terms of hyperplane arrangements. This viewpoint leads to short proofs that all coloring complexes and a large class of unipolar complexes have convex ear…
Let $P$ be a planar $n$-gon with the sidelengths $a_1, \ldots, a_n$ and let us denote by $L=L(P)$ the corresponding planar polygonal linkage. We are concerned with the problem of finding conditions on the sidelengths $a_i$ which guarantee…
We study the distribution of palindromic numbers (with respect to a fixed base $g\ge 2$) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes $n\le x$ as $x\to\infty$. Our results show…
We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.
Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…
We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…
In this survey we overview known results and get several new results on digraph compositions which generalize several classes of digraphs, such as quasi-transitive digraphs. After an introductory section, the paper is divided into six…
We generalize Bj\"{o}rner and Stanley's poset of compositions to $m$-colored compositions. Their work draws many analogies between their (1-colored) composition poset and Young's lattice of partitions, including links to (quasi-)symmetric…
We consider the faces in pseudoline arrangements in which the pseudolines are colored with two colors. Bj\"orner, Las Vergnas, Sturmfels, White, and Ziegler conjecture the existence of a two-colored triangle in such arrangements. We…
In recent work, G. E. Andrews and G. Simay prove a surprising relation involving parity palindromic compositions, and ask whether a combinatorial proof can be found. We extend their results to a more general class of compositions that are…
A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…
We consider the potential function of the colored Jones polynomial for a link with arbitrary colors and obtain the cone-manifold structure for the link complement. In addition, we establish a relationship between a saddle point equation and…
In this paper, by considering two non-isospectral problems with matrices chosen on the color Lie algebra $\mathfrak{sp}_{1}(6)$, we construct (1+1)-dimensional and (2+1)-dimensional super integrable systems on $\mathfrak{sp}_{1}(6)$.…
We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the…
We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for the number of such compositions, the total number of parts…
This monograph presents a detailed analysis of hypercomplex numbers in 2, 3 and 4 dimensions, then presents the properties of hypercomplex numbers in 5 and 6 dimensions. It continues with a detailed analysis of hypercomplex numbers in n…
For a given Lie superalgebra, two ways of constructing color superalgebras are presented. One of them is based on the color superalgebraic nature of the Clifford algebras. The method is applicable to any Lie superalgebras and results in…
Extensions of a set partition obtained by imposing bounds on the size of the parts and the coloring of some of the elements are examined. Combinatorial properties and the generating functions of some counting sequences associated with these…