Related papers: Higher Order r-Dowling polynomials
We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a…
We study first-order methods with preconditioning for solving structured nonlinear convex optimization problems. We propose a new family of preconditioners generated by symmetric polynomials. They provide first-order optimization methods…
For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…
We give three interpretations of the number $b$ of orbits of the Borel subgroup of upper triangular matrices on the variety $\ms{X}$ of complete quadrics. First, we show that $b$ is equal to the number of standard Young tableaux on…
We introduce poly-Bernoulli polynomials in two variables by using a generalization of Stirling numbers of the second kind that we studied in a previous work. We prove the bi-variate poly-Bernoulli polynomial version of some known results on…
We propose a categorical setting for the study of the combinatorics of rational numbers. We find combinatorial interpretation for the Bernoulli and Euler numbers and polynomials.
In this note we investigate mixed partitions with extra condition on the sizes of the blocks. We give a general formula and the generating function. We consider in more details a special case, determining the generating functions, some…
This work deals with a new generalization of $r$-Stirling numbers using $l$-tuple of permutations and partitions called $(l,r)$-Stirling numbers of both kinds. We study various properties of these numbers using combinatorial interpretations…
Generalised polynomials are maps constructed by applying the floor function, addition, and multiplication to polynomials. Despite superficial similarity, generalised polynomials exhibit many phenomena which are impossible for polynomials.…
In this paper, we consider the degenerate poly-Bernoulli polynomials and present new and explicit formulas for computing them in terms of the degenerate Bernoulli polynomials and Stirling numbers of the second kind.
We introduce a new algebraic construction, {\em monop}, that combines monoids (with respect to the product of species), and operads (monoids with respect to the substitution of species) in the same algebraic structure. By the use of…
In this paper we study Appell polynomials by connecting them to random variables. This probabilistic approach yields, e.g., the mean value property which is fundamental in the sense that many other properties can be derived from it. We also…
New methods for derivation of Bell polynomials of the second kind are presented. The methods are based on an ordinary generating function and its composita. The relation between a composita and a Bell polynomial is demonstrated. Main…
The normal ordering of an integral power of the number operator in terms of boson operators is expressed with the help of the Stirling numbers of the second kind. As a `degenerate version' of this, we consider the normal ordering of a…
In this paper, we introduce a new class of structured polynomials, called separable plus lower degree (SPLD) polynomials. The formal definition of an SPLD polynomial, which extends the concept of SPQ polynomials (Ahmadi et al. in Math Oper…
In this paper, we study relations among several types of Eulerian polynomials from a combinatorial viewpoint. We establish an identity between the restricted Eulerian polynomials of types $A$ and $B$. As an application, we present a…
Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton's method. Using first-order derivatives of…
This talk is devoted mainly to the concept of higher-order polarization on a group, which is introduced in the framework of a Group Approach to Quantization, as a powerful tool to guarantee the irreducibility of quantizations and/or…
Let $w$ be a word in alphabet $\{x,D\}$ with $m$ $x$'s and $n$ $D$'s. Interpreting "$x$" as multiplication by $x$, and "$D$" as differentiation with respect to $x$, the identity $wf(x) = x^{m-n}\sum_k S_w(k) x^k D^k f(x)$, valid for any…
We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…