Related papers: Eulerian pairs on Fibonacci words
In this study, the new algebraic properties related to bivariate Fibonacci polynomials has been given. We present the partial derivatives of these polynomials in the form of convolution of bivariate Fibonacci polynomials. Also, we define a…
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a Fibonacci graph which gives a generic example of non-series-parallel graphs. Our intention in this paper is to simplify the…
Suppose $(G,G')$ is a dual pair of subgroups of a metaplectic group. The dual pair correspondence is a bijection between (subsets of the) irreducible representations of $G$ and $G'$, defined by the non-vanishing of…
We prove that the partial order on the set of matchings of 2n points on a circle, given by resolving crossings, is an Eulerian poset.
The numbers of even and odd permutations with a given ascent number are investigated using an operator that was previously introduced by the author. Their difference is called a signed Eulerian number. By means of the operator the…
This note studies the behavior of Euler characteristics and of intersection homology Euler characterstics under proper morphisms of algebraic (or analytic) varieties. The methods also yield, for algebraic (or analytic) varieties, formulae…
We investigate connections between pairs of (pseudo-)Riemannian metrics whose sum is a (tensor) product of a covector field with itself. A bijective mapping between the classes of Euclidean and Lorentzian metrics is constructed as a special…
First we recall homology groups of prer Lie superalgebras. Then introducing double weighted chain spaces, we deal with pre Lie superalgebra of multi-vector fields with polynomial coefficients on n-dimensional number space. The bracket is…
In light of the grammar given by Ji for the $(\alpha,\beta)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the…
We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…
In Roger Howe's 1989 paper, ``Remarks on classical invariant theory," Howe introduces the notion of a dual pair of Lie subalgebras: a pair $(\mathfrak{g}_1, \mathfrak{g}_2)$ of reductive Lie subalgebras of a Lie algebra $\mathfrak{g}$ such…
The following article summarizes research where theorems and their respective demonstrations are postulated based on quadratic equations with special properties given by the Pythagorean triplets and the Fibonacci sequence given the second…
We show that the 2-associahedra are Eulerian, by exploiting their recursive structure.
We observe that three context-free grammars of Dumont can be brought to a common ground, via the idea of transformations of grammars, proposed by Ma-Ma-Yeh. Then we develop a unified perspective to investigate several combinatorial objects…
A correlation is a binary vector that encodes all possible positions of overlaps of two words, where an overlap for an ordered pair of words (u,v) occurs if a suffix of word u matches a prefix of word v. As multiple pairs can have the same…
In this paper, we analyze the density of the Fibonacci word and its derived forms by examining the morphisms associated with each. It offers a comparative analysis of the density of Fibonacci numbers alongside other words derived from…
We prove that the Eulerian polynomial satisfies certain polynomial congruences. Furthermore, these congruences characterize the Eulerian polynomial.
There is a natural notion of a subdivision of a lower Eulerian poset called a strong formal subdivision, which abstracts the notion of a polyhedral subdivision of a polytope, or a proper, surjective morphism of fans. We show that there is a…
Following the treatment of Blass and Sagan, we present an algorithmic bijection between the Eulerian equivalence classes of totally cyclic orientations and the spanning trees without internal activity edges for a given graph.
Defining the biperiodic Fibonacci words as a class of words over the alphabet $\{0,1\}$, and two specializations the $k-$Fibonacci and classical Fibonacci words, we provide a self-similar decomposition of these words into overlapping words…