Related papers: Mutual Interlacing and Eulerian-like Polynomials f…

Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…

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,…

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…

We give several families of polynomials which are related by Eulerian summation operators. They satisfy interesting combinatorial properties like being integer-valued at integral points. This involves nearby-symmetries and a recursion for…

In this paper, we study Eulerian polynomials for permutations and signed permutations of the multiset $\{1,1,2,2,\ldots,n,n\}$. Properties of these polynomials, including recurrence relations and unimodality are discussed. In particular, we…

Athanasiadis conjectured that, for every positive integer $r$, the local $h$-polynomial of the $r$th edgewise subdivision of any simplex has only real zeros. In this paper, based on the theory of interlacing polynomials, we prove that a…

We introduce the Double leaves basis, a combinatorial basis for the Hom spaces between two Bott-Samelson-Soergel bimodules. As an application we give a combinatorial algorithm to find, for any given Weyl or affine Weyl group, the set of…

Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…

We construct new rational approximants of Euler's constant that improve those of Aptekarev et al. (2007) and Rivoal (2009). The approximants are given in terms of certain (mixed type) multiple orthogonal polynomials associated with the…

Using the theory of exponential Riordan arrays, we show that the Eulerian-Dowling polynomials are moments for a paramaterized family of orthogonal polynomials. In addition, we show that the related Dowling and the Tanny-Dowling polynomials…

We refine a technique used in a paper by Schur on real-rooted polynomials. This amounts to an extension of a theorem of Wagner on Hadamard products of Toeplitz matrices. We also apply our results to polynomials for which the Neggers-Stanley…

We construct certain Steinberg groups associated to extended affine Lie algebras and their root systems. Then by the integration methods of Kac and Peterson for integrable Lie algebras, we associate a group to every tame extended affine Lie…

Spivey's combinatorial method revealed an important identity for Bell numbers, involving Stirling numbers of the second kind. This paper extends his work by deriving Spivey-type recurrence relations for fully degenerate Bell polynomials and…

This paper is concerned with multivariate refinements of the gamma-positivity of Eulerian polynomials by using the succession and fixed point statistics. Properties of the enumerative polynomials for permutations, signed permutations and…

We outline the proof of a conjecture of Kontsevich on the isomorphism between the group of polynomial symplectomorphisms in $2n$ variables and the group of automorphisms of the $n$-th Weyl algebra over complex numbers. Our proof uses…

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

The generating polynomial of permutations of size $n$, counted by the number of alternating runs, has a root at $-1$ of multiplicity $\lfloor (n-2)/2 \rfloor$ for all $n \ge 2$. This result can be derived by combining the David--Barton…

We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integer versions of these sequences,…

We introduce the Primitive Eulerian polynomial $P_{\cal A}(z)$ of a central hyperplane arrangement ${\cal A}$. It is a reparametrization of its cocharacteristic polynomial. Previous work of the first author implicitly show that, for…