Related papers: Unimodality of generalized Gaussian coefficients
Let function $f$ be normalized, analytic and univalent in the unit disk ${\mathbb D}=\{z:|z|<1\}$ and $f(z)=z+\sum_{n=2}^{\infty} a_n z^n$. Using a method based on Grusky coefficients we study several problems over that class of univalent…
In the present paper we define the notion of generalized cumulants which gives a universal framework for commutative, free, Boolean, and especially, monotone probability theories. The uniqueness of generalized cumulants holds for each…
In this paper a survey is given of application of a method based on Grunsky coefficients for obtaining different estimates (some sharp) for the general class of univalent functions where no analytical characterisation exists. More…
We use a combinatorial interpretation of the coefficients of zonal Kerov polynomials as a number of unoriented maps to derive an explicit formula for the coefficients in genus one.
A general description of the Vi\`ete coefficients of the gaussian period polynomials is given, in terms of certain symmetric representations of the subgroups and the corresponding quotient groups of the multiplicative group…
The author in [7] was proved the generalized remainder and quotient theorems of polynomial in one indeterminate where the divisor is complete factorization to linear factors. In this paper we give the formula for the generalized remainder…
A counter-intuitive result of Gauss (formulae (1.6), (1.7) below) is made less mysterious by virtue of being generalized through the introduction of an additional parameter.
We give a proof of the generalized Cauchy identity for double Grothendieck polynomials, a combinatorial interpretation of the stable double Grothendieck polynomials in terms of triples of tableaux, and an interpolation between the stable…
In a previous paper, we studied an overpartition analogue of Gaussian polynomials as the generating function for overpartitions fitting inside an $m \times n$ rectangle. Here, we add one more parameter counting the number of overlined…
Gamma-positivity is an elementary property that polynomials with symmetric coefficients may have, which directly implies their unimodality. The idea behind it stems from work of Foata, Sch\"utzenberger and Strehl on the Eulerian…
We give several equivalent combinatorial descriptions of the space of states for the box-ball systems, and connect certain partition functions for these models with the q-weight multiplicities of the tensor product of the fundamental…
Transformation formulas for four-parameter refinements of the q-trinomial coefficients are proven. The iterative nature of these transformations allows for the easy derivation of several infinite series of q-trinomial identities, and can be…
In this paper one extends the binomial and trinomial coefficients to the concept of 'k-nomial' coefficients, and one obtains some properties of these. As an application one generalizes Pascal's triangle.
We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…
We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…
Via a covariance representation based on characteristic functions, a known elementary proof of the Gaussian concentration inequality is presented. A few other applications are briefly mentioned.
Using the Okounkov-Maulik stable map, we identify the equivariant cohomology of instanton moduli spaces with the space of polynomials on an infinite number of variables. We define the generalized Jack polynomials as the polynomials…
We present a complete theory, which is a generalization of Bargmann's theory of factors for ray representations. We apply the theory to the generally covariant formulation of the Quantum Mechanics.
We present an asymmetric $q$-Painlev\'e equation. We will derive this using $q$-orthogonal polynomials with respect to generalized Freud weights: their recurrence coefficients will obey this $q$-Painlev\'e equation (up to a simple…
The $q$-analogue of the binomial coefficient, known as a $q$-binomial coefficient, is typically denoted $\left[{n \atop k}\right]_q$. These polynomials are important combinatorial objects, often appearing in generating functions related to…