Boolean-Eulerian numbers count red-blue colored decreasing binary trees and equal 2^{n-1} times the nth Euler number; their polynomials are algebraic transforms of Eulerian polynomials that inherit gamma-positivity, real-rootedness, and zero interlacing.
Th\'eorie g\'eom\'etrique des polyn\^omes eul\'eriens , vol
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Boolean--Eulerian numbers
Boolean-Eulerian numbers count red-blue colored decreasing binary trees and equal 2^{n-1} times the nth Euler number; their polynomials are algebraic transforms of Eulerian polynomials that inherit gamma-positivity, real-rootedness, and zero interlacing.