q-Catalan numbers

q-analogs of the Catalan numbers C_n = (1/(n + 1))(_n²ⁿ) are studied from the view-point of Lagrange inversion. The first, due to Carlitz, corresponds to the Andrews-Gessel-Garsia q-Lagrange inversion theory, satisfies a nice recurrence relation and counts inversions of Catalan words. The second, tracing back to Mac Mahon, arise from Krattenthaler's and Gessel and Stanton's q-Lagrange inversion formula, have a nice explicit formula and enumerate the major index. Finally a joint generalization is given which includes also the Polya-Gessel q-Catalan numbers.     

Central Units in ℤCp,q

Let C_{p, q} be the semi-direct product of a cyclic group of order q by a cyclic group of order p, and ?C_{p, q} the integral group ring of C_{p, q}. In this article, firstly, we describe the group of normalized central units of ?C_{p, q} as a direct product of two subgroups that we call units of first kind and of second kind. For a class of prime numbers that we call good primes, we construct a multiplicatively independent set which generates the group of units of first kind. Finally, we construct a set of multiplicatively independent units which generates the units of second kind for a larger class of primes.     

Weighted inversion numbers,restricted growth functions,and standard young tableaux

We give a family of weighted inversion numbers with the same generating function which interpolate between the inversion number and MacMahon's major index. Foata's bijection is obtained in a natural way from a simple involution. An alternative proof uses q-difference equations which yield some new results. We obtain a new generating function for restricted growth functions and two q-analogs of a formula for the number of standard Young tableaux of a given shape. While the first really goes back to MacMahon, the second uses one of our weighted inversion numbers and appears to be new.     

Representations of the virasoro-like algebra and its q-Analog

In this paper, some irreducible graded modules with 1-dimensional homogeneous spaces over the Virasoro-like algebra and its q-analogs are constructed. The unitarizability of these modules, and the conditions under which two of such irreducible graded modules are ismorphic are determined. Some other kinds of irreducible graded modules with 1-dimensional homogeneous spaces over the Virasorolike algebra and its q-analogs are also given.     

Carlitz’s q-Bernoulli and q-Euler numbers and polynomials and a class of generalized q-Hurwitz zeta functions

In this paper, we systematically recover the identities for the q-eta numbers η_k and the q-eta polynomials η_k(x), presented by Carlitz [L. Carlitz, q-Bernoulli numbers and polynomials, Duke Math. J. 15 (1948) 987–1000], which we define here via generating series rather than via the difference equations of Carlitz. Following a method developed by Kaneko et al. [M. Kaneko, N. Kurokawa, M. Wakayama, A variation of Euler’s approach to the Riemann zeta function, Kyushu J. Math. 57 (2003) 175–192] for a canonical q-extension of the Riemann zeta function, we investigate a similarly constructed q-extension of the Hurwitz zeta function. The details of this investigation disclose some interesting connections among q-eta polynomials, Carlitz’s q-Bernoulli polynomials -polynomials, and the q-Bernoulli polynomials that emerge from the q-extension of the Hurwitz zeta function discussed here.     

Signed words and permutations, IV: Fixed and pixed points

The flag-major index “fmaj” and the classical length function “ℓ” are used to construct two q-analogs of the generating polynomial for the hyperoctahedral group B _n by number of positive and negative fixed points (resp., pixed points). Specializations of those q-analogs are also derived dealing with signed derangements and desarrangements, as well as several classical results that were previously proved for the symmetric group. To Volker Strehl, a dedication à la Goethe, on the occasion of his sixtieth birthday.     

Z-Join Spectra of Z-Supercompactly Generated Lattices

The main result of this paper is a generalization of the classical equivalence between the category of continuous posets and the category of completely distributive lattices, based on the fact that the continuous posets are precisely the spectra of completely distributive lattices. Here we show that for so-called hereditary and union complete subset selections Z, the category of Z-continuous posets is equivalent (via a suitable spectrum functor) to the category of Z-supercompactly generated lattices; these are completely distributive lattices with a join-dense subset of certain Z-hypercompact elements. By appropriate change of the morphisms, these equivalences turn into dualities. We present two different approaches: the first one directly uses the Z-join ideal completion and the Z-below relation; the other combines two known equivalence theorems, namely a topological representation of Z-continuous posets and a general lattice theoretical representation of closure spaces.     

Properties of convergence for -Bernstein polynomials

