English
Related papers

Related papers: Boolean--Eulerian numbers

200 papers

We provide combinatorial interpretation for the $\gamma$-coefficients of the basic Eulerian polynomials that enumerate permutations by the excedance statistic and the major index as well as the corresponding $\gamma$-coefficients for…

Combinatorics · Mathematics 2015-05-01 Zhicong Lin , Jiang Zeng

The classical Eulerian polynomials can be expanded in the basis $t^{k-1}(1+t)^{n+1-2k}$ ($1\leq k\leq\lfloor (n+1)/2\rfloor$) with positive integral coefficients. This formula implies both the symmetry and the unimodality of the Eulerian…

Combinatorics · Mathematics 2012-04-02 Guoniu Han , Frédéric Jouhet , Jiang Zeng

At a crossroads of calculus and combinatorics, the generating function of secant and tangent numbers (Euler numbers) provides enumeration of alternating permutations. In this article, we present a new refinement of Euler numbers to answer…

Combinatorics · Mathematics 2020-11-17 Masato Kobayashi

We study a family of symmetric polynomials that we refer to as the Boolean product polynomials. The motivation for studying these polynomials stems from the computation of the characteristic polynomial of the real matroid spanned by the…

Combinatorics · Mathematics 2018-06-11 Louis J. Billera , Sara C. Billey , Vasu Tewari

Eulerian polynomials are fundamental in combinatorics and algebra. In this paper we study the linear transformation $\mathcal{A} : \mathbb{R}[t] \to \mathbb{R}[t]$ defined by $\mathcal{A}(t^n) = A_n(t)$, where $A_n(t)$ denotes the $n$-th…

Combinatorics · Mathematics 2021-08-12 Petter Brändén , Katharina Jochemko

We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…

Combinatorics · Mathematics 2011-02-01 Victor N. Ermolaev , Giulio Iacobelli

We study the roots of generalized Eulerian polynomials via a novel approach. We interpret Eulerian polynomials as the generating polynomials of a statistic over inversion sequences. Inversion sequences (also known as Lehmer codes or…

Combinatorics · Mathematics 2014-12-09 Carla D. Savage , Mirkó Visontai

Motivated by the work of Visontai and Dey-Sivasubramanian on the gamma-positivity of some polynomials, we find the commutative property of a pair of Eulerian operators. As an application, we show the bi-gamma-positivity of the descent…

Combinatorics · Mathematics 2022-10-25 Shi-Mei Ma , Hao Qi , Jean Yeh , Yeong-Nan Yeh

We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…

Combinatorics · Mathematics 2015-09-28 Antoine Genitrini , Bernhard Gittenberger , Veronika Kraus , Cécile Mailler

In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this…

Combinatorics · Mathematics 2020-02-20 José Aliste-Prieto , Anna de Mier , José Zamora

We consider several generalizations of the classical $\gamma$-positivity of Eulerian polynomials (and their derangement analogues) using generating functions and combinatorial theory of continued fractions. For the symmetric group, we prove…

Combinatorics · Mathematics 2022-03-22 Heesung Shin , Jiang Zeng

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

Combinatorics · Mathematics 2012-01-13 Edinah K. Gnang , Chetan Tonde

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…

Combinatorics · Mathematics 2014-07-22 Amritanshu Prasad

We introduce a refinement of Boolean-Catalan numbers and call them Boolean-Narayana numbers. We provide an explicit formula for these numbers, and prove unimodality, log-concavity, and real-roots-only results for their sequences. We also…

Combinatorics · Mathematics 2026-04-14 Miklos Bona

Many combinatorial and other number triangles are solutions of recurrences of the Graham-Knuth-Patashnik (GKP) type. Such triangles and their defining recurrences are investigated analytically. They are acted on by a transformation group…

Combinatorics · Mathematics 2025-02-17 Robert S. Maier

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…

Combinatorics · Mathematics 2025-02-14 Yang Li , Zhicong Lin

This paper develops methods to study the distribution of Eulerian statistics defined by second-order recurrence relations. We define a random process to decompose the statistics over compositions of integers. It is shown that the numbers of…

Probability · Mathematics 2022-10-20 Alperen Y. Özdemir

In this paper we present grammatical interpretations of the alternating Eulerian polynomials of types A and B. As applications, we derive several properties of the type B alternating Eulerian polynomials, including combinatorial expansions,…

Combinatorics · Mathematics 2021-06-25 Shi-Mei Ma , Qi Fang , Toufik Mansour , Yeong-Nan Yeh

The aim of this paper is twofold. Firstly, we investigate a finite sum involving the generalized falling factorial polynomials, in some special cases of which we express it in terms of the degenerate Stirling numbers of the second kind, the…

Number Theory · Mathematics 2023-01-11 Taekyun Kim , Dae San Kim

We show that every Borel graph $G$ of subexponential growth has a Borel proper edge-coloring with $\Delta(G) + 1$ colors. We deduce this from a stronger result, namely that an $n$-vertex (finite) graph $G$ of subexponential growth can be…

Combinatorics · Mathematics 2024-08-22 Anton Bernshteyn , Abhishek Dhawan