相关论文: Boolean--Eulerian numbers

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one…

This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…

In this paper, we define the notion of descent for the paths in the $p$-Bratteli diagram. This leads to the definition of $p^{k}$-Eulerian polynomials, whose coefficients count the number of paths with a given number of descents. We provide…

Gessel conjectured that the two-sided Eulerian polynomial, recording the common distribution of the descent number of a permutation and that of its inverse, has non-negative integer coefficients when expanded in terms of the gamma basis.…

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…

In this paper, we give a type B analogue of the 1/k-Eulerian polynomials. Properties of this kind of polynomials, including combinatorial interpretations, recurrence relations and gamma-positivity are studied. In particular, we show that…

We define a generalization of the Eulerian polynomials and the Eulerian numbers by considering a descent statistic on segmented permutations coming from the study of 2-species exclusion processes and a change of basis in a Hopf algebra. We…

Motivated by the classical Eulerian number, descent and excedance numbers in the hyperoctahedral groups, an triangular array from staircase tableaux and so on, we study a triangular array $[\mathcal {T}_{n,k}]_{n,k\ge 0}$ satisfying the…

The binomial Eulerian polynomials, introduced by Postnikov, Reiner, and Williams, are $\gamma$-positive polynomials and can be interpreted as $h$-polynomials of certain flag simplicial polytopes. Recently, Athanasiadis studied analogs of…

The Eulerian polynomials and derangement polynomials are two well-studied generating functions that frequently arise in combinatorics, algebra, and geometry. When one makes an appearance, the other often does so as well, and their…

We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string…

The Eulerian numbers count permutations according to the number of descents. The two-sided Eulerian numbers count permutations according to number of descents and the number of descents in the inverse permutation. Here we derive some…

Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…

In 1998, B\"{o}cker and Dress gave a 1-to-1 correspondence between symbolically dated rooted trees and symbolic ultrametrics. We consider the corresponding problem for unrooted trees. More precisely, given a tree $T$ with leaf set $X$ and a…

The Collatz conjecture states that repeated steps of $n\mathrm{\to }\mathrm{3}n\mathrm{+1}$ at odd numbers and $n\mathrm{\to }n\mathrm{/2}$ at even numbers amount to walks over root paths to the branching number $c=4$ in the `trivial'…

We present a unified algebraic framework utilizing the formal Bell transform to bridge the Dirichlet convolution of arithmetic functions with the combinatorial structure of infinite Euler-type products. By analyzing the logarithmic…

Eulerian polynomials record the distribution of descents over permutations. Caylerian polynomials likewise record the distribution of descents over Cayley permutations, where a Cayley permutation is a word of positive integers such that if…

Many mathematicians have been studying various degenerate versions of special polynomials and numbers in some arithmetic and combinatorial aspects. Our main focus here is a new type of degenerate poly-Euler polynomials and numbers. This…

We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…

Carlitz and Scoville introduced the polynomials $A_n(x,y|{\alpha},{\beta})$, which we refer to as the $(\alpha, \beta)$-Eulerian polynomials. These polynomials count permutations based on Eulerian-Stirling statistics, including descents,…