A method for proving polynomial enumeration formulas

We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by “explaining” their zeros using an appropriate combinatorial extension of the objects under consideration to negative integer parameters. We apply this method to prove a new refinement of the Bender-Knuth (ex-)Conjecture, which easily implies the Bender-Knuth (ex-)Conjecture itself. This is probably the most elementary way to prove this result currently known. Furthermore we adapt our method to q-polynomials, which allows us to derive generating function results as well. Finally we use this method to give another proof for the enumeration of semistandard tableaux of a fixed shape which differs from our proof of the Bender-Knuth (ex-)Conjecture in that it is a multivariate application of our method.     

Généralisation d'identités de Carlitz,Howard et Lehmer

Divided differences provide an efficient method for computing with functions of several variables.In this note, we use them to generalize the Newton interpolation formula, and obtain an orthogonality relation (3.3). From this, we deduce two inversion formulas (3.4) and (3.8) involving two infinite sets of variables.The generating functions (1.1) to (1.4) of Carlitz and Howard are obtained by a mere specialization of variables in the preceding inversion formulas.As an illustration, we show how to recover several identities due to Carlitz and Lehmer, and we give a newq-analog of the generating series of the Howard numbers (formulas 4.22 and 4.23).

     

Kinematic formulas for finite lattices

In analogy to valuation characterizations and kinematic formulas of convex geometry, we develop a combinatorial theory of invariant valuations and kinematic formulas for finite lattices. Combinatorial kinematic formulas are shown to have application to some probabilistic questions, leading in turn to polynomial identities for Möbius functions and Whitney numbers.     

Riordan arrays associated with Laurent series and generalized Sheffer-type groups

A relationship between a pair of Laurent series and Riordan arrays is formulated. In addition, a type of generalized Sheffer groups is defined by using Riordan arrays with respect to power series with non-zero coefficients. The isomorphism between a generalized Sheffer group and the group of the Riordan arrays associated with Laurent series is established. Furthermore, Appell, associated, Bell, and hitting-time subgroups of the groups are defined and discussed. A relationship between the generalized Sheffer groups with respect to different type of power series is presented. The equivalence of the defined Riordan array pairs and generalized Stirling number pairs is given. A type of inverse relations of various series is constructed by using pairs of Riordan arrays. Finally, several applications involving various arrays, polynomial sequences, special formulas and identities are also presented as illustrative examples.     

The Saalschütz chain reactions and bilateral basic hypergeometric series

By iterating recursively the q-Saalschütz summation formula, we introduce the Saalschütz chain reactions. A general series transform, which expresses a nonterminating bilateral series in terms of a finite multiple unilateral sum, will be established. As applications we derive, by means of Bailey’s 6ψ6 -series identity, several bilateral transformations including one due to Milne [12]. These transformations further yield a number of closed formulas of very well-poised bilateral basic hypergeometric series; which are closely related to the identities obtained by Minton [13], Karlsson [11], Gasper [8], and Chu [5], [6], [7] through the partial fraction method and divided differences.     

On a kind of curious binomial identity

As a generalization of Calkin's identity and its alternating form, we compute a kind of binomial identity involving some real number sequences and a partial sum of the binomial coefficients, from which many interesting identities follow.     

Counting involutory, unimodal, and alternating signed permutations

In this work we count the number of involutory, unimodal, and alternating elements of the group of signed permutations B_n, and the group of even-signed permutations D_n. Recurrence relations, generating functions, and explicit formulas of the enumerating sequences are given.     

Characterizations of multivariate life distributions

Characterizations of multivariate distributions has been a topic of great interest in applied statistics literature for the last three decades. In this paper, we develop characterizations of multivariate lifetime distributions by relationship between multivariate failure rates (reversed failure rates) and the left (right) truncated expectations of functions of random variables. We, then, discuss the application of the results to derive a multivariate Stein type identity.     

Eulerian quasisymmetric functions for the type B Coxeter group and other wreath product groups

Eulerian quasisymmetric functions were introduced by Shareshian and Wachs in order to obtain a q-analog of Euler?s exponential generating function formula for the Eulerian numbers (Shareshian and Wachs, 2010 [17]). They are defined via the symmetric group, and applying the stable and nonstable principal specializations yields formulas for joint distributions of permutation statistics. We consider the wreath product of the cyclic group with the symmetric group, also known as the group of colored permutations. We use this group to introduce colored Eulerian quasisymmetric functions, which are a generalization of Eulerian quasisymmetric functions. We derive a formula for the generating function of these colored Eulerian quasisymmetric functions, which reduces to a formula of Shareshian and Wachs for the Eulerian quasisymmetric functions. We show that applying the stable and nonstable principal specializations yields formulas for joint distributions of colored permutation statistics, which generalize the Shareshian–Wachs q-analog of Euler?s formula, formulas of Foata and Han, and a formula of Chow and Gessel.     

A polynomial expression for the Hilbert series of the quotient ring of diagonal coinvariants