In this paper, we discuss properties of the ω,q-Bernstein polynomials introduced by S. Lewanowicz and P. Woźny in [S. Lewanowicz, P. Woźny, Generalized Bernstein polynomials, BIT 44 (1) (2004) 63–78], where fC[0,1], ω,q>0, ω≠1,q⁻¹,…,q⁻ⁿ⁺¹. When ω=0, we recover the q-Bernstein polynomials introduced by [G.M. Phillips, Bernstein polynomials based on the q-integers, Ann. Numer. Math. 4 (1997) 511–518]; when q=1, we recover the classical Bernstein polynomials. We compute the second moment of , and demonstrate that if f is convex and ω,q(0,1) or (1,∞), then are monotonically decreasing in n for all x[0,1]. We prove that for ω(0,1), q_n(0,1], the sequence converges to f uniformly on [0,1] for each fC[0,1] if and only if lim_n→∞q_n=1. For fixed ω,q(0,1), we prove that the sequence converges for each fC[0,1] and obtain the estimates for the rate of convergence of by the modulus of continuity of f, and the estimates are sharp in the sense of order for Lipschitz continuous functions.     

Rook-by-rook rook theory: Bijective proofs of rook and hit equivalences

Suppose μ and ν are integer partitions of n, and N>n. It is well known that the Ferrers boards associated to μ and ν are rook-equivalent iff the multisets [μ_i+i:1iN] and [ν_i+i:1iN] are equal. We use the Garsia–Milne involution principle to produce a bijective proof of this theorem in which non-attacking rook placements for μ are explicitly matched with corresponding placements for ν. One byproduct is a direct combinatorial proof that the matrix of Stirling numbers of the first kind is the inverse of the matrix of Stirling numbers of the second kind. We also prove q-analogues and p,q-analogues of these results. We also use the Garsia–Milne involution principle to show that for any two rook boards B and B^′, if B and B^′ are bijectively rook-equivalent, then B and B^′ are bijectively hit-equivalent.     

Regular boundary value problems for complete second order elliptic differential-operator equations in UMD Banach spaces

We consider coerciveness and Fredholmness of nonlocal boundary value problems for complete second order elliptic differential-operator equations in UMD Banach spaces. In some special cases, the main coefficients of the boundary conditions may be bounded operators and not only complex numbers. Then, we prove an isomorphism, in particular, maximal L _p -regularity, of the problem with a linear parameter in the equation. In both cases, the boundary conditions may also contain unbounded operators in perturbation terms. Finally, application to regular nonlocal boundary value problems for elliptic equations of the second order in non-smooth domains are presented. Equations and boundary conditions may contain differential-integral parts. The spaces of solvability are Sobolev type spaces W _p,q ^2,2. The first author is a member of G.N.A.M.P.A. and the paper fits the 60% research program of G.N.A.M.P.A.-I.N.D.A.M.; The third author was supported by the Israel Ministry of Absorption.     

Systematic Construction of <Emphasis Type="Italic">q</Emphasis>-Analogs of <Emphasis Type="Italic">t</Emphasis>−(<Emphasis Type="Italic">v</Emphasis>,<Emphasis Type="Italic">k</Emphasis>,λ)-Designs

In the present paper we consider a q-analog of t–(v,k,)-designs. It is canonic since it arises by replacing sets by vector spaces over GF(q), and their orders by dimensions. These generalizations were introduced by Thomas [Geom.Dedicata vol. 63, pp. 247–253 (1996)] they are called t –(v,k,;q)- designs. A few of such q-analogs are known today, they were constructed using sophisticated geometric arguments and case-by-case methods. It is our aim now to present a general method that allows systematically to construct such designs, and to give complete catalogs (for small parameters, of course) using an implemented software package. &nbsp; In order to attack the (highly complex) construction, we prepare them for an enormous data reduction by embedding their definition into the theory of group actions on posets, so that we can derive and use a generalization of the Kramer-Mesner matrix for their definition, together with an improved version of the LLL-algorithm. By doing so we generalize the methods developed in a research project on t –(v,k,)-designs on sets, obtaining this way new results on the existence of t–(v,k,;q)-designs on spaces for further quintuples (t,v,k,;q) of parameters. We present several 2–(6,3,;2)-designs, 2–(7,3,;2)-designs and, as far as we know, the very first 3-designs over GF(q).classification 05B05     

LatticeW algebras and quantum groups

We present Feigin's construction [Lectures given in Landau Institute] of latticeW algebras and give some simple results: lattice Virasoro andW ₃ algebras. For the simplest caseg=sl(2), we introduce the wholeU _q(2)) quantum group on this lattice. We find the simplest two-dimensional module as well as the exchange relations and define the lattice Virasoro algebra as the algebra of invariants ofU _q(sl(2)). Another generalization is connected with the lattice integrals of motion as the invariants of the quantum affine groupU _q(ñ₊). We show that Volkov's scheme leads to a system of difference equations for a function of non-commutative variables.Landau Institute for Theoretical Physics, 142432, Chernogolovka, Russia. Published in Teoreticheskaya i Matematicheskaya Fizika, Vol. 100, No. 1, pp. 132–147, July, 1994.     

Multiple <Emphasis Type="Italic">q</Emphasis>-zeta functions and multiple <Emphasis Type="Italic">q</Emphasis>-polylogarithms

