Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Laminational Models for Some Spaces of Polynomials of Any Degree
The so-called 'pinched disk' model of the Mandelbrot set is due to A. Douady, J. H. Hubbard, and W. P. Thurston. It can be described in the language of geodesic laminations.
War and Sacrifice
This collection of papers on the archaeology of conflict covers a wide range in both time and space, running from Sub-Neolithic Finland to early Modern Ireland. The papers include a diverse series of approaches to the study of conflict, using excavation, osteology, artefacts and linguistics.
Traffic Distributions and Independence: Permutation Invariant Random Matrices and the Three Notions of Independence
Voiculescu's notion of asymptotic free independence is known for a large class of random matrices including independent unitary invariant matrices. This notion is extended for independent random matrices invariant in law by conjugation by permutation matrices. This fact leads naturally to an extension of free probability, formalized under the notions of traffic probability. The author first establishes this construction for random matrices and then defines the traffic distribution of random matrices, which is richer than the $^*$-distribution of free probability. The knowledge of the individual traffic distributions of independent permutation invariant families of matrices is sufficient to c...
Theta Functions on Varieties with Effective Anti-Canonical Class
View the abstract.
The Bounded and Precise Word Problems for Presentations of Groups
The author introduces and studies the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be solved in nondeterministic polynomial time, and the precise word problem is in PSPACE, i.e., it can be solved in polynomial space. The main technical result of the paper states that, for certain finite presentations of groups, which include the Baumslag-Solitar one-relator groups and free products of cyclic groups, the bounded word problem and the precise word problem can be solved in polylogarithmic space. As consequences of developed techniques that can be described as calculus of brackets, the author obtains polylogarithmic space bounds for the computational complexity of the diagram problem for free groups, for the width problem for elements of free groups, and for computation of the area defined by polygonal singular closed curves in the plane. The author also obtains polynomial time bounds for these problems.
Bounded Littlewood Identities
We describe a method, based on the theory of Macdonald–Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald’s partial fraction technique and results in the first examples of bounded Littlewood identities for Macdonald polynomials. These identities, which take the form of decomposition formulas for Macdonald polynomials of type (R, S) in terms of ordinary Macdonald polynomials, are q, t-analogues of known branching formulas for characters of the symplectic, orthogonal and special orthogonal groups. In the classical limit, our method implies that MacMahon’s famous ex-conjecture for the generating function of symmetric plane partitions in a box follows from the identification of GL(n, R), O(n) as a Gelfand pair. As further applications, we obtain combinatorial formulas for characters of affine Lie algebras; Rogers–Ramanujan identities for affine Lie algebras, complementing recent results of Griffin et al.; and quadratic transformation formulas for Kaneko–Macdonald-type basic hypergeometric series.