A special case of Haiman?s identity [M. Haiman, Vanishing theorems and character formulas for the Hilbert scheme of points in the plane, Invent. Math. 149 (2002) 371–407] for the character of the quotient ring of diagonal coinvariants under the diagonal action of the symmetric group yields a formula for the bigraded Hilbert series as a sum of rational functions in q,t. In this paper we show how a summation identity of Garsia and Zabrocki for Macdonald polynomial Pieri coefficients can be used to transform Haiman?s formula for the Hilbert series into an explicit polynomial in q,t with integer coefficients. We also provide an equivalent formula for the Hilbert series as the constant term in a multivariate Laurent series.     

Representations of Central Matrix-Valued Carathéodory Functions in Both Nondegenerate and Degenerate Cases

We derive left and right quotient representations for central q × q matrix-valued Carathéodory functions. Moreover, we obtain recurrent formulas for the matrix polynomials involved in the quotient representations. These formulas are the starting point for getting recurrent formulas for those matrix polynomials which occur in the Arov-Krein resolvent matrix for the nondegenerate matricial Carathéodory problem.     

A symbolic operator approach to several summation formulas for power series II

Here expounded is a kind of symbolic operator method that can be used to construct many transformation formulas and summation formulas for various types of power series including some old ones and more new ones.     

A Family of Approximation Formulas and some Applications

The general scheme, suggested in [1] using a basis of an infinite-dimensional space and allowing to construct finite-dimensional orthogonal systems and interpolation formulas, is improved in the paper. This results particularly in a generalization of the well-known scheme by which periodic interpolatory wavelets are constructed. A number of systems which do not satisfy all the conditions for multiresolution analysis but have some useful properties are introduced and investigated.

Starting with general constructions in Hilbert spaces, we give a more careful consideration to the case connected with the classic Fourier basis.

Convergence of expansions which are similar to partial sums of the summation method of Fourier series, as well as convergence of interpolation formulas are considered.

Some applications to fast calculation of Fourier coefficients and to solution of integrodifferential equations are given. The corresponding numerical results have been obtained by means of MATHEMATICA 3.0 system.     

Binomial Determinant Evaluations

By means of matrix decomposition and the partial fraction method, we establish several determinant evaluation formulas, which can be considered as generalizations of the Vandermonde and Cauchy determinants. Received February 24, 2005     

Counting formulas for glued lattices

A tolerance relation of a lattice L, i.e., a reflexive and symmetric relation of L which is compatible with join and meet, is called glued if covering blocks of have nonempty intersection. For a lattice L with a glued tolerance relation we prove a formula counting the number of elements of L with exactly k lower (upper) covers. Moreover, we prove similar formulas for incidence structures and graphs and we give a new proof of Dilworth's covering theorem.     

Multivariate convexity preserving interpolation by smooth functions

A set of multivariate data is called strictly convex if there exists a strictly convex interpolant to these data. In this paper we characterize strict convexity of Lagrange and Hermite multivariate data by a simple property and show that for strict convex data and given smoothness requirements there exists a smooth strictly convex interpolant. We also show how to construct a multivariate convex smooth interpolant to scattered data. Partially supported by DGICYT PS93-0310 and by the EC project CHRX-CT94-0522.     

A recursive method for computing interpolants

In this paper, we describe a recursive method for computing interpolants defined in a space spanned by a finite number of continuous functions in R^d${\mathbb{R}}^d$. We apply this method to construct several interpolants such as spline interpolants, tensor product interpolants and multivariate polynomial interpolants. We also give a simple algorithm for solving a multivariate polynomial interpolation problem and constructing the minimal interpolation space for a given finite set of interpolation points.     

The class of tenable zero-balanced Pólya urns with an initially dominant subset of colors

In Kholfi and Mahmoud (2011) the class of tenable irreducible nondegenerate zero-balanced Pólya urn schemes is introduced and its asymptotic behavior in various phases is studied. In the absence of an initially dominant subset of colors, the counts of balls of all the colors satisfy multivariate central limit theorems. It is reported there that the case of an initially dominant subset of colors poses challenges requiring finer asymptotic analysis. In the present investigation we follow up on this. Indeed, we characterize noncritical cases with an initially dominant subset of colors in which not all ball counts satisfy one multivariate central limit theorem, but rather a subset of the ball counts satisfies a singular multivariate central limit theorem. The rest of the cases are critical, in which all the ball counts satisfy a multivariate central limit theorem, but under a different scaling. However, for these critical cases the Gaussian phases are delayed considerably.     

Symmetric identities on Bernoulli polynomials

In this paper, we obtain a generalization of an identity due to Carlitz on Bernoulli polynomials. Then we use this generalized formula to derive two symmetric identities which reduce to some known identities on Bernoulli polynomials and Bernoulli numbers, including the Miki identity.     

Determination of jumps of distributions by differentiated means

Differentiated means are defined in order to find formulas for jumps of distributions. We analyze two types of jumps occurring in the notions of distributional jump behavior and symmetric jump behavior. We start by defining what we call Riesz differentiated means for numerical series, then the differentiated means are extended to distributional evaluations for the Schwartz class of tempered distributions. The jumps of tempered distributions are completely determined by the differentiated means of the Fourier transform. We also find formulas for the jumps in terms of the asymptotic behavior of partial derivatives of harmonic representations and harmonic conjugate functions. Applications to Fourier series are given. The second author gratefully acknowledges support by the Louisiana State Board of Regents grant LEQSF(2005-2007)-ENH-TR-21.