Related papers: Partially Palindromic Compositions
We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…
In this paper we develop the theory of operads, algebras and modules in cofibrantly generated symmetric monoidal model categories. We give J-semi model strucures, which are a slightly weaker version of model structures, for operads and…
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…
We prove a conjecture of Bourn and Willenbring (2020) regarding the palindromicity and unimodality of a certain family of polynomials $N_n(t)$. These recursively defined polynomials arise as the numerators of generating functions in the…
We use generating functions to enumerate Arndt compositions, that is, integer compositions where there is a descent between every second pair of parts, starting with the first and second part, and so on. In 2013, J\"org Arndt noted that…
We show that the compositions of positive integers may be interpreted in terms of powers of some power series, over arbitrary commutative ring. As consequences, several closed formulas for the compositions as well as for the generalized…
We provide new formulas for the coefficients in the partial fraction decomposition of the restricted partition generating function. These techniques allow us to partially resolve a recent conjecture of Sills and Zeilberger. We also describe…
Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…
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 partially ordered (generalized) pattern (POP) is a generalized pattern some of whose letters are incomparable, an extension of generalized permutation patterns introduced by Babson and Steingrimsson. POPs were introduced in the symmetric…
Compounding submodular monotone (i.e. 2-alternating) set functions on a finite set preserves this property, as shown in 2010. A natural generalization to k-alternating functions was presented in 2018, however hardly readable because of page…
We extend the classical Ostrowski numeration systems, closely related to Sturmian words, by allowing a wider range of coefficients, so that possible representations of a number $n$ better reflect the structure of the associated Sturmian…
We introduce a notion of palindromicity of a natural number which is independent of the base. We study the existence and density of palindromic and multiple palindromic numbers, and we raise several related questions.
Several authors have introduced various type of coherent-like rings and proved analogous results on these rings. It appears that all these relative coherent rings and all the used techniques can be unified. In [2], several coherent-like…
Imprecise probability is concerned with uncertainty about which probability distributions to use. It has applications in robust statistics and machine learning. We look at programming language models for imprecise probability. Our…
In 2013, Joerg Arndt recorded that the Fibonacci numbers count integer compositions where the first part is greater than the second, the third part is greater than the fourth, etc. We provide a new combinatorial proof that verifies his…
In this paper, we study modularity of several functions which naturally arose in a recent paper of Lau and Zhou on open Gromov-Witten potentials of elliptic orbifolds. They derived a number of examples of indefinite theta functions, and we…
In this paper we consider the palindromes that can be formed by taking unordered sets of $n$ elements from an alphabet of $b$ letters. In particular, we seek to find the probability that given a random member of this space we are able to…
We study the so-called closed and splitting subsemimodules and submodules of a given semimodule or module, respectively. We describe lattices of subsemimodules and of closed subsemimodules and posets of splitting subsemimodules and…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…