Related papers: Counting parity palindrome compositions
We show how confluence criteria based on decreasing diagrams are generalized to ones composable with other criteria. For demonstration of the method, the confluence criteria of orthogonality, rule labeling, and critical pair systems for…
We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…
In the present work the existence of some patterns of primes is shown which generalize the celebrated result of Green and Tao according to which there are arbitrarily long arithmetic progressions in the sequence of primes
We prove, under mild conditions on fixed points and two cycles, the asymptotic normality of vincular pattern counts for a permutation chosen uniformly at random in a conjugacy class.Additionally, we prove that the limiting variance is…
We prove a general divisibility theorem that implies, e.g., that, in any group, the number of generating pairs (as well as triples, etc.) is a multiple of the order of the commutator subgroup. Another corollary says that, in any associative…
In this paper, we will study the simplest kind of beauty that can be found in a simple piece of music and can be appreciated universally. The proposed approach shows that aesthetically appealing patterns deliver higher amount of information…
We derived the sum identities for generalized harmonic and corresponding oscillatory numbers for which a sieve procedure can be applied. The obtained results enable us to understand better the properties of these numbers and their…
We study which standard operators of probabilistic process calculi allow for compositional reasoning with respect to bisimulation metric semantics. We argue that uniform continuity (generalizing the earlier proposed property of…
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…
We consider the problem of counting the occurrences of patterns of the form $xy-z$ within flattened permutations of a given length. Using symmetric functions, we find recurrence relations satisfied by the distributions on $\mathcal{S}_n$…
In 2013, Fici and Zamboni proved a number of theorems about finite and infinite words having only a small number of factors that are palindromes. In this paper we rederive some of their results, and obtain some new ones, by a different…
In this paper we prove that for any infinite word W whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes are palindromes; (II) P(n) + P(n+1) = C(n+1) - C(n) + 2 for…
We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…
The p-adic formulation of replica symmetry breaking is presented. In this approach ultrametricity is a natural consequence of the basic properties of the p-adic numbers. Many properties can be simply derived in this approach and p-adic…
In 2017, E. Panzer proved the parity theorem for multiple polylogarithms. While his proof is simple and constructive, it does not yield a general explicit formula. Inspired by M. Hirose's recent work on the parity theorem for multiple zeta…
A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a…
The use of compositions simplifies some aspects of the theory of numerical semigroups. We illustrate this by giving a new proof for the asymptotic number C((1 + $\sqrt$ 5)/2) g of numerical semigroups of genus g and by describing the…
A strongly concave composition of $n$ is an integer partition with strictly decreasing and increasing parts. In this paper we give a uniform asymptotic formula for the rank statistic of a strongly concave composition introduced by Andrews,…
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…
This note is devoted to a combinatorial proof of a Schmidt type theorem due to Andrews and Paule. A four-variable refinement of Andrews and Paule's theorem is also obtained based on this combinatorial construction.