Search Results

This chapter analyzes Frobenius conjugacy classes. It shows that in either the split or nonsplit case, when χ‎ is good for N, the conjugacy class FrobE,X has unitary eigenvalues in every representation of the reductive group G_arith,N. Now fix a maximal compact subgroup K of the complex reductive group G_arith,N (ℂ). The semisimple part (in the sense of Jordan decomposition) of FrobE,X gives rise to a well-defined conjugacy class θE,X in K.

This chapter works on Gₘ/k. It considers an arithmetically semisimple object N ɛ G_arith which is pure of weight zero. It assumes it is of the form G[1], with G a middle extension sheaf. Thus, for some open set j : U ⊂ 𝔾ₘ, we have G = j_*Ƒ, for Ƒ := j^*G a lisse sheaf on U which is pure of weight −1 and arithmetically semisimple, and having no geometric constituent isomorphic to a Kummer sheaf.

It is easy to solve FP when n = 2. Indeed, g(a1, a2) = a1a2 - a1 - a2. However, the computation of a (simple) formula when n = 3 is much more difficult and has been the subject of numerous research papers over a long period. F. Curtis has proved that the search for such a formula is, in some sense, doomed to failure since the Frobenius number cannot be given by ‘closed’ formulas of a certain type. Recently, an explicit formula for computing g(a1, a2, a3) has been found. After presenting four different proofs of equality (1), one of which uses the well-known Pick's theorem, this chapter presents the result of Curtis, the general formula, and summarizes the known upper bounds for g(a1, a2, a3) as well as exact formulas for particular triples.

This chapter provides a systematic exposition of the known formulas, including upper and lower bounds for g(a1, . . . , an) for general n, and for special sequences (for instance, when a1, . . . , an forms an arithmetic sequence). Results on the change in value of g(a1, . . . , an), when an additional element an + 1 is inserted, are also given.

Let g(n, t) and h(n, t) be the largest and smallest of three of the Frobenius numbers when a1 < · · · < an = t and t = a1 < · · · < an, respectively. This chapter reviews the results on these functions. It also examines an algorithm that solves the modular change problem, a generalization of FP, due to Z. Skupień, describes the relation between FP and (a1, . . . , an)-trees, discusses the postage stamp problem, as well as a multidimensional generalization of FP.

This chapter contains a brief introduction to the fundamental concepts of Markov chains, including classification of states, irreducible classes, first passage times, stochastic complementation and censoring, and stationary distributions, for both discrete and continuous time processes. The chapter ends with properties of non-negative matrices and the Perron-Frobenius theorem.

In a series of papers by Freed, Hopkins, and Teleman (2003, 2005, 2007a) the relationship between positive energy representations of the loop group of a compact Lie group G and the twisted equivariant K-theory K ^τ+dimG _G (G) was developed. Here G acts on itself by conjugation. The loop group representations depend on a choice of ‘level’, and the twisting τ is derived from the level. For all levels the main theorem is an isomorphism of abelian groups, and for special transgressed levels it is an isomorphism of rings: the fusion ring of the loop group andK ^τ+dimG _G (G) as a ring. For G connected with π₁G torsionfree, it has been proven that the ring K ^τ+dimG _G (G) is a quotient of the representation ring of G and can be calculated explicitly. In these cases it agrees with the fusion ring of the corresponding centrally extended loop group. This chapter explicates the multiplication on the twisted equivariant K-theory for an arbitrary compact Lie group G. It constructs a Frobenius ring structure on K ^τ+dimG _G (G). This is best expressed in the language of topological quantum field theory: a two-dimensional topological quantum field theory (TQFT) is constructed over the integers in which the abelian group attached to the circle is K ^τ+dimG _G (G).

This chapter presents proofs of following theorems. Theorem 6.1: Suppose N in G_arith is geometrically semisimple. Then G_geom,N is a normal subgroup of G_arith,N. Theorem 6.2: Suppose that N in G_arith is arithmetically semisimple and pure of weight zero. If G_arith,N is finite, then N is punctual. Indeed, if every Frobenius conjugacy class FrobE,X in G_arith,N is quasiunipotent, then N is punctual. Theorem 6.4: Suppose that N in G_arith is arithmetically semisimple and pure of weight zero. If G_geom is finite, then N is punctual. Theorem 6.5: Suppose that N in G_arith is arithmetically semisimple and pure of weight zero. Then the group G_geom,N/G⁰_geom,N of connected components of G_geom,N is cyclic of some prime to p order n.

