To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We introduce a non-increasing tree growth process $((T_n,{\sigma}_n),\, n\ge 1)$, where Tn is a rooted labelled tree on n vertices and σn is a permutation of the vertex labels. The construction of (Tn, σn) from (Tn−1, σn−1) involves rewiring a random (possibly empty) subset of edges in Tn−1 towards the newly added vertex; as a consequence Tn−1 ⊄ Tn with positive probability. The key feature of the process is that the shape of Tn has the same law as that of a random recursive tree, while the degree distribution of any given vertex is not monotone in the process.
We present two applications. First, while couplings between Kingman’s coalescent and random recursive trees were known for any fixed n, this new process provides a non-standard coupling of all finite Kingman’s coalescents. Second, we use the new process and the Chen–Stein method to extend the well-understood properties of degree distribution of random recursive trees to extremal-range cases. Namely, we obtain convergence rates on the number of vertices with degree at least $c\ln n$, c ∈ (1, 2), in trees with n vertices. Further avenues of research are discussed.
The first edition of this book appeared in 1981 as a direct continuation of Lectures of von Neumann Algebras (by Ş.V. Strătilă and L. Zsidó) and, until 2003, was the only comprehensive monograph on the subject. Addressing the students of mathematics and physics and researchers interested in operator algebras, noncommutative geometry and free probability, this revised edition covers the fundamentals and latest developments in the field of operator algebras. It discusses the group-measure space construction, Krieger factors, infinite tensor products of factors of type I (ITPFI factors) and construction of the type III_1 hyperfinite factor. It also studies the techniques necessary for continuous and discrete decomposition, duality theory for noncommutative groups, discrete decomposition of Connes, and Ocneanu's result on the actions of amenable groups. It contains a detailed consideration of groups of automorphisms and their spectral theory, and the theory of crossed products.
We sample certain results from the theory of q-series, including summation and transformation formulas, as well as some recent results which are not available in book form. Our approach is systematic and uses the Askey–Wilson calculus and Rodrigues-type formulas.
This chapter contains a survey of known results and open problems connected to the combinatorics of (type A) Macdonald polynomials. Macdonald polynomials are symmetric functions in a set of variables which depend on two extra parameters q,t. They include most of the commonly studied bases for the ring of symmetric functions, such as Schur functions and Hall-Littlewood polynomials, as special cases. Macdonald polynomials have geometric interpretations which make them important to algebraic geometry and mathematical physics, and are also fundamental to the study of special functions. Their combinatorial properties are rather mysterious, although a lot of progress has been made on the type A case in the past 20 years, in conjunction with the study of the representation theory of the ring of diagonal coinvariants. This survey shows how to express Macdonald polynomials, and other important objects such as the bigraded Hilbert series of the diagonal coinvariant ring, in terms of popular combinatorial structures including tableaux, Dyck paths, and parking functions.
The purpose of this chapter is to give an elementary introduction to the most fundamental aspects of elliptic hypergeometric functions. We will also give some indication of their historical origin in statistical mechanics. We will explain how elliptic hypergeometric functions can be used to construct biorthogonal rational functions, generalizing the famous Askey scheme of orthogonal polynomials. Apart from some general mathematical maturity, the only prerequisites will be elementary linear algebra and complex function theory.
The A-hypergeometric or GKZ hypergeometric system of differential equations in the present form were introduced by Gel'fand, Zelevinsky, and Kapranov about 30 years ago. Series solutions are multivariable hypergeometric series defined by a matrix A. They found that affine toric ideals and their algebraic and combinatorial properties describe solution spaces of the A-hypergeometric differential equations, which also opened new research areas in commutative algebra, combinatorics, polyhedral geometry, and algebraic statistics. This chapter describes fundamental facts about the system and its solutions, and also gives pointers to recent advances. Applications of A-hypergeometric functions are getting broader. Early applications were mainly to period maps and algebraic geometry. The interplay with commutative algebra and combinatorics has been a source of new ideas for these two fields and for the theory of hypergeometric functions. Recent new applications are to multivariate analysis in statistics.
By introducing weight functions on Euclidean space which are products of powers of linear functions vanishing on the mirrors of a finite reflection group one can construct generalizations of classical harmonic and Fourier analysis. There is a commutative algebra of differential-difference operators (the Dunkl operators) which generalize the partial derivatives and which are equipped with parameters. This chapter gives an introduction to the requisite properties of finite reflection (Coxeter) groups, which are associated to root systems. This is followed by the construction and commutativity proofs for the Dunkl operators. By their use one defines a concept of harmonic polynomials which serve as orthogonal bases for functions on the surface of the standard unit sphere with respect to the group-invariant weight function. There is an analog of the exponential function, the Dunkl kernel, which is used to define a generalized Fourier transform. The one-variable version of the transform is related to the classical Hankel transform. The two-dimensional examples of harmonic polynomials include the Gegenbauer and Jacobi polynomials. The general theory includes a natural extension of the classical orthogonal polynomials and of the Bessel functions.
This chapter provides an overview of some of the main results from the theories of hypergeometric and basic hypergeometric series and integrals associated with root systems. In particular, a number of summations, transformations, and explicit evaluations for such multiple series and integrals is listed. The focus is on those results that do not directly extend to the elliptic level. The featured results include multivariate versions of the terminating q-binomial theorem, the q-Pfaff-Saalschütz summation, the Jackson summation, some multilateral summations including multivariate versions of Dougall's 2H2 summation, Ramanujan's 1psi1 summation, Bailey's 6psi6 summation, multivariate Watson and Bailey transformations, dimension changing transformations, and multidimensional generalizations of the Askey-Wilson integral evaluation. A survey on the theory of basic hypergeometric series with Macdonald polynomial argument is provided as well.
The aim of this chapter is to introduce the formal theory of general orthogonal polynomials and present the two dual combinatorial approaches due to Foata for the special function aspects of the orthogonal polynomials, and to Flajolet and Viennot for the lattice paths models used for the moments and general orthogonal polynomials. After reviewing the standard interplay between orthogonal polynomials and combinatorics, influenced by their pioneering works, we will report on some recent topics developed in this cross-cutting field of these two branches of mathematics.
The KZ equations are a fundamental mathematical structure related to hypergeometric functions. Solutions of all versions of KZ equations are given by multidimensional hypergeometric integrals. The semi-classical limit of KZ equations leads to basic quantum chain models of mathematical physics and representation theory. In this chapter we describe the main examples of the KZ equations (rational, trigonometric, elliptic, differential or difference) with integral hypergeometric solutions. We also describe the semi-classical limit of KZ equations and associated Bethe ansatz method as the semi-classical limit of the hypergeometric solutions.
The su(2) 3j-coefficients (or symbols) and higher ones as 6j and 9j play a crucial role in various physical applications dealing with the quantization of angular momentum. In this chapter, the hypergeometric expressions for these coefficients and their relations to discrete orthogonal polynomials are emphasized. We give a short summary of the relevant class of representations of the Lie algebra su(2), and discuss their tensor product. In the tensor product decomposition, the important Clebsch-Gordan coefficients appear. 3j-Coefficients are proportional to these Clebsch-Gordan coefficients. We give some useful expressions (as hypergeometric series) and their relation to Hahn polynomials. Next, the tensor product of three representations is considered, and the relevant Racah coefficients (or 6j-coefficients) are defined. The explicit expression of a Racah coefficient as a hypergeometric series of type 4F3 and the connection with Racah polynomials and their orthogonality is given.9j-Coefficients are then defined in the context of the tensor product of four representations. They are related to a discrete orthogonal polynomial in two variables. Finally, we consider the tensor product of (n+1) representations and generalized recoupling coefficients or 3nj-coefficients, determined by two binary coupling schemes.
We give a survey of elliptic hypergeometric functions associated with root systems, comprised of three main parts. The first two in essence form an annotated table of the main evaluation and transformation formulas for elliptic hypergeometric integrals and series on root systems. The third and final part gives an introduction to Rains' elliptic Macdonald-Koornwinder theory (in part also developed by Coskun and Gustafson). We survey the main properties of elliptic BC_n interpolation functions and BC_n-symmetric biorthogonal functions, which generalize Okounkov's BC_n interpolation Macdonald polynomials and the Koornwinder polynomials, respectively.
Appell introduced four kinds of hypergeometric series in two variables as extensions of the hypergeometric series F(a,b,c;x), and Lauricella generalized them to hypergeometric series in m variables, and they considered systems of partial differential equations satisfied by them. In this chapter, we give definitions of Appell’s and Lauricella’s hypergeometric series and state their fundamental properties such as domains of convergence, integral representations, systems of partial differential equations, fundamental systems of solutions, and transformation formulas. We define the rank and the singular locus of a system of partial differential equations, and list them for Appell’s and Lauricella’s systems. We describe Pfaffian systems, contiguity relations, monodromy representations and twisted period relations for the systems. We give their explicit forms for Lauricella’s E_D, which is the simplest among Lauricella’s systems. We also mention the uniformization of the complement of the singular locus of E_D by the projectivization of its fundamental system of solutions.
This chapter gives an overview of the theory of nonsymmetric and symmetric Macdonald-Koornwinder polynomials. The setup of the theory is new, allowing for a uniform treatment of all known cases, including a new rank two case. Among the basic properties of the Macdonald-Koornwinder polynomials discussed in the chapter are the (bi)orthogonality relations, the quadratic norm formulas, duality, and evaluation formulas. The chapter also gives an introduction to the associated theory of double affine Hecke algebras.
Let $\gamma(G)$ and $${\gamma _ \circ }(G)$$ denote the sizes of a smallest dominating set and smallest independent dominating set in a graph G, respectively. One of the first results in probabilistic combinatorics is that if G is an n-vertex graph of minimum degree at least d, then
$$\begin{equation}\gamma(G) \leq \frac{n}{d}(\log d + 1).\end{equation}$$
In this paper the main result is that if G is any n-vertex d-regular graph of girth at least five, then
$$\begin{equation}\gamma_(G) \leq \frac{n}{d}(\log d + c)\end{equation}$$
for some constant c independent of d. This result is sharp in the sense that as $d \rightarrow \infty$, almost all d-regular n-vertex graphs G of girth at least five have
Furthermore, if G is a disjoint union of ${n}/{(2d)}$ complete bipartite graphs $K_{d,d}$, then ${\gamma_\circ}(G) = \frac{n}{2}$. We also prove that there are n-vertex graphs G of minimum degree d and whose maximum degree grows not much faster than d log d such that ${\gamma_\circ}(G) \sim {n}/{2}$ as $d \rightarrow \infty$. Therefore both the girth and regularity conditions are required for the main result.