For every positive integer d we define the q-analog of multiple zeta function of depth d and study its properties, generalizing the work of Kaneko et al. who dealt with the case d=1. We first analytically continue it to a meromorphic function on ℂ ^d with explicit poles. In our Main Theorem we show that its limit when q ↑1 is the ordinary multiple zeta function. Then we consider some special values of these functions when d=2. At the end of the paper we also propose the q-analogs of multiple polylogarithms by using Jackson’s q-iterated integrals and then study some of their properties. Our definition is motivated by those of Koornwinder and Schlesinger although theirs are slightly different from ours. Partially supported by NSF grant DMS0139813 and DMS0348258.     

Enumeration by kernel positions

We introduce a class of two-player games on posets with a rank function, in which each move of the winning strategy is unique. This allows one to enumerate the kernel positions by rank. The main example is a simple game on words in which the number of kernel positions of rank n is a signed factorial multiple of the nth Bernoulli number of the second kind. Generalizations to the degenerate Bernoulli numbers and to negative integer substitutions into the Bernoulli polynomials are developed. Using an appropriate scoring system for each function with an appropriate Newton expansion we construct a game in which the expected gain of a player equals the definite integral of the function on the interval [0,1].     

Socles of Buchsbaum modules, complexes and posets

The socle of a graded Buchsbaum module is studied and is related to its local cohomology modules. This algebraic result is then applied to face enumeration of Buchsbaum simplicial complexes and posets. In particular, new necessary conditions on face numbers and Betti numbers of such complexes and posets are established. These conditions are used to settle in the affirmative Kühnel's conjecture for the maximum value of the Euler characteristic of a 2k-dimensional simplicial manifold on n vertices as well as Kalai's conjecture providing a lower bound on the number of edges of a simplicial manifold in terms of its dimension, number of vertices, and the first Betti number.     

q-Weighted log-concavity and q-product theorem on the normality of posets

We show that q-weighted log-concavity and the strict normalized matching property are preserved under the q-direct product over weighted posets. As consequences, two classes of weighted posets including the finite linear lattices are strictly q-weighted log-concave and strictly normal.     

Cyclic Relative Difference Sets and their p-Ranks

By modifying the constructions in Helleseth et al. [10] and No [15], we construct a family of cyclic ((q ^3k –1)/(q–1), q–1, q ^3k–1, q ^3k–2) relative difference sets, where q=3 ^e . These relative difference sets are liftings of the difference sets constructed in Helleseth et al. [10] and No [15]. In order to demonstrate that these relative difference sets are in general new, we compute p-ranks of the classical relative difference sets and 3-ranks of the newly constructed relative difference sets when q=3. By rank comparison, we show that the newly constructed relative difference sets are never equivalent to the classical relative difference sets, and are in general inequivalent to the affine GMW difference sets.     

Little q-Legendre Polynomials and Irrationality of Certain Lambert Series

Certain q-analogs h _p(1) of the harmonic series, with p = 1/q an integer greater than one, were shown to be irrational by Erds (J. Indiana Math. Soc. 12, 1948, 63–66). In 1991–1992 Peter Borwein (J. Number Theory 37, 1991, 253–259; Proc. Cambridge Philos. Soc. 112, 1992, 141–146) used Padé approximation and complex analysis to prove the irrationality of these q-harmonic series and of q-analogs ln _p (2) of the natural logarithm of 2. Recently Amdeberhan and Zeilberger (Adv. Appl. Math. 20, 1998, 275–283) used the qEKHAD symbolic package to find q-WZ pairs that provide a proof of irrationality similar to Apéry's proof of irrationality of (2) and (3). They also obtain an upper bound for the measure of irrationality, but better upper bounds were earlier given by Bundschuh and Väänänen (Compositio Math. 91, 1994, 175–199) and recently also by Matala-aho and Väänänen (Bull. Australian Math. Soc. 58, 1998, 15–31) (for ln _p (2)). In this paper we show how one can obtain rational approximants for h _p(1) and ln _p (2) (and many other similar quantities) by Padé approximation using little q-Legendre polynomials and we show that properties of these orthogonal polynomials indeed prove the irrationality, with an upper bound of the measure of irrationality which is as sharp as the upper bound given by Bundschuh and Väänänen for h _p(1) and a better upper bound as the one given by Matala-aho and Väänänen for ln _p (2).     

On the Convergence and Iterates of q-Bernstein Polynomials

The convergence properties of q-Bernstein polynomials are investigated. When q1 is fixed the generalized Bernstein polynomials _nf of f, a one parameter family of Bernstein polynomials, converge to f as n→∞ if f is a polynomial. It is proved that, if the parameter 0<q<1 is fixed, then _nf→f if and only if f is linear. The iterates of _nf are also considered. It is shown that _n^Mf converges to the linear interpolating polynomial for f at the endpoints of [0,1], for any fixed q>0, as the number of iterates M→∞. Moreover, the iterates of the Boolean sum of _nf converge to the interpolating polynomial for f at n+1 geometrically spaced nodes on [0,1].     

The connected partition lattice of a graph and the reconstruction conjecture

Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question.