Related papers: Compositions that are palindromic modulo $m$
Partial methods play an important role in formal methods and beyond. Recently such methods were developed for parity games, where polynomial-time partial solvers decide the winners of a subset of nodes. We investigate here how effective…
The purpose of this article is to motivate the study of invariant, and especially conformally invariant, differential pairings. Since a general theory is lacking, this work merely presents some interesting examples of these pairings,…
In this paper we introduce a generalization of palindromic continued fractions as studied by Adamczewski and Bugeaud. We refer to these generalized palindromes as $m$-palindromes, where $m$ ranges over the positive integers. We provide a…
A simple Parry number is a real number \beta>1 such that the R\'enyi expansion of 1 is finite, of the form d_\beta(1)=t_1...t_m. We study the palindromic structure of infinite aperiodic words u_\beta that are the fixed point of a…
Recently, Drema and Saikia (2023) proved several congruences modulo powers of 2 and 3 for overpartition triples with odd parts. We extend their list substantially. We prove several congruences modulo powers of 2 for overpartition k-tuples…
In combinatorial problems it is sometimes possible to define a $G$-equivariant mapping from a space $X$ of configurations of a system to a Euclidean space $\mathbb{R}^m$ for which a coincidence of the image of this mapping with an…
It is proved that the numerical semigroups associated to the combinatorial configurations satisfy a family of non-linear symmetric patterns. Also, these numerical semigroups are studied for two particular classes of combinatorial…
Using combinatorial techniques, we answer two questions about simple classical Lie groups. Define $N(G,m)$ to be the number of conjugacy classes of elements of finite order $m$ in a Lie group $G$, and $N(G,m,s)$ to be the number of such…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
A class of bilinear permutation polynomials over a finite field of characteristic 2 was constructed in a recursive manner recently which involved some other constructions as special cases. We determine the compositional inverses of them…
We review known results concerning powers and products of $(m,p)$-isometries with a view to providing elementary proofs based on properties of polynomials. We consider also the situation when $p=\infty$ where we find elements of graph…
A matroid M is cyclically orderable if there is a cyclic permutation of the elements of M such that any r consecutive elements form a basis in M. An old conjecture of Kajitani, Miyano, and Ueno states that a matroid M is cyclically…
In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…
We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…
Building on techniques used in the case of the disc, we use a variety of methods to develop formulae for the adjoints of composition operators on Hardy spaces of the upper half-plane. In doing so, we prove a slight extension of a known…
Gordon introduced a class of matroids $M(n)$, for prime $n\ge 2$, such that $M(n)$ is algebraically representable, but only in characteristic $n$. Lindstr\"om proved that $M(n)$ for general $n\ge 2$ is not algebraically representable if…
We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in the complex projective plane. Such pair of arrangements has an additional property: they admit conjugated equations on the ring…
In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this…
In 1999 Lyngs{\o} and Pedersen proposed a conjecture stating that every binary circular word of length $n$ with equal number of zeros and ones has an antipalindromic linear subsequence of length at least $\frac{2}{3}n$. No progress over a…
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…