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.
Given a nonincreasing function f : ℤ≥ 0 \{0} → ℤ≥ 0 such that (i) f(k) − f(k + 1) ≤ 1 for all k ≥ 1 and (ii) if a = f(1) and b = limk → ∞f(k), then |f−1(a)| ≤ |f−1(a − 1)| ≤ ··· ≤ |f−1(b + 1)|, a system of generators of a monomial ideal I ⊂ K[x1, . . ., xn] for which depth S/Ik = f(k) for all k ≥ 1 is explicitly described. Furthermore, we give a characterization of triplets of integers (n, d, r) with n > 0, d ≥ 0 and r > 0 with the properties that there exists a monomial ideal I ⊂ S = K[x1, . . ., xn] for which limk→∞ depth S/Ik = d and dstab(I) = r, where dstab(I) is the smallest integer k0 ≥ 1 with depth S/Ik0 = depth S/Ik0+1 = depth S/Ik0+2 = ···.
For a group G, a weak Cayley table isomorphism is a bijection f : G → G such that f(g1g2) is conjugate to f(g1)f(g2) for all g1, g2 ∈ G. The set of all weak Cayley table isomorphisms forms a group (G) that is the group of symmetries of the weak Cayley table of G. We determine (G) for each of the 17 wallpaper groups G, and for some other crystallographic groups.
Recent experiments have shown that patterns can emerge in bacterial colonies genetically modified to have a drop in diffusion when population densities (detected via a quorum sensing mechanism) are sufficiently large. We examine one PDE model of this system, and construct its non-constant stationary solutions in the form of an interface for the bacterial density. We derive the equations for the interface motion and demonstrate analytically that such interface solution is stable when the diffusion rate of bacteria is large and the diffusion rate of signalling molecules, Dh, is small. We further demonstrate that increasing Dh induces a Hopf bifurcation, resulting in a loss of stability, which can lead to either complex spatio-temporal dynamics or extinction of pattern altogether. These results are confirmed by numerical simulations.
For an element g of a group G, an Engel sink is a subset ${\mathscr E}$(g) such that for every x ∈ G all sufficiently long commutators [. . .[[x, g], g], . . ., g] belong to ${\mathscr E}$(g). A finite group is nilpotent if and only if every element has a trivial Engel sink. We prove that if in a finite group G every element has an Engel sink generating a subgroup of rank r, then G has a normal subgroup N of rank bounded in terms of r such that G/N is nilpotent.
Within themenagerie of objects studied in contemporary probability theory, a number of related animals have attracted great interest amongst probabilists and physicists in recent years. The inspiration for many of these objects comes from physics, but the mathematical subject has taken on a life of its own and many beautiful constructions have emerged. The overall target of these notes is to identify some of these topics, and to develop their basic theory at a level suitable for mathematics graduates.
If the two principal characters in these notes are random walk and percolation, they are only part of the rich theory of uniform spanning trees, self-avoiding walks, random networks, models for ferromagnetism and the spread of disease, and motion in random environments. This is an area that has attracted many fine scientists, by virtue, perhaps, of its special mixture of modelling and problem-solving. There remain many open problems. It is the experience of the author that these may be explained successfully to a graduate audience open to inspiration and provocation.
The material described here may be used for personal study and also as the bases of lecture courses of between 16 and 48 hours duration. Little is assumed about the mathematical background of the audience beyond some basic probability theory, but students should be willing to get their hands dirty if they are to profit. Care should be taken in the setting of examinations, since problems can be unexpectedly difficult. Successful examinations may be designed, and some help is offered through the inclusion of exercises at the ends of chapters. As an alternative to a conventional examination, students could be asked to deliver presentations on aspects and extensions of the topics studied.
Chapter 1 is devoted to the relationship between randomwalks (on graphs) and electrical networks. This leads to the Thomson andRayleigh principles, and thence to a proof of Pólya's theorem. In Chapter 2,we describeWilson's algorithm for constructing a uniform spanning tree (UST), and we discuss boundary conditions and weak limits for UST on a lattice. This chapter includes a brief introduction to Schramm–Löwner evolutions (SLEs).
We solve a problem posed by Cardinali and Sastry (Elliptic ovoids and their rosettes in a classical generalized quadrangle of even order. Proc. Indian Acad. Sci. Math. Sci.126 (2016), 591–612) about factorization of 2-covers of finite classical generalized quadrangles (GQs). To that end, we develop a general theory of cover factorization for GQs, and in particular, we study the isomorphism problem for such covers and associated geometries. As a byproduct, we obtain new results about semi-partial geometries coming from θ-covers, and consider related problems.