Related papers: Barycentric subdivisions and derangement polynomia…
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric…
It is known that if the derangements subgroup of a transitive non-regular permutation group is a proper subgroup, then it is a Frobenius--Wielandt kernel, and, conversely, minimal Frobenius--Wielandt kernels are proper derangements…
Equivariant Ehrhart theory enumerates the lattice points in a polytope with respect to a group action. Answering a question of Stapledon, we describe the equivariant Ehrhart theory of the permutahedron, and we prove his Effectiveness…
We define the acyclic orientation polynomial of a graph to be the generating function for the sinks of its acyclic orientations. Stanley proved that the number of acyclic orientations is equal to the chromatic polynomial evaluated at $-1$…
A derangement is a permutation with no fixed point, and a nonderangement is a permutation with at least one fixed point. There is a one-term recurrence for the number of derangements of $n$ elements, and we describe a bijective proof of…
We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…
This paper sets out to introduce the generalized derangement polynomials of order $r $. It then proceeds to establish various identities associated with these polynomials, along with providing recurrence relations for derangement…
We define an excedance number for the multi-colored permutation group, i.e. the wreath product of Z_{r_1} x ... x Z_{r_k} with S_n, and calculate its multi-distribution with some natural parameters. We also compute the multi-distribution of…
The Ehrhart quasipolynomial of a rational polytope $P$ encodes the number of integer lattice points in dilates of $P$, and the $h^*$-polynomial of $P$ is the numerator of the accompanying generating function. We provide two decomposition…
We propose a sum rule for $r$-derangements (meaning that the elements are restricted to be in distinct cycles in the cycle decomposition) involving binomial coefficients. The identity, obtained using the Cauchy product of two exponential…
We use a polynomial decomposition result by Stapledon to show that the numerator polynomial of the Ehrhart series of an open polytope is the difference of two symmetric polynomials with nonnegative integer coefficients. We obtain a related…
A permutation $\sigma$ of a multiset is called Stirling permutation if $\sigma(s)\ge \sigma(i)$ as soon as $\sigma(i)=\sigma(j)$ and $i<s<j.$ In our paper we study Stirling polynomials that arise in the generating function for descent…
We present an accurate investigation of the algebraic conditions that the symbols of a convergent, univariate, binary, non-stationary subdivision scheme should fulfill in order to reproduce spaces of exponential polynomials. A subdivision…
We study the intersection lattice of a hyperplane arrangement recently introduced by Hetyei who showed that the number of regions of the arrangement is a median Genocchi number. Using a different method, we refine Hetyei's result by…
A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…
We find a simple product formula for the characteristic polynomial of the permutations with a fixed descent set under the weak order. As a corollary we obtain a simple product formula for the characteristic polynomial of alternating…
In this paper, we introduce an equivariant version of the characteristic quasi-polynomials as the permutation characters on the complement of mod $q$ hyperplane arrangements. We prove that the permutation character is a quasi-polynomial in…
The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…