Related papers: Counting parity palindrome compositions
We introduce poly-Cauchy permutations that are enumerated by the poly-Cauchy numbers. We provide combinatorial proofs for several identities involving poly-Cauchy numbers and some of their generalizations. The aim of this work is to…
We achieve compositions rules for the geometric parameters of the composed rotations, which is in a certain sense analogous to the well known Rodrigues formula. We also obtain a necessary and sufficient condition for a composition of two…
We propose the formula for the number of pairs of consecutive primes $p_n, p_{n+1}<x$ separated by gap $d=p_{n+1}-p_n$ expressed directly by the number of all primes $<x$, i.e. by $\pi(x)$. As the application of this formula we formulate 7…
Andrews once gave $q$-analogues of a binomial congruence of Glaisher, and he suggested perfect $q$-analogues. In this note we give ones meeting the demand of Andrews.
In this article I study pairing of two interacting particles in ideal 1D, 2D and Bethe lattices. I employ the method of recursion that has been formulated recently by Berciu et. al. to compute the pair functions in real space without…
We give a direct deduction and proof of two identities in the theory of plane partitions. The first one is known to enumerate the traces of plane partitions. The second one comes without any combinatorial interpretation.
The Permutation Pattern Matching problem asks, given two permutations $\sigma$ on $n$ elements and $\pi$, whether $\sigma$ admits a subsequence with the same relative order as $\pi$ (or, in the counting version, how many such subsequences…
We formalise, in Coq, the opening sections of Parity Complexes [Street1991] up to and including the all important excision of extremals algorithm. Parity complexes describe the essential combinatorial structure exhibited by simplexes, cubes…
In a recent paper the first two authors proved that the generating series of the Poincare polynomials of the quasihomogeneous Hilbert schemes of points in the plane has a simple decomposition in an infinite product. In this paper we give a…
A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…
We prove that the double covers of the alternating and symmetric groups are determined by their complex group algebras. To be more precise, let $n\geq 5$ be an integer, $G$ a finite group, and let $\AAA$ and $\SSS^\pm$ denote the double…
This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…
A derivation of Balmer's formula is presented, guided by the principles of simplicity and harmony.
We prove several general formulas for the distributions of various permutation statistics over any set of permutations whose quasisymmetric generating function is a symmetric function. Our formulas involve certain kinds of plethystic…
This work presents a recursive construction for simple $t$-designs using resolutions of the ingredient designs. The result extends a construction of $t$-designs in our recent paper [39]. Essentially, the method in [39] describes the blocks…
We introduce a sieve for counting twin primes up to a given range. Our method depends on a parameter ${\lambda}_x$ and the estimation of the number of twin primes obtained as a result, is called a fundamental structure of the distribution…
We obtain a very simple formula for the generating function of bipartite (resp. quasi-bipartite) planar maps with boundaries (holes) of prescribed lengths, which generalizes certain expressions obtained by Eynard in a book to appear. The…
We prove the 169 compositions of time interval relations. The proof is first-order and inferred from an axiomatic system on time intervals. We show a general proof template that can alleviate the manual proof with Isar.
Defining a family of recurrences, we generalize Comtet's formula for the generating function of the enumeration of indecomposable permutations. Consequently, we generalize Panaitopol's asymptotic expansion for the prime counting function,…
In this note we give three identities for partitions with parts separated by parity, which were recently introduced by Andrews.