This chapter takes up the proof of the main theorem. Theorem 7.2: Suppose N in G_arithι‎-pure of weight zero and arithmetically semisimple, such that the quotient group G_arith,N/G_geom,N is ℤ / nℤ. Fix an integer d mod n. Then as E/k runs over larger and larger extension fields whose degree is d mod n, the conjugacy classes {θ‎_E,ρ‎}_goodρ‎ become equidistributed in the space Karith# for the measure μd# of total mass one. Equivalently, as E/k runs over larger and larger extension fields whose degree is d mod n, the conjugacy classes {θ‎_E,ρ‎}_goodρ‎ become equidistributed in the space Karith# for the measure i*μd# of total mass one.

This chapter deals with nonnegative matrices, which are relevant in the study of Markov processes because the state transition matrix of such a process is a special kind of nonnegative matrix, known as a stochastic matrix. However, it turns out that practically all of the useful properties of a stochastic matrix also hold for the more general class of nonnegative matrices. Hence it is desirable to present the theory in the more general setting, and then specialize to Markov processes. The chapter first considers the canonical form for nonnegative matrices, including irreducible matrices and periodic irreducible matrices, before discussing the Perron–Frobenius theorem for primitive matrices and for irreducible matrices.

This chapter focuses on the shift in attention of the London avant-garde towards visual art from West Africa and the Pacific islands from late 1912 into the war years. New evidence is presented showing that Epstein's first African experiments occurred no earlier than 1913. They are shown to have begun with an adaptation of aesthetics derived from the art of Benin City before engaging with Yoruba and Akan sculpture. The presentation of African art in institutions such as the British Museum is considered alongside its availability in various commercial galleries of the time and its reception by other members of the avant-garde such as D. H. Lawrence. Henri Gaudier-Brzeska is shown to have developed around the same time an interest in the Oceanic pieces in the British Museum that would inform works such as the Hieratic Head of Ezra Pound.

This chapter studies second order and Gaussian fields on the background spaces which are the continuum limits of the finite graphs. For this random processes in Hilbert spaces are examined. Orthogonal expansions such as Karhunen–Loeve are examined, with spectral representations of the processes established. Gaussian processes induced by differential operators representing physical processes in the world are studied.

The parameter spaces of natural patterns are so complex that inference must often proceed compositionally, successively building up more and more complex structures, as well as back-tracking, creating simpler structures from more complex versions. Inference is transformational in nature. The philosophical approach studied in this chapter is that the posterior distribution that describes the patterns contains all of the information about the underlying regular structure. Therefore, the transformations of inference are guided via the posterior in the sense that the algorithm for changing the regular structures will correspond to the sample path of a Markov process. The Markov process is constructed to push towards the posterior distribution in which the information about the patterns are stored. This provides the deepconnection between the transformational paradigm of regular structure creation, and random sampling algorithms.

In this final chapter, we return to the subject of the first: the fundamental principles of fluid mechanics. In chapter 1, we derived the equations of fluid motion from Hamilton’s principle of stationary action, emphasizing its logical simplicity and the resulting close correspondence between mechanics and thermodynamics. Now we explore the Hamiltonian approach more fully, discovering its other advantages. The most important of these advantages arise from the correspondence between the symmetry properties of the Lagrangian and the conservation laws of the resulting dynamical equations. Therefore, we begin with a very brief introduction to symmetry and conservation laws. Noether’s theorem applies to the equations that arise from variational principles like Hamilton’s principle. According to Noether’s theorem : If a variational principle is invariant to a continuous transformation of its dependent and independent variables, then the equations arising from the variational principle possess a divergence-form conservation law. The invariance property is also called a symmetry property. Thus Noether’s theorem connects symmetry properties and conservation laws. We shall neither state nor prove the general form of Noether’s theorem; to do so would require a lengthy digression on continuous groups. Instead we illustrate the connection between symmetry and conservation laws with a series of increasingly complex and important examples. These examples convey the flavor of the general theory. Our first example is very simple. Consider a body of mass m moving in one dimension. The body is attached to the end of a spring with spring-constant K. Let x(t) be the displacement of the body from its location when the spring is unstretched.

This chapter gives several examples, which may help the reader to work in concrete terms with Markoff numbers, Christoffel words, Markoff constants, and quadratic forms. In particular the thirteen Markoff numbers <1000 are given, together with the associated mathematical objects considered before in the book:Markoff constants, Christoffel words, the associated matrices by the representation of Chapter 3, theMarkoff quadratic numbers whose expansion is given by the Christoffel word, the Markoff quadratic forms. Some results of Frobenius, Aigner, andClemens are given. In particular thematrix associated with a Christoffel word may be computed directly from its Markoff triple.