Following the ideas of L. Carlitz we introduce a generalization of the Bernoulli and Eulerian polynomials of higher order to vectorial index and argument. These polynomials are used for computation of the vector partition function $W({\bf s},{\bf D})$, i.e., a number of integer solutions to a linear system ${\bf x} \ge 0, {\bf D x} = {\bf s}$. It is shown that $W({\bf s},{\bf D})$ can be expressed through the vector Bernoulli polynomials of higher order.
The central binomial series at negative integers are expressed as a linear combination of values of certain two polynomials. We show that one of the polynomials is a special value of the bivariate Eulerian polynomial and the other polynomial is related to the antidiagonal sum of poly-Bernoulli numbers. As an application, we prove Stephan's observation from 2004.
We express the Nörlund polynomials in terms of the second-order Eulerian numbers. Based on this expression, we derive several identities related to the Bernoulli numbers. In particular, we present a short proof of the problem raised by Rzcadkowski and Urlińska.
In this paper, which is a complement of \cite{BG}, we study a few elementary invariants for configurations of skew lines, as introduced and analyzed first by Viro and his collaborators. We slightly simplify the exposition of some known invariants and use them to define a natural partition of the lines in a skew configuration. We also describe an algorithm which constructs a spindle-permutation for a given switching class, or proves non-existence of such a spindle-permutation.
We suggest a combinatorial method of encoding continuous symbolic dynamical systems. A~continuous phase space, the infinite-dimensional cube, turns into the path space of a tree, and the shift is mapped to a transformation which was called a "transfer." The central problem is that of distinguishability: does the encoding separate almost all points of the space? The main result says that the partition of the cube into Weyl simplices satisfies this property.\footnote{{\it Keywords:} combinatorial encoding, transfer, Bernoulli scheme, graded graph.
In this Ph.D. dissertation (2018, Emory University) we prove theorems at the intersection of the additive and multiplicative branches of number theory, bringing together ideas from partition theory, $q$-series, algebra, modular forms and analytic number theory. We present a natural multiplicative theory of integer partitions (which are usually considered in terms of addition), and explore new classes of partition-theoretic zeta functions and Dirichlet series -- as well as "Eulerian" $q$-hypergeometric series -- enjoying many interesting relations. We find a number of theorems of classical numb…
We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an arbitrary order in a sequence, are in bijection with permutations. The permutation decomposes canonically, by inserting parentheses, into a tree having as nodes a class of permutations which we call primitive. Primitive permutations can be assembled from very simple data. The data for the trees into which a permutation decomposes can be written in a form si…
We prove a lower bound expansion on the probability that a random $\pm 1$ matrix is singular, and conjecture that such expansions govern the actual probability of singularity. These expansions are based on naming the most likely, second most likely, and so on, ways that a Bernoulli matrix can be singular; the most likely way is to have a null vector of the form $e_i \pm e_j$, which corresponds to the integer partition 11, with two parts of size 1. The second most likely way is to have a null vector of the form $e_i \pm e_j \pm e_k \pm e_\ell$, which corresponds to the partition 1111. The fifth…
We give a new combinatorial interpretation of the stationary distribution of the (partially) asymmetric exclusion process on a finite number of sites in terms of decorated alternative trees and colored permutations. The corresponding expressions of the multivariate partition functions are then related to multivariate generalizations of Eulerian polynomials for colored permutations considered recently by N. Williams and the third author, and others. We also discuss stability-- and negative dependence properties satisfied by the partition functions.
We define some generalizations of the classical descent and inversion statistics on signed permutations that arise from the work of Sack and Ulfarsson [20] and called after width-k descents and width-k inversionsof type A in Davis's work [8]. Using the aforementioned new statistics, we derive some new generalizations of Eulerian polynomials of type A, B and D. It should also be noticed that we establish the Gamma-positivity of the "width-k" Eulerian polynomials and we give a combinatorial interpretation of finite sequences associated to these new polynomials using quasisymmetric functions and …
We study asymptotic properties of sequences of partitions ($σ$\nobreakdash-algebras) in spaces with Bernoulli measures associated with the Robinson--Schensted--Knuth correspondence.
The functions satisfying the mean value property for an n-dimensional cube are determined explicitly. This problem is related to invariant theory for a finite reflection group, especially to a system of invariant differential equations. Solving this problem is reduced to showing that a certain set of invariant polynomials forms an invariant basis. After establishing a certain summation formula over Young diagrams, the latter problem is settled by considering a recursion formula involving Bernoulli numbers. Keywords: polyhedral harmonics; cube; reflection groups; invariant theory; invariant dif…
We introduce and study s-lecture hall P-partitions which is a generalization of s-lecture hall partitions to labeled (weighted) posets. We provide generating function identities for s-lecture hall P-partitions that generalize identities obtained by Savage and Schuster for s-lecture hall partitions, and by Stanley for P-partitions. We also prove that the corresponding (P,s)-Eulerian polynomials are real-rooted for certain pairs (P,s), and speculate on unimodality properties of these polynomials.
Recently, Hyatt introduced some colored Eulerian quasisymmetric function to study the joint distribution of excedance number and major index on colored permutation groups. We show how Hyatt's generating function formula for the fixed point colored Eulerian quasisymmetric functions can be deduced from the Decrease value theorem of Foata and Han. Using this generating function formula, we prove two symmetric function generalizations of the Chung-Graham-Knuth symmetrical Eulerian identity for some flag Eulerian quasisymmetric functions, which are specialized to the flag excedance numbers. Combina…
Weights of permutations were originally introduced by Dugan, Glennon, Gunnells, and Steingrímsson (Journal of Combinatorial Theory, Series A 164:24-49, 2019) in their study of the combinatorics of tiered trees. Given a permutation $σ$ viewed as a sequence of integers, computing the weight of $σ$ involves recursively counting descents of certain subpermutations of $σ$. Using this weight function, one can define a $q$-analog $E_n(x,q)$ of the Eulerian polynomials. We prove two main results regarding weights of permutations and the polynomials $E_n(x,q)$. First, we show that the coefficients of $…
In this paper, we first give formulas for the order polynomial $Ω(\Pw; t)$ and the Eulerian polynomial $e(\Pw; λ)$ of a finite labeled poset $(P, ω)$ using the adjacency matrix of what we call the $ω$-graph of $(P, ω)$. We then derive various recursion formulas for $Ω(\Pw; t)$ and $e(\Pw; λ)$ and discuss some applications of these formulas to Bernoulli numbers and Bernoulli polynomials. Finally, we give a recursive algorithm using a single linear operator on a vector space. This algorithm provides a uniform method to construct a family of new invariants for labeled posets $(\Pw)$, which includ…
We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent generating polynomial of the set of permutations of a totally ordered $n$-set, known as the Eulerian polynomial. We show how this extension shares some of the properties of the classical one. B. Drake proved that this polynomial factors completely over the integers. From his product formula it can be concluded that this polynomial has positive coefficients in the $γ…
We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex degrees. The mapping from blossoming trees to maps is a generalization to unfixed genus of Schaeffer's closing construction for planar Eulerian maps. The inverse mapping relies on the existence of canonical orientations which allow to equip the maps with canonical spanning trees, as proved by Bernardi. Our bijection gives in particular (here in the Eulerian case) a…
We introduce a partition of (coweight) lattice points inside the dilated fundamental parallelepiped into those of partially closed simplices. This partition can be considered as a generalization and a lattice points interpretation of the classical formula of Worpitzky. This partition, and the generalized Eulerian polynomial, recently introduced by Lam and Postnikov, can be used to describe the characteristic (quasi)polynomials of Shi and Linial arrangements. As an application, we prove that the characteristic quasi-polynomial of the Shi arrangement turns out to be a polynomial. We also present…
These notes are designed to offer some (perhaps new) codicils to related work, a list of problems and conjectures seeking (preferably) combinatorial proofs. The main items are Eulerian polynomials and hook/contents of Young diagram, mostly on the latter. We also have items on Frobenius theorem and multi-core partitions; most recently, some problems on (what we call) colored over-partitions. Formulas analogues to or in the spirit of works by Han, Nekrasov-Okounkov and Stanley are distributed throughout. Concluding remarks are provided at the end in hopes of directing the interested researcher, …
For any $n > 0$ and $0 \leq m < n$, let $P_{n,m}$ be the poset of projective equivalence classes of $\{-,0,+\}$-vectors of length $n$ with sign variation bounded by $m$, ordered by reverse inclusion of the positions of zeros. Let $Δ_{n,m}$ be the order complex of $P_{n,m}$. A previous result from the third author shows that $Δ_{n,m}$ is Cohen-Macaulay over $\mathbb{Q}$ whenever $m$ is even or $m = n-1$. Hence, it follows that the $h$-vector of $Δ_{n,m}$ consists of nonnegative entries. Our main result states that $Δ_{n,m}$ is partitionable and we give an interpretation of the $h$-vector when $…
Character polynomials are used to study the restriction of a polynomial representation of a general linear group to its subgroup of permutation matrices. A simple formula is obtained for computing inner products of class functions given by character polynomials. Character polynomials for symmetric and alternating tensors are computed using generating functions with Eulerian factorizations. These are used to compute character polynomials for Weyl modules, which exhibit a duality. By taking inner products of character polynomials for Weyl modules and character polynomials for Specht modules, sta…
The Kaleidoscopic Filter on the Partition Manifold, Part I: The Simplicial Ehrhart, Barycentric Pascal Product, and Continuous Bernoulli Exact Closed Forms for $p(n)$
