Related papers: Noncommutative binomial theorem, shuffle type poly…
We conjecture an explicit positive combinatorial formula for the expansion of unicellular LLT polynomials in the elementary symmetric basis. This is an analogue of the Shareshian-Wachs conjecture and previously studied by Panova and the…
Wick polynomials and Wick products are studied in the context of non-commutative probability theory. It is shown that free, boolean and conditionally free Wick polynomials can be defined and related through the action of the group of…
Inhomogeneous analogues of symmetric and nonsymmetric Macdonald polynomials were introduced by F. Knop and the author. In the symmetric case A. Okounkov has recently proved a beautiful expansion formula which can be viewed as a…
Recently, several types of degenerate Bell polynomials have been introduced as degenerate versions of the ordinary Bell polynomials. The aim of this paper is to study some identities for the degenerate Bell polynomials and their related…
If H is a connected, graded Hopf algebra, then Takeuchi's formula can be used to compute its antipode. However, there is usually massive cancellation in the result. We show how sign-reversing involutions can sometimes be used to obtain…
We prove that hypersurfaces defined by irreducible square-free polynomials have rational singularities. As an easy consequence, we deduce that certain (possibly non-square-free) polynomials associated to pairs of square-free polynomials…
We prove several new versions of Hilbert's basis theorem for non-associative Ore extensions, non-associative skew Laurent polynomial rings, non-associative skew power series rings, and non-associative skew Laurent series rings. For…
We initiate the study of the Macdonald intersection polynomials $\operatorname{I}_{\mu^{(1)},\dots,\mu^{(k)}}[X;q,t]$, which are indexed by $k$-tuples of partitions $\mu^{(1)},\dots,\mu^{(k)}$. These polynomials are conjectured to be equal…
We computationally investigate the complete polytope of Bell inequalities for 2 particles with small numbers of possible measurements and outcomes. Our approach is limited by Pitowsky's connection of this problem to the computationally hard…
The machinery of noncommutative Schur functions provides a general tool for obtaining Schur expansions for combinatorially defined symmetric functions. We extend this approach to a wider class of symmetric functions, explore its strengths…
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…
The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…
The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…
Let Y be a random variable whose moment generating function exists in some neighborhood of the origin. We consider the probabilistic bivariate Bell polynomials associated with Y and the probabilistic bivariate r-Bell polynomials associated…
A set of polynomials in noncommuting variables is called locally linearly dependent if their evaluations at tuples of matrices are always linearly dependent. By a theorem of Camino, Helton, Skelton and Ye, a finite locally linearly…
We use the method of characteristic sets with respect to two term orderings to prove the existence and obtain a method of computation of a bivariate Kolchin-type dimension polynomial associated with a non-reflexive difference-differential…
A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…
Working with a rather general notion of independence, we provide a transference method which allows to compare the p-norm of sums of independent copies with the p-norm of sums of free copies. Our main technique is to construct explicit…
We obtain some recurrence relationships among the partition vectors of the partial exponential Bell polynomials. On using such results, the $n$-th Adomian polynomial for any nonlinear operator can be expressed explicitly in terms of the…
Simple necessary and sufficient conditions for a $n$-tuple of noncommutative polynomials to be a cyclic gradient are given and similarly for a noncommutative polynomial to have a vanishing cyclic gradient. Connections with free probability…