Related papers: Eulerian pairs on Fibonacci words
The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian…
We introduce new recurrences for the type B and type D Eulerian polynomials, and interpret them combinatorially. These recurrences are analogous to a well-known recurrence for the type A Eulerian polynomials. We also discuss their…
A relationship between signed Eulerian polynomials and the classical Eulerian polynomials on $\mathfrak{S}_n$ was given by D\'{e}sarm\'{e}nien and Foata in 1992, and a refined version, called signed Euler-Mahonian identity, together with a…
We establish some new combinatorial identities involving Euler polynomials and balancing (Lucas-balancing) polynomials. The derivations use elementary techniques and are based on functional equations for the respective generating functions.…
In this paper, we study relations among several types of Eulerian polynomials from a combinatorial viewpoint. We establish an identity between the restricted Eulerian polynomials of types $A$ and $B$. As an application, we present a…
The notion of pairable functions is introduced and some of its properties are developed. In this connection the famous Euler identity is interpreted as a property of certain pairable functions and finite cyclic groups.
Given an $n$-vertex digraph $D$ and a labeling $\sigma:V(D)\to [n]$, we say that an arc $u\to v$ of $D$ is a descent of $\sigma$ if $\sigma(u)>\sigma(v)$. Foata and Zeilberger introduced a generating function $A_D(t)$ for labelings of $D$…
This paper develops the study of Fox pairings of a group $G$ from the viewpoint of group cohomology. We compute some cohomology groups of Fox pairings of $G$, where $G$ admits a Poincar\'{e} duality group pair. We also suggest fundamental…
Binomial-Eulerian polynomials were introduced by Postnikov, Reiner and Williams. In this paper, properties of the binomial-Eulerian polynomials, including recurrence relations and generating functions are studied. We present three…
We survey known results and open problems in abelian combinatorics on words. Abelian combinatorics on words is the extension to the commutative setting of the classical theory of combinatorics on words. The extension is based on…
If $u$ and $v$ are two words, the correlation of $u$ over $v$ is a binary word that encodes all possible overlaps between $u$ and $v$. This concept was introduced by Guibas and Odlyzko as a key element of their method for enumerating the…
The Eulerian numbers form a triangular array with many interesting properties. The numbers arise from various combinatorial and probabilistic interpretations, and have been studied in a variety of mathematical contexts. In this article we…
We introduce the affine Vogan diagrams of complex simple Lie algebras. These are generalizations of Vogan diagrams, and we study the involutions represented by them. We apply these diagrams to study the symmetric pairs, in particular the…
In this paper, we establish a connection between the 1/k-Eulerian polynomials introduced by Savage and Viswanathan (Electron. J. Combin. 19(2012), P9) and k-Stirling permutations. We also introduce the dual set of Stirling permutations.
Following a recent paper of Anselmo et al., we consider $m \times n$ rectangular matrices formed from the Fibonacci word, and we show that their balance properties can be solved with a finite automaton. We also generalize the result to…
Based on the Hermite--Biehler theorem, we simultaneously prove the real-rootedness of Eulerian polynomials of type $D$ and the real-rootedness of affine Eulerian polynomials of type $B$, which were first obtained by Savage and Visontai by…
This is an English translation of Euler's 1750 paper "De numeris amicabilibus" (E152), the most substantial of his three works with this name. In it, he expounds at great length the ad hoc methods he has developed to search for pairs of…
The paper explores combinatorial properties of Fibonacci words and their generalizations within the framework of combinatorics on words. These infinite sequences, measures the diversity of subwords in Fibonacci words, showing non-decreasing…
The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by…
We give a combinatorial proof of an identity that involves Eulerian numbers and was obtained algebraically by Brenti and Welker (2009). To do so, we study alcoved triangulations of dilated hypersimplices. As a byproduct, we describe the…