Pure Mathematics
http://hdl.handle.net/10023/94
20180116T21:16:08Z

The infinite simple group V of Richard J. Thompson : presentations by permutations
http://hdl.handle.net/10023/12296
We show that one can naturally describe elements of R. Thompson's finitely presented infinite simple group V, known by Thompson to have a presentation with four generators and fourteen relations, as products of permutations analogous to transpositions. This perspective provides an intuitive explanation towards the simplicity of V and also perhaps indicates a reason as to why it was one of the first discovered infinite finitely presented simple groups: it is (in some basic sense) a relative of the finite alternating groups. We find a natural infinite presentation for V as a group generated by these "transpositions," which presentation bears comparison with Dehornoy's infinite presentation and which enables us to develop two small presentations for V: a humaninterpretable presentation with three generators and eight relations, and a Tietzederived presentation with two generators and seven relations.
20170101T00:00:00Z
Quick, Martyn
Bleak, Collin Patrick
We show that one can naturally describe elements of R. Thompson's finitely presented infinite simple group V, known by Thompson to have a presentation with four generators and fourteen relations, as products of permutations analogous to transpositions. This perspective provides an intuitive explanation towards the simplicity of V and also perhaps indicates a reason as to why it was one of the first discovered infinite finitely presented simple groups: it is (in some basic sense) a relative of the finite alternating groups. We find a natural infinite presentation for V as a group generated by these "transpositions," which presentation bears comparison with Dehornoy's infinite presentation and which enables us to develop two small presentations for V: a humaninterpretable presentation with three generators and eight relations, and a Tietzederived presentation with two generators and seven relations.

Return times at periodic points in random dynamics
http://hdl.handle.net/10023/12136
We prove a quenched limiting law for random measures on subshifts at periodic points. We consider a family of measures {µω}ω∈Ω, where the ‘driving space’ Ω is equipped with a probability measure which is invariant under a transformation θ. We assume that the fibred measures µω satisfy a generalised invariance property and are ψmixing. We then show that for almost every ω the return times to cylinders An at periodic points are in the limit compound Poisson distributed for a parameter ϑ which is given by the escape rate at the periodic point.
20170101T00:00:00Z
Haydn, Nicolai
Todd, Michael John
We prove a quenched limiting law for random measures on subshifts at periodic points. We consider a family of measures {µω}ω∈Ω, where the ‘driving space’ Ω is equipped with a probability measure which is invariant under a transformation θ. We assume that the fibred measures µω satisfy a generalised invariance property and are ψmixing. We then show that for almost every ω the return times to cylinders An at periodic points are in the limit compound Poisson distributed for a parameter ϑ which is given by the escape rate at the periodic point.

Counting subwords and other results related to the generalised starheight problem for regular languages
http://hdl.handle.net/10023/12024
The Generalised StarHeight Problem is an open question in the field of formal language theory that concerns a measure of complexity on the class of regular languages; specifically, it asks whether or not there exists an algorithm to determine the generalised starheight of a given regular language. Rather surprisingly, it is not yet known whether there exists a regular language of generalised starheight greater than one.
Motivated by a theorem of Thérien, we first take a combinatorial approach to the problem and consider the languages in which every word features a fixed contiguous subword an exact number of times. We show that these languages are all of generalised starheight zero. Similarly, we consider the languages in which every word features a fixed contiguous subword a prescribed number of times modulo a fixed number and show that these languages are all of generalised starheight at most one.
Using these combinatorial results, we initiate work on identifying the generalised starheight of the languages that are recognised by finite semigroups. To do this, we establish the generalised starheight of languages recognised by Rees zeromatrix semigroups over nilpotent groups of classes zero and one before considering Rees zeromatrix semigroups over monogenic semigroups.
Finally, we explore the generalised starheight of languages recognised by finite groups of a given order. We do this through the use of finite state automata and 'count arrows' to examine semidirect products of the form 𝐴 ⋊ ℤ[sub]𝑟, where 𝐴 is an abelian group and ℤ[sub]𝑟 is the cyclic group of order 𝑟.
20171207T00:00:00Z
Bourne, Thomas
The Generalised StarHeight Problem is an open question in the field of formal language theory that concerns a measure of complexity on the class of regular languages; specifically, it asks whether or not there exists an algorithm to determine the generalised starheight of a given regular language. Rather surprisingly, it is not yet known whether there exists a regular language of generalised starheight greater than one.
Motivated by a theorem of Thérien, we first take a combinatorial approach to the problem and consider the languages in which every word features a fixed contiguous subword an exact number of times. We show that these languages are all of generalised starheight zero. Similarly, we consider the languages in which every word features a fixed contiguous subword a prescribed number of times modulo a fixed number and show that these languages are all of generalised starheight at most one.
Using these combinatorial results, we initiate work on identifying the generalised starheight of the languages that are recognised by finite semigroups. To do this, we establish the generalised starheight of languages recognised by Rees zeromatrix semigroups over nilpotent groups of classes zero and one before considering Rees zeromatrix semigroups over monogenic semigroups.
Finally, we explore the generalised starheight of languages recognised by finite groups of a given order. We do this through the use of finite state automata and 'count arrows' to examine semidirect products of the form 𝐴 ⋊ ℤ[sub]𝑟, where 𝐴 is an abelian group and ℤ[sub]𝑟 is the cyclic group of order 𝑟.

Inhomogeneous selfsimilar sets with overlaps
http://hdl.handle.net/10023/11995
It is known that if the underlying iterated function system satisfies the open set condition, then the upper box dimension of an inhomogeneous selfsimilar set is the maximum of the upper box dimensions of the homogeneous counterpart and the condensation set. First, we prove that this 'expected formula' does not hold in general if there are overlaps in the construction. We demonstrate this via two different types of counterexample: the first is a family of overlapping inhomogeneous selfsimilar sets based upon Bernoulli convolutions; and the second applies in higher dimensions and makes use of a spectral gap property that holds for certain subgroups of SO(d) for d≥3. We also obtain new upper bounds for the upper box dimension of an inhomogeneous selfsimilar set which hold in general. Moreover, our counterexamples demonstrate that these bounds are optimal. In the final section we show that if the weak separation property is satisfied, that is, the overlaps are controllable, then the 'expected formula' does hold.
20170504T00:00:00Z
Baker, Simon
Fraser, Jonathan M.
Máthé, András
It is known that if the underlying iterated function system satisfies the open set condition, then the upper box dimension of an inhomogeneous selfsimilar set is the maximum of the upper box dimensions of the homogeneous counterpart and the condensation set. First, we prove that this 'expected formula' does not hold in general if there are overlaps in the construction. We demonstrate this via two different types of counterexample: the first is a family of overlapping inhomogeneous selfsimilar sets based upon Bernoulli convolutions; and the second applies in higher dimensions and makes use of a spectral gap property that holds for certain subgroups of SO(d) for d≥3. We also obtain new upper bounds for the upper box dimension of an inhomogeneous selfsimilar set which hold in general. Moreover, our counterexamples demonstrate that these bounds are optimal. In the final section we show that if the weak separation property is satisfied, that is, the overlaps are controllable, then the 'expected formula' does hold.

Arithmetic patches, weak tangents, and dimension
http://hdl.handle.net/10023/11978
We investigate the relationships between several classical notions in arithmetic combinatorics and geometry including the presence (or lack of) arithmetic progressions (or patches in dimensions at least 2), the structure of tangent sets, and the Assouad dimension. We begin by extending a recent result of Dyatlov and Zahl by showing that a set cannot contain arbitrarily large arithmetic progressions (patches) if it has Assouad dimension strictly smaller than the ambient spatial dimension. Seeking a partial converse, we go on to prove that having Assouad dimension equal to the ambient spatial dimension is equivalent to having weak tangents with nonempty interior and to ‘asymptotically’ containing arbitrarily large arithmetic patches. We present some applications of our results concerning sets of integers, which include a weak solution to the Erdös–Turán conjecture on arithmetic progressions.
The first named author is supported by a Leverhulme Trust Research Fellowship (RF2016500) and the second named author is supported by a PhD scholarship provided bythe School of Mathematics in the University of St Andrews
20171101T00:00:00Z
Fraser, Jonathan MacDonald
Yu, Han
We investigate the relationships between several classical notions in arithmetic combinatorics and geometry including the presence (or lack of) arithmetic progressions (or patches in dimensions at least 2), the structure of tangent sets, and the Assouad dimension. We begin by extending a recent result of Dyatlov and Zahl by showing that a set cannot contain arbitrarily large arithmetic progressions (patches) if it has Assouad dimension strictly smaller than the ambient spatial dimension. Seeking a partial converse, we go on to prove that having Assouad dimension equal to the ambient spatial dimension is equivalent to having weak tangents with nonempty interior and to ‘asymptotically’ containing arbitrarily large arithmetic patches. We present some applications of our results concerning sets of integers, which include a weak solution to the Erdös–Turán conjecture on arithmetic progressions.

Parallel algorithms for computing finite semigroups
http://hdl.handle.net/10023/11879
In this paper, we present two algorithms based on the FroidurePin Algorithm for computing a finite semigroup. If U is any semigroup, and A be a subset of U, then we denote by ⟨A⟩ the least subsemigroup of U containing A. If B is any other subset of U, then, roughly speaking, the first algorithm we present describes how to use any information about ⟨A⟩, that has been found using the FroidurePin Algorithm, to compute the semigroup ⟨A, B⟩. More precisely, we describe the data structure for a finite semigroup S given by Froidure and Pin, and how to obtain such a data structure for ⟨A, B⟩ from that for ⟨A⟩. The second algorithm is a lockfree concurrent version of the FroidurePin Algorithm. As was the case with the original algorithm of Froidure and Pin, the algorithms presented here produce the left and right Cayley graphs, a confluent terminating rewriting system, and a reduced word of the rewriting system for every element of the semigroup they output.
20170619T00:00:00Z
Jonusas, Julius
Mitchell, J. D.
Pfeiffer, M.
In this paper, we present two algorithms based on the FroidurePin Algorithm for computing a finite semigroup. If U is any semigroup, and A be a subset of U, then we denote by ⟨A⟩ the least subsemigroup of U containing A. If B is any other subset of U, then, roughly speaking, the first algorithm we present describes how to use any information about ⟨A⟩, that has been found using the FroidurePin Algorithm, to compute the semigroup ⟨A, B⟩. More precisely, we describe the data structure for a finite semigroup S given by Froidure and Pin, and how to obtain such a data structure for ⟨A, B⟩ from that for ⟨A⟩. The second algorithm is a lockfree concurrent version of the FroidurePin Algorithm. As was the case with the original algorithm of Froidure and Pin, the algorithms presented here produce the left and right Cayley graphs, a confluent terminating rewriting system, and a reduced word of the rewriting system for every element of the semigroup they output.

On the Fourier analytic structure of the Brownian graph
http://hdl.handle.net/10023/11846
In a previous article (Int. Math. Res. Not. 2014:10 (2014), 2730–2745) T. Orponen and the authors proved that the Fourier dimension of the graph of any realvalued function on R is bounded above by 1. This partially answered a question of Kahane (1993) by showing that the graph of the Wiener process Wt (Brownian motion) is almost surely not a Salem set. In this article we complement this result by showing that the Fourier dimension of the graph of Wt is almost surely 1. In the proof we introduce a method based on Itô calculus to estimate Fourier transforms by reformulating the question in the language of Itô driftdiffusion processes and combine it with the classical work of Kahane on Brownian images.
20180101T00:00:00Z
Fraser, Jonathan MacDonald
Sahlsten, Tuomas
In a previous article (Int. Math. Res. Not. 2014:10 (2014), 2730–2745) T. Orponen and the authors proved that the Fourier dimension of the graph of any realvalued function on R is bounded above by 1. This partially answered a question of Kahane (1993) by showing that the graph of the Wiener process Wt (Brownian motion) is almost surely not a Salem set. In this article we complement this result by showing that the Fourier dimension of the graph of Wt is almost surely 1. In the proof we introduce a method based on Itô calculus to estimate Fourier transforms by reformulating the question in the language of Itô driftdiffusion processes and combine it with the classical work of Kahane on Brownian images.

Root sets of polynomials and power series with finite choice of coefficients
http://hdl.handle.net/10023/11822
Given H⊆C two natural objects to study are the set of zeros of polynomials with coefficients in H, {z∈C:∃k>0,∃(an)∈Hk+1,∑n=0kanzn=0}, and the set of zeros of a power series with coefficients in H, {z∈C:∃(an)∈HN,∑n=0∞anzn=0}. In this paper, we consider the case where each element of H has modulus 1. The main result of this paper states that for any r∈(1/2,1), if H is 2cos−1(5−4r24)dense in S1, then the set of zeros of polynomials with coefficients in H is dense in {z∈C:z∈[r,r−1]}, and the set of zeros of power series with coefficients in H contains the annulus {z∈C:z∈[r,1)}. These two statements demonstrate quantitatively how the set of polynomial zeros/power series zeros fill out the natural annulus containing them as H becomes progressively more dense.
The first author is supported by the EPSRC Grant EP/M001903/1. The second author is supported by a PhD scholarship provided by the School of Mathematics in the University of St Andrews.
20171009T00:00:00Z
Baker, Simon
Yu, Han
Given H⊆C two natural objects to study are the set of zeros of polynomials with coefficients in H, {z∈C:∃k>0,∃(an)∈Hk+1,∑n=0kanzn=0}, and the set of zeros of a power series with coefficients in H, {z∈C:∃(an)∈HN,∑n=0∞anzn=0}. In this paper, we consider the case where each element of H has modulus 1. The main result of this paper states that for any r∈(1/2,1), if H is 2cos−1(5−4r24)dense in S1, then the set of zeros of polynomials with coefficients in H is dense in {z∈C:z∈[r,r−1]}, and the set of zeros of power series with coefficients in H contains the annulus {z∈C:z∈[r,1)}. These two statements demonstrate quantitatively how the set of polynomial zeros/power series zeros fill out the natural annulus containing them as H becomes progressively more dense.

On the starheight of subword counting languages and their relationship to Rees zeromatrix semigroups
http://hdl.handle.net/10023/11811
Given a word w over a finite alphabet, we consider, in three special cases, the generalised starheight of the languages in which w occurs as a contiguous subword (factor) an exact number of times and of the languages in which w occurs as a contiguous subword modulo a fixed number, and prove that in each case it is at most one. We use these combinatorial results to show that any language recognised by a Rees (zero)matrix semigroup over an abelian group is of generalised starheight at most one.
20161115T00:00:00Z
Bourne, Tom
Ruškuc, Nik
Given a word w over a finite alphabet, we consider, in three special cases, the generalised starheight of the languages in which w occurs as a contiguous subword (factor) an exact number of times and of the languages in which w occurs as a contiguous subword modulo a fixed number, and prove that in each case it is at most one. We use these combinatorial results to show that any language recognised by a Rees (zero)matrix semigroup over an abelian group is of generalised starheight at most one.

Selfsimilar sets: projections, sections and percolation
http://hdl.handle.net/10023/11629
We survey some recent results on the dimension of orthogonal projections of selfsimilar sets and of random subsets obtained by percolation on selfsimilar sets. In particular we highlight conditions when the dimension of the projections takes the generic value for all, or very nearly all, projections. We then describe a method for deriving dimensional properties of sections of deterministic selfsimilar sets by utilising projection properties of random percolation subsets.
20170101T00:00:00Z
Falconer, Kenneth John
Jin, Xiong
We survey some recent results on the dimension of orthogonal projections of selfsimilar sets and of random subsets obtained by percolation on selfsimilar sets. In particular we highlight conditions when the dimension of the projections takes the generic value for all, or very nearly all, projections. We then describe a method for deriving dimensional properties of sections of deterministic selfsimilar sets by utilising projection properties of random percolation subsets.

Nearcomplete external difference families
http://hdl.handle.net/10023/11576
We introduce and explore nearcomplete external difference families, a partitioning of the nonidentity elements of a group so that each nonidentity element is expressible as a difference of elements from distinct subsets a fixed number of times. We show that the existence of such an object implies the existence of a nearresolvable design. We provide examples and general constructions of these objects, some of which lead to new parameter families of nearresolvable designs on a nonprimepower number of points. Our constructions employ cyclotomy, partial difference sets, and Galois rings.
20170901T00:00:00Z
Davis, James A.
Huczynska, Sophie
Mullen, Gary L.
We introduce and explore nearcomplete external difference families, a partitioning of the nonidentity elements of a group so that each nonidentity element is expressible as a difference of elements from distinct subsets a fixed number of times. We show that the existence of such an object implies the existence of a nearresolvable design. We provide examples and general constructions of these objects, some of which lead to new parameter families of nearresolvable designs on a nonprimepower number of points. Our constructions employ cyclotomy, partial difference sets, and Galois rings.

Synchronization and separation in the Johnson schemes
http://hdl.handle.net/10023/11525
Recently Peter Keevash solved asymptotically the existence question for Steiner systems by showing that S(t,k,n) exists whenever the necessary divisibility conditions on the parameters are satisfied and n is sufficiently large in terms of k and t. The purpose of this paper is to make a conjecture which if true would be a significant extension of Keevash's theorem, and to give some theoretical and computational evidence for the conjecture. We phrase the conjecture in terms of the notions (which we define here) of synchronization and separation for association schemes. These definitions are based on those for permutation groups which grow out of the theory of synchronization in finite automata. In this theory, two classes of permutation groups (called synchronizing and separating) lying between primitive and 2homogeneous are defined. A big open question is how the permutation group induced by Sn on ksubsets of {1,...,n} fits in this hierarchy; our conjecture would give a solution to this problem for n large in terms of k.
20170628T00:00:00Z
Aljohani, Mohammed
Bamberg, John
Cameron, Peter Jephson
Recently Peter Keevash solved asymptotically the existence question for Steiner systems by showing that S(t,k,n) exists whenever the necessary divisibility conditions on the parameters are satisfied and n is sufficiently large in terms of k and t. The purpose of this paper is to make a conjecture which if true would be a significant extension of Keevash's theorem, and to give some theoretical and computational evidence for the conjecture. We phrase the conjecture in terms of the notions (which we define here) of synchronization and separation for association schemes. These definitions are based on those for permutation groups which grow out of the theory of synchronization in finite automata. In this theory, two classes of permutation groups (called synchronizing and separating) lying between primitive and 2homogeneous are defined. A big open question is how the permutation group induced by Sn on ksubsets of {1,...,n} fits in this hierarchy; our conjecture would give a solution to this problem for n large in terms of k.

Orbits of primitive khomogenous groups on (nk)partitions with applications to semigroups
http://hdl.handle.net/10023/11403
The purpose of this paper is to advance our knowledge of two of the most classic and popular topics in transformation semigroups: automorphisms and the size of minimal generating sets. In order to do this, we examine the khomogeneous permutation groups (those which act transitively on the subsets of size k of their domain X) where X=n and k<n/2. In the process we obtain, for khomogeneous groups, results on the minimum numbers of generators, the numbers of orbits on kpartitions, and their normalizers in the symmetric group. As a sample result, we show that every finite 2homogeneous group is 2generated. Underlying our investigations on automorphisms of transformation semigroups is the following conjecture: If a transformation semigroup S contains singular maps, and its group of units is a primitive group G of permutations, then its automorphisms are all induced (under conjugation) by the elements in the normalizer of G in the symmetric group. For the special case that S contains all constant maps, this conjecture was proved correct, more than 40 years ago. In this paper, we prove that the conjecture also holds for the case of semigroups containing a map of rank 3 or less. The effort in establishing this result suggests that further improvements might be a great challenge. This problem and several additional} ones on permutation groups, transformation semigroups and computational algebra, are proposed in the end of the paper.
This work was developed within FCT project CEMATCIÊNCIAS (UID/Multi/04621/2013).
20170509T00:00:00Z
Araújo, João
Bentz, Wolfram
Cameron, Peter Jephson
The purpose of this paper is to advance our knowledge of two of the most classic and popular topics in transformation semigroups: automorphisms and the size of minimal generating sets. In order to do this, we examine the khomogeneous permutation groups (those which act transitively on the subsets of size k of their domain X) where X=n and k<n/2. In the process we obtain, for khomogeneous groups, results on the minimum numbers of generators, the numbers of orbits on kpartitions, and their normalizers in the symmetric group. As a sample result, we show that every finite 2homogeneous group is 2generated. Underlying our investigations on automorphisms of transformation semigroups is the following conjecture: If a transformation semigroup S contains singular maps, and its group of units is a primitive group G of permutations, then its automorphisms are all induced (under conjugation) by the elements in the normalizer of G in the symmetric group. For the special case that S contains all constant maps, this conjecture was proved correct, more than 40 years ago. In this paper, we prove that the conjecture also holds for the case of semigroups containing a map of rank 3 or less. The effort in establishing this result suggests that further improvements might be a great challenge. This problem and several additional} ones on permutation groups, transformation semigroups and computational algebra, are proposed in the end of the paper.

Recurrence statistics for the space of interval exchange maps and the Teichmüller flow on the space of translation surfaces
http://hdl.handle.net/10023/11400
In this paper we show that the transfer operator of a Rauzy–Veech–Zorich renormalization map acting on a space of quasiHölder functions is quasicompact and derive certain statistical recurrence properties for this map and its associated Teichmüller flow. We establish Borel–Cantelli lemmas, Extreme Value statistics and return time statistics for the map and flow. Previous results have established quasicompactness in Hölder or analytic function spaces, for example the work of M. Pollicott and T. Morita. The quasiHölder function space is particularly useful for investigating return time statistics. In particular we establish the shrinking target property for nested balls in the setting of Teichmüller flow. Our point of view, approach and terminology derive from the work of M. Pollicott augmented by that of M. Viana.
MT was partially supported by NSF grant DMS 110958.
20170801T00:00:00Z
Aimino, Romain
Nicol, Matthew
Todd, Michael John
In this paper we show that the transfer operator of a Rauzy–Veech–Zorich renormalization map acting on a space of quasiHölder functions is quasicompact and derive certain statistical recurrence properties for this map and its associated Teichmüller flow. We establish Borel–Cantelli lemmas, Extreme Value statistics and return time statistics for the map and flow. Previous results have established quasicompactness in Hölder or analytic function spaces, for example the work of M. Pollicott and T. Morita. The quasiHölder function space is particularly useful for investigating return time statistics. In particular we establish the shrinking target property for nested balls in the setting of Teichmüller flow. Our point of view, approach and terminology derive from the work of M. Pollicott augmented by that of M. Viana.

Constructing 2generated subgroups of the group of homeomorphisms of Cantor space
http://hdl.handle.net/10023/11362
We study finite generation, 2generation and simplicity of subgroups of H[sub]c, the
group of homeomorphisms of Cantor space.
In Chapter 1 and Chapter 2 we run through foundational concepts and notation. In Chapter 3 we study vigorous subgroups of H[sub]c. A subgroup G of H[sub]c is vigorous if for any nonempty clopen set A with proper nonempty clopen subsets B and C there exists g ∈ G with supp(g) ⊑ A and Bg ⊆ C. It is a corollary of the main theorem of Chapter 3 that all finitely generated simple vigorous subgroups of H[sub]c are in fact 2generated. We show the family of finitely generated, simple, vigorous subgroups of H[sub]c is closed under several natural constructions.
In Chapter 4 we use a generalised notion of word and the tight completion construction from [13] to construct a family of subgroups of H[sub]c which generalise Thompson's group V . We give necessary conditions for these groups to be finitely generated and simple. Of these we show which are vigorous. Finally we give some examples.
20170101T00:00:00Z
Hyde, James Thomas
We study finite generation, 2generation and simplicity of subgroups of H[sub]c, the
group of homeomorphisms of Cantor space.
In Chapter 1 and Chapter 2 we run through foundational concepts and notation. In Chapter 3 we study vigorous subgroups of H[sub]c. A subgroup G of H[sub]c is vigorous if for any nonempty clopen set A with proper nonempty clopen subsets B and C there exists g ∈ G with supp(g) ⊑ A and Bg ⊆ C. It is a corollary of the main theorem of Chapter 3 that all finitely generated simple vigorous subgroups of H[sub]c are in fact 2generated. We show the family of finitely generated, simple, vigorous subgroups of H[sub]c is closed under several natural constructions.
In Chapter 4 we use a generalised notion of word and the tight completion construction from [13] to construct a family of subgroups of H[sub]c which generalise Thompson's group V . We give necessary conditions for these groups to be finitely generated and simple. Of these we show which are vigorous. Finally we give some examples.

Decision problems for wordhyperbolic semigroups
http://hdl.handle.net/10023/11263
This paper studies decision problems for semigroups that are wordhyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `wordhyperbolic structure' has to be strengthened slightly in order to define a unique semigroup up to isomorphism. The isomorphism problem is proven to be undecidable for wordhyperbolic semigroups (in contrast to the situation for wordhyperbolic groups). It is proved that it is undecidable whether a wordhyperbolic semigroup is automatic, asynchronously automatic, biautomatic, or asynchronously biautomatic. (These properties do not hold in general for wordhyperbolic semigroups.) It is proved that the uniform word problem for wordhyperbolic semigroup is solvable in polynomial time (improving on the previous exponentialtime algorithm). Algorithms are presented for deciding whether a wordhyperbolic semigroup is a monoid, a group, a completely simple semigroup, a Clifford semigroup, or a free semigroup.
20161101T00:00:00Z
Cain, Alan James
Pfeiffer, Markus Johannes
This paper studies decision problems for semigroups that are wordhyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `wordhyperbolic structure' has to be strengthened slightly in order to define a unique semigroup up to isomorphism. The isomorphism problem is proven to be undecidable for wordhyperbolic semigroups (in contrast to the situation for wordhyperbolic groups). It is proved that it is undecidable whether a wordhyperbolic semigroup is automatic, asynchronously automatic, biautomatic, or asynchronously biautomatic. (These properties do not hold in general for wordhyperbolic semigroups.) It is proved that the uniform word problem for wordhyperbolic semigroup is solvable in polynomial time (improving on the previous exponentialtime algorithm). Algorithms are presented for deciding whether a wordhyperbolic semigroup is a monoid, a group, a completely simple semigroup, a Clifford semigroup, or a free semigroup.

Generalized Bernstein polynomials and total positivity
http://hdl.handle.net/10023/11183
"This thesis submitted for Ph.D. degree deals mainly with geometric properties of generalized Bernstein polynomials which replace the single Bernstein polynomial by a oneparameter family of polynomials. It also provides a triangular decomposition and 1banded factorization of the Vandermonde matrix.
We first establish the generalized Bernstein polynomials for monomials, which leads to a definition of Stirling polynomials of the second kind. These are qanalogues of Stirling numbers of the second kind. Some of the properties of the Stirling numbers are generalized to their qanalogues.
We show that the generalized Bernstein polynomials are monotonic in degree n when the function ƒ is convex...
Shape preserving properties of the generalized Bernstein polynomials are studied by making use of the concept of total positivity. It is proved that monotonic and convex functions produce monotonic and convex generalized Bernstein polynomials. It is also shown that the generalized Bernstein polynomials are monotonic in the parameter q
for the class of convex functions.
Finally, we look into the degree elevation and degree reduction processes on the generalized Bernstein polynomials."  from the Abstract.
19990101T00:00:00Z
Oruç, Halil
"This thesis submitted for Ph.D. degree deals mainly with geometric properties of generalized Bernstein polynomials which replace the single Bernstein polynomial by a oneparameter family of polynomials. It also provides a triangular decomposition and 1banded factorization of the Vandermonde matrix.
We first establish the generalized Bernstein polynomials for monomials, which leads to a definition of Stirling polynomials of the second kind. These are qanalogues of Stirling numbers of the second kind. Some of the properties of the Stirling numbers are generalized to their qanalogues.
We show that the generalized Bernstein polynomials are monotonic in degree n when the function ƒ is convex...
Shape preserving properties of the generalized Bernstein polynomials are studied by making use of the concept of total positivity. It is proved that monotonic and convex functions produce monotonic and convex generalized Bernstein polynomials. It is also shown that the generalized Bernstein polynomials are monotonic in the parameter q
for the class of convex functions.
Finally, we look into the degree elevation and degree reduction processes on the generalized Bernstein polynomials."  from the Abstract.

Between primitive and 2transitive : synchronization and its friends
http://hdl.handle.net/10023/11134
An automaton (consisting of a finite set of states with given transitions) is said to be synchronizing if there is a word in the transitions which sends all states of the automaton to a single state. Research on this topic has been driven by the Černý conjecture, one of the oldest and most famous problems in automata theory, according to which a synchronizing nstate automaton has a reset word of length at most (n − 1)2 . The transitions of an automaton generate a transformation monoid on the set of states, and so an automaton can be regarded as a transformation monoid with a prescribed set of generators. In this setting, an automaton is synchronizing if the transitions generate a constant map. A permutation group G on a set Ω is said to synchronize a map f if the monoid hG, fi generated by G and f is synchronizing in the above sense; we say G is synchronizing if it synchronizes every nonpermutation. The classes of synchronizing groups and friends form an hierarchy of natural and elegant classes of groups lying strictly between the classes of primitive and 2homogeneous groups. These classes have been floating around for some years and it is now time to provide a unified reference on them. The study of all these classes has been prompted by the Černý conjecture, but it is of independent interest since it involves a rich mix of group theory, combinatorics, graph endomorphisms, semigroup theory, finite geometry, and representation theory, and has interesting computational aspects as well. So as to make the paper selfcontained, we have provided background material on these topics. Our purpose here is to present recent work on synchronizing groups and related topics. In addition to the results that show the connections between the various areas of mathematics mentioned above, we include a new result on the Černý conjecture (a strengthening of a theorem of Rystsov), some challenges to finite geometers (which classical polar spaces can be partitioned into ovoids?), some thoughts about infinite analogues, and a long list of open problems to stimulate further work.
The second author was supported by the Fundação para a Ciência e Tecnologia (Portuguese Foundation for Science and Technology) through the project CEMATCIÊNCIAS UID/Multi/ 04621/2013
20170101T00:00:00Z
Araújo, João
Cameron, Peter Jephson
Steinberg, Benjamin
An automaton (consisting of a finite set of states with given transitions) is said to be synchronizing if there is a word in the transitions which sends all states of the automaton to a single state. Research on this topic has been driven by the Černý conjecture, one of the oldest and most famous problems in automata theory, according to which a synchronizing nstate automaton has a reset word of length at most (n − 1)2 . The transitions of an automaton generate a transformation monoid on the set of states, and so an automaton can be regarded as a transformation monoid with a prescribed set of generators. In this setting, an automaton is synchronizing if the transitions generate a constant map. A permutation group G on a set Ω is said to synchronize a map f if the monoid hG, fi generated by G and f is synchronizing in the above sense; we say G is synchronizing if it synchronizes every nonpermutation. The classes of synchronizing groups and friends form an hierarchy of natural and elegant classes of groups lying strictly between the classes of primitive and 2homogeneous groups. These classes have been floating around for some years and it is now time to provide a unified reference on them. The study of all these classes has been prompted by the Černý conjecture, but it is of independent interest since it involves a rich mix of group theory, combinatorics, graph endomorphisms, semigroup theory, finite geometry, and representation theory, and has interesting computational aspects as well. So as to make the paper selfcontained, we have provided background material on these topics. Our purpose here is to present recent work on synchronizing groups and related topics. In addition to the results that show the connections between the various areas of mathematics mentioned above, we include a new result on the Černý conjecture (a strengthening of a theorem of Rystsov), some challenges to finite geometers (which classical polar spaces can be partitioned into ovoids?), some thoughts about infinite analogues, and a long list of open problems to stimulate further work.

Algorithms for detecting dependencies and rigid subsystems for CAD
http://hdl.handle.net/10023/11110
Automated approaches for detecting dependencies in structures created with Computer Aided Design software are critical for developing robust solvers and providing informative user feedback. We model a set of geometric constraints with a bicolored multigraph and give a graphbased pebble game algorithm that allows us to determine combinatorially if there are generic dependencies. We further use the pebble game to yield a decomposition of the graph into factor graphs which may be used to give a user detailed feedback about dependent substructures in a specific realization of a system of CAD constraints with nongeneric properties.
Louis Theran is partially supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007–2013)/ERC grant agreement No. 247029SDModels, Academy of Finland (AKA) project COALESCE, and the Hutchcroft fund.
20161001T00:00:00Z
Farre, James
Kleinschmidt, Helena
Sidman, Jessica
John, Audrey St.
Stark, Stephanie
Theran, Louis
Yu, Xilin
Automated approaches for detecting dependencies in structures created with Computer Aided Design software are critical for developing robust solvers and providing informative user feedback. We model a set of geometric constraints with a bicolored multigraph and give a graphbased pebble game algorithm that allows us to determine combinatorially if there are generic dependencies. We further use the pebble game to yield a decomposition of the graph into factor graphs which may be used to give a user detailed feedback about dependent substructures in a specific realization of a system of CAD constraints with nongeneric properties.

Flatness, extension and amalgamation in monoids, semigroups and rings
http://hdl.handle.net/10023/11071
We begin our study of amalgamations by examining some ideas which are wellknown for the category of Rmodules. In particular we look at such notions as direct limits, pushouts, pullbacks, tensor products and flatness in the category of Ssets.
Chapter II introduces the important concept of free extensions and uses this to describe the amalgamated free product.
In Chapter III we define the extension property and the notion of purity. We show that many of the important notions in semigroup amalgams are intimately connected to these. In Section 2 we deduce that 'the extension property implies amalgamation' and more
surprisingly that a semigroup U is an amalgamation base if and only if it has the extension property in every containing semigroup.
Chapter IV revisits the idea of flatness and after some technical results we prove a result, similar to one for rings, on flat amalgams.
In Chapter V we show that the results of Hall and Howie on perfect amalgams can be proved using the same techniques as those used in Chapters III and IV.
We conclude the thesis with a look at the case of rings. We show that almost all of the results for semi group amalgams examined in the previous chapters, also hold for ring amalgams.
19860101T00:00:00Z
Renshaw, James Henry
We begin our study of amalgamations by examining some ideas which are wellknown for the category of Rmodules. In particular we look at such notions as direct limits, pushouts, pullbacks, tensor products and flatness in the category of Ssets.
Chapter II introduces the important concept of free extensions and uses this to describe the amalgamated free product.
In Chapter III we define the extension property and the notion of purity. We show that many of the important notions in semigroup amalgams are intimately connected to these. In Section 2 we deduce that 'the extension property implies amalgamation' and more
surprisingly that a semigroup U is an amalgamation base if and only if it has the extension property in every containing semigroup.
Chapter IV revisits the idea of flatness and after some technical results we prove a result, similar to one for rings, on flat amalgams.
In Chapter V we show that the results of Hall and Howie on perfect amalgams can be proved using the same techniques as those used in Chapters III and IV.
We conclude the thesis with a look at the case of rings. We show that almost all of the results for semi group amalgams examined in the previous chapters, also hold for ring amalgams.

Dimension theory of random selfsimilar and selfaffine constructions
http://hdl.handle.net/10023/11033
This thesis is structured as follows.
Chapter 1 introduces fractal sets before recalling basic mathematical concepts from dynamical systems, measure theory, dimension theory and probability theory.
In Chapter 2 we give an overview of both deterministic and stochastic sets obtained from iterated function systems.
We summarise classical results and set most of the basic notation.
This is followed by the introduction of random graph directed systems in Chapter 3, based on the single authored paper [T1] to be published in Journal of Fractal Geometry. We prove that these attractors have equal Hausdorff and upper boxcounting dimension irrespective of overlaps. It follows that the same holds for the classical models introduced in Chapter 2. This chapter also contains results about the Assouad dimensions for these random sets.
Chapter 4 is based on the single authored paper [T2] and establishes the boxcounting dimension for random boxlike selfaffine sets using some of the results and the notation developed in Chapter 3. We give some examples to illustrate the results.
In Chapter 5 we consider the Hausdorff and packing measure of random attractors and show that for reasonable random systems the Hausdorff measure is zero almost surely. We further establish bounds on the gauge functions necessary to obtain positive or finite Hausdorff measure for random homogeneous systems.
Chapter 6 is based on a joint article with J. M. Fraser and J.J. Miao [FMT] to appear in Ergodic Theory and Dynamical Systems. It is chronologically the first and contains results that were extended in the paper on which Chapter 3 is based.
However, we will give some simpler, alternative proofs in this section and crucially also find the Assouad dimension of some random selfaffine carpets and show that the Assouad dimension is always `maximal' in both measure theoretic and topological meanings.
20170623T00:00:00Z
Troscheit, Sascha
This thesis is structured as follows.
Chapter 1 introduces fractal sets before recalling basic mathematical concepts from dynamical systems, measure theory, dimension theory and probability theory.
In Chapter 2 we give an overview of both deterministic and stochastic sets obtained from iterated function systems.
We summarise classical results and set most of the basic notation.
This is followed by the introduction of random graph directed systems in Chapter 3, based on the single authored paper [T1] to be published in Journal of Fractal Geometry. We prove that these attractors have equal Hausdorff and upper boxcounting dimension irrespective of overlaps. It follows that the same holds for the classical models introduced in Chapter 2. This chapter also contains results about the Assouad dimensions for these random sets.
Chapter 4 is based on the single authored paper [T2] and establishes the boxcounting dimension for random boxlike selfaffine sets using some of the results and the notation developed in Chapter 3. We give some examples to illustrate the results.
In Chapter 5 we consider the Hausdorff and packing measure of random attractors and show that for reasonable random systems the Hausdorff measure is zero almost surely. We further establish bounds on the gauge functions necessary to obtain positive or finite Hausdorff measure for random homogeneous systems.
Chapter 6 is based on a joint article with J. M. Fraser and J.J. Miao [FMT] to appear in Ergodic Theory and Dynamical Systems. It is chronologically the first and contains results that were extended in the paper on which Chapter 3 is based.
However, we will give some simpler, alternative proofs in this section and crucially also find the Assouad dimension of some random selfaffine carpets and show that the Assouad dimension is always `maximal' in both measure theoretic and topological meanings.

Restricted permutations, antichains, atomic classes and stack sorting
http://hdl.handle.net/10023/11023
Involvement is a partial order on all finite permutations, of infinite dimension and having subsets isomorphic to every countable partial order with finite descending chains. It has attracted the attention of some celebrated mathematicians including Paul Erdős and, due to its close links with sorting devices, Donald Knuth.
We compare and contrast two presentations of closed classes that depend on the partial order of involvement: Basis or Avoidance Set, and Union of Atomic Classes. We examine how the basis is affected by a comprehensive list of closed class constructions and decompositions.
The partial order of involvement contains infinite antichains. We develop the concept of a fundamental antichain. We compare the concept of 'fundamental' with other definitions of minimality for antichains, and compare fundamental permutation antichains with fundamental antichains in graph theory. The justification for investigating fundamental antichains is the nice patterns they produce. We forward the case for classifying the fundamental permutation antichains.
Sorting devices have close links with closed classes. We consider two sorting devices, constructed from stacks in series, in detail.
We give a comment on an enumerative conjecture by Ira Gessel.
We demonstrate, with a remarkable example, that there exist two closed classes, equinumerous, one of which has a single basis element, the other infinitely many basis elements.
We present this paper as a comprehensive analysis of the partial order of permutation involvement. We regard the main research contributions offered here to be the examples that demonstrate what is, and what is not, possible; although there are numerous structure results that do not fall under this category. We propose the classification of fundamental permutation antichains as one of the principal problems for closed classes today, and consider this as a problem whose solution will have wide significance for the study of partial orders, and mathematics as a whole.
20030101T00:00:00Z
Murphy, Maximilian M.
Involvement is a partial order on all finite permutations, of infinite dimension and having subsets isomorphic to every countable partial order with finite descending chains. It has attracted the attention of some celebrated mathematicians including Paul Erdős and, due to its close links with sorting devices, Donald Knuth.
We compare and contrast two presentations of closed classes that depend on the partial order of involvement: Basis or Avoidance Set, and Union of Atomic Classes. We examine how the basis is affected by a comprehensive list of closed class constructions and decompositions.
The partial order of involvement contains infinite antichains. We develop the concept of a fundamental antichain. We compare the concept of 'fundamental' with other definitions of minimality for antichains, and compare fundamental permutation antichains with fundamental antichains in graph theory. The justification for investigating fundamental antichains is the nice patterns they produce. We forward the case for classifying the fundamental permutation antichains.
Sorting devices have close links with closed classes. We consider two sorting devices, constructed from stacks in series, in detail.
We give a comment on an enumerative conjecture by Ira Gessel.
We demonstrate, with a remarkable example, that there exist two closed classes, equinumerous, one of which has a single basis element, the other infinitely many basis elements.
We present this paper as a comprehensive analysis of the partial order of permutation involvement. We regard the main research contributions offered here to be the examples that demonstrate what is, and what is not, possible; although there are numerous structure results that do not fall under this category. We propose the classification of fundamental permutation antichains as one of the principal problems for closed classes today, and consider this as a problem whose solution will have wide significance for the study of partial orders, and mathematics as a whole.

Topological graph inverse semigroups
http://hdl.handle.net/10023/10847
To every directed graph E one can associate a graph inverse semigroup G(E), where elements roughly correspond to possible paths in E . These semigroups generalize polycyclic monoids, and they arise in the study of Leavitt path algebras, Cohn path algebras, graph C⁎C⁎algebras, and Toeplitz C⁎algebras. We investigate topologies that turn G(E) into a topological semigroup. For instance, we show that in any such topology that is Hausdorff, G(E)∖{0} must be discrete for any directed graph E . On the other hand, G(E) need not be discrete in a Hausdorff semigroup topology, and for certain graphs E , G(E) admits a T1 semigroup topology in which G(E)∖{0} is not discrete. We also describe, in various situations, the algebraic structure and possible cardinality of the closure of G(E) in larger topological semigroups.
Michał Morayne was partially supported by NCN grant DEC2011/01/B/ST1/01439 while this work was performed.
20160801T00:00:00Z
Mesyan, Z.
Mitchell, J. D.
Morayne, M.
Péresse, Y. H.
To every directed graph E one can associate a graph inverse semigroup G(E), where elements roughly correspond to possible paths in E . These semigroups generalize polycyclic monoids, and they arise in the study of Leavitt path algebras, Cohn path algebras, graph C⁎C⁎algebras, and Toeplitz C⁎algebras. We investigate topologies that turn G(E) into a topological semigroup. For instance, we show that in any such topology that is Hausdorff, G(E)∖{0} must be discrete for any directed graph E . On the other hand, G(E) need not be discrete in a Hausdorff semigroup topology, and for certain graphs E , G(E) admits a T1 semigroup topology in which G(E)∖{0} is not discrete. We also describe, in various situations, the algebraic structure and possible cardinality of the closure of G(E) in larger topological semigroups.

ℤ4codes and their Gray map images as orthogonal arrays
http://hdl.handle.net/10023/10804
A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter.Since the paper of Hammons et al., there is a lot of interest in codes over rings, especially in codes over ℤ4 and their (usually nonlinear) binary Gray map images.We show that Delsarte's observation extends to codes over arbitrary finite commutative rings with identity. Also, we show that the strength of the Gray map image of a ℤ4 code is one less than the minimum Lee weight of its Gray map image.
20170701T00:00:00Z
Cameron, Peter Jephson
Kusuma, Josephine
Solé, Patrick
A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter.Since the paper of Hammons et al., there is a lot of interest in codes over rings, especially in codes over ℤ4 and their (usually nonlinear) binary Gray map images.We show that Delsarte's observation extends to codes over arbitrary finite commutative rings with identity. Also, we show that the strength of the Gray map image of a ℤ4 code is one less than the minimum Lee weight of its Gray map image.

Rare events for the MannevillePomeau map
http://hdl.handle.net/10023/10742
We prove a dichotomy for MannevillePomeau maps ƒ : [0, 1] → [0, 1] : given any point ζ ε [0, 1] , either the Rare Events Point Processes (REPP), counting the number of exceedances, which correspond to entrances in balls around ζ, converge in distribution to a Poisson process; or the point ζ is periodic and the REPP converge in distribution to a compound Poisson process. Our method is to use inducing techniques for all points except 0 and its preimages, extending a recent result [HWZ14], and then to deal with the remaining points separately. The preimages of 0 are dealt with applying recent results in [AFV14]. The point ζ = 0 is studied separately because the tangency with the identity map at this point creates too much dependence, which causes severe clustering of exceedances. The Extremal Index, which measures the intensity of clustering, is equal to 0 at ζ = 0 , which ultimately leads to a degenerate limit distribution for the partial maxima of stochastic processes arising from the dynamics and for the usual normalising sequences. We prove that using adapted normalising sequences we can still obtain nondegenerate limit distributions at ζ = 0 .
Funding: CMUP (UID/MAT/00144/2013), which is funded by FCT (Portugal) with national (MEC) and European structural funds through the programs FEDER, under the partnership agreement PT2020.
20161101T00:00:00Z
Freitas, Ana Cristina Moreira
Freitas, Jorge
Todd, Mike
Vaienti, Sandro
We prove a dichotomy for MannevillePomeau maps ƒ : [0, 1] → [0, 1] : given any point ζ ε [0, 1] , either the Rare Events Point Processes (REPP), counting the number of exceedances, which correspond to entrances in balls around ζ, converge in distribution to a Poisson process; or the point ζ is periodic and the REPP converge in distribution to a compound Poisson process. Our method is to use inducing techniques for all points except 0 and its preimages, extending a recent result [HWZ14], and then to deal with the remaining points separately. The preimages of 0 are dealt with applying recent results in [AFV14]. The point ζ = 0 is studied separately because the tangency with the identity map at this point creates too much dependence, which causes severe clustering of exceedances. The Extremal Index, which measures the intensity of clustering, is equal to 0 at ζ = 0 , which ultimately leads to a degenerate limit distribution for the partial maxima of stochastic processes arising from the dynamics and for the usual normalising sequences. We prove that using adapted normalising sequences we can still obtain nondegenerate limit distributions at ζ = 0 .

Uniform scaling limits for ergodic measures
http://hdl.handle.net/10023/10724
We provide an elementary proof that ergodic measures on onesided shift spaces are ‘uniformly scaling’ in the following sense: at almost every point the scenery distributions weakly converge to a common distribution on the space of measures. Moreover, we show how the limiting distribution can be expressed in terms of, and derived from, a 'reverse Jacobian’ function associated with the corresponding measure on the space of left infinite sequences. Finally we specialise to the setting of Gibbs measures, discuss some statistical properties, and prove a Central Limit Theorem for ergodic Markov measures.
J. M. Fraser and M. Pollicott were financially supported in part by the EPSRC grant EP/J013560/1.
20170101T00:00:00Z
Fraser, Jonathan MacDonald
Pollicott, Mark
We provide an elementary proof that ergodic measures on onesided shift spaces are ‘uniformly scaling’ in the following sense: at almost every point the scenery distributions weakly converge to a common distribution on the space of measures. Moreover, we show how the limiting distribution can be expressed in terms of, and derived from, a 'reverse Jacobian’ function associated with the corresponding measure on the space of left infinite sequences. Finally we specialise to the setting of Gibbs measures, discuss some statistical properties, and prove a Central Limit Theorem for ergodic Markov measures.

Highest rank of a polytope for An
http://hdl.handle.net/10023/10678
We prove that the highest rank of a string Cgroup constructed from an alternating group An is 3 if n=5, 4 if n=9, 5 if n=10, 6 if n=11, and ⌊(n−1)/2⌋ if n⩾12. Moreover, if n=3,4,6,7, or 8, the group An is not a string Cgroup. This solves a conjecture made by the last three authors in 2012.
This research was supported by a Marsden grant (UOA1218) of the Royal Society of New Zealand, and by the Portuguese Foundation for Science and Technology (FCTFundação para a Ciência e a Tecnologia), through CIDMA  Center for Research and Development in Mathematics and Applications, within project UID/MAT/04106/2013.
20170704T00:00:00Z
Cameron, Peter J.
Fernandes, Maria Elisa
Leemans, Dimitri
Mixer, Mark
We prove that the highest rank of a string Cgroup constructed from an alternating group An is 3 if n=5, 4 if n=9, 5 if n=10, 6 if n=11, and ⌊(n−1)/2⌋ if n⩾12. Moreover, if n=3,4,6,7, or 8, the group An is not a string Cgroup. This solves a conjecture made by the last three authors in 2012.

Multifractal zeta functions
http://hdl.handle.net/10023/10637
Multifractals have during the past 20 − 25 years been the focus of enormous attention in the mathematical literature. Loosely speaking there are two main ingredients in multifractal analysis: the multifractal spectra and the Renyi dimensions. One of the main goals in multifractal analysis is to understand these two ingredients and their relationship with each other. Motivated by the powerful techniques provided by the use of the ArtinMazur zetafunctions in number theory and the use of the Ruelle zetafunctions in dynamical systems, Lapidus and collaborators (see books by Lapidus & van Frankenhuysen [32, 33] and the references therein) have introduced and pioneered use of zetafunctions in fractal geometry. Inspired by this development, within the past 7−8 years several authors have paralleled this development by introducing zetafunctions into multifractal geometry. Our result inspired by this work will be given in section 2.2.2. There we introduce geometric multifractal zetafunctions providing precise information of very general classes of multifractal spectra, including, for example, the multifractal spectra of selfconformal measures and the multifractal spectra of ergodic Birkhoff averages of continuous functions. Results in that section are based on paper [37].
Dynamical zetafunctions have been introduced and developed by Ruelle [63, 64] and others, (see, for example, the surveys and books [3, 54, 55] and the references therein). It has been a major challenge to introduce and develop a natural and meaningful theory of dynamical multifractal zetafunctions paralleling existing theory of dynamical zeta functions. In particular, in the setting of selfconformal constructions, Olsen [49] introduced a family of dynamical multifractal zetafunctions designed to provide precise information of very general classes of multifractal spectra, including, for example, the multifractal spectra of selfconformal measures and the multifractal spectra of ergodic Birkhoff averages of continuous functions. However, recently it has been recognised that while selfconformal constructions provide a useful and important framework for studying fractal and multifractal geometry, the more general notion of graphdirected selfconformal constructions provide a substantially more flexible and useful framework, see, for example, [36] for an elaboration of this. In recognition of this viewpoint, in section 2.3.11 we provide main definitions of the multifractal pressure and the multifractal dynamical zetafunctions and we state our main results. This section is based on paper [38].
Setting we are working unifies various different multifractal spectra including fine multifractal spectra of selfconformal measures or Birkhoff averages of continuous function. It was introduced by Olsen in [43]. In section 2.1 we propose answer to problem of defining Renyi spectra in more general settings and provide slight improvement of result regrading multifractal spectra in the case of Subshift of finite type.
20170623T00:00:00Z
Mijović, Vuksan
Multifractals have during the past 20 − 25 years been the focus of enormous attention in the mathematical literature. Loosely speaking there are two main ingredients in multifractal analysis: the multifractal spectra and the Renyi dimensions. One of the main goals in multifractal analysis is to understand these two ingredients and their relationship with each other. Motivated by the powerful techniques provided by the use of the ArtinMazur zetafunctions in number theory and the use of the Ruelle zetafunctions in dynamical systems, Lapidus and collaborators (see books by Lapidus & van Frankenhuysen [32, 33] and the references therein) have introduced and pioneered use of zetafunctions in fractal geometry. Inspired by this development, within the past 7−8 years several authors have paralleled this development by introducing zetafunctions into multifractal geometry. Our result inspired by this work will be given in section 2.2.2. There we introduce geometric multifractal zetafunctions providing precise information of very general classes of multifractal spectra, including, for example, the multifractal spectra of selfconformal measures and the multifractal spectra of ergodic Birkhoff averages of continuous functions. Results in that section are based on paper [37].
Dynamical zetafunctions have been introduced and developed by Ruelle [63, 64] and others, (see, for example, the surveys and books [3, 54, 55] and the references therein). It has been a major challenge to introduce and develop a natural and meaningful theory of dynamical multifractal zetafunctions paralleling existing theory of dynamical zeta functions. In particular, in the setting of selfconformal constructions, Olsen [49] introduced a family of dynamical multifractal zetafunctions designed to provide precise information of very general classes of multifractal spectra, including, for example, the multifractal spectra of selfconformal measures and the multifractal spectra of ergodic Birkhoff averages of continuous functions. However, recently it has been recognised that while selfconformal constructions provide a useful and important framework for studying fractal and multifractal geometry, the more general notion of graphdirected selfconformal constructions provide a substantially more flexible and useful framework, see, for example, [36] for an elaboration of this. In recognition of this viewpoint, in section 2.3.11 we provide main definitions of the multifractal pressure and the multifractal dynamical zetafunctions and we state our main results. This section is based on paper [38].
Setting we are working unifies various different multifractal spectra including fine multifractal spectra of selfconformal measures or Birkhoff averages of continuous function. It was introduced by Olsen in [43]. In section 2.1 we propose answer to problem of defining Renyi spectra in more general settings and provide slight improvement of result regrading multifractal spectra in the case of Subshift of finite type.

Planar selfaffine sets with equal Hausdorff, box and affinity dimensions
http://hdl.handle.net/10023/10634
Using methods from ergodic theory along with properties of the Furstenberg measure we obtain conditions under which certain classes of plane selfaffine sets have Hausdorff or boxcounting dimensions equal to their affinity dimension. We exhibit some new specific classes of selfaffine sets for which these dimensions are equal.
20161020T00:00:00Z
Falconer, Kenneth
Kempton, Thomas Michael William
Using methods from ergodic theory along with properties of the Furstenberg measure we obtain conditions under which certain classes of plane selfaffine sets have Hausdorff or boxcounting dimensions equal to their affinity dimension. We exhibit some new specific classes of selfaffine sets for which these dimensions are equal.

Generating sets of finite groups
http://hdl.handle.net/10023/10576
We investigate the extent to which the exchange relation holds in finite groups G. We define a new equivalence relation ≡m, where two elements are equivalent if each can be substituted for the other in any generating set for G. We then refine this to a new sequence ≡(r)/m of equivalence relations by saying that x≡(r)/m y if each can be substituted for the other in any relement generating set. The relations ≡(r)/m become finer as r increases, and we define a new group invariant ψ(G) to be the value of r at which they stabilise to ≡m. Remarkably, we are able to prove that if G is soluble then ψ(G) ∈ {d(G),d(G)+1}, where d(G) is the minimum number of generators of G, and to classify the finite soluble groups G for which ψ(G)=d(G). For insoluble G, we show that d(G) ≤ ψ(G) ≤ d(G)+5. However, we know of no examples of groups G for which ψ(G) > d(G)+1. As an application, we look at the generating graph of G, whose vertices are the elements of G, the edges being the 2element generating sets. Our relation ≡(2)m enables us to calculate Aut(Γ(G)) for all soluble groups G of nonzero spread, and give detailed structural information about Aut(Γ(G)) in the insoluble case.
20170402T00:00:00Z
Cameron, Peter Jephson
Lucchini, Andrea
RoneyDougal, Colva Mary
We investigate the extent to which the exchange relation holds in finite groups G. We define a new equivalence relation ≡m, where two elements are equivalent if each can be substituted for the other in any generating set for G. We then refine this to a new sequence ≡(r)/m of equivalence relations by saying that x≡(r)/m y if each can be substituted for the other in any relement generating set. The relations ≡(r)/m become finer as r increases, and we define a new group invariant ψ(G) to be the value of r at which they stabilise to ≡m. Remarkably, we are able to prove that if G is soluble then ψ(G) ∈ {d(G),d(G)+1}, where d(G) is the minimum number of generators of G, and to classify the finite soluble groups G for which ψ(G)=d(G). For insoluble G, we show that d(G) ≤ ψ(G) ≤ d(G)+5. However, we know of no examples of groups G for which ψ(G) > d(G)+1. As an application, we look at the generating graph of G, whose vertices are the elements of G, the edges being the 2element generating sets. Our relation ≡(2)m enables us to calculate Aut(Γ(G)) for all soluble groups G of nonzero spread, and give detailed structural information about Aut(Γ(G)) in the insoluble case.

Mixed moments and local dimensions of measures
http://hdl.handle.net/10023/10568
We analyse the asymptotic behaviour of the mixed moments of Borel probability measures on [0,1]d. In particular, we prove that the asymptotic behaviour of the mixed moments of a measure is intimately related to the local dimensions of the measure.
20160901T00:00:00Z
Olsen, Lars Ole Ronnow
We analyse the asymptotic behaviour of the mixed moments of Borel probability measures on [0,1]d. In particular, we prove that the asymptotic behaviour of the mixed moments of a measure is intimately related to the local dimensions of the measure.

On the generating graph of a simple group
http://hdl.handle.net/10023/10539
The generating graph Γ(H) of a finite group H is the graph defined on the elements of H, with an edge between two vertices if and only if they generate H. We show that if H is a sufficiently large simple group with Γ(G) ≅ Γ(H) for a finite group G, then G ≅ H. We also prove that the generating graph of a symmetric group determines the group.
The authors were supported by Universita di Padova (Progetto di Ricerca di Ateneo: Invariable generation of groups). The second author was also supported by an Alexander von Humboldt Fellowship for Experienced Researchers, by OTKA grants K84233 and K115799, and by the MTA Renyi Lendulet Groups and Graphs Research Group.
20170801T00:00:00Z
Lucchini, Andrea
Maroti, Attila
RoneyDougal, Colva Mary
The generating graph Γ(H) of a finite group H is the graph defined on the elements of H, with an edge between two vertices if and only if they generate H. We show that if H is a sufficiently large simple group with Γ(G) ≅ Γ(H) for a finite group G, then G ≅ H. We also prove that the generating graph of a symmetric group determines the group.

The Assouad dimension of randomly generated fractals
http://hdl.handle.net/10023/10511
We consider several dierent models for generating random fractals including random selfsimilar sets, random selfaffine carpets, and Mandelbrot percolation. In each setting we compute either the almost sure or the Baire typical Assouad dimension and consider some illustrative examples. Our results reveal a phenomenon common to each of our models: the Assouad dimension of a randomly generated fractal is generically as big as possible and does not depend on the measure theoretic or topological structure of the sample space. This is in stark contrast to the other commonly studied notions of dimension like the Hausdor or packing dimension.
JMF was financially supported by the EPSRC grant EP/J013560/1 whilst employed at the University of Warwick. JJM was partially supported by the NNSF of China (no. 11201152), the Fund for the Doctoral Program of Higher Education of China (no. 20120076120001) and SRF for ROCS, SEM (no. 01207427) ST was financially supported by the EPSRC Doctoral Training Grant EP/K503162/1.
20160922T00:00:00Z
Fraser, Jonathan MacDonald
Miao, Jun Jie
Troscheit, Sascha
We consider several dierent models for generating random fractals including random selfsimilar sets, random selfaffine carpets, and Mandelbrot percolation. In each setting we compute either the almost sure or the Baire typical Assouad dimension and consider some illustrative examples. Our results reveal a phenomenon common to each of our models: the Assouad dimension of a randomly generated fractal is generically as big as possible and does not depend on the measure theoretic or topological structure of the sample space. This is in stark contrast to the other commonly studied notions of dimension like the Hausdor or packing dimension.

Linear response for intermittent maps
http://hdl.handle.net/10023/10334
We consider the one parameter family α↦Tα (α∈[0,1)) of PomeauManneville type interval maps Tα(x)=x(1+2αxα) for x∈[0,1/2) and Tα(x)=2x−1 for x∈[1/2,1], with the associated absolutely continuous invariant probability measure μα. For α∈(0,1), Sarig and Gouëzel proved that the system mixes only polynomially with rate n1−1/α (in particular, there is no spectral gap). We show that for any ψ∈Lq, the map α→∫10ψdμα is differentiable on [0,1−1/q), and we give a (linear response) formula for the value of the derivative. This is the first time that a linear response formula for the SRB measure is obtained in the setting of slowly mixing dynamics. Our argument shows how cone techniques can be used in this context. For α≥1/2 we need the n−1/α decorrelation obtained by Gouëzel under additional conditions.
20161101T00:00:00Z
Baladi, Viviane
Todd, Michael John
We consider the one parameter family α↦Tα (α∈[0,1)) of PomeauManneville type interval maps Tα(x)=x(1+2αxα) for x∈[0,1/2) and Tα(x)=2x−1 for x∈[1/2,1], with the associated absolutely continuous invariant probability measure μα. For α∈(0,1), Sarig and Gouëzel proved that the system mixes only polynomially with rate n1−1/α (in particular, there is no spectral gap). We show that for any ψ∈Lq, the map α→∫10ψdμα is differentiable on [0,1−1/q), and we give a (linear response) formula for the value of the derivative. This is the first time that a linear response formula for the SRB measure is obtained in the setting of slowly mixing dynamics. Our argument shows how cone techniques can be used in this context. For α≥1/2 we need the n−1/α decorrelation obtained by Gouëzel under additional conditions.

The classification of partition homogeneous groups with applications to semigroup theory
http://hdl.handle.net/10023/10228
Let λ=(λ1,λ2,...) be a partition of n, a sequence of positive integers in nonincreasing order with sum n. Let Ω:={1,...,n}. An ordered partition P=(A1,A2,...) of Ω has type λ if Ai=λi.Following Martin and Sagan, we say that G is λtransitive if, for any two ordered partitions P=(A1,A2,...) and Q=(B1,B2,...) of Ω of type λ, there exists g ∈ G with Aig=Bi for all i. A group G is said to be λhomogeneous if, given two ordered partitions P and Q as above, inducing the sets P'={A1,A2,...} and Q'={B1,B2,...}, there exists g ∈ G such that P'g=Q'. Clearly a λtransitive group is λhomogeneous.The first goal of this paper is to classify the λhomogeneous groups (Theorems 1.1 and 1.2). The second goal is to apply this classification to a problem in semigroup theory.Let Tn and Sn denote the transformation monoid and the symmetric group on Ω, respectively. Fix a group H<=Sn. Given a noninvertible transformation a in TnSn and a group G<=Sn, we say that (a,G) is an Hpair if the semigroups generated by {a} ∪ H and {a} ∪ G contain the same nonunits, that is, {a,G}\G= {a,H}\H. Using the classification of the λhomogeneous groups we classify all the Snpairs (Theorem 1.8). For a multitude of transformation semigroups this theorem immediately implies a description of their automorphisms, congruences, generators and other relevant properties (Theorem 8.5). This topic involves both group theory and semigroup theory; we have attempted to include enough exposition to make the paper selfcontained for researchers in both areas. The paper finishes with a number of open problems on permutation and linear groups.
20160415T00:00:00Z
André, Jorge
Araúo, Joāo
Cameron, Peter Jephson
Let λ=(λ1,λ2,...) be a partition of n, a sequence of positive integers in nonincreasing order with sum n. Let Ω:={1,...,n}. An ordered partition P=(A1,A2,...) of Ω has type λ if Ai=λi.Following Martin and Sagan, we say that G is λtransitive if, for any two ordered partitions P=(A1,A2,...) and Q=(B1,B2,...) of Ω of type λ, there exists g ∈ G with Aig=Bi for all i. A group G is said to be λhomogeneous if, given two ordered partitions P and Q as above, inducing the sets P'={A1,A2,...} and Q'={B1,B2,...}, there exists g ∈ G such that P'g=Q'. Clearly a λtransitive group is λhomogeneous.The first goal of this paper is to classify the λhomogeneous groups (Theorems 1.1 and 1.2). The second goal is to apply this classification to a problem in semigroup theory.Let Tn and Sn denote the transformation monoid and the symmetric group on Ω, respectively. Fix a group H<=Sn. Given a noninvertible transformation a in TnSn and a group G<=Sn, we say that (a,G) is an Hpair if the semigroups generated by {a} ∪ H and {a} ∪ G contain the same nonunits, that is, {a,G}\G= {a,H}\H. Using the classification of the λhomogeneous groups we classify all the Snpairs (Theorem 1.8). For a multitude of transformation semigroups this theorem immediately implies a description of their automorphisms, congruences, generators and other relevant properties (Theorem 8.5). This topic involves both group theory and semigroup theory; we have attempted to include enough exposition to make the paper selfcontained for researchers in both areas. The paper finishes with a number of open problems on permutation and linear groups.

On The Lq dimensions of measures on HeuterLalley type selfaffine sets
http://hdl.handle.net/10023/10165
We study the Lqdimensions of selfaffine measures and the Käenmäki measure on a class of selfaffine sets similar to the class considered by Hueter and Lalley. We give simple, checkable conditions under which the Lqdimensions are equal to the value predicted by Falconer for a range of q. As a corollary this gives a wider class of selfaffine sets for which the Hausdorff dimension can be explicitly calculated. Our proof combines the potential theoretic approach developed by Hunt and Kaloshin with recent advances in the dynamics of selfaffine sets.
The authors were financially supported by an LMS Scheme 4 Research in Pairs grant. The second author also acknowledges financial support from the EPSRC grant EP/K029061/1, and the first author acknowledges financial support from a Leverhulme Trust Research Fellowship (RF2016500).
20180101T00:00:00Z
Fraser, Jonathan M.
Kempton, Tom
We study the Lqdimensions of selfaffine measures and the Käenmäki measure on a class of selfaffine sets similar to the class considered by Hueter and Lalley. We give simple, checkable conditions under which the Lqdimensions are equal to the value predicted by Falconer for a range of q. As a corollary this gives a wider class of selfaffine sets for which the Hausdorff dimension can be explicitly calculated. Our proof combines the potential theoretic approach developed by Hunt and Kaloshin with recent advances in the dynamics of selfaffine sets.

A dynamical definition of f.g. virtually free groups
http://hdl.handle.net/10023/10148
We show that the class of finitely generated virtually free groups is precisely the class of demonstrable subgroups for R. Thompson's group V . The class of demonstrable groups for V consists of all groups which can embed into V with a natural dynamical behaviour in their induced actions on the Cantor space C2 := {0,1}ω. There are also connections with formal language theory, as the class of groups with contextfree word problem is also the class of finitely generated virtually free groups, while R. Thompson's group V is a candidate as a universal coCF group by Lehnert's conjecture, corresponding to the class of groups with context free coword problem (as introduced by Holt, Rees, Röver, and Thomas). Our main results answers a question of BernsZieze, Fry, Gillings, Hoganson, and Matthews, and separately of Bleak and SalazarDías, and fits into the larger exploration of the class of coCF groups as it shows that all four of the known properties of the class of coCF groups hold for the set of finitely generation subgroups of V .
20160201T00:00:00Z
Bennett, Daniel
Bleak, Collin
We show that the class of finitely generated virtually free groups is precisely the class of demonstrable subgroups for R. Thompson's group V . The class of demonstrable groups for V consists of all groups which can embed into V with a natural dynamical behaviour in their induced actions on the Cantor space C2 := {0,1}ω. There are also connections with formal language theory, as the class of groups with contextfree word problem is also the class of finitely generated virtually free groups, while R. Thompson's group V is a candidate as a universal coCF group by Lehnert's conjecture, corresponding to the class of groups with context free coword problem (as introduced by Holt, Rees, Röver, and Thomas). Our main results answers a question of BernsZieze, Fry, Gillings, Hoganson, and Matthews, and separately of Bleak and SalazarDías, and fits into the larger exploration of the class of coCF groups as it shows that all four of the known properties of the class of coCF groups hold for the set of finitely generation subgroups of V .

On optimality and construction of circular repeatedmeasurements designs
http://hdl.handle.net/10023/10092
The aim of this paper is to characterize and construct universally optimal designs among the class of circular repeatedmeasurements designs when the parameters do not permit balance for carryover effects. It is shown that some circular weakly neighbour balanced designs defined by Filipiak and Markiewicz (2012) are universally optimal repeatedmeasurements designs. These results extend the work of Magda (1980), Kunert (1984b) and Filipiak and Markiewicz (2012).
20170101T00:00:00Z
Bailey, Rosemary Anne
Cameron, Peter Jephson
Filipiak, Katarzyna
Kunert, Joachim
Markiewicz, Augustyn
The aim of this paper is to characterize and construct universally optimal designs among the class of circular repeatedmeasurements designs when the parameters do not permit balance for carryover effects. It is shown that some circular weakly neighbour balanced designs defined by Filipiak and Markiewicz (2012) are universally optimal repeatedmeasurements designs. These results extend the work of Magda (1980), Kunert (1984b) and Filipiak and Markiewicz (2012).

Transience and multifractal analysis
http://hdl.handle.net/10023/10086
We study dimension theory for dissipative dynamical systems, proving a conditional variational principle for the quotients of Birkhoff averages restricted to the recurrent part of the system. On the other hand, we show that when the whole system is considered (and not just its recurrent part) the conditional variational principle does not necessarily hold. Moreover, we exhibit an example of a topologically transitive map having discontinuous Lyapunov spectrum. The mechanism producing all these pathological features on the multifractal spectra is transience, that is, the nonrecurrent part of the dynamics.
G.I. was partially supported by the Center of Dynamical Systems and Related Fields código ACT1103 and by Proyecto Fondecyt 1150058. T.J. wishes to thank Proyecto Mecesup0711 for funding his visit to PUCChile. M.T. is grateful for the support of Proyecto Fondecyt 1110040 for funding his visit to PUCChile and for partial support from NSF grant DMS 1109587.
20170301T00:00:00Z
Iommi, Godofredo
Jordan, Thomas
Todd, Michael John
We study dimension theory for dissipative dynamical systems, proving a conditional variational principle for the quotients of Birkhoff averages restricted to the recurrent part of the system. On the other hand, we show that when the whole system is considered (and not just its recurrent part) the conditional variational principle does not necessarily hold. Moreover, we exhibit an example of a topologically transitive map having discontinuous Lyapunov spectrum. The mechanism producing all these pathological features on the multifractal spectra is transience, that is, the nonrecurrent part of the dynamics.

Multifractal spectra and multifractal zetafunctions
http://hdl.handle.net/10023/10071
We introduce multifractal zetafunctions providing precise information of a very general class of multifractal spectra, including, for example, the multifractal spectra of selfconformal measures and the multifractal spectra of ergodic Birkhoff averages of continuous functions. More precisely, we prove that these and more general multifractal spectra equal the abscissae of convergence of the associated zetafunctions.
20170201T00:00:00Z
Mijovic, Vuksan
Olsen, Lars Ole Ronnow
We introduce multifractal zetafunctions providing precise information of a very general class of multifractal spectra, including, for example, the multifractal spectra of selfconformal measures and the multifractal spectra of ergodic Birkhoff averages of continuous functions. More precisely, we prove that these and more general multifractal spectra equal the abscissae of convergence of the associated zetafunctions.

Average distances on selfsimilar sets and higher order average distances of selfsimilar measures
http://hdl.handle.net/10023/10069
The purpose of this paper is twofold: (1) We study different notions of the average distance between two points of a selfsimilar subset of ℝ, and (2) we investigate the asymptotic behaviour of higher order average moments of selfsimilar measures on selfsimilar subsets of in ℝ.
20171001T00:00:00Z
Allen, D.
Edwards, H.
Harper, S.
Olsen, Lars Ole Ronnow
The purpose of this paper is twofold: (1) We study different notions of the average distance between two points of a selfsimilar subset of ℝ, and (2) we investigate the asymptotic behaviour of higher order average moments of selfsimilar measures on selfsimilar subsets of in ℝ.

The Assouad dimension of selfaffine carpets with no grid structure
http://hdl.handle.net/10023/10061
Previous study of the Assouad dimension of planar selfaffine sets has relied heavily on the underlying IFS having a `grid structure', thus allowing for the use of approximate squares. We study the Assouad dimension of a class of selfaffine carpets which do not have an associated grid structure. We find that the Assouad dimension is related to the box and Assouad dimensions of the (selfsimilar) projection of the selfaffine set onto the first coordinate and to the local dimensions of the projection of a natural Bernoulli measure onto the first coordinate. In a special case we relate the Assouad dimension of the PrzytyckiUrbański sets to the lower local dimensions of Bernoulli convolutions.
JMF is financially supported by a Leverhulme Trust Research Fellowship.
20170616T00:00:00Z
Fraser, Jonathan M.
Jordan, Thomas
Previous study of the Assouad dimension of planar selfaffine sets has relied heavily on the underlying IFS having a `grid structure', thus allowing for the use of approximate squares. We study the Assouad dimension of a class of selfaffine carpets which do not have an associated grid structure. We find that the Assouad dimension is related to the box and Assouad dimensions of the (selfsimilar) projection of the selfaffine set onto the first coordinate and to the local dimensions of the projection of a natural Bernoulli measure onto the first coordinate. In a special case we relate the Assouad dimension of the PrzytyckiUrbański sets to the lower local dimensions of Bernoulli convolutions.

Strong Marstrand theorems and dimensions of sets formed by subsets of hyperplanes
http://hdl.handle.net/10023/10058
We present strong versions of Marstrand's projection theorems and other related theorems. For example, if E is a plane set of positive and finite sdimensional Hausdorff measure, there is a set X of directions of Lebesgue measure 0, such that the projection onto any line with direction outside X, of any subset F of E of positive sdimensional measure, has Hausdorff dimension min(1,s), i.e. the set of exceptional directions is independent of F. Using duality this leads to results on the dimension of sets that intersect families of lines or hyperplanes in positive Lebesgue measure.
20160101T00:00:00Z
Falconer, Kenneth
Mattila, Pertti
We present strong versions of Marstrand's projection theorems and other related theorems. For example, if E is a plane set of positive and finite sdimensional Hausdorff measure, there is a set X of directions of Lebesgue measure 0, such that the projection onto any line with direction outside X, of any subset F of E of positive sdimensional measure, has Hausdorff dimension min(1,s), i.e. the set of exceptional directions is independent of F. Using duality this leads to results on the dimension of sets that intersect families of lines or hyperplanes in positive Lebesgue measure.

Observing the formation of flaredriven coronal rain
http://hdl.handle.net/10023/10001
Flaredriven coronal rain can manifest from rapidly cooled plasma condensations near coronal looptops in thermally unstable postflare arcades. We detect 5 phases that characterise the postflare decay:heating, evaporation, conductive cooling dominance for ~120 s, radiative/ enthalpy cooling dominance for ~4700 s and finally catastrophic cooling occurring within 35124 s leading to rain strands with s periodicity of 5570 s. We find an excellent agreement between the observations and model predictions of the dominant cooling timescales and the onset of catastrophic cooling. At the rain formation site we detect comoving, multithermal rain clumps that undergo catastrophic cooling from ~1 MK to ~22000 K. During catastrophic cooling the plasma cools at a maximum rate of 22700 K s1 in multiple looptop sources. We calculated the density of the EUV plasma from the DEM of the multithermal source employing regularised inversion. Assuming a pressure balance, we estimate the density of the chromospheric component of rain to be 9.21x1011 ±1.76x1011 cm3 which is comparable with quiescent coronal rain densities. With up to 8 parallel strands in the EUV loop cross section, we calculate the mass loss rate from the postflare arcade to be as much as 1.98x1012 ± 4.95x1011 g s1. Finally, we reveal a close proximity between the model predictions of 105.8 K and the observed properties between 105.9 K and 106.2 K, that defines the temperature onset of catastrophic cooling. The close correspondence between the observations and numerical models suggests that indeed acoustic waves (with a sound travel time of 68 s) could play an important role in redistributing energy and sustaining the enthalpybased radiative cooling.
PA. GV are funded by the European Research Council under the European Union Seventh Framework Programme (FP7/20072013) / ERC grant agreement nr. 291058
20161220T00:00:00Z
Scullion, E.
Rouppe Van Der Voort, L.
Antolin, P.
Wedemeyer, S.
Vissers, G.
Kontar, E. P.
Gallagher, P.
Flaredriven coronal rain can manifest from rapidly cooled plasma condensations near coronal looptops in thermally unstable postflare arcades. We detect 5 phases that characterise the postflare decay:heating, evaporation, conductive cooling dominance for ~120 s, radiative/ enthalpy cooling dominance for ~4700 s and finally catastrophic cooling occurring within 35124 s leading to rain strands with s periodicity of 5570 s. We find an excellent agreement between the observations and model predictions of the dominant cooling timescales and the onset of catastrophic cooling. At the rain formation site we detect comoving, multithermal rain clumps that undergo catastrophic cooling from ~1 MK to ~22000 K. During catastrophic cooling the plasma cools at a maximum rate of 22700 K s1 in multiple looptop sources. We calculated the density of the EUV plasma from the DEM of the multithermal source employing regularised inversion. Assuming a pressure balance, we estimate the density of the chromospheric component of rain to be 9.21x1011 ±1.76x1011 cm3 which is comparable with quiescent coronal rain densities. With up to 8 parallel strands in the EUV loop cross section, we calculate the mass loss rate from the postflare arcade to be as much as 1.98x1012 ± 4.95x1011 g s1. Finally, we reveal a close proximity between the model predictions of 105.8 K and the observed properties between 105.9 K and 106.2 K, that defines the temperature onset of catastrophic cooling. The close correspondence between the observations and numerical models suggests that indeed acoustic waves (with a sound travel time of 68 s) could play an important role in redistributing energy and sustaining the enthalpybased radiative cooling.

Counting chirps : acoustic monitoring of cryptic frogs
http://hdl.handle.net/10023/9921
1 . Global amphibian declines have resulted in a vital need for monitoring programmes that follow population trends. Monitoring using advertisement calls is ideal as choruses are undisturbed during data collection. However, methods currently employed by managers frequently rely on trained observers, and/or do not provide density data on which to base trends. 2 . This study explores the utility of monitoring using acoustic spatially explicit capturerecapture (aSECR) with time of arrival (ToA) and signal strength (SS) as a quantitative monitoring technique to measure call density of a threatened but visually cryptic anuran, the Cape peninsula moss frog Arthroleptella lightfooti. 3 . The relationships between temporal and environmental variables (date, rainfall, temperature) and A. lightfooti call density at three study sites on the Cape peninsula, South Africa were examined. Acoustic data, collected from an array of six microphones over four months during the winter breeding season, provided a time series of call density estimates. 4 . Model selection indicated that call density was primarily associated with seasonality fitted as a quadratic function. Call density peaked midbreeding season. At the main study site, the lowest recorded mean call density (0·160 calls m2 min1) occurred in May and reached its peak midJuly (1·259 calls m2 min1). The sites differed in call density, but also the effective sampling area. 5 . Synthesis and applications.The monitoring technique, acoustic spatially explicit capture–recapture (aSCR), quantitatively estimates call density without disturbing the calling animals or their environment, while time of arrival (ToA) and signal strength (SS) significantly add to the accuracy of call localisation, which in turn increases precision of call density estimates without the need for specialist field staff. This technique appears ideally suited to aid the monitoring of visually cryptic, acoustically active species.
Funding for the frog survey was received from the National Geographic Society/Waitt Grants Program (No. W18411). The EPSRC and NERC helped to fund this research through a PhD grant (No. EP/1000917/1) to D.L.B. R.A. and G.J.M. acknowledge initiative funding from the National Research Foundation of South Africa.
20170601T00:00:00Z
Measey, G. John
Stevenson, Ben C.
Scott, Tanya
Altwegg, Res
Borchers, David L.
1 . Global amphibian declines have resulted in a vital need for monitoring programmes that follow population trends. Monitoring using advertisement calls is ideal as choruses are undisturbed during data collection. However, methods currently employed by managers frequently rely on trained observers, and/or do not provide density data on which to base trends. 2 . This study explores the utility of monitoring using acoustic spatially explicit capturerecapture (aSECR) with time of arrival (ToA) and signal strength (SS) as a quantitative monitoring technique to measure call density of a threatened but visually cryptic anuran, the Cape peninsula moss frog Arthroleptella lightfooti. 3 . The relationships between temporal and environmental variables (date, rainfall, temperature) and A. lightfooti call density at three study sites on the Cape peninsula, South Africa were examined. Acoustic data, collected from an array of six microphones over four months during the winter breeding season, provided a time series of call density estimates. 4 . Model selection indicated that call density was primarily associated with seasonality fitted as a quadratic function. Call density peaked midbreeding season. At the main study site, the lowest recorded mean call density (0·160 calls m2 min1) occurred in May and reached its peak midJuly (1·259 calls m2 min1). The sites differed in call density, but also the effective sampling area. 5 . Synthesis and applications.The monitoring technique, acoustic spatially explicit capture–recapture (aSCR), quantitatively estimates call density without disturbing the calling animals or their environment, while time of arrival (ToA) and signal strength (SS) significantly add to the accuracy of call localisation, which in turn increases precision of call density estimates without the need for specialist field staff. This technique appears ideally suited to aid the monitoring of visually cryptic, acoustically active species.

Generating "large" subgroups and subsemigroups
http://hdl.handle.net/10023/9913
In this thesis we will be exclusively considering uncountable groups and semigroups.
Roughly speaking the underlying problem is to find “large” subgroups
(or subsemigroups) of the object in question, where we consider three different
notions of “largeness”:
(i) We classify all the subsemigroups of the set of all mapping from a countable
set back to itself which contains a specific uncountable subsemigroup;
(ii) We investigate topological “largeness”, in particular subgroups which are
finitely generated and dense;
(iii) We investigate if it is possible to find an integer r such that any countable
collection of elements belongs to some rgenerated subsemigroup, and more
precisely can these elements be obtained by multiplying the generators in a
prescribed fashion.
20160101T00:00:00Z
Jonušas, Julius
In this thesis we will be exclusively considering uncountable groups and semigroups.
Roughly speaking the underlying problem is to find “large” subgroups
(or subsemigroups) of the object in question, where we consider three different
notions of “largeness”:
(i) We classify all the subsemigroups of the set of all mapping from a countable
set back to itself which contains a specific uncountable subsemigroup;
(ii) We investigate topological “largeness”, in particular subgroups which are
finitely generated and dense;
(iii) We investigate if it is possible to find an integer r such that any countable
collection of elements belongs to some rgenerated subsemigroup, and more
precisely can these elements be obtained by multiplying the generators in a
prescribed fashion.

Synchronizing permutation groups and graph endomorphisms
http://hdl.handle.net/10023/9912
The current thesis is focused on synchronizing permutation groups and on graph endo
morphisms. Applying the implicit classification of rank 3 groups, we provide a bound
on synchronizing ranks of rank 3 groups, at first. Then, we determine the singular graph
endomorphisms of the Hamming graph and related graphs, count Latin hypercuboids of
class r, establish their relation to mixed MDS codes, investigate Gdecompositions of
(non)synchronizing semigroups, and analyse the kernel graph construction used in the
theorem of Cameron and Kazanidis which identifies nonsynchronizing transformations
with graph endomorphisms [20].
The contribution lies in the following points:
1. A bound on synchronizing ranks of groups of permutation rank 3 is given, and a
complete list of small nonsynchronizing groups of permutation rank 3 is provided
(see Chapter 3).
2. The singular endomorphisms of the Hamming graph and some related graphs are
characterised (see Chapter 5).
3. A theorem on the extension of partial Latin hypercuboids is given, Latin hyper
cuboids for small values are counted, and their correspondence to mixed MDS
codes is unveiled (see Chapter 6).
4. The research on normalizing groups from [3] is extended to semigroups of the
form <G, T>, and decomposition properties of nonsynchronizing semigroups are described which are then applied to semigroups induced by combinatorial tiling
problems (see Chapter 7).
5. At last, it is shown that all rank 3 graphs admitting singular endomorphisms are
hulls and it is conjectured that a hull on n vertices has minimal generating set of at
most n generators (see Chapter 8).
20160101T00:00:00Z
Schaefer, Artur
The current thesis is focused on synchronizing permutation groups and on graph endo
morphisms. Applying the implicit classification of rank 3 groups, we provide a bound
on synchronizing ranks of rank 3 groups, at first. Then, we determine the singular graph
endomorphisms of the Hamming graph and related graphs, count Latin hypercuboids of
class r, establish their relation to mixed MDS codes, investigate Gdecompositions of
(non)synchronizing semigroups, and analyse the kernel graph construction used in the
theorem of Cameron and Kazanidis which identifies nonsynchronizing transformations
with graph endomorphisms [20].
The contribution lies in the following points:
1. A bound on synchronizing ranks of groups of permutation rank 3 is given, and a
complete list of small nonsynchronizing groups of permutation rank 3 is provided
(see Chapter 3).
2. The singular endomorphisms of the Hamming graph and some related graphs are
characterised (see Chapter 5).
3. A theorem on the extension of partial Latin hypercuboids is given, Latin hyper
cuboids for small values are counted, and their correspondence to mixed MDS
codes is unveiled (see Chapter 6).
4. The research on normalizing groups from [3] is extended to semigroups of the
form <G, T>, and decomposition properties of nonsynchronizing semigroups are described which are then applied to semigroups induced by combinatorial tiling
problems (see Chapter 7).
5. At last, it is shown that all rank 3 graphs admitting singular endomorphisms are
hulls and it is conjectured that a hull on n vertices has minimal generating set of at
most n generators (see Chapter 8).

On the dimensions of a family of overlapping selfaffine carpets
http://hdl.handle.net/10023/9835
We consider the dimensions of a family of selfaffine sets related to the BedfordMcMullen carpets. In particular, we fix a BedfordMcMullen system and then randomise the translation vectors with the stipulation that the column structure is preserved. As such, we maintain one of the key features in the BedfordMcMullen set up in that alignment causes the dimensions to drop from the affinity dimension. We compute the Hausdorff, packing and box dimensions outside of a small set of exceptional translations, and also for some explicit translations even in the presence of overlapping. Our results rely on, and can be seen as a partial extension of, M. Hochman's recent work on the dimensions of selfsimilar sets and measures.
The work of J.M.F. was supported by the EPSRC grant EP/J013560/1 whilst at Warwick and an EPSRC doctoral training grant whilst at St Andrews.
20161201T00:00:00Z
Fraser, Jonathan MacDonald
Shmerkin, Pablo
We consider the dimensions of a family of selfaffine sets related to the BedfordMcMullen carpets. In particular, we fix a BedfordMcMullen system and then randomise the translation vectors with the stipulation that the column structure is preserved. As such, we maintain one of the key features in the BedfordMcMullen set up in that alignment causes the dimensions to drop from the affinity dimension. We compute the Hausdorff, packing and box dimensions outside of a small set of exceptional translations, and also for some explicit translations even in the presence of overlapping. Our results rely on, and can be seen as a partial extension of, M. Hochman's recent work on the dimensions of selfsimilar sets and measures.

String Cgroups as transitive subgroups of Sn
http://hdl.handle.net/10023/9794
If Γ is a string Cgroup which is isomorphic to a transitive subgroup of the symmetric group Sn (other than Sn and the alternating group An), then the rank of Γ is at most n/2+1, with finitely many exceptions (which are classified). It is conjectured that only the symmetric group has to be excluded.
20160201T00:00:00Z
Cameron, Peter Jephson
Fernandes, Maria Elisa
Leemans, Dimitri
Mixer, Mark
If Γ is a string Cgroup which is isomorphic to a transitive subgroup of the symmetric group Sn (other than Sn and the alternating group An), then the rank of Γ is at most n/2+1, with finitely many exceptions (which are classified). It is conjectured that only the symmetric group has to be excluded.

The Assouad dimensions of projections of planar sets
http://hdl.handle.net/10023/9725
We consider the Assouad dimensions of orthogonal projections of planar sets onto lines. Our investigation covers both general and selfsimilar sets. For general sets, the main result is the following: if a set in the plane has Assouad dimension s ∈ [0, 2], then the projections have Assouad dimension at least min{1, s} almost surely. Compared to the famous analogue for Hausdorff dimension – namely Marstrand’s Projection Theorem – a striking difference is that the words ‘at least’cannot be dispensed with: in fact, for many planar selfsimilar sets of dimension s < 1, we prove that the Assouad dimension of projections can attain both values sand 1 for a set of directions of positive measure. For selfsimilar sets, our investigation splits naturally into two cases: when the group of rotations is discrete, and when it is dense. In the ‘discrete rotations’ case we prove the following dichotomy for any given projection: either the Hausdorff measure is positive in the Hausdorff dimension, in which case the Hausdorff and Assouad dimensions coincide; or the Hausdorff measure is zero in the Hausdorff dimension,in which case the Assouad dimension is equal to 1. In the ‘dense rotations’ case we prove that every projection has Assouad dimension equal to one, assuming that the planar set is not a singleton. As another application of our results, we show that there is no Falconer’s Theorem for Assouad dimension. More precisely, the Assouad dimension of a selfsimilar (or selfaffine) set is not in general almost surely constant when one randomises the translation vectors.
The first named author is supported by a Leverhulme Trust Research Fellowship and the second named author is supported by the Academy of Finland through the grant Restricted families of projections and connections to Kakeya type problems, grant number 274512.
20170201T00:00:00Z
Fraser, Jonathan M.
Orponen, Tuomas
We consider the Assouad dimensions of orthogonal projections of planar sets onto lines. Our investigation covers both general and selfsimilar sets. For general sets, the main result is the following: if a set in the plane has Assouad dimension s ∈ [0, 2], then the projections have Assouad dimension at least min{1, s} almost surely. Compared to the famous analogue for Hausdorff dimension – namely Marstrand’s Projection Theorem – a striking difference is that the words ‘at least’cannot be dispensed with: in fact, for many planar selfsimilar sets of dimension s < 1, we prove that the Assouad dimension of projections can attain both values sand 1 for a set of directions of positive measure. For selfsimilar sets, our investigation splits naturally into two cases: when the group of rotations is discrete, and when it is dense. In the ‘discrete rotations’ case we prove the following dichotomy for any given projection: either the Hausdorff measure is positive in the Hausdorff dimension, in which case the Hausdorff and Assouad dimensions coincide; or the Hausdorff measure is zero in the Hausdorff dimension,in which case the Assouad dimension is equal to 1. In the ‘dense rotations’ case we prove that every projection has Assouad dimension equal to one, assuming that the planar set is not a singleton. As another application of our results, we show that there is no Falconer’s Theorem for Assouad dimension. More precisely, the Assouad dimension of a selfsimilar (or selfaffine) set is not in general almost surely constant when one randomises the translation vectors.

On the Lq spectrum of planar selfaffine measures
http://hdl.handle.net/10023/9724
We study the dimension theory of a class of planar selfaffine multifractal measures. These measures are the Bernoulli measures supported on boxlike selfaffine sets, introduced by the author, which are the attractors of iterated function systems consisting of contracting affine maps which take the unit square to rectangles with sides parallel to the axes. This class contains the selfaffine measures recently considered by Feng and Wang as well as many other measures. In particular, we allow the defining maps to have nontrivial rotational and reflectional components. Assuming the rectangular open set condition, we compute the Lqspectrum by means of a qmodified singular value function. A key application of our results is a closed form expression for the Lqspectrum in the case where there are no mappings that switch the coordinate axes. This is useful for computational purposes and also allows us to prove differentiability of the Lqspectrum at q=1 in the more difficult `nonmultiplicative' situation. This has applications concerning the Hausdorff, packing and entropy dimension of the measure as well as the Hausdorff and packing dimension of the support. Due to the possible inclusion of axis reversing maps, we are led to extend some results of Peres and Solomyak on the existence of the Lqspectrum of selfsimilar measures to the graphdirected case.
The author was supported by the EPSRC grant EP/J013560/1. This work was started whilst the author was an EPSRC funded PhD student at the University of St Andrews, and he expresses his gratitude for the support he found there.
20160101T00:00:00Z
Fraser, Jonathan M.
We study the dimension theory of a class of planar selfaffine multifractal measures. These measures are the Bernoulli measures supported on boxlike selfaffine sets, introduced by the author, which are the attractors of iterated function systems consisting of contracting affine maps which take the unit square to rectangles with sides parallel to the axes. This class contains the selfaffine measures recently considered by Feng and Wang as well as many other measures. In particular, we allow the defining maps to have nontrivial rotational and reflectional components. Assuming the rectangular open set condition, we compute the Lqspectrum by means of a qmodified singular value function. A key application of our results is a closed form expression for the Lqspectrum in the case where there are no mappings that switch the coordinate axes. This is useful for computational purposes and also allows us to prove differentiability of the Lqspectrum at q=1 in the more difficult `nonmultiplicative' situation. This has applications concerning the Hausdorff, packing and entropy dimension of the measure as well as the Hausdorff and packing dimension of the support. Due to the possible inclusion of axis reversing maps, we are led to extend some results of Peres and Solomyak on the existence of the Lqspectrum of selfsimilar measures to the graphdirected case.

Finite presentability and isomorphism of Cayley graphs of monoids
http://hdl.handle.net/10023/9711
Two finitely generated monoids are constructed, one finitely presented the other not, whose (directed, unlabelled) Cayley graphs are isomorphic.
20171101T00:00:00Z
Awang, Jennifer Sylvia
Pfeiffer, Markus Johannes
Ruskuc, Nikola
Two finitely generated monoids are constructed, one finitely presented the other not, whose (directed, unlabelled) Cayley graphs are isomorphic.

Primitive groups, graph endomorphisms and synchronization
http://hdl.handle.net/10023/9648
Let Ω be a set of cardinality n, G be a permutation group on Ω and f:Ω→Ω be a map that is not a permutation. We say that G synchronizes f if the transformation semigroup ⟨G,f⟩ contains a constant map, and that G is a synchronizing group if G synchronizes every nonpermutation. A synchronizing group is necessarily primitive, but there are primitive groups that are not synchronizing. Every nonsynchronizing primitive group fails to synchronize at least one uniform transformation (that is, transformation whose kernel has parts of equal size), and it had previously been conjectured that this was essentially the only way in which a primitive group could fail to be synchronizing, in other words, that a primitive group synchronizes every nonuniform transformation. The first goal of this paper is to prove that this conjecture is false, by exhibiting primitive groups that fail to synchronize specific nonuniform transformations of ranks 5 and 6. As it has previously been shown that primitive groups synchronize every nonuniform transformation of rank at most 4, these examples are of the lowest possible rank. In addition, we produce graphs with primitive automorphism groups that have approximately √n nonsynchronizing ranks, thus refuting another conjecture on the number of nonsynchronizing ranks of a primitive group. The second goal of this paper is to extend the spectrum of ranks for which it is known that primitive groups synchronize every nonuniform transformation of that rank. It has previously been shown that a primitive group of degree n synchronizes every nonuniform transformation of rank n−1 and n−2, and here this is extended to n−3 and n−4. In the process, we will obtain a purely graphtheoretical result showing that, with limited exceptions, in a vertexprimitive graph the union of neighbourhoods of a set of vertices A is bounded below by a function that is asymptotically √A. Determining the exact spectrum of ranks for which there exist nonuniform transformations not synchronized by some primitive group is just one of several natural, but possibly difficult, problems on automata, primitive groups, graphs and computational algebra arising from this work; these are outlined in the final section.
The third author has been partially supported by the Fundação para a Ciência e a Tecnologia through the project CEMATCIÊNCIAS UID/Multi/04621/2013.
20161201T00:00:00Z
Araújo, João
Bentz, Wolfram
Cameron, Peter Jephson
Royle, Gordon
Schaefer, Artur
Let Ω be a set of cardinality n, G be a permutation group on Ω and f:Ω→Ω be a map that is not a permutation. We say that G synchronizes f if the transformation semigroup ⟨G,f⟩ contains a constant map, and that G is a synchronizing group if G synchronizes every nonpermutation. A synchronizing group is necessarily primitive, but there are primitive groups that are not synchronizing. Every nonsynchronizing primitive group fails to synchronize at least one uniform transformation (that is, transformation whose kernel has parts of equal size), and it had previously been conjectured that this was essentially the only way in which a primitive group could fail to be synchronizing, in other words, that a primitive group synchronizes every nonuniform transformation. The first goal of this paper is to prove that this conjecture is false, by exhibiting primitive groups that fail to synchronize specific nonuniform transformations of ranks 5 and 6. As it has previously been shown that primitive groups synchronize every nonuniform transformation of rank at most 4, these examples are of the lowest possible rank. In addition, we produce graphs with primitive automorphism groups that have approximately √n nonsynchronizing ranks, thus refuting another conjecture on the number of nonsynchronizing ranks of a primitive group. The second goal of this paper is to extend the spectrum of ranks for which it is known that primitive groups synchronize every nonuniform transformation of that rank. It has previously been shown that a primitive group of degree n synchronizes every nonuniform transformation of rank n−1 and n−2, and here this is extended to n−3 and n−4. In the process, we will obtain a purely graphtheoretical result showing that, with limited exceptions, in a vertexprimitive graph the union of neighbourhoods of a set of vertices A is bounded below by a function that is asymptotically √A. Determining the exact spectrum of ranks for which there exist nonuniform transformations not synchronized by some primitive group is just one of several natural, but possibly difficult, problems on automata, primitive groups, graphs and computational algebra arising from this work; these are outlined in the final section.

Bernoulli convolutions and 1D dynamics
http://hdl.handle.net/10023/9629
We describe a family φλ of dynamical systems on the unit interval which preserve Bernoulli convolutions. We show that if there are parameter ranges for which these systems are piecewise convex, then the corresponding Bernoulli convolution will be absolutely continuous with bounded density. We study the systems φλ and give some numerical evidence to suggest values of λ for which φλ may be piecewise convex.
20151008T00:00:00Z
Kempton, Thomas Michael William
Persson, Tomas
We describe a family φλ of dynamical systems on the unit interval which preserve Bernoulli convolutions. We show that if there are parameter ranges for which these systems are piecewise convex, then the corresponding Bernoulli convolution will be absolutely continuous with bounded density. We study the systems φλ and give some numerical evidence to suggest values of λ for which φλ may be piecewise convex.

Threedimensional forceddamped dynamical systems with rich dynamics : bifurcations, chaos and unbounded solutions
http://hdl.handle.net/10023/9468
We consider certain autonomous threedimensional dynamical systems that can arise in mechanical and fluiddynamical contexts. Extending a previous study in Craik and Okamoto (2002), to include linear forcing and damping, we find that the fourleaf structure discovered in that paper, and unbounded orbits, persist, but may now be accompanied by three distinct perioddoubling cascades to chaos, and by orbits that approach stable equilibrium points. This rich structure is investigated both analytically and numerically, distinguishing three main cases determined by the damping and forcing parameter values.
T.M. is supported by the GrantinAid for JSPS Fellow No. 24·5312. H.O. is partially supported by JSPS KAKENHI 24244007.
20150101T00:00:00Z
Miyaji, Tomoyuki
Okamoto, Hisashi
Craik, Alexander Duncan Davidson
We consider certain autonomous threedimensional dynamical systems that can arise in mechanical and fluiddynamical contexts. Extending a previous study in Craik and Okamoto (2002), to include linear forcing and damping, we find that the fourleaf structure discovered in that paper, and unbounded orbits, persist, but may now be accompanied by three distinct perioddoubling cascades to chaos, and by orbits that approach stable equilibrium points. This rich structure is investigated both analytically and numerically, distinguishing three main cases determined by the damping and forcing parameter values.

Recurrence and transience for suspension flows
http://hdl.handle.net/10023/9416
We study the thermodynamic formalism for suspension flows over countable Markov shifts with roof functions not necessarily bounded away from zero. We establish conditions to ensure the existence and uniqueness of equilibrium measures for regular potentials. We define the notions of recurrence and transience of a potential in this setting. We define the renewal flow, which is a symbolic model for a class of flows with diverse recurrence features. We study the corresponding thermodynamic formalism, establishing conditions for the existence of equilibrium measures and phase transitions. Applications are given to suspension flows defined over interval maps having parabolic fixed points.
Funding: Proyecto Fondecyt 1110040 for funding visit to PUCChile and partial support from NSF grant DMS 1109587.
20150101T00:00:00Z
Iommi, Godofredo
Jordan, Thomas
Todd, Michael John
We study the thermodynamic formalism for suspension flows over countable Markov shifts with roof functions not necessarily bounded away from zero. We establish conditions to ensure the existence and uniqueness of equilibrium measures for regular potentials. We define the notions of recurrence and transience of a potential in this setting. We define the renewal flow, which is a symbolic model for a class of flows with diverse recurrence features. We study the corresponding thermodynamic formalism, establishing conditions for the existence of equilibrium measures and phase transitions. Applications are given to suspension flows defined over interval maps having parabolic fixed points.

A note on the probability of generating alternating or symmetric groups
http://hdl.handle.net/10023/9348
We improve on recent estimates for the probability of generating the alternating and symmetric groups An and Sn. In particular, we find the sharp lower bound if the probability is given by a quadratic in n−1. This leads to improved bounds on the largest number h(An) such that a direct product of h(An) copies of An can be generated by two elements.
The research of the first author is supported by the Australian Research Council grant DP120100446.
20150901T00:00:00Z
Morgan, Luke
RoneyDougal, Colva Mary
We improve on recent estimates for the probability of generating the alternating and symmetric groups An and Sn. In particular, we find the sharp lower bound if the probability is given by a quadratic in n−1. This leads to improved bounds on the largest number h(An) such that a direct product of h(An) copies of An can be generated by two elements.

Lengths of words in transformation semigroups generated by digraphs
http://hdl.handle.net/10023/9277
Given a simple digraph D on n vertices (with n≥2), there is a natural construction of a semigroup of transformations ⟨D⟩. For any edge (a, b) of D, let a→b be the idempotent of rank n−1 mapping a to b and fixing all vertices other than a; then, define ⟨D⟩ to be the semigroup generated by a→b for all (a,b)∈E(D). For α∈⟨D⟩, let ℓ(D,α) be the minimal length of a word in E(D) expressing α. It is well known that the semigroup Singn of all transformations of rank at most n−1 is generated by its idempotents of rank n−1. When D=Kn is the complete undirected graph, Howie and Iwahori, independently, obtained a formula to calculate ℓ(Kn,α), for any α∈⟨Kn⟩=Singn; however, no analogous nontrivial results are known when D≠Kn. In this paper, we characterise all simple digraphs D such that either ℓ(D,α) is equal to Howie–Iwahori’s formula for all α∈⟨D⟩, or ℓ(D,α)=n−fix(α) for all α∈⟨D⟩, or ℓ(D,α)=n−rk(α) for all α∈⟨D⟩. We also obtain bounds for ℓ(D,α) when D is an acyclic digraph or a strong tournament (the latter case corresponds to a smallest generating set of idempotents of rank n−1 of Singn). We finish the paper with a list of conjectures and open problems
The second and third authors were supported by the EPSRC grant EP/K033956/1.
20170201T00:00:00Z
Cameron, P. J.
CastilloRamirez, A.
Gadouleau, M.
Mitchell, J. D.
Given a simple digraph D on n vertices (with n≥2), there is a natural construction of a semigroup of transformations ⟨D⟩. For any edge (a, b) of D, let a→b be the idempotent of rank n−1 mapping a to b and fixing all vertices other than a; then, define ⟨D⟩ to be the semigroup generated by a→b for all (a,b)∈E(D). For α∈⟨D⟩, let ℓ(D,α) be the minimal length of a word in E(D) expressing α. It is well known that the semigroup Singn of all transformations of rank at most n−1 is generated by its idempotents of rank n−1. When D=Kn is the complete undirected graph, Howie and Iwahori, independently, obtained a formula to calculate ℓ(Kn,α), for any α∈⟨Kn⟩=Singn; however, no analogous nontrivial results are known when D≠Kn. In this paper, we characterise all simple digraphs D such that either ℓ(D,α) is equal to Howie–Iwahori’s formula for all α∈⟨D⟩, or ℓ(D,α)=n−fix(α) for all α∈⟨D⟩, or ℓ(D,α)=n−rk(α) for all α∈⟨D⟩. We also obtain bounds for ℓ(D,α) when D is an acyclic digraph or a strong tournament (the latter case corresponds to a smallest generating set of idempotents of rank n−1 of Singn). We finish the paper with a list of conjectures and open problems

Idempotent rank in the endomorphism monoid of a nonuniform partition
http://hdl.handle.net/10023/9275
We calculate the rank and idempotent rank of the semigroup E(X,P) generated by the idempotents of the semigroup T(X,P), which consists of all transformations of the finite set X preserving a nonuniform partition P. We also classify and enumerate the idempotent generating sets of this minimal possible size. This extends results of the first two authors in the uniform case.
20160201T00:00:00Z
Dolinka, Igor
East, James
Mitchell, James D.
We calculate the rank and idempotent rank of the semigroup E(X,P) generated by the idempotents of the semigroup T(X,P), which consists of all transformations of the finite set X preserving a nonuniform partition P. We also classify and enumerate the idempotent generating sets of this minimal possible size. This extends results of the first two authors in the uniform case.

Ends of semigroups
http://hdl.handle.net/10023/9254
We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by subsemigroups and extensions of finite Rees index. We prove an analogue of Hopf's Theorem, stating that a group has 1, 2 or infinitely many ends, for left cancellative semigroups and that the cardinality of the set of ends is invariant in subsemigroups and extension of finite Green index in left cancellative semigroups.
20161001T00:00:00Z
Craik, S.
Gray, R.
Kilibarda, V.
Mitchell, J. D.
Ruskuc, N.
We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by subsemigroups and extensions of finite Rees index. We prove an analogue of Hopf's Theorem, stating that a group has 1, 2 or infinitely many ends, for left cancellative semigroups and that the cardinality of the set of ends is invariant in subsemigroups and extension of finite Green index in left cancellative semigroups.

Dimension conservation for selfsimilar sets and fractal percolation
http://hdl.handle.net/10023/9253
We introduce a technique that uses projection properties of fractal percolation to establish dimension conservation results for sections of deterministic selfsimilar sets. For example, let K be a selfsimilar subset of R2 with Hausdorff dimension dimHK >1 such that the rotational components of the underlying similarities generate the full rotation group. Then for all ε >0, writing πθ for projection onto the line Lθ in direction θ, the Hausdorff dimensions of the sections satisfy dimH (K ∩ πθ1x)> dimHK  1  ε for a set of x ∈ Lθ of positive Lebesgue measure, for all directions θ except for those in a set of Hausdorff dimension 0. For a class of selfsimilar sets we obtain a similar conclusion for all directions, but with lower box dimension replacing Hausdorff dimensions of sections. We obtain similar inequalities for the dimensions of sections of Mandelbrot percolation sets.
20150101T00:00:00Z
Falconer, Kenneth John
Jin, Xiong
We introduce a technique that uses projection properties of fractal percolation to establish dimension conservation results for sections of deterministic selfsimilar sets. For example, let K be a selfsimilar subset of R2 with Hausdorff dimension dimHK >1 such that the rotational components of the underlying similarities generate the full rotation group. Then for all ε >0, writing πθ for projection onto the line Lθ in direction θ, the Hausdorff dimensions of the sections satisfy dimH (K ∩ πθ1x)> dimHK  1  ε for a set of x ∈ Lθ of positive Lebesgue measure, for all directions θ except for those in a set of Hausdorff dimension 0. For a class of selfsimilar sets we obtain a similar conclusion for all directions, but with lower box dimension replacing Hausdorff dimensions of sections. We obtain similar inequalities for the dimensions of sections of Mandelbrot percolation sets.

Sixty years of fractal projections
http://hdl.handle.net/10023/9231
Sixty years ago, John Marstrand published a paper which, among other things, relates the Hausdorff dimension of a plane set to the dimensions of its orthogonal projections onto lines. For many years, the paper attracted very little attention. However, over the past 30 years, Marstrand’s projection theorems have become the prototype for many results in fractal geometry with numerous variants and applications and they continue to motivate leading research.
20150731T00:00:00Z
Falconer, Kenneth John
Fraser, Jonathan Macdonald
Jin, Xiong
Sixty years ago, John Marstrand published a paper which, among other things, relates the Hausdorff dimension of a plane set to the dimensions of its orthogonal projections onto lines. For many years, the paper attracted very little attention. However, over the past 30 years, Marstrand’s projection theorems have become the prototype for many results in fractal geometry with numerous variants and applications and they continue to motivate leading research.

Hitting times and periodicity in random dynamics
http://hdl.handle.net/10023/9179
We prove quenched laws of hitting time statistics for random subshifts of finite type. In particular we prove a dichotomy between the law for periodic and for nonperiodic points. We show that this applies to random Gibbs measures.
20151001T00:00:00Z
Todd, Michael John
Rousseau, Jerome
We prove quenched laws of hitting time statistics for random subshifts of finite type. In particular we prove a dichotomy between the law for periodic and for nonperiodic points. We show that this applies to random Gibbs measures.

Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph
http://hdl.handle.net/10023/9178
We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph R. As a consequence we show that, for any countable graph Γ, there are uncountably many maximal subgroups of the endomorphism monoid of R isomorphic to the automorphism group of Γ. Further structural information about End R is established including that Aut Γ arises in uncountably many ways as a Schützenberger group. Similar results are proved for the countable universal directed graph and the countable universal bipartite graph.
20160501T00:00:00Z
Dolinka, Igor
Gray, Robert Duncan
McPhee, Jillian Dawn
Mitchell, James David
Quick, Martyn
We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph R. As a consequence we show that, for any countable graph Γ, there are uncountably many maximal subgroups of the endomorphism monoid of R isomorphic to the automorphism group of Γ. Further structural information about End R is established including that Aut Γ arises in uncountably many ways as a Schützenberger group. Similar results are proved for the countable universal directed graph and the countable universal bipartite graph.

On regularity and the word problem for free idempotent generated semigroups
http://hdl.handle.net/10023/9145
The category of all idempotent generated semigroups with a prescribed structure Ɛ of their idempotents E (called the biordered set) has an initial object called the free idempotent generated semigroup over Ɛ, defined by a presentation over alphabet E, and denoted by IG(Ɛ). Recently, much effort has been put into investigating the structure of semigroups of the form IG(Ɛ), especially regarding their maximal subgroups. In this paper we take these investigations in a new direction by considering the word problem for IG(Ɛ). We prove two principal results, one positive and one negative. We show that, for a finite biordered set E, it is decidable whether a given word w ∈ E∗ represents a regular element; if in addition one assumes that all maximal subgroups of IG(Ɛ) have decidable word problems, then the word problem in IG(Ɛ) restricted to regular words is decidable. On the other hand, we exhibit a biorder Ɛ arising from a finite idempotent semigroup S, such that the word problem for IG(Ɛ) is undecidable, even though all the maximal subgroups have decidable word problems. This is achieved by relating the word problem of IG(Ɛ) to the subgroup membership problem infinitely presented groups.
The research of the first author was supported by the Ministry of Education, Science, and Technological Development of the Republic of Serbia through the grant No. 174019, and by the grant No. 0851/2015 of the Secretariat of Science and Technological Development of the Autonomous Province of Vojvodina. The research of the second author was partially supported by the EPSRCfunded project EP/N033353/1 ‘Special inverse monoids: subgroups, structure, geometry, rewriting systems and the word problem’. The research of the third author was supported by the EPSRCfunded project EP/H011978/1 ‘Automata, Languages, Decidability in Algebra’.
20170303T00:00:00Z
Dolinka, Igor
Gray, Robert D.
Ruskuc, Nikola
The category of all idempotent generated semigroups with a prescribed structure Ɛ of their idempotents E (called the biordered set) has an initial object called the free idempotent generated semigroup over Ɛ, defined by a presentation over alphabet E, and denoted by IG(Ɛ). Recently, much effort has been put into investigating the structure of semigroups of the form IG(Ɛ), especially regarding their maximal subgroups. In this paper we take these investigations in a new direction by considering the word problem for IG(Ɛ). We prove two principal results, one positive and one negative. We show that, for a finite biordered set E, it is decidable whether a given word w ∈ E∗ represents a regular element; if in addition one assumes that all maximal subgroups of IG(Ɛ) have decidable word problems, then the word problem in IG(Ɛ) restricted to regular words is decidable. On the other hand, we exhibit a biorder Ɛ arising from a finite idempotent semigroup S, such that the word problem for IG(Ɛ) is undecidable, even though all the maximal subgroups have decidable word problems. This is achieved by relating the word problem of IG(Ɛ) to the subgroup membership problem infinitely presented groups.

The random continued fraction transformation
http://hdl.handle.net/10023/9142
We introduce a random dynamical system related to continued fraction expansions. It uses random combination of the Gauss map and the R\'enyi (or backwards) continued fraction map. We explore the continued fraction expansions that this system produces as well as the dynamical properties of the system.
20150701T00:00:00Z
Kalle, Charlene
Kempton, Thomas Michael William
Verbitskiy, Evgeny
We introduce a random dynamical system related to continued fraction expansions. It uses random combination of the Gauss map and the R\'enyi (or backwards) continued fraction map. We explore the continued fraction expansions that this system produces as well as the dynamical properties of the system.

The scenery flow for selfaffine measures
http://hdl.handle.net/10023/9141
We describe the scaling scenery associated to Bernoulli measures supported on separated selfaffine sets under the condition that certain projections of the measure are absolutely continuous.
20150501T00:00:00Z
Kempton, Thomas Michael William
We describe the scaling scenery associated to Bernoulli measures supported on separated selfaffine sets under the condition that certain projections of the measure are absolutely continuous.

Computing finite semigroups
http://hdl.handle.net/10023/9138
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to which these results apply include many important classes: transformation semigroups, partial permutation semigroups and inverse semigroups, partition monoids, matrix semigroups, and subsemigroups of finite regular Rees matrix and $0$matrix semigroups over groups. For any subsemigroup of such a semigroup, it is possible to, among other things, efficiently compute its size and Green's relations, test membership, factorize elements over the generators, find the semigroup generated by the given subsemigroup and any collection of additional elements, calculate the partial order of the $\mathscr{D}$classes, test regularity, and determine the idempotents. This is achieved by representing the given subsemigroup without exhaustively enumerating its elements. It is also possible to compute the Green's classes of an element of such a subsemigroup without determining the global structure of the semigroup.
20151007T00:00:00Z
East, J.
EgriNagy, A.
Mitchell, J. D.
Péresse, Y.
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to which these results apply include many important classes: transformation semigroups, partial permutation semigroups and inverse semigroups, partition monoids, matrix semigroups, and subsemigroups of finite regular Rees matrix and $0$matrix semigroups over groups. For any subsemigroup of such a semigroup, it is possible to, among other things, efficiently compute its size and Green's relations, test membership, factorize elements over the generators, find the semigroup generated by the given subsemigroup and any collection of additional elements, calculate the partial order of the $\mathscr{D}$classes, test regularity, and determine the idempotents. This is achieved by representing the given subsemigroup without exhaustively enumerating its elements. It is also possible to compute the Green's classes of an element of such a subsemigroup without determining the global structure of the semigroup.

Embedding rightangled Artin groups into BrinThompson groups
http://hdl.handle.net/10023/9080
We prove that every finitelygenerated rightangled Artin group can be embedded into some BrinThompson group nV. It follows that many other groups can be embedded into some nV (e.g., any finite extension of any of Haglund and Wise's special groups), and that various decision problems involving subgroups of nV are unsolvable.
7 pages, no figures
20160227T00:00:00Z
Belk, James
Bleak, Collin
Matucci, Francesco
We prove that every finitelygenerated rightangled Artin group can be embedded into some BrinThompson group nV. It follows that many other groups can be embedded into some nV (e.g., any finite extension of any of Haglund and Wise's special groups), and that various decision problems involving subgroups of nV are unsolvable.

Universal sequences for the orderautomorphisms of the rationals
http://hdl.handle.net/10023/9024
In this paper, we consider the group Aut(Q,≤) of orderautomorphisms of the rational numbers, proving a result analogous to a theorem of Galvin's for the symmetric group. In an announcement, Khélif states that every countable subset of Aut(Q,≤) is contained in an Ngenerated subgroup of Aut(Q,≤) for some fixed N ∈ N. We show that the least such N is 2. Moreover, for every countable subset of Aut(Q,≤), we show that every element can be given as a prescribed product of two generators without using their inverses. More precisely, suppose that a and b freely generate the free semigroup {a,b}+ consisting of the nonempty words over a and b. Then we show that there exists a sequence of words w1, w2,... over {a,b} such that for every sequence f1, f2, ... ∈ Aut(Q,≤) there is a homomorphism φ : {a,b}+ → Aut(Q,≤) where (wi)φ=fi for every i. The main theorem in this paper provides an alternative proof of a result of Droste and Holland showing that the strong cofinality of Aut(Q,≤) is uncountable, or equivalently that Aut(Q,≤) has uncountable cofinality and Bergman's property.
20160801T00:00:00Z
Hyde, J.
Jonusas, J.
Mitchell, J. D.
Peresse, Y. H.
In this paper, we consider the group Aut(Q,≤) of orderautomorphisms of the rational numbers, proving a result analogous to a theorem of Galvin's for the symmetric group. In an announcement, Khélif states that every countable subset of Aut(Q,≤) is contained in an Ngenerated subgroup of Aut(Q,≤) for some fixed N ∈ N. We show that the least such N is 2. Moreover, for every countable subset of Aut(Q,≤), we show that every element can be given as a prescribed product of two generators without using their inverses. More precisely, suppose that a and b freely generate the free semigroup {a,b}+ consisting of the nonempty words over a and b. Then we show that there exists a sequence of words w1, w2,... over {a,b} such that for every sequence f1, f2, ... ∈ Aut(Q,≤) there is a homomorphism φ : {a,b}+ → Aut(Q,≤) where (wi)φ=fi for every i. The main theorem in this paper provides an alternative proof of a result of Droste and Holland showing that the strong cofinality of Aut(Q,≤) is uncountable, or equivalently that Aut(Q,≤) has uncountable cofinality and Bergman's property.

From onedimensional fields to Vlasov equilibria : Theory and application of Hermite Polynomials
http://hdl.handle.net/10023/8992
We consider the theory and application of a solution method for the inverse problem in collisionless equilibria, namely that of calculating a VlasovMaxwell equilibrium for a given macroscopic (fluid) equilibrium. Using Jeans' Theorem, the equilibria are expressed as functions of the constants of motion, in the form of a Maxwellian multiplied by an unknown function of the canonical momenta. In this case it is possible to reduce the inverse problem to inverting Weierstrass transforms, which we achieve by using expansions over Hermite Polynomials. Sufficient conditions are found which guarantee the convergence,boundedness and nonnegativity of the candidate solution, when satisfied. These conditions are obtained by elementary means, and it is clear how to put them into practice. Illustrative examples of the use of this method with both forcefree and non forcefree macroscopic equilibria are presented, including the full verification of a recently derived distribution function for the ForceFree Harris Sheet (Allanson et al. (2015)). In the effort to model equilibria with lower values of the plasma beta, solutions for the same macroscopic equilibrium in a new gauge are calculated, with numerical results presented for βpl = 0:05.
20160601T00:00:00Z
Allanson, Oliver Douglas
Neukirch, Thomas
Troscheit, Sascha
Wilson, Fiona
We consider the theory and application of a solution method for the inverse problem in collisionless equilibria, namely that of calculating a VlasovMaxwell equilibrium for a given macroscopic (fluid) equilibrium. Using Jeans' Theorem, the equilibria are expressed as functions of the constants of motion, in the form of a Maxwellian multiplied by an unknown function of the canonical momenta. In this case it is possible to reduce the inverse problem to inverting Weierstrass transforms, which we achieve by using expansions over Hermite Polynomials. Sufficient conditions are found which guarantee the convergence,boundedness and nonnegativity of the candidate solution, when satisfied. These conditions are obtained by elementary means, and it is clear how to put them into practice. Illustrative examples of the use of this method with both forcefree and non forcefree macroscopic equilibria are presented, including the full verification of a recently derived distribution function for the ForceFree Harris Sheet (Allanson et al. (2015)). In the effort to model equilibria with lower values of the plasma beta, solutions for the same macroscopic equilibrium in a new gauge are calculated, with numerical results presented for βpl = 0:05.

Aspects of order and congruence relations on regular semigroups
http://hdl.handle.net/10023/8926
On a regular semigroup S natural order relations have been defined
by Nambooripad and by Lallement. Different characterisations and
relationships between the Nambooripad order J, Lallement's order λ and
a certain relation k are considered in Chapter I. It is shown that on
a regular semigroup S the partial order J is left compatible if and
only if S is locally Runipotent. This condition in the case where S
is orthodox is equivalent to saying that E(S) is a left seminormal
band. It is also proved that λ is the least compatible partial order
contained in J and that k = λ if and only if k is compatible and k
if and only if J is compatible. A description of λ and J in the
semigroups T(X) and PT(X) is presented.
In Chapter II, it is proved that in an orthodox semigroup S the
band of idempotents E(S) is left quasinormal if and only if there
exists a local isomorphism from S onto an Runipotent semigroup. It is
shown that there exists a least Runipotent congruence on any orthodox
semigroup, generated by a certain left compatible equivalence R. This
equivalence is a congruence if and only if E(S) is a right semiregular
band.
The last Chapter is particularly concerned with the description of
Runipotent congruences on a regular semigroup S by means of their
kernels and traces. The lattice RC(S) of all Runipotent congruences
on a regular semigroup S is studied. A congruence≡ on the lattice
RC(S) is considered and the greatest and the least element of each
≡class are described.
19830101T00:00:00Z
Gomes, Gracinda Maria dos Santos
On a regular semigroup S natural order relations have been defined
by Nambooripad and by Lallement. Different characterisations and
relationships between the Nambooripad order J, Lallement's order λ and
a certain relation k are considered in Chapter I. It is shown that on
a regular semigroup S the partial order J is left compatible if and
only if S is locally Runipotent. This condition in the case where S
is orthodox is equivalent to saying that E(S) is a left seminormal
band. It is also proved that λ is the least compatible partial order
contained in J and that k = λ if and only if k is compatible and k
if and only if J is compatible. A description of λ and J in the
semigroups T(X) and PT(X) is presented.
In Chapter II, it is proved that in an orthodox semigroup S the
band of idempotents E(S) is left quasinormal if and only if there
exists a local isomorphism from S onto an Runipotent semigroup. It is
shown that there exists a least Runipotent congruence on any orthodox
semigroup, generated by a certain left compatible equivalence R. This
equivalence is a congruence if and only if E(S) is a right semiregular
band.
The last Chapter is particularly concerned with the description of
Runipotent congruences on a regular semigroup S by means of their
kernels and traces. The lattice RC(S) of all Runipotent congruences
on a regular semigroup S is studied. A congruence≡ on the lattice
RC(S) is considered and the greatest and the least element of each
≡class are described.

An efficient acoustic density estimation method with human detectors applied to gibbons in Cambodia
http://hdl.handle.net/10023/8842
Some animal species are hard to see but easy to hear. Standard visual methods for estimating population density for such species are often ineffective or inefficient, but methods based on passive acoustics show more promise. We develop spatially explicit capturerecapture (SECR) methods for territorial vocalising species, in which humans act as an acoustic detector array. We use SECR and estimated bearing data from a singleoccasion acoustic survey of a gibbon population in northeastern Cambodia to estimate the density of calling groups. The properties of the estimator are assessed using a simulation study, in which a variety of survey designs are also investigated. We then present a new form of the SECR likelihood for multioccasion data which accounts for the stochastic availability of animals. In the context of gibbon surveys this allows modelbased estimation of the proportion of groups that produce territorial vocalisations on a given day, thereby enabling the density of groups, instead of the density of calling groups, to be estimated. We illustrate the performance of this new estimator by simulation. We show that it is possible to estimate density reliably from human acoustic detections of visually cryptic species using SECR methods. For gibbon surveys we also show that incorporating observers' estimates of bearings to detected groups substantially improves estimator performance. Using the new form of the SECR likelihood we demonstrate that estimates of availability, in addition to population density and detection function parameters, can be obtained from multioccasion data, and that the detection function parameters are not confounded with the availability parameter. This acoustic SECR method provides a means of obtaining reliable density estimates for territorial vocalising species. It is also efficient in terms of data requirements since it only requires routine survey data. We anticipate that the lowtech field requirements will make this method an attractive option in many situations where populations can be surveyed acoustically by humans.
D. Kidney was supported by an Engineering and Physical Sciences Research Council (EPSRC) Doctoral Training Grant studentship (EPSRC grant EP/P505097/1). B. Stevenson was supported by a studentship jointly funded by the University of St Andrews and EPSRC, through the National Centre for Statistical Ecology (EPSRC grant EP/I000917/1).
20160519T00:00:00Z
Kidney, Darren
Rawson, Benjamin M.
Borchers, David Louis
Stevenson, Ben
Marques, Tiago A.
Thomas, Len
Some animal species are hard to see but easy to hear. Standard visual methods for estimating population density for such species are often ineffective or inefficient, but methods based on passive acoustics show more promise. We develop spatially explicit capturerecapture (SECR) methods for territorial vocalising species, in which humans act as an acoustic detector array. We use SECR and estimated bearing data from a singleoccasion acoustic survey of a gibbon population in northeastern Cambodia to estimate the density of calling groups. The properties of the estimator are assessed using a simulation study, in which a variety of survey designs are also investigated. We then present a new form of the SECR likelihood for multioccasion data which accounts for the stochastic availability of animals. In the context of gibbon surveys this allows modelbased estimation of the proportion of groups that produce territorial vocalisations on a given day, thereby enabling the density of groups, instead of the density of calling groups, to be estimated. We illustrate the performance of this new estimator by simulation. We show that it is possible to estimate density reliably from human acoustic detections of visually cryptic species using SECR methods. For gibbon surveys we also show that incorporating observers' estimates of bearings to detected groups substantially improves estimator performance. Using the new form of the SECR likelihood we demonstrate that estimates of availability, in addition to population density and detection function parameters, can be obtained from multioccasion data, and that the detection function parameters are not confounded with the availability parameter. This acoustic SECR method provides a means of obtaining reliable density estimates for territorial vocalising species. It is also efficient in terms of data requirements since it only requires routine survey data. We anticipate that the lowtech field requirements will make this method an attractive option in many situations where populations can be surveyed acoustically by humans.

Embeddings into Thompson's group V and coCF groups
http://hdl.handle.net/10023/8747
It is shown in Lehnert and Schweitzer (‘The coword problem for the Higman–Thompson group is contextfree’, Bull. London Math. Soc. 39 (2007) 235–241) that R. Thompson's group V is a cocontextfree (coCF) group, thus implying that all of its finitely generated subgroups are also coCF groups. Also, Lehnert shows in his thesis that V embeds inside the coCF group QAut(T2,c), which is a group of particular bijections on the vertices of an infinite binary 2edgecoloured tree, and he conjectures that QAut(T2,c) is a universal coCF group. We show that QAut(T2,c) embeds into V, and thus obtain a new form for Lehnert's conjecture. Following up on these ideas, we begin work to build a representation theory into R. Thompson's group V. In particular, we classify precisely which Baumslag–Solitar groups embed into V.
20161001T00:00:00Z
Bleak, Collin
Matucci, Francesco
Neunhöffer, Max
It is shown in Lehnert and Schweitzer (‘The coword problem for the Higman–Thompson group is contextfree’, Bull. London Math. Soc. 39 (2007) 235–241) that R. Thompson's group V is a cocontextfree (coCF) group, thus implying that all of its finitely generated subgroups are also coCF groups. Also, Lehnert shows in his thesis that V embeds inside the coCF group QAut(T2,c), which is a group of particular bijections on the vertices of an infinite binary 2edgecoloured tree, and he conjectures that QAut(T2,c) is a universal coCF group. We show that QAut(T2,c) embeds into V, and thus obtain a new form for Lehnert's conjecture. Following up on these ideas, we begin work to build a representation theory into R. Thompson's group V. In particular, we classify precisely which Baumslag–Solitar groups embed into V.

Copulae on products of compact Riemannian manifolds
http://hdl.handle.net/10023/8672
Abstract One standard way of considering a probability distribution on the unit n cube, [0 , 1]n , due to Sklar (1959), is to decompose it into its marginal distributions and a copula, i.e. a probability distribution on [0 , 1]n with uniform marginals. The definition of copula was extended by Jones et al. (2014) to probability distributions on products of circles. This paper defines a copula as a probability distribution on a product of compact Riemannian manifolds that has uniform marginals. Basic properties of such copulae are established. Two fairly general constructions of copulae on products of compact homogeneous manifolds are given; one is based on convolution in the isometry group, the other using equivariant functions from compact Riemannian manifolds to their spaces of square integrable functions. Examples illustrate the use of copulae to analyse bivariate spherical data and bivariate rotational data.
20150901T00:00:00Z
Jupp, P.E.
Abstract One standard way of considering a probability distribution on the unit n cube, [0 , 1]n , due to Sklar (1959), is to decompose it into its marginal distributions and a copula, i.e. a probability distribution on [0 , 1]n with uniform marginals. The definition of copula was extended by Jones et al. (2014) to probability distributions on products of circles. This paper defines a copula as a probability distribution on a product of compact Riemannian manifolds that has uniform marginals. Basic properties of such copulae are established. Two fairly general constructions of copulae on products of compact homogeneous manifolds are given; one is based on convolution in the isometry group, the other using equivariant functions from compact Riemannian manifolds to their spaces of square integrable functions. Examples illustrate the use of copulae to analyse bivariate spherical data and bivariate rotational data.

Graph automatic semigroups
http://hdl.handle.net/10023/8645
In this thesis we examine properties and constructions of graph automatic semigroups, a generalisation of both automatic semigroups and finitely generated FApresentable semigroups.
We consider the properties of graph automatic semigroups, showing that they are independent of the choice of generating set, have decidable word problem, and that if we have a graph automatic structure for a semigroup then we can find one with uniqueness.
Semigroup constructions and their effect on graph automaticity are considered. We show that finitely generated direct products, free products, finitely generated Rees matrix semigroup constructions, zero unions, and ordinal sums all preserve unary graph automaticity, and examine when the converse also holds. We also demonstrate situations where semidirect products, BruckReilly extensions, and semilattice constructions preserve graph automaticity, and consider the conditions we may impose on such constructions in order to ensure that graph automaticity is preserved.
Unary graph automatic semigroups, that is semigroups which have graph automatic structures over a single letter alphabet, are also examined. We consider the form of an automaton recognising multiplication by generators in such a semigroup, and use this to demonstrate various properties of unary graph automatic semigroups. We show that infinite periodic semigroups are not unary graph automatic, and show that we may always find a uniform set of normal forms for a unary graph automatic semigroup. We also determine some necessary conditions for a semigroup to be unary graph automatic, and use this to provide examples of semigroups which are not unary graph automatic.
Finally we consider semigroup constructions for unary graph automatic semigroups. We show that the free product of two semigroups is unary graph automatic if and only if both semigroups are trivial; that direct products do not always preserve unary graph automaticity; and that BruckReilly extensions are never unary graph automatic.
20160624T00:00:00Z
Carey, Rachael Marie
In this thesis we examine properties and constructions of graph automatic semigroups, a generalisation of both automatic semigroups and finitely generated FApresentable semigroups.
We consider the properties of graph automatic semigroups, showing that they are independent of the choice of generating set, have decidable word problem, and that if we have a graph automatic structure for a semigroup then we can find one with uniqueness.
Semigroup constructions and their effect on graph automaticity are considered. We show that finitely generated direct products, free products, finitely generated Rees matrix semigroup constructions, zero unions, and ordinal sums all preserve unary graph automaticity, and examine when the converse also holds. We also demonstrate situations where semidirect products, BruckReilly extensions, and semilattice constructions preserve graph automaticity, and consider the conditions we may impose on such constructions in order to ensure that graph automaticity is preserved.
Unary graph automatic semigroups, that is semigroups which have graph automatic structures over a single letter alphabet, are also examined. We consider the form of an automaton recognising multiplication by generators in such a semigroup, and use this to demonstrate various properties of unary graph automatic semigroups. We show that infinite periodic semigroups are not unary graph automatic, and show that we may always find a uniform set of normal forms for a unary graph automatic semigroup. We also determine some necessary conditions for a semigroup to be unary graph automatic, and use this to provide examples of semigroups which are not unary graph automatic.
Finally we consider semigroup constructions for unary graph automatic semigroups. We show that the free product of two semigroups is unary graph automatic if and only if both semigroups are trivial; that direct products do not always preserve unary graph automaticity; and that BruckReilly extensions are never unary graph automatic.

Constructing flagtransitive, pointimprimitive designs
http://hdl.handle.net/10023/8546
We give a construction of a family of designs with a specified pointpartition and determine the subgroup of automorphisms leaving invariant the pointpartition. We give necessary and sufficient conditions for a design in the family to possess a flagtransitive group of automorphisms preserving the specified pointpartition. We give examples of flagtransitive designs in the family, including a new symmetric 2(1408,336,80) design with automorphism group 2^12:((3⋅M22):2) and a construction of one of the families of the symplectic designs (the designs S^−(n) ) exhibiting a flagtransitive, pointimprimitive automorphism group.
20160504T00:00:00Z
Cameron, Peter Jephson
Praeger, Cheryl E.
We give a construction of a family of designs with a specified pointpartition and determine the subgroup of automorphisms leaving invariant the pointpartition. We give necessary and sufficient conditions for a design in the family to possess a flagtransitive group of automorphisms preserving the specified pointpartition. We give examples of flagtransitive designs in the family, including a new symmetric 2(1408,336,80) design with automorphism group 2^12:((3⋅M22):2) and a construction of one of the families of the symplectic designs (the designs S^−(n) ) exhibiting a flagtransitive, pointimprimitive automorphism group.

Permutation groups and transformation semigroups : results and problems
http://hdl.handle.net/10023/8532
J.M. Howie, the influential St Andrews semigroupist, claimed that we value an area of pure mathematics to the extent that (a) it gives rise to arguments that are deep and elegant, and (b) it has interesting interconnections with other parts of pure mathematics. This paper surveys some recent results on the transformation semigroup generated by a permutation group G and a single nonpermutation a. Our particular concern is the influence that properties of G (related to homogeneity, transitivity and primitivity) have on the structure of the semigroup. In the first part of the paper, we consider properties of S=<G,a> such as regularity and generation. The second is a brief report on the synchronization project, which aims to decide in what circumstances S contains an element of rank 1. The paper closes with a list of open problems on permutation groups and linear groups, and some comments about the impact on semigroups are provided. These two research directions outlined above lead to very interesting and challenging problems on primitive permutation groups whose solutions require combining results from several different areas of mathematics, certainly fulfilling both of Howie's elegance and value tests in a new and fascinating way.
20151001T00:00:00Z
Araujo, Joao
Cameron, Peter Jephson
J.M. Howie, the influential St Andrews semigroupist, claimed that we value an area of pure mathematics to the extent that (a) it gives rise to arguments that are deep and elegant, and (b) it has interesting interconnections with other parts of pure mathematics. This paper surveys some recent results on the transformation semigroup generated by a permutation group G and a single nonpermutation a. Our particular concern is the influence that properties of G (related to homogeneity, transitivity and primitivity) have on the structure of the semigroup. In the first part of the paper, we consider properties of S=<G,a> such as regularity and generation. The second is a brief report on the synchronization project, which aims to decide in what circumstances S contains an element of rank 1. The paper closes with a list of open problems on permutation groups and linear groups, and some comments about the impact on semigroups are provided. These two research directions outlined above lead to very interesting and challenging problems on primitive permutation groups whose solutions require combining results from several different areas of mathematics, certainly fulfilling both of Howie's elegance and value tests in a new and fascinating way.

Guessing games on trianglefree graphs
http://hdl.handle.net/10023/8518
The guessing game introduced by Riis is a variant of the "guessing your own hats" game and can be played on any simple directed graph G on n vertices. For each digraph G, it is proved that there exists a unique guessing number gn(G) associated to the guessing game played on G. When we consider the directed edge to be bidirected, in other words, the graph G is undirected, Christofides and Markström introduced a method to bound the value of the guessing number from below using the fractional clique cover number kappa_f(G). In particular they showed gn(G) >= V(G)  kappa_f(G). Moreover, it is pointed out that equality holds in this bound if the underlying undirected graph G falls into one of the following categories: perfect graphs, cycle graphs or their complement. In this paper, we show that there are trianglefree graphs that have guessing numbers which do not meet the fractional clique cover bound. In particular, the famous trianglefree HigmanSims graph has guessing number at least 77 and at most 78, while the bound given by fractional clique cover is 50.
20160101T00:00:00Z
Cameron, Peter Jephson
Dang, Anh
Riis, Soren
The guessing game introduced by Riis is a variant of the "guessing your own hats" game and can be played on any simple directed graph G on n vertices. For each digraph G, it is proved that there exists a unique guessing number gn(G) associated to the guessing game played on G. When we consider the directed edge to be bidirected, in other words, the graph G is undirected, Christofides and Markström introduced a method to bound the value of the guessing number from below using the fractional clique cover number kappa_f(G). In particular they showed gn(G) >= V(G)  kappa_f(G). Moreover, it is pointed out that equality holds in this bound if the underlying undirected graph G falls into one of the following categories: perfect graphs, cycle graphs or their complement. In this paper, we show that there are trianglefree graphs that have guessing numbers which do not meet the fractional clique cover bound. In particular, the famous trianglefree HigmanSims graph has guessing number at least 77 and at most 78, while the bound given by fractional clique cover is 50.

Some undecidability results for asynchronous transducers and the BrinThompson group 2V
http://hdl.handle.net/10023/8508
Using a result of Kari and Ollinger, we prove that the torsion problem for elements of the BrinThompson group 2V is undecidable. As a result, we show that there does not exist an algorithm to determine whether an element of the rational group R of Grigorchuk, Nekrashevich, and Sushchanskii has finite order. A modification of the construction gives other undecidability results about the dynamics of the action of elements of 2V on Cantor Space. Arzhantseva, Lafont, and Minasyanin prove in 2012 that there exists a finitely presented group with solvable word problem and unsolvable torsion problem. To our knowledge, 2V furnishes the first concrete example of such a group, and gives an example of a direct undecidability result in the extended family of R. Thompson type groups.
20170501T00:00:00Z
Belk, James
Bleak, Collin
Using a result of Kari and Ollinger, we prove that the torsion problem for elements of the BrinThompson group 2V is undecidable. As a result, we show that there does not exist an algorithm to determine whether an element of the rational group R of Grigorchuk, Nekrashevich, and Sushchanskii has finite order. A modification of the construction gives other undecidability results about the dynamics of the action of elements of 2V on Cantor Space. Arzhantseva, Lafont, and Minasyanin prove in 2012 that there exists a finitely presented group with solvable word problem and unsolvable torsion problem. To our knowledge, 2V furnishes the first concrete example of such a group, and gives an example of a direct undecidability result in the extended family of R. Thompson type groups.

Effects of thermal conduction and compressive viscosity on the period ratio of the slow mode
http://hdl.handle.net/10023/8423
Aims: Increasing observational evidence of wave modes brings us to a closer understanding of the solar corona. Coronal seismology allows us to combine wave observations and theory to determine otherwise unknown parameters. The period ratio, P1/2P2, between the period P1 of the fundamental mode and the period P2 of its first overtone, is one such tool of coronal seismology and its departure from unity provides information about the structure of the corona. Methods: We consider analytically the effects of thermal conduction and compressive viscosity on the period ratio for a longitudinally propagating sound wave. Results: For coronal values of thermal conduction the effect on the period ratio is negligible. For compressive viscosity the effect on the period ratio may become important for some short hot loops. Conclusions: Damping typically has a small effect on the period ratio, suggesting that longitudinal structuring remains the most significant effect.
C.K.M. acknowledges financial support from the CarnegieTrust. Discussions with Dr. I. De Moortel and Prof. A. W. Hood are gratefully acknowledged
20100601T00:00:00Z
Macnamara, Cicely Krystyna
Roberts, Bernard
Aims: Increasing observational evidence of wave modes brings us to a closer understanding of the solar corona. Coronal seismology allows us to combine wave observations and theory to determine otherwise unknown parameters. The period ratio, P1/2P2, between the period P1 of the fundamental mode and the period P2 of its first overtone, is one such tool of coronal seismology and its departure from unity provides information about the structure of the corona. Methods: We consider analytically the effects of thermal conduction and compressive viscosity on the period ratio for a longitudinally propagating sound wave. Results: For coronal values of thermal conduction the effect on the period ratio is negligible. For compressive viscosity the effect on the period ratio may become important for some short hot loops. Conclusions: Damping typically has a small effect on the period ratio, suggesting that longitudinal structuring remains the most significant effect.

Wild attractors and thermodynamic formalism
http://hdl.handle.net/10023/8394
Fibonacci unimodal maps can have a wild Cantor attractor, and hence be Lebesgue dissipative, depending on the order of the critical point. We present a oneparameter family ƒλ of countably piecewise linear unimodal Fibonacci maps in order to study the thermodynamic formalism of dynamics where dissipativity of Lebesgue (and conformal) measure is responsible for phase transitions. We show that for the potential φt = t log ƒλ', there is a unique phase transition at some t1 ≤ 1, and the pressure P(φt ) is analytic (with unique equilibrium state) elsewhere. The pressure is majorised by a nonanalytic C∞ curve (with all derivatives equal to 0 at t1 < 1) at the emergence of a wild attractor, whereas the phase transition at t1 = 1 can be of any finite order for those λ for which ƒλ is Lebesgue conservative. We also obtain results on the existence of conformal measures and equilibrium states, as well as the hyperbolic dimension and the dimension of the basin of ω(c).
MT was partially supported by NSF Grants DMS 0606343 and DMS 0908093.
20150901T00:00:00Z
Bruin, Henk
Todd, Michael John
Fibonacci unimodal maps can have a wild Cantor attractor, and hence be Lebesgue dissipative, depending on the order of the critical point. We present a oneparameter family ƒλ of countably piecewise linear unimodal Fibonacci maps in order to study the thermodynamic formalism of dynamics where dissipativity of Lebesgue (and conformal) measure is responsible for phase transitions. We show that for the potential φt = t log ƒλ', there is a unique phase transition at some t1 ≤ 1, and the pressure P(φt ) is analytic (with unique equilibrium state) elsewhere. The pressure is majorised by a nonanalytic C∞ curve (with all derivatives equal to 0 at t1 < 1) at the emergence of a wild attractor, whereas the phase transition at t1 = 1 can be of any finite order for those λ for which ƒλ is Lebesgue conservative. We also obtain results on the existence of conformal measures and equilibrium states, as well as the hyperbolic dimension and the dimension of the basin of ω(c).

Well quasiorder in combinatorics : embeddings and homomorphisms
http://hdl.handle.net/10023/7963
The notion of well quasiorder (wqo) from the theory of ordered sets often arises naturally in contexts where one deals with infinite collections of structures which can somehow be compared, and it then represents a useful discriminator between ‘tame’ and ‘wild’ such classes. In this article we survey such situations within combinatorics, and attempt to identify promising directions for further research. We argue that these are intimately linked with a more systematic and detailed study of homomorphisms in combinatorics.
20150701T00:00:00Z
Huczynska, Sophie
Ruskuc, Nik
The notion of well quasiorder (wqo) from the theory of ordered sets often arises naturally in contexts where one deals with infinite collections of structures which can somehow be compared, and it then represents a useful discriminator between ‘tame’ and ‘wild’ such classes. In this article we survey such situations within combinatorics, and attempt to identify promising directions for further research. We argue that these are intimately linked with a more systematic and detailed study of homomorphisms in combinatorics.

Coprime invariable generation and minimalexponent groups
http://hdl.handle.net/10023/7910
A finite group G is coprimely invariably generated if there exists a set of generators {g1,. .,gu} of G with the property that the orders g1,. .,gu are pairwise coprime and that for all x1,. .,xu∈G the set {g1x1,. .,guxu} generates G.We show that if G is coprimely invariably generated, then G can be generated with three elements, or two if G is soluble, and that G has zero presentation rank. As a corollary, we show that if G is any finite group such that no proper subgroup has the same exponent as G, then G has zero presentation rank. Furthermore, we show that every finite simple group is coprimely invariably generated by two elements, except for O8+(2) which requires three elements.Along the way, we show that for each finite simple group S, and for each partition π1,. .,πu of the primes dividing S, the product of the number kπi(S) of conjugacy classes of πielements satisfies. ∏i=1ukπi(S)≤S2OutS.
Colva RoneyDougal acknowledges the support of EPSRC grant EP/I03582X/1.
20150801T00:00:00Z
Detomi, Eloisa
Lucchini, Andrea
RoneyDougal, C.M.
A finite group G is coprimely invariably generated if there exists a set of generators {g1,. .,gu} of G with the property that the orders g1,. .,gu are pairwise coprime and that for all x1,. .,xu∈G the set {g1x1,. .,guxu} generates G.We show that if G is coprimely invariably generated, then G can be generated with three elements, or two if G is soluble, and that G has zero presentation rank. As a corollary, we show that if G is any finite group such that no proper subgroup has the same exponent as G, then G has zero presentation rank. Furthermore, we show that every finite simple group is coprimely invariably generated by two elements, except for O8+(2) which requires three elements.Along the way, we show that for each finite simple group S, and for each partition π1,. .,πu of the primes dividing S, the product of the number kπi(S) of conjugacy classes of πielements satisfies. ∏i=1ukπi(S)≤S2OutS.

Dimension and measure theory of selfsimilar structures with no separation condition
http://hdl.handle.net/10023/7854
We introduce methods to cope with selfsimilar sets when we do not assume any separation condition. For a selfsimilar set K ⊆ ℝᵈ we establish a similarity dimensionlike formula for Hausdorff dimension regardless of any separation condition. By the application of this result we deduce that the Hausdorff measure and Hausdorff content of K are equal, which implies that K is Ahlfors regular if and only if Hᵗ (K) > 0 where t = dim[sub]H K. We further show that if t = dim[sub]H K < 1 then Hᵗ (K) > 0 is also equivalent to the weak separation property. Regarding Hausdorff dimension, we give a dimension approximation method that provides a tool to generalise results on nonoverlapping selfsimilar sets to overlapping selfsimilar sets.
We investigate how the Hausdorff dimension and measure of a selfsimilar set
K ⊆ ℝᵈ behave under linear mappings. This depends on the nature of the group T generated by the orthogonal parts of the defining maps of K. We show that if T is finite then every linear image of K is a graph directed attractor and there exists at least one projection of K such that the dimension drops under projection. In general, with no restrictions on T we establish that Hᵗ (L ∘ O(K)) = Hᵗ (L(K)) for every element O of the closure of T , where L is a linear map and t = dim[sub]H K. We also prove that for disjoint subsets A and B of K we have that Hᵗ (L(A) ∩ L(B)) = 0. Hochman and Shmerkin showed that if T is dense in SO(d; ℝ) and the strong separation condition is satisfied then dim[sub]H (g(K)) = min {dim[sub]H K; l} for every continuously differentiable map g of rank l. We deduce the same result without any separation condition and we generalize a result of Eroğlu by obtaining that Hᵗ (g(K)) = 0.
We show that for the attractor (K1, … ,Kq) of a graph directed iterated function system, for each 1 ≤ j ≤ q and ε > 0 there exists a selfsimilar set K ⊆ Kj that satisfies the strong separation condition and dim[sub]H Kj  ε < dim[sub]H K. We show that we can further assume convenient conditions on the orthogonal parts and similarity ratios of the defining similarities of K. Using this property we obtain results on a range of topics including on dimensions of projections, intersections, distance sets and sums and products of sets.
We study the situations where the Hausdorff measure and Hausdorff content of a set are equal in the critical dimension. Our main result here shows that this equality holds for any subset of a set corresponding to a nontrivial cylinder of an irreducible subshift of finite type, and thus also for any selfsimilar or graph directed selfsimilar set, regardless of separation conditions. The main tool in the proof is an exhaustion lemma for Hausdorff measure based on the Vitali's Covering Theorem. We also give several examples showing that one cannot hope for the equality to hold in general if one moves in a number of the natural directions away from `selfsimilar'. Finally we consider an analogous version of the problem for packing measure. In this case we need the strong separation condition and can only prove that the packing measure and δapproximate packing premeasure coincide for sufficiently small δ > 0.
20151130T00:00:00Z
Farkas, Ábel
We introduce methods to cope with selfsimilar sets when we do not assume any separation condition. For a selfsimilar set K ⊆ ℝᵈ we establish a similarity dimensionlike formula for Hausdorff dimension regardless of any separation condition. By the application of this result we deduce that the Hausdorff measure and Hausdorff content of K are equal, which implies that K is Ahlfors regular if and only if Hᵗ (K) > 0 where t = dim[sub]H K. We further show that if t = dim[sub]H K < 1 then Hᵗ (K) > 0 is also equivalent to the weak separation property. Regarding Hausdorff dimension, we give a dimension approximation method that provides a tool to generalise results on nonoverlapping selfsimilar sets to overlapping selfsimilar sets.
We investigate how the Hausdorff dimension and measure of a selfsimilar set
K ⊆ ℝᵈ behave under linear mappings. This depends on the nature of the group T generated by the orthogonal parts of the defining maps of K. We show that if T is finite then every linear image of K is a graph directed attractor and there exists at least one projection of K such that the dimension drops under projection. In general, with no restrictions on T we establish that Hᵗ (L ∘ O(K)) = Hᵗ (L(K)) for every element O of the closure of T , where L is a linear map and t = dim[sub]H K. We also prove that for disjoint subsets A and B of K we have that Hᵗ (L(A) ∩ L(B)) = 0. Hochman and Shmerkin showed that if T is dense in SO(d; ℝ) and the strong separation condition is satisfied then dim[sub]H (g(K)) = min {dim[sub]H K; l} for every continuously differentiable map g of rank l. We deduce the same result without any separation condition and we generalize a result of Eroğlu by obtaining that Hᵗ (g(K)) = 0.
We show that for the attractor (K1, … ,Kq) of a graph directed iterated function system, for each 1 ≤ j ≤ q and ε > 0 there exists a selfsimilar set K ⊆ Kj that satisfies the strong separation condition and dim[sub]H Kj  ε < dim[sub]H K. We show that we can further assume convenient conditions on the orthogonal parts and similarity ratios of the defining similarities of K. Using this property we obtain results on a range of topics including on dimensions of projections, intersections, distance sets and sums and products of sets.
We study the situations where the Hausdorff measure and Hausdorff content of a set are equal in the critical dimension. Our main result here shows that this equality holds for any subset of a set corresponding to a nontrivial cylinder of an irreducible subshift of finite type, and thus also for any selfsimilar or graph directed selfsimilar set, regardless of separation conditions. The main tool in the proof is an exhaustion lemma for Hausdorff measure based on the Vitali's Covering Theorem. We also give several examples showing that one cannot hope for the equality to hold in general if one moves in a number of the natural directions away from `selfsimilar'. Finally we consider an analogous version of the problem for packing measure. In this case we need the strong separation condition and can only prove that the packing measure and δapproximate packing premeasure coincide for sufficiently small δ > 0.

Speed of convergence for laws of rare events and escape rates
http://hdl.handle.net/10023/7837
We obtain error terms on the rate of convergence to Extreme Value Laws, and to the asymptotic Hitting Time Statistics, for a general class of weakly dependent stochastic processes. The dependence of the error terms on the ‘time’ and ‘length’ scales is very explicit. Specialising to data derived from a class of dynamical systems we find even more detailed error terms, one application of which is to consider escape rates through small holes in these systems.
MT was partially supported by NSF grant DMS 1109587. All authors are supported by FCT (Portugal) projects PTDC/MAT/099493/2008 and PTDC/MAT/120346/2010, which are financed by national and European structural funds through the programs FEDER and COMPETE. All three authors were also supported by CMUP, which is financed by FCT (Portugal) through the programs POCTI and POSI, with national and European structural funds, under the project PEstC/MAT/UI0144/2013.
20150401T00:00:00Z
Freitas, Ana
Freitas, Jorge
Todd, Michael John
We obtain error terms on the rate of convergence to Extreme Value Laws, and to the asymptotic Hitting Time Statistics, for a general class of weakly dependent stochastic processes. The dependence of the error terms on the ‘time’ and ‘length’ scales is very explicit. Specialising to data derived from a class of dynamical systems we find even more detailed error terms, one application of which is to consider escape rates through small holes in these systems.

On simultaneous local dimension functions of subsets of Rd
http://hdl.handle.net/10023/7778
For a subset E ⊑ Rd and x ∈ Rd, the local Hausdorff dimension function of E at x and the local packing dimension function of E at x are defined by (Formula presented.) where dimH and dimP denote the Hausdorff dimension and the packing dimension, respectively. In this note we give a short and simple proof showing that for any pair of continuous functions f,g: Rd → [0, d] with f ≤ g, it is possible to choose a set E that simultaneously has f as its local Hausdorff dimension function and g as its local packing dimension function.
Date of Acceptance: 04/05/2015
20150930T00:00:00Z
Olsen, Lars Ole Ronnow
For a subset E ⊑ Rd and x ∈ Rd, the local Hausdorff dimension function of E at x and the local packing dimension function of E at x are defined by (Formula presented.) where dimH and dimP denote the Hausdorff dimension and the packing dimension, respectively. In this note we give a short and simple proof showing that for any pair of continuous functions f,g: Rd → [0, d] with f ≤ g, it is possible to choose a set E that simultaneously has f as its local Hausdorff dimension function and g as its local packing dimension function.

Nearthreshold electron injection in the laserplasma wakefield accelerator leading to femtosecond bunches
http://hdl.handle.net/10023/7750
The laserplasma wakefield accelerator is a compact source of high brightness, ultrashort duration electron bunches. Selfinjection occurs when electrons from the background plasma gain sufficient momentum at the back of the bubbleshaped accelerating structure to experience sustained acceleration. The shortest duration and highest brightness electron bunches result from selfinjection close to the threshold for injection. Here we show that in this case injection is due to the localized charge density buildup in the sheath crossing region at the rear of the bubble, which has the effect of increasing the accelerating potential to above a critical value. Bunch duration is determined by the dwell time above this critical value, which explains why single or multiple ultrashort electron bunches with little dark current are formed in the first bubble. We confirm experimentally, using coherent optical transition radiation measurements, that single or multiple bunches with femtosecond duration and peak currents of several kiloAmpere, and femtosecond intervals between bunches, emerge from the accelerator.
We gratefully acknowledge the support of the UK EPSRC (grant no. EP/J018171/1), the EU FP7 programmes: the Extreme Light Infrastructure (ELI) project, the LaserlabEurope (no. 284464), and the EUCARD2 project (no. 312453).
20150917T00:00:00Z
Islam, M.R.
Brunetti, E.
Shanks, R.P.
Ersfeld, B.
Issac, R.C.
Cipiccia, S.
Anania, M.P.
Welsh, G.H.
Wiggins, S.M.
Noble, A.
Cairns, R Alan
Raj, G.
Jaroszynski, D.A.
The laserplasma wakefield accelerator is a compact source of high brightness, ultrashort duration electron bunches. Selfinjection occurs when electrons from the background plasma gain sufficient momentum at the back of the bubbleshaped accelerating structure to experience sustained acceleration. The shortest duration and highest brightness electron bunches result from selfinjection close to the threshold for injection. Here we show that in this case injection is due to the localized charge density buildup in the sheath crossing region at the rear of the bubble, which has the effect of increasing the accelerating potential to above a critical value. Bunch duration is determined by the dwell time above this critical value, which explains why single or multiple ultrashort electron bunches with little dark current are formed in the first bubble. We confirm experimentally, using coherent optical transition radiation measurements, that single or multiple bunches with femtosecond duration and peak currents of several kiloAmpere, and femtosecond intervals between bunches, emerge from the accelerator.

Digit frequencies and Bernoulli convolutions
http://hdl.handle.net/10023/7719
It is well known that when β is a Pisot number, the corresponding Bernoulli convolution ν(β) has Hausdorff dimension less than 1, i.e. that there exists a set A(β) with (ν(β))(A(β))=1 and dim_H(A(β))<1. We show explicitly how to construct for each Pisot number β such a set A(β).
This work was supported partly by the Dutch Organisation for Scientific Research (NWO) grant number 613.001.022 and partly by the Engineering and Physical Sciences Research Council grant number EP/K029061/1.
20140627T00:00:00Z
Kempton, Thomas Michael William
It is well known that when β is a Pisot number, the corresponding Bernoulli convolution ν(β) has Hausdorff dimension less than 1, i.e. that there exists a set A(β) with (ν(β))(A(β))=1 and dim_H(A(β))<1. We show explicitly how to construct for each Pisot number β such a set A(β).

Selfaffine sets with positive Lebesgue measure
http://hdl.handle.net/10023/7718
Using techniques introduced by C. Gunturk, we prove that the attractors of a family of overlapping selfaffine iterated function systems contain a neighbourhood of zero for all parameters in a certain range. This corresponds to giving conditions under which a single sequence may serve as a ‘simultaneous βexpansion’ of different numbers in different bases.
20140627T00:00:00Z
Dajani, Karma
Jiang, Kan
Kempton, Thomas Michael William
Using techniques introduced by C. Gunturk, we prove that the attractors of a family of overlapping selfaffine iterated function systems contain a neighbourhood of zero for all parameters in a certain range. This corresponds to giving conditions under which a single sequence may serve as a ‘simultaneous βexpansion’ of different numbers in different bases.

An exact collisionless equilibrium for the ForceFree Harris Sheet with low plasma beta
http://hdl.handle.net/10023/7691
We present a first discussion and analysis of the physical properties of a new exact collisionless equilibrium for a onedimensional nonlinear forcefree magnetic field, namely, the forcefree Harris sheet. The solution allows any value of the plasma beta, and crucially below unity, which previous nonlinear forcefree collisionless equilibria could not. The distribution function involves infinite series of Hermite polynomials in the canonical momenta, of which the important mathematical properties of convergence and nonnegativity have recently been proven. Plots of the distribution function are presented for the plasma beta modestly below unity, and we compare the shape of the distribution function in two of the velocity directions to a Maxwellian distribution.
Funding: STFC Consolidated Grant [ST/K000950/1] (OA, TN & FW) and a Doctoral Training Grant [ST/K502327/1] (OA). EPSRC Doctoral Training Grant [EP/K503162/1] (ST).
20151001T00:00:00Z
Allanson, Oliver Douglas
Neukirch, Thomas
Wilson, Fiona
Troscheit, Sascha
We present a first discussion and analysis of the physical properties of a new exact collisionless equilibrium for a onedimensional nonlinear forcefree magnetic field, namely, the forcefree Harris sheet. The solution allows any value of the plasma beta, and crucially below unity, which previous nonlinear forcefree collisionless equilibria could not. The distribution function involves infinite series of Hermite polynomials in the canonical momenta, of which the important mathematical properties of convergence and nonnegativity have recently been proven. Plots of the distribution function are presented for the plasma beta modestly below unity, and we compare the shape of the distribution function in two of the velocity directions to a Maxwellian distribution.

Homomorphic image orders on combinatorial structures
http://hdl.handle.net/10023/7679
Combinatorial structures have been considered under various orders, including substructure order and homomorphism order. In this paper, we investigate the homomorphic image order, corresponding to the existence of a surjective homomorphism between two structures. We distinguish between strong and induced forms of the order and explore how they behave in the context of different common combinatorial structures. We focus on three aspects: antichains and partial wellorder, the joint preimage property and the dual amalgamation property. The two latter properties are natural analogues of the wellknown joint embedding property and amalgamation property, and are investigated here for the first time.
20150701T00:00:00Z
Huczynska, Sophie
Ruskuc, Nik
Combinatorial structures have been considered under various orders, including substructure order and homomorphism order. In this paper, we investigate the homomorphic image order, corresponding to the existence of a surjective homomorphism between two structures. We distinguish between strong and induced forms of the order and explore how they behave in the context of different common combinatorial structures. We focus on three aspects: antichains and partial wellorder, the joint preimage property and the dual amalgamation property. The two latter properties are natural analogues of the wellknown joint embedding property and amalgamation property, and are investigated here for the first time.

A Höldertype inequality on a regular rooted tree
http://hdl.handle.net/10023/7658
We establish an inequality which involves a nonnegative function defined on the vertices of a finite mary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree summed over automorphisms of the tree, to a product of sums of powers of the function over vertices at certain levels of the tree. Conjugate powers arise naturally in the inequality, indeed, Hölder's inequality is a key tool in the proof which uses induction on subgroups of the automorphism group of the tree.
20150315T00:00:00Z
Falconer, Kenneth John
We establish an inequality which involves a nonnegative function defined on the vertices of a finite mary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree summed over automorphisms of the tree, to a product of sums of powers of the function over vertices at certain levels of the tree. Conjugate powers arise naturally in the inequality, indeed, Hölder's inequality is a key tool in the proof which uses induction on subgroups of the automorphism group of the tree.

On generators, relations and Dsimplicity of direct products, Byleen extensions, and other semigroup constructions
http://hdl.handle.net/10023/7629
In this thesis we study two different topics, both in the context of semigroup constructions. The first is the investigation of an embedding problem, specifically the problem of whether it is possible to embed any given finitely presentable semigroup into a Dsimple finitely presentable semigroup. We consider some wellknown semigroup constructions, investigating their properties to determine whether they might prove useful for finding a solution to our problem. We carry out a more detailed study into a more complicated semigroup construction, the Byleen extension, which has been used to solve several other embedding problems. We prove several results regarding the structure of this extension, finding necessary and sufficient conditions for an extension to be Dsimple and a very strong necessary condition for an extension to be finitely presentable.
The second topic covered in this thesis is relative rank, specifically the sequence obtained by taking the rank of incremental direct powers of a given semigroup modulo the diagonal subsemigroup. We investigate the relative rank sequences of infinite Cartesian products of groups and of semigroups. We characterise all semigroups for which the relative rank sequence of an infinite Cartesian product is finite, and show that if the sequence is finite then it is bounded above by a logarithmic function. We will find sufficient conditions for the relative rank sequence of an infinite Cartesian product to be logarithmic, and sufficient conditions for it to be constant. Chapter 4 ends with the introduction of a new topic, relative presentability, which follows naturally from the topic of relative rank.
20151130T00:00:00Z
Baynes, Samuel
In this thesis we study two different topics, both in the context of semigroup constructions. The first is the investigation of an embedding problem, specifically the problem of whether it is possible to embed any given finitely presentable semigroup into a Dsimple finitely presentable semigroup. We consider some wellknown semigroup constructions, investigating their properties to determine whether they might prove useful for finding a solution to our problem. We carry out a more detailed study into a more complicated semigroup construction, the Byleen extension, which has been used to solve several other embedding problems. We prove several results regarding the structure of this extension, finding necessary and sufficient conditions for an extension to be Dsimple and a very strong necessary condition for an extension to be finitely presentable.
The second topic covered in this thesis is relative rank, specifically the sequence obtained by taking the rank of incremental direct powers of a given semigroup modulo the diagonal subsemigroup. We investigate the relative rank sequences of infinite Cartesian products of groups and of semigroups. We characterise all semigroups for which the relative rank sequence of an infinite Cartesian product is finite, and show that if the sequence is finite then it is bounded above by a logarithmic function. We will find sufficient conditions for the relative rank sequence of an infinite Cartesian product to be logarithmic, and sufficient conditions for it to be constant. Chapter 4 ends with the introduction of a new topic, relative presentability, which follows naturally from the topic of relative rank.

Higher moments for random multiplicative measures
http://hdl.handle.net/10023/7474
We obtain a condition for the Lqconvergence of martingales generated by random multiplicative cascade measures for q>1 without any selfsimilarity requirements on the cascades.
20150801T00:00:00Z
Falconer, Kenneth John
We obtain a condition for the Lqconvergence of martingales generated by random multiplicative cascade measures for q>1 without any selfsimilarity requirements on the cascades.

Generalized energy inequalities and higher multifractal moments
http://hdl.handle.net/10023/7095
We present a class of generalized energy inequalities and indicate their use in investigating higher multifractal moments, in particular Lqdimensions of images of measures under Brownian processes, Lqdimensions of almost selfaﬃne measures, and moments of random cascade measures
20140802T00:00:00Z
Falconer, Kenneth John
We present a class of generalized energy inequalities and indicate their use in investigating higher multifractal moments, in particular Lqdimensions of images of measures under Brownian processes, Lqdimensions of almost selfaﬃne measures, and moments of random cascade measures

The maximal subgroups of the classical groups in dimension 13, 14 and 15
http://hdl.handle.net/10023/7067
One might easily argue that the Classification of Finite Simple Groups is
one of the most important theorems of group theory. Given that any finite
group can be deconstructed into its simple composition factors, it is of great
importance to have a detailed knowledge of the structure of finite simple
groups.
One of the classes of finite groups that appear in the classification theorem
are the simple classical groups, which are matrix groups preserving
some form. This thesis will shed some new light on almost simple classical
groups in dimension 13, 14 and 15. In particular we will determine their
maximal subgroups.
We will build on the results by Bray, Holt, and RoneyDougal who
calculated the maximal subgroups of all almost simple finite classical groups
in dimension less than 12. Furthermore, Aschbacher proved that the maximal
subgroups of almost simple classical groups lie in nine classes. The maximal
subgroups in the first eight classes, i.e. the subgroups of geometric type,
were determined by Kleidman and Liebeck for
dimension greater than 13.
Therefore this thesis concentrates on the ninth class of Aschbacher’s
Theorem. This class roughly consists of subgroups which are almost simple
modulo scalars and do not preserve a geometric structure. As our final
result we will give tables containing all maximal subgroups of almost simple
classical groups in dimension 13, 14 and 15.
20151130T00:00:00Z
Schröder, Anna Katharina
One might easily argue that the Classification of Finite Simple Groups is
one of the most important theorems of group theory. Given that any finite
group can be deconstructed into its simple composition factors, it is of great
importance to have a detailed knowledge of the structure of finite simple
groups.
One of the classes of finite groups that appear in the classification theorem
are the simple classical groups, which are matrix groups preserving
some form. This thesis will shed some new light on almost simple classical
groups in dimension 13, 14 and 15. In particular we will determine their
maximal subgroups.
We will build on the results by Bray, Holt, and RoneyDougal who
calculated the maximal subgroups of all almost simple finite classical groups
in dimension less than 12. Furthermore, Aschbacher proved that the maximal
subgroups of almost simple classical groups lie in nine classes. The maximal
subgroups in the first eight classes, i.e. the subgroups of geometric type,
were determined by Kleidman and Liebeck for
dimension greater than 13.
Therefore this thesis concentrates on the ninth class of Aschbacher’s
Theorem. This class roughly consists of subgroups which are almost simple
modulo scalars and do not preserve a geometric structure. As our final
result we will give tables containing all maximal subgroups of almost simple
classical groups in dimension 13, 14 and 15.

Dots and lines : geometric semigroup theory and finite presentability
http://hdl.handle.net/10023/6923
Geometric semigroup theory means different things to different people, but it is agreed that it involves associating a geometric structure to a semigroup and deducing properties of the semigroup based on that structure.
One such property is finite presentability. In geometric group theory, the geometric structure of choice is the Cayley graph of the group. It is known that in group theory finite presentability is an invariant under quasiisometry of Cayley graphs.
We choose to associate a metric space to a semigroup based on a Cayley graph of that semigroup. This metric space is constructed by removing directions, multiple edges and loops from the Cayley graph. We call this a skeleton of the semigroup.
We show that finite presentability of certain types of direct products, completely (0)simple, and Clifford semigroups is preserved under isomorphism of skeletons. A major tool employed in this is the ŠvarcMilnor Lemma.
We present an example that shows that in general, finite presentability is not an invariant property under isomorphism of skeletons of semigroups, and in fact is not an invariant property under quasiisometry of Cayley graphs for semigroups.
We give several skeletons and describe fully the semigroups that can be associated to these.
20150626T00:00:00Z
Awang, Jennifer S.
Geometric semigroup theory means different things to different people, but it is agreed that it involves associating a geometric structure to a semigroup and deducing properties of the semigroup based on that structure.
One such property is finite presentability. In geometric group theory, the geometric structure of choice is the Cayley graph of the group. It is known that in group theory finite presentability is an invariant under quasiisometry of Cayley graphs.
We choose to associate a metric space to a semigroup based on a Cayley graph of that semigroup. This metric space is constructed by removing directions, multiple edges and loops from the Cayley graph. We call this a skeleton of the semigroup.
We show that finite presentability of certain types of direct products, completely (0)simple, and Clifford semigroups is preserved under isomorphism of skeletons. A major tool employed in this is the ŠvarcMilnor Lemma.
We present an example that shows that in general, finite presentability is not an invariant property under isomorphism of skeletons of semigroups, and in fact is not an invariant property under quasiisometry of Cayley graphs for semigroups.
We give several skeletons and describe fully the semigroups that can be associated to these.

Inflations of geometric grid classes of permutations
http://hdl.handle.net/10023/6862
Geometric grid classes and the substitution decomposition have both been shown to be fundamental in the understanding of the structure of permutation classes. In particular, these are the two main tools in the recent classification of permutation classes of growth rate less than κ ≈ 2.20557 (a specific algebraic integer at which infinite antichains first appear). Using language and ordertheoretic methods, we prove that the substitution closures of geometric grid classes are well partially ordered, finitely based, and that all their subclasses have algebraic generating functions. We go on to show that the inflation of a geometric grid class by a strongly rational class is well partially ordered, and that all its subclasses have rational generating functions. This latter fact allows us to conclude that every permutation class with growth rate less than κ has a rational generating function. This bound is tight as there are permutation classes with growth rate κ which have nonrational generating functions.
All three authors were partially supported by EPSRC via the grant EP/J006440/1.
20150201T00:00:00Z
Albert, M.D.
Ruskuc, Nik
Vatter, V.
Geometric grid classes and the substitution decomposition have both been shown to be fundamental in the understanding of the structure of permutation classes. In particular, these are the two main tools in the recent classification of permutation classes of growth rate less than κ ≈ 2.20557 (a specific algebraic integer at which infinite antichains first appear). Using language and ordertheoretic methods, we prove that the substitution closures of geometric grid classes are well partially ordered, finitely based, and that all their subclasses have algebraic generating functions. We go on to show that the inflation of a geometric grid class by a strongly rational class is well partially ordered, and that all its subclasses have rational generating functions. This latter fact allows us to conclude that every permutation class with growth rate less than κ has a rational generating function. This bound is tight as there are permutation classes with growth rate κ which have nonrational generating functions.

Subalgebras of FApresentable algebras
http://hdl.handle.net/10023/6852
Automatic presentations, also called FApresentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FApresentable algebras. First, an example is given to show that the class of finitely generated FApresentable algebras is not closed under forming finitely generated subalgebras, even within the class of algebras with only unary operations. In contrast, a finitely generated subalgebra of an FApresentable algebra with a single unary operation is itself FApresentable. Furthermore, it is proven that the class of unary FApresentable algebras is closed under forming finitely generated subalgebras and that the membership problem for such subalgebras is decidable.
20140601T00:00:00Z
Cain, A.J.
Ruskuc, Nik
Automatic presentations, also called FApresentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FApresentable algebras. First, an example is given to show that the class of finitely generated FApresentable algebras is not closed under forming finitely generated subalgebras, even within the class of algebras with only unary operations. In contrast, a finitely generated subalgebra of an FApresentable algebra with a single unary operation is itself FApresentable. Furthermore, it is proven that the class of unary FApresentable algebras is closed under forming finitely generated subalgebras and that the membership problem for such subalgebras is decidable.

Cayley automaton semigroups
http://hdl.handle.net/10023/6558
Let S be a semigroup, C(S) the automaton constructed from the right Cayley
graph of S with respect to all of S as the generating set and ∑(C(S)) the
automaton semigroup constructed from C(S). Such semigroups are termed
Cayley automaton semigroups. For a given semigroup S we aim to establish
connections between S and ∑(C(S)).
For a finite monogenic semigroup S with a nontrivial cyclic subgroup C[sub]n we
show that ∑(C(S)) is a small extension of a free semigroup of rank n, and
that in the case of a trivial subgroup ∑(C(S)) is finite.
The notion of invariance is considered and we examine those semigroups S
satisfying S ≅ ∑(C(S)). We classify which bands satisfy this, showing that
they are those bands with faithful leftregular representations, but exhibit
examples outwith this classification. In doing so we answer an open problem
of Cain.
Following this, we consider iterations of the construction and show that for
any n there exists a semigroup where we can iterate the construction n times
before reaching a semigroup satisfying S ≅ ∑(C(S)). We also give an example of a semigroup where repeated iteration never produces a semigroup
satisfying S ≅ ∑(C(S)).
Cayley automaton semigroups of infinite semigroups are also considered and
we generalise and extend a result of Silva and Steinberg to cancellative semigroups. We also construct the Cayley automaton semigroup of the bicyclic
monoid, showing in particular that it is not finitely generated.
20150626T00:00:00Z
McLeman, Alexander Lewis Andrew
Let S be a semigroup, C(S) the automaton constructed from the right Cayley
graph of S with respect to all of S as the generating set and ∑(C(S)) the
automaton semigroup constructed from C(S). Such semigroups are termed
Cayley automaton semigroups. For a given semigroup S we aim to establish
connections between S and ∑(C(S)).
For a finite monogenic semigroup S with a nontrivial cyclic subgroup C[sub]n we
show that ∑(C(S)) is a small extension of a free semigroup of rank n, and
that in the case of a trivial subgroup ∑(C(S)) is finite.
The notion of invariance is considered and we examine those semigroups S
satisfying S ≅ ∑(C(S)). We classify which bands satisfy this, showing that
they are those bands with faithful leftregular representations, but exhibit
examples outwith this classification. In doing so we answer an open problem
of Cain.
Following this, we consider iterations of the construction and show that for
any n there exists a semigroup where we can iterate the construction n times
before reaching a semigroup satisfying S ≅ ∑(C(S)). We also give an example of a semigroup where repeated iteration never produces a semigroup
satisfying S ≅ ∑(C(S)).
Cayley automaton semigroups of infinite semigroups are also considered and
we generalise and extend a result of Silva and Steinberg to cancellative semigroups. We also construct the Cayley automaton semigroup of the bicyclic
monoid, showing in particular that it is not finitely generated.

Most switching classes with primitive automorphism groups contain graphs with trivial groups
http://hdl.handle.net/10023/6429
The operation of switching a graph Gamma with respect to a subset X of the vertex set interchanges edges and nonedges between X and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set of graphs on a given vertex set, so we can talk about the automorphism group of a switching class of graphs. It might be thought that switching classes with many automorphisms would have the property that all their graphs also have many automorphisms. But the main theorem of this paper shows a different picture: with finitely many exceptions, if a nontrivial switching class S has primitive automorphism group, then it contains a graph whose automorphism group is trivial. We also find all the exceptional switching classes; up to complementation, there are just six.
20150601T00:00:00Z
Cameron, Peter Jephson
Spiga, Pablo
The operation of switching a graph Gamma with respect to a subset X of the vertex set interchanges edges and nonedges between X and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set of graphs on a given vertex set, so we can talk about the automorphism group of a switching class of graphs. It might be thought that switching classes with many automorphisms would have the property that all their graphs also have many automorphisms. But the main theorem of this paper shows a different picture: with finitely many exceptions, if a nontrivial switching class S has primitive automorphism group, then it contains a graph whose automorphism group is trivial. We also find all the exceptional switching classes; up to complementation, there are just six.

On residual finiteness of monoids, their Schützenberger groups and associated actions
http://hdl.handle.net/10023/6310
In this paper we discuss connections between the following properties: (RFM) residual finiteness of a monoid M ; (RFSG) residual finiteness of Schützenberger groups of M ; and (RFRL) residual finiteness of the natural actions of M on its Green's R and Lclasses. The general question is whether (RFM) implies (RFSG) and/or (RFRL), and vice versa. We consider these questions in all the possible combinations of the following situations: M is an arbitrary monoid; M is an arbitrary regular monoid; every Jclass of M has finitely many R and Lclasses; M has finitely many left and right ideals. In each case we obtain complete answers, which are summarised in a table.
RG was supported by an EPSRC Postdoctoral Fellowship EP/E043194/1 held at the University of St Andrews, Scotland.
20140601T00:00:00Z
Gray, R
Ruskuc, Nik
In this paper we discuss connections between the following properties: (RFM) residual finiteness of a monoid M ; (RFSG) residual finiteness of Schützenberger groups of M ; and (RFRL) residual finiteness of the natural actions of M on its Green's R and Lclasses. The general question is whether (RFM) implies (RFSG) and/or (RFRL), and vice versa. We consider these questions in all the possible combinations of the following situations: M is an arbitrary monoid; M is an arbitrary regular monoid; every Jclass of M has finitely many R and Lclasses; M has finitely many left and right ideals. In each case we obtain complete answers, which are summarised in a table.

Codimension formulae for the intersection of fractal subsets of Cantor spaces
http://hdl.handle.net/10023/6030
We examine the dimensions of the intersection of a subset E of an mary Cantor space Cm with the image of a subset F under a random isometry with respect to a natural metric. We obtain almost sure upper bounds for the Hausdorff and upper boxcounting dimensions of the intersection, and a lower bound for the essential supremum of the Hausdorff dimension. The dimensions of the intersections are typically max{dim E +dim F dim Cm, 0}, akin to other codimension theorems. The upper estimates come from the expected sizes of coverings, whilst the lower estimate is more intricate, using martingales to define a random measure on the intersection to facilitate a potential theoretic argument.
20160201T00:00:00Z
Donoven, Casey
Falconer, Kenneth John
We examine the dimensions of the intersection of a subset E of an mary Cantor space Cm with the image of a subset F under a random isometry with respect to a natural metric. We obtain almost sure upper bounds for the Hausdorff and upper boxcounting dimensions of the intersection, and a lower bound for the essential supremum of the Hausdorff dimension. The dimensions of the intersections are typically max{dim E +dim F dim Cm, 0}, akin to other codimension theorems. The upper estimates come from the expected sizes of coverings, whilst the lower estimate is more intricate, using martingales to define a random measure on the intersection to facilitate a potential theoretic argument.

Hölder differentiability of selfconformal devil's staircases
http://hdl.handle.net/10023/5980
In this paper we consider the probability distribution function of a Gibbs measure supported on a selfconformal set given by an iterated function system (devil's staircase) applied to a compact subset of ℝ. We use thermodynamic multifractal formalism to calculate the Hausdorff dimension of the sets Sα 0, Sα ∞ and Sα, the set of points at which this function has, respectively, Hölder derivative 0, ∞ or no derivative in the general sense. This extends recent work by Darst, Dekking, Falconer, Kesseböhmer and Stratmann, and Yao, Zhang and Li by considering arbitrary such Gibbs measures given by a potential function independent of the geometric potential.
20140301T00:00:00Z
Troscheit, S.
In this paper we consider the probability distribution function of a Gibbs measure supported on a selfconformal set given by an iterated function system (devil's staircase) applied to a compact subset of ℝ. We use thermodynamic multifractal formalism to calculate the Hausdorff dimension of the sets Sα 0, Sα ∞ and Sα, the set of points at which this function has, respectively, Hölder derivative 0, ∞ or no derivative in the general sense. This extends recent work by Darst, Dekking, Falconer, Kesseböhmer and Stratmann, and Yao, Zhang and Li by considering arbitrary such Gibbs measures given by a potential function independent of the geometric potential.

Assouad type dimensions and homogeneity of fractals
http://hdl.handle.net/10023/5941
We investigate several aspects of the Assouad dimension and the lower dimension, which together form a natural 'dimension pair'. In particular, we compute these dimensions for certain classes of selfaffine sets and quasiselfsimilar sets and study their relationships with other notions of dimension, such as the Hausdorff dimension for example. We also investigate some basic properties of these dimensions including their behaviour regarding unions and products and their set theoretic complexity.
The author was supported by an EPSRC Doctoral Training Grant
20141201T00:00:00Z
Fraser, Jonathan M.
We investigate several aspects of the Assouad dimension and the lower dimension, which together form a natural 'dimension pair'. In particular, we compute these dimensions for certain classes of selfaffine sets and quasiselfsimilar sets and study their relationships with other notions of dimension, such as the Hausdorff dimension for example. We also investigate some basic properties of these dimensions including their behaviour regarding unions and products and their set theoretic complexity.

Negative ion sound solitary waves revisited
http://hdl.handle.net/10023/5845
Some years ago, a group including the present author and Padma Shukla showed that a suitable nonthermal electron distribution allows the formation of ion sound solitary waves with either positive or negative density perturbations, whereas with Maxwellian electrons only a positive density perturbation is possible. The present paper discusses the qualitative features of this distribution allowing the negative waves and shared with suitable twotemperature distributions.
20131201T00:00:00Z
Cairns, R. A.
Some years ago, a group including the present author and Padma Shukla showed that a suitable nonthermal electron distribution allows the formation of ion sound solitary waves with either positive or negative density perturbations, whereas with Maxwellian electrons only a positive density perturbation is possible. The present paper discusses the qualitative features of this distribution allowing the negative waves and shared with suitable twotemperature distributions.

An explicit upper bound for the Helfgott delta in SL(2,p)
http://hdl.handle.net/10023/5819
Helfgott proved that there exists a δ>0 such that if S is a symmetric generating subset of SL(2,p) containing 1 then either S3=SL(2,p) or S3 ≥S1+δ. It is known that δ ≥ 1/3024. Here we show that δ ≤(log2(7)1)/6 ≈ 0.3012 and we present evidence suggesting that this might be the true value of δ.
20150101T00:00:00Z
Button, Jack
RoneyDougal, Colva
Helfgott proved that there exists a δ>0 such that if S is a symmetric generating subset of SL(2,p) containing 1 then either S3=SL(2,p) or S3 ≥S1+δ. It is known that δ ≥ 1/3024. Here we show that δ ≤(log2(7)1)/6 ≈ 0.3012 and we present evidence suggesting that this might be the true value of δ.

Backward wave cyclotronmaser emission in the auroral magnetosphere
http://hdl.handle.net/10023/5802
In this Letter, we present theory and particleincell simulations describing cyclotron radio emission from Earth's auroral region and similar phenomena in other astrophysical environments. In particular, we find that the radiation, generated by a downgoing electron horseshoe distribution is due to a backward wave cyclotronmaser emission process. The backward wave nature of the radiation contributes to upward refraction of the radiation that is also enhanced by a density inhomogeneity. We also show that the radiation is preferentially amplified along the auroral oval rather than transversely. The results are in agreement with recent Cluster observations.
This work was supported by EPSRC Grant No. EP/G04239X/1.
20141007T00:00:00Z
Speirs, D. C.
Bingham, R.
Cairns, R. A.
Vorgul, I.
Kellett, B. J.
Phelps, A. D. R.
Ronald, K.
In this Letter, we present theory and particleincell simulations describing cyclotron radio emission from Earth's auroral region and similar phenomena in other astrophysical environments. In particular, we find that the radiation, generated by a downgoing electron horseshoe distribution is due to a backward wave cyclotronmaser emission process. The backward wave nature of the radiation contributes to upward refraction of the radiation that is also enhanced by a density inhomogeneity. We also show that the radiation is preferentially amplified along the auroral oval rather than transversely. The results are in agreement with recent Cluster observations.

Maximal subsemigroups of the semigroup of all mappings on an infinite set
http://hdl.handle.net/10023/5793
We classify the maximal subsemigroups of the semigroup ΩΩ of all mappings on an infinite set Ω that contain one of the following groups: the symmetric group on Ω, the setwise stabilizer of a nonempty finite subset of Ω, the stabilizer of a finite partition of Ω, or the stabilizer of an ultrafilter on Ω. If G is any of these groups, then we also characterise the mappings f,g ∈ ΩΩ such that the semigroup G, f, g generated by G ∪ {f,g} equals ΩΩ. We also show that the setwise stabiliser of a nonempty finite set, the almost stabiliser of a finite partition, and the stabiliser of an ultrafilter are maximal subsemigroups of the symmetric group.
20150301T00:00:00Z
East, J.
Mitchell, James David
Péresse, Y.
We classify the maximal subsemigroups of the semigroup ΩΩ of all mappings on an infinite set Ω that contain one of the following groups: the symmetric group on Ω, the setwise stabilizer of a nonempty finite subset of Ω, the stabilizer of a finite partition of Ω, or the stabilizer of an ultrafilter on Ω. If G is any of these groups, then we also characterise the mappings f,g ∈ ΩΩ such that the semigroup G, f, g generated by G ∪ {f,g} equals ΩΩ. We also show that the setwise stabiliser of a nonempty finite set, the almost stabiliser of a finite partition, and the stabiliser of an ultrafilter are maximal subsemigroups of the symmetric group.

Computing in permutation groups without memory
http://hdl.handle.net/10023/5727
Memoryless computation is a new technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computations are performed in modern cores, since they typically involve updates of single registers. The memoryless computation model can be fully expressed in terms of transformation semigroups, or in the case of bijective functions, permutation groups. In this paper, we consider how efficiently permutations can be computed without memory. We determine the minimum number of basic updates required to compute any permutation, or any even permutation. The small number of required instructions shows that very small instruction sets could be encoded on cores to perform memoryless computation. We then start looking at a possible compromise between the size of the instruction set and the length of the resulting programs. We consider updates only involving a limited number of registers. In particular, we show that binary instructions are not enough to compute all permutations without memory when the alphabet size is even. These results, though expressed as properties of special generating sets of the symmetric or alternating groups, provide guidelines on the implementation of memoryless computation.
Funding: UK Engineering and Physical Sciences Research Council (EP/K033956/1)
20141102T00:00:00Z
Cameron, Peter Jephson
Fairbairn, Ben
Gadouleau, Maximilien
Memoryless computation is a new technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computations are performed in modern cores, since they typically involve updates of single registers. The memoryless computation model can be fully expressed in terms of transformation semigroups, or in the case of bijective functions, permutation groups. In this paper, we consider how efficiently permutations can be computed without memory. We determine the minimum number of basic updates required to compute any permutation, or any even permutation. The small number of required instructions shows that very small instruction sets could be encoded on cores to perform memoryless computation. We then start looking at a possible compromise between the size of the instruction set and the length of the resulting programs. We consider updates only involving a limited number of registers. In particular, we show that binary instructions are not enough to compute all permutations without memory when the alphabet size is even. These results, though expressed as properties of special generating sets of the symmetric or alternating groups, provide guidelines on the implementation of memoryless computation.

Computing in matrix groups without memory
http://hdl.handle.net/10023/5715
Memoryless computation is a novel means of computing any function of a set of registers by updating one register at a time while using no memory. We aim to emulate how computations are performed on modern cores, since they typically involve updates of single registers. The computation model of memoryless computation can be fully expressed in terms of transformation semigroups, or in the case of bijective functions, permutation groups. In this paper, we view registers as elements of a finite field and we compute linear permutations without memory. We first determine the maximum complexity of a linear function when only linear instructions are allowed. We also determine which linear functions are hardest to compute when the field in question is the binary field and the number of registers is even. Secondly, we investigate some matrix groups, thus showing that the special linear group is internally computable but not fast. Thirdly, we determine the smallest set of instructions required to generate the special and general linear groups. These results are important for memoryless computation, for they show that linear functions can be computed very fast or that very few instructions are needed to compute any linear function. They thus indicate new advantages of using memoryless computation.
Funding: UK Engineering and Physical Sciences Research Council award EP/K033956/1
20141102T00:00:00Z
Cameron, Peter Jephson
Fairbairn, Ben
Gadouleau, Maximilien
Memoryless computation is a novel means of computing any function of a set of registers by updating one register at a time while using no memory. We aim to emulate how computations are performed on modern cores, since they typically involve updates of single registers. The computation model of memoryless computation can be fully expressed in terms of transformation semigroups, or in the case of bijective functions, permutation groups. In this paper, we view registers as elements of a finite field and we compute linear permutations without memory. We first determine the maximum complexity of a linear function when only linear instructions are allowed. We also determine which linear functions are hardest to compute when the field in question is the binary field and the number of registers is even. Secondly, we investigate some matrix groups, thus showing that the special linear group is internally computable but not fast. Thirdly, we determine the smallest set of instructions required to generate the special and general linear groups. These results are important for memoryless computation, for they show that linear functions can be computed very fast or that very few instructions are needed to compute any linear function. They thus indicate new advantages of using memoryless computation.

The probability of generating a finite simple group
http://hdl.handle.net/10023/5658
We study the probability of generating a finite simple group, together with its generalisation PG,socG(d), the conditional probability of generating an almost simple finite group G by d elements, given that these elements generate G/ socG. We prove that PG,socG(2) ⩾ 53/90, with equality if and only if G is A6 or S6, and establish a similar result for PG,socG(3). Positive answers to longstanding questions of Wiegold on direct products, and of Mel’nikov on profinite groups, follow easily from our results.
20131101T00:00:00Z
Menezes, Nina Emma
Quick, Martyn
RoneyDougal, Colva Mary
We study the probability of generating a finite simple group, together with its generalisation PG,socG(d), the conditional probability of generating an almost simple finite group G by d elements, given that these elements generate G/ socG. We prove that PG,socG(2) ⩾ 53/90, with equality if and only if G is A6 or S6, and establish a similar result for PG,socG(3). Positive answers to longstanding questions of Wiegold on direct products, and of Mel’nikov on profinite groups, follow easily from our results.

Most primitive groups are full automorphism groups of edgetransitive hypergraphs
http://hdl.handle.net/10023/5580
We prove that, for a primitive permutation group G acting on a set of size n, other than the alternating group, the probability that Aut(X,YG) = G for a random subset Y of X, tends to 1 as n tends to infinity. So the property of the title holds for all primitive groups except the alternating groups and finitely many others. This answers a question of M. Klin. Moreover, we give an upper bound n1/2+ε for the minimum size of the edges in such a hypergraph. This is essentially best possible.
20150101T00:00:00Z
Babai, Laszlo
Cameron, Peter Jephson
We prove that, for a primitive permutation group G acting on a set of size n, other than the alternating group, the probability that Aut(X,YG) = G for a random subset Y of X, tends to 1 as n tends to infinity. So the property of the title holds for all primitive groups except the alternating groups and finitely many others. This answers a question of M. Klin. Moreover, we give an upper bound n1/2+ε for the minimum size of the edges in such a hypergraph. This is essentially best possible.

Exact dimensionality and projections of random selfsimilar measures and sets
http://hdl.handle.net/10023/5514
We study the geometric properties of random multiplicative cascade measures defined on selfsimilar sets. We show that such measures and their projections and sections are almost surely exactdimensional, generalizing Feng and Hu's result for selfsimilar measures. This, together with a compact group extension argument, enables us to generalize Hochman and Shmerkin's theorems on projections of deterministic selfsimilar measures to these random measures without requiring any separation conditions on the underlying sets. We give applications to selfsimilar sets and fractal percolation, including new results on projections, C1images and distance sets.
20141001T00:00:00Z
Falconer, Kenneth
Jin, Xiong
We study the geometric properties of random multiplicative cascade measures defined on selfsimilar sets. We show that such measures and their projections and sections are almost surely exactdimensional, generalizing Feng and Hu's result for selfsimilar measures. This, together with a compact group extension argument, enables us to generalize Hochman and Shmerkin's theorems on projections of deterministic selfsimilar measures to these random measures without requiring any separation conditions on the underlying sets. We give applications to selfsimilar sets and fractal percolation, including new results on projections, C1images and distance sets.

On the nature of reconnection at a solar coronal null point above a separatrix dome
http://hdl.handle.net/10023/5459
Threedimensional magnetic null points are ubiquitous in the solar corona and in any generic mixedpolarity magnetic field. We consider magnetic reconnection at an isolated coronal null point whose fan field lines form a dome structure. Using analytical and computational models, we demonstrate several features of spinefan reconnection at such a null, including the fact that substantial magnetic flux transfer from one region of field line connectivity to another can occur. The flux transfer occurs across the current sheet that forms around the null point during spinefan reconnection, and there is no separator present. Also, flipping of magnetic field lines takes place in a manner similar to that observed in the quasiseparatrix layer or sliprunning reconnection.
20130910T00:00:00Z
Pontin, D. I.
Priest, E. R.
Galsgaard, K.
Threedimensional magnetic null points are ubiquitous in the solar corona and in any generic mixedpolarity magnetic field. We consider magnetic reconnection at an isolated coronal null point whose fan field lines form a dome structure. Using analytical and computational models, we demonstrate several features of spinefan reconnection at such a null, including the fact that substantial magnetic flux transfer from one region of field line connectivity to another can occur. The flux transfer occurs across the current sheet that forms around the null point during spinefan reconnection, and there is no separator present. Also, flipping of magnetic field lines takes place in a manner similar to that observed in the quasiseparatrix layer or sliprunning reconnection.

On magnetic reconnection and flux rope topology in solar flux emergence
http://hdl.handle.net/10023/5393
We present an analysis of the formation of atmospheric flux ropes in a magnetohydrodynamic solar flux emergence simulation. The simulation domain ranges from the top of the solar interior to the low corona. A twisted magnetic flux tube emerges from the solar interior and into the atmosphere where it interacts with the ambient magnetic field. By studying the connectivity of the evolving magnetic field, we are able to better understand the process of flux rope formation in the solar atmosphere. In the simulation, two flux ropes are produced as a result of flux emergence. Each has a different evolution resulting in different topological structures. These are determined by plasma flows and magnetic reconnection. As the flux rope is the basic structure of the coronal mass ejection, we discuss the implications of our findings for solar eruptions.
20140221T00:00:00Z
MacTaggart, David
Haynes, Andrew Lewis
We present an analysis of the formation of atmospheric flux ropes in a magnetohydrodynamic solar flux emergence simulation. The simulation domain ranges from the top of the solar interior to the low corona. A twisted magnetic flux tube emerges from the solar interior and into the atmosphere where it interacts with the ambient magnetic field. By studying the connectivity of the evolving magnetic field, we are able to better understand the process of flux rope formation in the solar atmosphere. In the simulation, two flux ropes are produced as a result of flux emergence. Each has a different evolution resulting in different topological structures. These are determined by plasma flows and magnetic reconnection. As the flux rope is the basic structure of the coronal mass ejection, we discuss the implications of our findings for solar eruptions.

Observations of a hybrid doublestreamer/pseudostreamer in the solar corona
http://hdl.handle.net/10023/5318
We report on the first observation of a single hybrid magnetic structure that contains both a pseudostreamer and a double streamer. This structure was originally observed by the SWAP instrument on board the PROBA2 satellite between 2013 May 5 and 10. It consists of a pair of filament channels near the south pole of the Sun. On the western edge of the structure, the magnetic morphology above the filaments is that of a sidebyside double streamer, with open field between the two channels. On the eastern edge, the magnetic morphology is that of a coronal pseudostreamer without the central open field. We investigated this structure with multiple observations and modeling techniques. We describe the topology and dynamic consequences of such a unified structure.
D.B.S. and L.A.R. acknowledge support from the Belgian Federal Science Policy Office (BELSPO) through the ESAPRODEX program, grant No. 4000103240. S.J.P. acknowledges the financial support of the Isle of Man Government.
20140520T00:00:00Z
Rachmeler, L.A.
Platten, S.J.
Bethge, C.
Seaton, D.B.
Yeates, A.R.
We report on the first observation of a single hybrid magnetic structure that contains both a pseudostreamer and a double streamer. This structure was originally observed by the SWAP instrument on board the PROBA2 satellite between 2013 May 5 and 10. It consists of a pair of filament channels near the south pole of the Sun. On the western edge of the structure, the magnetic morphology above the filaments is that of a sidebyside double streamer, with open field between the two channels. On the eastern edge, the magnetic morphology is that of a coronal pseudostreamer without the central open field. We investigated this structure with multiple observations and modeling techniques. We describe the topology and dynamic consequences of such a unified structure.

Space exploration using parallel orbits : a study in parallel symbolic computing
http://hdl.handle.net/10023/5303
Orbit enumerations represent an important class of mathematical algorithms which is widely used in computational discrete mathematics. In this paper, we present a new sharedmemory implementation of a generic Orbit skeleton in the GAP computer algebra system [5]. By defining a skeleton, we are easily able to capture a wide variety of concrete Orbit enumerations that can exploit the same underlying parallel implementation. We also propose a generic cost model for predicting the speedups that our Orbit skeleton will deliver for a given application on a given parallel system. We demonstrate the scalability of our implementation on a 64core sharedmemory machine. Our results show that we are able to obtain good speedups over sequential GAP programs (up to 25.27 on 64 cores).
20130901T00:00:00Z
Janjic, Vladimir
Brown, Christopher Mark
Neunhoeffer, Max
Hammond, Kevin
Linton, Stephen Alexander
Loidl, HansWolfgang
Orbit enumerations represent an important class of mathematical algorithms which is widely used in computational discrete mathematics. In this paper, we present a new sharedmemory implementation of a generic Orbit skeleton in the GAP computer algebra system [5]. By defining a skeleton, we are easily able to capture a wide variety of concrete Orbit enumerations that can exploit the same underlying parallel implementation. We also propose a generic cost model for predicting the speedups that our Orbit skeleton will deliver for a given application on a given parallel system. We demonstrate the scalability of our implementation on a 64core sharedmemory machine. Our results show that we are able to obtain good speedups over sequential GAP programs (up to 25.27 on 64 cores).

Catastrophe versus instability for the eruption of a toroidal solar magnetic flux rope
http://hdl.handle.net/10023/5291
The onset of a solar eruption is formulated here as either a magnetic catastrophe or as an instability. Both start with the same equation of force balance governing the underlying equilibria. Using a toroidal flux rope in an external bipolar or quadrupolar field as a model for the currentcarrying flux, we demonstrate the occurrence of a fold catastrophe by loss of equilibrium for several representative evolutionary sequences in the stable domain of parameter space. We verify that this catastrophe and the torus instability occur at the same point; they are thus equivalent descriptions for the onset condition of solar eruptions.
B.K. acknowledges support by the Chinese Academy of Sciences under grant No. 2012T1J0017. He also acknowledges support by the DFG, the STFC, and the NSF. J.L.'s work was supported by 973 Program grants 2013CB815103 and 2011CB811403, NSFC grants 11273055, and 11333007, and CAS grant KJCX2EWT07 to Yunnan Observatory. E.R.P. is grateful to the Leverhulme Trust for financial support. The contribution of T.T. was supported by NASA's HTP, LWS, and SR&T programs and by NSF.
20140701T00:00:00Z
Kliem, B.
Lin, J.
Forbes, T. G.
Priest, E. R.
Toeroek, T.
The onset of a solar eruption is formulated here as either a magnetic catastrophe or as an instability. Both start with the same equation of force balance governing the underlying equilibria. Using a toroidal flux rope in an external bipolar or quadrupolar field as a model for the currentcarrying flux, we demonstrate the occurrence of a fold catastrophe by loss of equilibrium for several representative evolutionary sequences in the stable domain of parameter space. We verify that this catastrophe and the torus instability occur at the same point; they are thus equivalent descriptions for the onset condition of solar eruptions.

The solar cycle variation of topological structures in the global solar corona
http://hdl.handle.net/10023/5271
Context. The complicated distribution of magnetic flux across the solar photosphere results in a complex web of coronal magnetic field structures. To understand this complexity, the magnetic skeleton of the coronal field can be calculated. The skeleton highlights the (separatrix) surfaces that divide the field into topologically distinct regions, allowing openfield regions on the solar surface to be located. Furthermore, separatrix surfaces and their intersections with other separatrix surfaces (i.e., separators) are important likely energy release sites. Aims. The aim of this paper is to investigate, throughout the solar cycle, the nature of coronal magneticfield topologies that arise under the potentialfield sourcesurface approximation. In particular, we characterise the typical global fields at solar maximum and minimum. Methods. Global magnetic fields are extrapolated from observed Kitt Peak and SOLIS synoptic magnetograms, from Carrington rotations 1645 to 2144, using the potentialfield sourcesurface model. This allows the variations in the coronal skeleton to be studied over three solar cycles. Results. The main building blocks which make up magnetic fields are identified and classified according to the nature of their separatrix surfaces. The magnetic skeleton reveals that, at solar maximum, the global coronal field involves a multitude of topological structures at all latitudes crisscrossing throughout the atmosphere. Many openfield regions exist originating anywhere on the photosphere. At solar minimum, the coronal topology is heavily influenced by the solar magnetic dipole. A strong dipole results in a simple largescale structure involving just two large polar openfield regions, but, at short radial distances between ± 60° latitude, the smallscale topology is complex. If the solar magnetic dipole if weak, as in the recent minimum, then the lowlatitude quietsun magnetic fields may be globally significant enough to create many disconnected openfield regions between ± 60° latitude, in addition to the two polar openfield regions.
S.J.P. acknowledges financial support from the Isle of Man Government. E.R.P. is grateful to the Leverhulme Trust for his emeritus fellowship. The research leading to these results has received funding from the European Commission’s Seventh Framework Programme (FP7/20072013) under the grant agreement SWIFF (project No. 263340, www.swiff.eu).
20140501T00:00:00Z
Platten, S.J.
Parnell, C.E.
Haynes, A.L.
Priest, E.R.
MacKay, D.H.
Context. The complicated distribution of magnetic flux across the solar photosphere results in a complex web of coronal magnetic field structures. To understand this complexity, the magnetic skeleton of the coronal field can be calculated. The skeleton highlights the (separatrix) surfaces that divide the field into topologically distinct regions, allowing openfield regions on the solar surface to be located. Furthermore, separatrix surfaces and their intersections with other separatrix surfaces (i.e., separators) are important likely energy release sites. Aims. The aim of this paper is to investigate, throughout the solar cycle, the nature of coronal magneticfield topologies that arise under the potentialfield sourcesurface approximation. In particular, we characterise the typical global fields at solar maximum and minimum. Methods. Global magnetic fields are extrapolated from observed Kitt Peak and SOLIS synoptic magnetograms, from Carrington rotations 1645 to 2144, using the potentialfield sourcesurface model. This allows the variations in the coronal skeleton to be studied over three solar cycles. Results. The main building blocks which make up magnetic fields are identified and classified according to the nature of their separatrix surfaces. The magnetic skeleton reveals that, at solar maximum, the global coronal field involves a multitude of topological structures at all latitudes crisscrossing throughout the atmosphere. Many openfield regions exist originating anywhere on the photosphere. At solar minimum, the coronal topology is heavily influenced by the solar magnetic dipole. A strong dipole results in a simple largescale structure involving just two large polar openfield regions, but, at short radial distances between ± 60° latitude, the smallscale topology is complex. If the solar magnetic dipole if weak, as in the recent minimum, then the lowlatitude quietsun magnetic fields may be globally significant enough to create many disconnected openfield regions between ± 60° latitude, in addition to the two polar openfield regions.

Free products in R. Thompson’s group V
http://hdl.handle.net/10023/5237
We investigate some product structures in R. Thompson's group $ V$, primarily by studying the topological dynamics associated with $ V$'s action on the Cantor set C. We draw attention to the class D(V,C) of groups which have embeddings as demonstrative subgroups of V whose class can be used to assist in forming various products. Note that D(V,C) contains all finite groups, the free group on two generators, and Q/Z, and is closed under passing to subgroups and under taking direct products of any member by any finite member. If G≤V and H ∈ D(V,C), then G~H embeds into V. Finally, if G, H ∈ D(V,C), then G*H embeds in V. Using a dynamical approach, we also show the perhaps surprising result that Z2 * Z does not embed in V, even though V has many embedded copies of Z2 and has many embedded copies of free products of various pairs of its subgroups.
20131101T00:00:00Z
Bleak, Collin Patrick
SalazarDiaz, Olga
We investigate some product structures in R. Thompson's group $ V$, primarily by studying the topological dynamics associated with $ V$'s action on the Cantor set C. We draw attention to the class D(V,C) of groups which have embeddings as demonstrative subgroups of V whose class can be used to assist in forming various products. Note that D(V,C) contains all finite groups, the free group on two generators, and Q/Z, and is closed under passing to subgroups and under taking direct products of any member by any finite member. If G≤V and H ∈ D(V,C), then G~H embeds into V. Finally, if G, H ∈ D(V,C), then G*H embeds in V. Using a dynamical approach, we also show the perhaps surprising result that Z2 * Z does not embed in V, even though V has many embedded copies of Z2 and has many embedded copies of free products of various pairs of its subgroups.

Indeterminacy and instability in Petschek reconnection
http://hdl.handle.net/10023/5234
We explain two puzzling aspects of Petschek's model for fast reconnection. One is its failure to occur in plasma simulations with uniform resistivity. The other is its inability to provide anything more than an upper limit for the reconnection rate. We have found that previously published analytical solutions based on Petschek's model are structurally unstable if the electrical resistivity is uniform. The structural instability is associated with the presence of an essential singularity at the Xline that is unphysical. By requiring that such a singularity does not exist, we obtain a formula that predicts a specific rate of reconnection. For uniform resistivity, reconnection can only occur at the slow, SweetParker rate. For nonuniform resistivity, reconnection can occur at a much faster rate provided that the resistivity profile is not too flat near the Xline. If this condition is satisfied, then the scale length of the nonuniformity determines the reconnection rate.
This work was supported by NSF Grants ATM0734032 and AGS0962698, NASA Grants NNX08AG44G and NNX10AC04G to the University of New Hampshire, and subcontract SVT7702 from the Smithsonian Astrophysical Observatory in support of their NASA Grants NNM07AA02C and NNM07AB07C. D. B. Seaton was supported by PRODEX Grant C90193 managed by the European Space Agency in collaboration with the Belgian Federal Science Policy Office, and by Grant FP7/20072013 from the European Commission's Seventh Framework Program under the agreement eHeroes (Project No. 284461). Additional support was provided by the Leverhulme Trust to E. R. Priest.
20130513T00:00:00Z
Forbes, T.G.
Priest, E.R.
Seaton, D.B.
Litvinenko, Y.E.
We explain two puzzling aspects of Petschek's model for fast reconnection. One is its failure to occur in plasma simulations with uniform resistivity. The other is its inability to provide anything more than an upper limit for the reconnection rate. We have found that previously published analytical solutions based on Petschek's model are structurally unstable if the electrical resistivity is uniform. The structural instability is associated with the presence of an essential singularity at the Xline that is unphysical. By requiring that such a singularity does not exist, we obtain a formula that predicts a specific rate of reconnection. For uniform resistivity, reconnection can only occur at the slow, SweetParker rate. For nonuniform resistivity, reconnection can occur at a much faster rate provided that the resistivity profile is not too flat near the Xline. If this condition is satisfied, then the scale length of the nonuniformity determines the reconnection rate.

The effect of slip length on vortex rebound from a rigid boundary
http://hdl.handle.net/10023/5232
The problem of a dipole incident normally on a rigid boundary, for moderate to large Reynolds numbers, has recently been treated numerically using a volume penalisation method by Nguyen van yen, Farge, and Schneider [Phys. Rev. Lett.106, 184502 (2011)]. Their results indicate that energy dissipating structures persist in the inviscid limit. They found that the use of penalisation methods intrinsically introduces some slip at the boundary wall, where the slip approaches zero as the Reynolds number goes to infinity, so reducing to the noslip case in this limit. We study the same problem, for both noslip and partial slip cases, using compact differences on a Chebyshev grid in the direction normal to the wall and Fourier methods in the direction along the wall. We find that for the noslip case there is no indication of the persistence of energy dissipating structures in the limit as viscosity approaches zero and that this also holds for any fixed slip length. However, when the slip length is taken to vary inversely with Reynolds number then the results of Nguyen van yen et al. are regained. It therefore appears that the prediction that energy dissipating structures persist in the inviscid limit follows from the two limits of wall slip length going to zero, and viscosity going to zero, not being treated independently in their use of the volume penalisation method.
20130923T00:00:00Z
Sutherland, D.
Macaskill, C.
Dritschel, D.G.
The problem of a dipole incident normally on a rigid boundary, for moderate to large Reynolds numbers, has recently been treated numerically using a volume penalisation method by Nguyen van yen, Farge, and Schneider [Phys. Rev. Lett.106, 184502 (2011)]. Their results indicate that energy dissipating structures persist in the inviscid limit. They found that the use of penalisation methods intrinsically introduces some slip at the boundary wall, where the slip approaches zero as the Reynolds number goes to infinity, so reducing to the noslip case in this limit. We study the same problem, for both noslip and partial slip cases, using compact differences on a Chebyshev grid in the direction normal to the wall and Fourier methods in the direction along the wall. We find that for the noslip case there is no indication of the persistence of energy dissipating structures in the limit as viscosity approaches zero and that this also holds for any fixed slip length. However, when the slip length is taken to vary inversely with Reynolds number then the results of Nguyen van yen et al. are regained. It therefore appears that the prediction that energy dissipating structures persist in the inviscid limit follows from the two limits of wall slip length going to zero, and viscosity going to zero, not being treated independently in their use of the volume penalisation method.

Progress towards numerical and experimental simulations of fusion relevant beam instabilities
http://hdl.handle.net/10023/5186
In certain plasmas, nonthermal electron distributions can produce instabilities. These instabilities may be useful or potentially disruptive. Therefore the study of these instabilities is of importance in a variety of fields including fusion science and astrophysics. Following on from previous work conducted at the University of Strathclyde on the cyclotron resonance maser instability that was relevant to astrophysical radiowave generation, further instabilities are being investigated. Particular instabilities of interest are the anomalous Doppler instability which can occur in magnetic confinement fusion plasmas and the twostream instability that is of importance in fastignition inertial confinement fusion. To this end, computational simulations have been undertaken to investigate the behaviour of both the anomalous Doppler and twostream instabilities with the goal of designing an experiment to observe these behaviours in a laboratory.
20140507T00:00:00Z
King, M.
Bryson, R.
Ronald, K.
Cairns, R. A.
McConville, S. L.
Speirs, D. C.
Phelps, A. D. R.
Bingham, R.
Gillespie, K. M.
Cross, A. W.
Vorgul, I.
Trines, R.
In certain plasmas, nonthermal electron distributions can produce instabilities. These instabilities may be useful or potentially disruptive. Therefore the study of these instabilities is of importance in a variety of fields including fusion science and astrophysics. Following on from previous work conducted at the University of Strathclyde on the cyclotron resonance maser instability that was relevant to astrophysical radiowave generation, further instabilities are being investigated. Particular instabilities of interest are the anomalous Doppler instability which can occur in magnetic confinement fusion plasmas and the twostream instability that is of importance in fastignition inertial confinement fusion. To this end, computational simulations have been undertaken to investigate the behaviour of both the anomalous Doppler and twostream instabilities with the goal of designing an experiment to observe these behaviours in a laboratory.

Scaled Experiment to Investigate Auroral Kilometric Radiation Mechanisms in the Presence of Background Electrons
http://hdl.handle.net/10023/5185
Auroral Kilometric Radiation (AKR) emissions occur at frequencies similar to 300kHz polarised in the Xmode with efficiencies similar to 12% [1,2] in the auroral density cavity in the polar regions of the Earth's magnetosphere, a region of low density plasma similar to 3200km above the Earth's surface, where electrons are accelerated down towards the Earth whilst undergoing magnetic compression. As a result of this magnetic compression the electrons acquire a horseshoe distribution function in velocity space. Previous theoretical studies have predicted that this distribution is capable of driving the cyclotron maser instability. To test this theory a scaled laboratory experiment was constructed to replicate this phenomenon in a controlled environment, [35] whilst 2D and 3D simulations are also being conducted to predict the experimental radiation power and mode, [69]. The experiment operates in the microwave frequency regime and incorporates a region of increasing magnetic field as found at the Earth's pole using magnet solenoids to encase the cylindrical interaction waveguide through which an initially rectilinear electron beam (12A) was accelerated by a 75keV pulse. Experimental results showed evidence of the formation of the horseshoe distribution function. The radiation was produced in the near cutoff TE01 mode, comparable with Xmode characteristics, at 4.42GHz. Peak microwave output power was measured similar to 35kW and peak efficiency of emission similar to 2%, [3]. A Penning trap was constructed and inserted into the interaction waveguide to enable generation of a background plasma which would lead to closer comparisons with the magnetospheric conditions. Initial design and measurements are presented showing the principle features of the new geometry.
20140507T00:00:00Z
McConville, S. L.
Ronald, K.
Speirs, D. C.
Gillespie, K. M.
Phelps, A. D. R.
Cross, A. W.
Bingham, R.
Robertson, C. W.
Whyte, C. G.
He, W.
King, M.
Bryson, R.
Vorgul, I.
Cairns, R. A.
Kellett, B. J.
Auroral Kilometric Radiation (AKR) emissions occur at frequencies similar to 300kHz polarised in the Xmode with efficiencies similar to 12% [1,2] in the auroral density cavity in the polar regions of the Earth's magnetosphere, a region of low density plasma similar to 3200km above the Earth's surface, where electrons are accelerated down towards the Earth whilst undergoing magnetic compression. As a result of this magnetic compression the electrons acquire a horseshoe distribution function in velocity space. Previous theoretical studies have predicted that this distribution is capable of driving the cyclotron maser instability. To test this theory a scaled laboratory experiment was constructed to replicate this phenomenon in a controlled environment, [35] whilst 2D and 3D simulations are also being conducted to predict the experimental radiation power and mode, [69]. The experiment operates in the microwave frequency regime and incorporates a region of increasing magnetic field as found at the Earth's pole using magnet solenoids to encase the cylindrical interaction waveguide through which an initially rectilinear electron beam (12A) was accelerated by a 75keV pulse. Experimental results showed evidence of the formation of the horseshoe distribution function. The radiation was produced in the near cutoff TE01 mode, comparable with Xmode characteristics, at 4.42GHz. Peak microwave output power was measured similar to 35kW and peak efficiency of emission similar to 2%, [3]. A Penning trap was constructed and inserted into the interaction waveguide to enable generation of a background plasma which would lead to closer comparisons with the magnetospheric conditions. Initial design and measurements are presented showing the principle features of the new geometry.

3D PiC code investigations of Auroral Kilometric Radiation mechanisms
http://hdl.handle.net/10023/5184
Efficient (similar to 1%) electron cyclotron radio emissions are known to originate in the X mode from regions of locally depleted plasma in the Earths polar magnetosphere. These emissions are commonly referred to as the Auroral Kilometric Radiation (AKR). AKR occurs naturally in these polar regions where electrons are accelerated by electric fields into the increasing planetary magnetic dipole. Here conservation of the magnetic moment converts axial to rotational momentum forming a horseshoe distribution in velocity phase space. This distribution is unstable to cyclotron emission with radiation emitted in the Xmode. Initial studies were conducted in the form of 2D PiC code simulations [1] and a scaled laboratory experiment that was constructed to reproduce the mechanism of AKR. As studies progressed, 3D PiC code simulations were conducted to enable complete investigation of the complex interaction dimensions. A maximum efficiency of 1.25% is predicted from these simulations in the same mode and frequency as measured in the experiment. This is also consistent with geophysical observations and the predictions of theory.
20140101T00:00:00Z
Gillespie, K. M.
McConville, S. L.
Speirs, D. C.
Ronald, K.
Phelps, A. D. R.
Bingham, R.
Cross, A. W.
Robertson, C. W.
Whyte, C. G.
He, W.
Vorgul, I.
Cairns, R. A.
Kellett, B. J.
Efficient (similar to 1%) electron cyclotron radio emissions are known to originate in the X mode from regions of locally depleted plasma in the Earths polar magnetosphere. These emissions are commonly referred to as the Auroral Kilometric Radiation (AKR). AKR occurs naturally in these polar regions where electrons are accelerated by electric fields into the increasing planetary magnetic dipole. Here conservation of the magnetic moment converts axial to rotational momentum forming a horseshoe distribution in velocity phase space. This distribution is unstable to cyclotron emission with radiation emitted in the Xmode. Initial studies were conducted in the form of 2D PiC code simulations [1] and a scaled laboratory experiment that was constructed to reproduce the mechanism of AKR. As studies progressed, 3D PiC code simulations were conducted to enable complete investigation of the complex interaction dimensions. A maximum efficiency of 1.25% is predicted from these simulations in the same mode and frequency as measured in the experiment. This is also consistent with geophysical observations and the predictions of theory.

Numerical simulation of unconstrained cyclotron resonant maser emission
http://hdl.handle.net/10023/5183
When a mainly rectilinear electron beam is subject to significant magnetic compression, conservation of magnetic moment results in the formation of a horseshoe shaped velocity distribution. It has been shown that such a distribution is unstable to cyclotron emission and may be responsible for the generation of Auroral Kilometric Radiation (AKR) an intense rf emission sourced at high altitudes in the terrestrial auroral magnetosphere. PiC code simulations have been undertaken to investigate the dynamics of the cyclotron emission process in the absence of cavity boundaries with particular consideration of the spatial growth rate, spectral output and rf conversion efficiency. Computations reveal that a welldefined cyclotron emission process occurs albeit with a low spatial growth rate compared to waveguide bounded simulations. The rf output is near perpendicular to the electron beam with a slight backwardwave character reflected in the spectral output with a well defined peak at 2.68GHz, just below the relativistic electron cyclotron frequency. The corresponding rf conversion efficiency of 1.1% is comparable to waveguide bounded simulations and consistent with the predictions of kinetic theory that suggest efficient, spectrally well defined radiation emission can be obtained from an electron horseshoe distribution in the absence of radiation boundaries.
20140507T00:00:00Z
Speirs, D. C.
Gillespie, K. M.
Ronald, K.
McConville, S. L.
Phelps, A. D. R.
Cross, A. W.
Bingham, R.
Kellett, B. J.
Cairns, R. A.
Vorgul, I.
When a mainly rectilinear electron beam is subject to significant magnetic compression, conservation of magnetic moment results in the formation of a horseshoe shaped velocity distribution. It has been shown that such a distribution is unstable to cyclotron emission and may be responsible for the generation of Auroral Kilometric Radiation (AKR) an intense rf emission sourced at high altitudes in the terrestrial auroral magnetosphere. PiC code simulations have been undertaken to investigate the dynamics of the cyclotron emission process in the absence of cavity boundaries with particular consideration of the spatial growth rate, spectral output and rf conversion efficiency. Computations reveal that a welldefined cyclotron emission process occurs albeit with a low spatial growth rate compared to waveguide bounded simulations. The rf output is near perpendicular to the electron beam with a slight backwardwave character reflected in the spectral output with a well defined peak at 2.68GHz, just below the relativistic electron cyclotron frequency. The corresponding rf conversion efficiency of 1.1% is comparable to waveguide bounded simulations and consistent with the predictions of kinetic theory that suggest efficient, spectrally well defined radiation emission can be obtained from an electron horseshoe distribution in the absence of radiation boundaries.

Laminar shocks in high power laser plasma interactions
http://hdl.handle.net/10023/5180
We propose a theory to describe laminar ion sound structures in a collisionless plasma. Reflection of a small fraction of the upstream ions converts the well known ion acoustic soliton into a structure with a steep potential gradient upstream and with downstream oscillations. The theory provides a simple interpretation of results dating back more than forty years but, more importantly, is shown to provide an explanation for recent observations on laser produced plasmas relevant to inertial fusion and to ion acceleration. (C) 2014 AIP Publishing LLC.
20140201T00:00:00Z
Cairns, R. A.
Bingham, R.
Norreys, P.
Trines, R.
We propose a theory to describe laminar ion sound structures in a collisionless plasma. Reflection of a small fraction of the upstream ions converts the well known ion acoustic soliton into a structure with a steep potential gradient upstream and with downstream oscillations. The theory provides a simple interpretation of results dating back more than forty years but, more importantly, is shown to provide an explanation for recent observations on laser produced plasmas relevant to inertial fusion and to ion acceleration. (C) 2014 AIP Publishing LLC.

Effect of collisions on amplification of laser beams by Brillouin scattering in plasmas
http://hdl.handle.net/10023/5173
We report on particle in cell simulations of energy transfer between a laser pump beam and a counterpropagating seed beam using the Brillouin scattering process in uniform plasma including collisions. The results presented show that the ion acoustic waves excited through naturally occurring Brillouin scattering of the pump field are preferentially damped without affecting the driven Brillouin scattering process resulting from the beating of the pump and seed fields together. We find that collisions, including the effects of Landau damping, allow for a more efficient transfer of energy between the laser beams, and a significant reduction in the amount of seed prepulse produced.
Authors KH, RT, DCS, RAC, RB were supported by EPSRC grant EP/G04239X/1.
20131001T00:00:00Z
Humphrey, K. A.
Trines, R. M. G. M.
Fiuza, F.
Speirs, D. C.
Norreys, P.
Cairns, R. A.
Silva, L. O.
Bingham, R.
We report on particle in cell simulations of energy transfer between a laser pump beam and a counterpropagating seed beam using the Brillouin scattering process in uniform plasma including collisions. The results presented show that the ion acoustic waves excited through naturally occurring Brillouin scattering of the pump field are preferentially damped without affecting the driven Brillouin scattering process resulting from the beating of the pump and seed fields together. We find that collisions, including the effects of Landau damping, allow for a more efficient transfer of energy between the laser beams, and a significant reduction in the amount of seed prepulse produced.

Beyond sumfree sets in the natural numbers
http://hdl.handle.net/10023/4986
For an interval [1,N]⊆N, sets S⊆[1,N] with the property that {(x,y)∈S2:x+y∈S}=0, known as sumfree sets, have attracted considerable attention. In this paper, we generalize this notion by considering r(S)={(x,y)∈S2:x+y∈S}, and analyze its behaviour as S ranges over the subsets of [1,N]. We obtain a comprehensive description of the spectrum of attainable rvalues, constructive existence results and structural characterizations for sets attaining extremal and nearextremal values.
20140207T00:00:00Z
Huczynska, Sophie
For an interval [1,N]⊆N, sets S⊆[1,N] with the property that {(x,y)∈S2:x+y∈S}=0, known as sumfree sets, have attracted considerable attention. In this paper, we generalize this notion by considering r(S)={(x,y)∈S2:x+y∈S}, and analyze its behaviour as S ranges over the subsets of [1,N]. We obtain a comprehensive description of the spectrum of attainable rvalues, constructive existence results and structural characterizations for sets attaining extremal and nearextremal values.

On the probability of generating a monolithic group
http://hdl.handle.net/10023/4626
A group L is primitive monolithic if L has a unique minimal normal subgroup, N , and trivial Frattini subgroup. By PL,N(k) we denote the conditional probability that k randomly chosen elements of L generate L , given that they project onto generators for L/N. In this article we show that PL,N(k) is controlled by PY,S(2), where N≅Sr and Y is a 2generated almost simple group with socle S that is contained in the normalizer in L of the first direct factor of N . Information aboutPL,N(k) for L primitive monolithic yields various types of information about the generation of arbitrary finite and profinite groups.
This research was supported through EPSRC grant EP/I03582X/1. The APC was paid through RCUK open access block grant funds.
20140601T00:00:00Z
Detomi, Eloisa
Lucchini, Andrea
RoneyDougal, Colva Mary
A group L is primitive monolithic if L has a unique minimal normal subgroup, N , and trivial Frattini subgroup. By PL,N(k) we denote the conditional probability that k randomly chosen elements of L generate L , given that they project onto generators for L/N. In this article we show that PL,N(k) is controlled by PY,S(2), where N≅Sr and Y is a 2generated almost simple group with socle S that is contained in the normalizer in L of the first direct factor of N . Information aboutPL,N(k) for L primitive monolithic yields various types of information about the generation of arbitrary finite and profinite groups.

Generalized dimensions of images of measures under Gaussian processes
http://hdl.handle.net/10023/4319
We show that for certain Gaussian random processes and fields X:RN→Rd, Dq(μx) = min {d, 1/α Dq (μ)} a.s., for an index α which depends on Hölder properties and strong local nondeterminism of X, where q>1, where Dq denotes generalized qdimension μX is the image of the measure μ under X. In particular this holds for indexα fractional Brownian motion, for fractional Riesz–Bessel motions and for certain infinity scale fractional Brownian motions.
26 pages
20140215T00:00:00Z
Falconer, Kenneth
Xiao, Yimin
We show that for certain Gaussian random processes and fields X:RN→Rd, Dq(μx) = min {d, 1/α Dq (μ)} a.s., for an index α which depends on Hölder properties and strong local nondeterminism of X, where q>1, where Dq denotes generalized qdimension μX is the image of the measure μ under X. In particular this holds for indexα fractional Brownian motion, for fractional Riesz–Bessel motions and for certain infinity scale fractional Brownian motions.

Inhomogeneous parabolic equations on unbounded metric measure spaces
http://hdl.handle.net/10023/4061
We study the inhomogeneous semilinear parabolic equation ut = Δu + up + f(x), with source term f independent of time and subject to f(x) ≥ 0 and with u(0, x) = φ(x) ≥ 0, for the very general setting of a metric measure space. By establishing Harnacktype inequalities in time t and some powerful estimates, we give sufficient conditions for nonexistence, local existence and global existence of weak solutions, depending on the value of p relative to a critical exponent.
20121001T00:00:00Z
Falconer, Kenneth John
Hu, Jiaxin
Sun, Yuhua
We study the inhomogeneous semilinear parabolic equation ut = Δu + up + f(x), with source term f independent of time and subject to f(x) ≥ 0 and with u(0, x) = φ(x) ≥ 0, for the very general setting of a metric measure space. By establishing Harnacktype inequalities in time t and some powerful estimates, we give sufficient conditions for nonexistence, local existence and global existence of weak solutions, depending on the value of p relative to a critical exponent.

Strong renewal theorems and Lyapunov spectra for alphaFarey and alphaLuroth systems
http://hdl.handle.net/10023/3933
In this paper, we introduce and study the alphaFarey map and its associated jump transformation, the alphaLuroth map, for an arbitrary countable partition alpha of the unit interval with atoms which accumulate only at the origin. These maps represent linearized generalizations of the Farey map and the Gauss map from elementary number theory. First, a thorough analysis of some of their topological and ergodic theoretical properties is given, including establishing exactness for both types of these maps. The first main result then is to establish weak and strong renewal laws for what we have called alphasumlevel sets for the alphaLuroth map. Similar results have previously been obtained for the Farey map and the Gauss map by using infinite ergodic theory. In this respect, a side product of the paper is to allow for greater transparency of some of the core ideas of infinite ergodic theory. The second remaining result is to obtain a complete description of the Lyapunov spectra of the alphaFarey map and the alphaLuroth map in terms of the thermodynamical formalism. We show how to derive these spectra and then give various examples which demonstrate the diversity of their behaviours in dependence on the chosen partition alpha.
20120601T00:00:00Z
Kesseboehmer, Marc
Munday, Sara
Stratmann, Bernd O.
In this paper, we introduce and study the alphaFarey map and its associated jump transformation, the alphaLuroth map, for an arbitrary countable partition alpha of the unit interval with atoms which accumulate only at the origin. These maps represent linearized generalizations of the Farey map and the Gauss map from elementary number theory. First, a thorough analysis of some of their topological and ergodic theoretical properties is given, including establishing exactness for both types of these maps. The first main result then is to establish weak and strong renewal laws for what we have called alphasumlevel sets for the alphaLuroth map. Similar results have previously been obtained for the Farey map and the Gauss map by using infinite ergodic theory. In this respect, a side product of the paper is to allow for greater transparency of some of the core ideas of infinite ergodic theory. The second remaining result is to obtain a complete description of the Lyapunov spectra of the alphaFarey map and the alphaLuroth map in terms of the thermodynamical formalism. We show how to derive these spectra and then give various examples which demonstrate the diversity of their behaviours in dependence on the chosen partition alpha.

Dimension and measure for generic continuous images
http://hdl.handle.net/10023/3902
We consider the Banach space consisting of continuous functions from an arbitrary uncountable compact metric space, X, into Rn. The key question is 'what is the generic dimension of f(X)?' and we consider two different approaches to answering it: Baire category and prevalence. In the Baire category setting we prove that typically the packing and upper box dimensions are as large as possible, n, but find that the behaviour of the Hausdorff, lower box and topological dimensions is considerably more subtle. In fact, they are typically equal to the minimum of n and the topological dimension of X. We also study, the typical Hausdorff and packing measures of f (X) and, in particular, give necessary and sufficient conditions for them to be zero, positive and finite, or infinite. It is interesting to compare the Baire category results with results in the prevalence setting. As such we also discuss a result of Dougherty on the prevalent topological dimension of f (X) and give some simple applications concerning the prevalent dimensions of graphs of realvalued continuous functions on compact metric spaces, allowing us to extend a recent result of Bayart and Heurteaux.
This work is supported by EPSRC Doctoral Training Grants
20130101T00:00:00Z
Balka, Richard
Farkas, Abel
Fraser, Jonathan M.
Hyde, James T.
We consider the Banach space consisting of continuous functions from an arbitrary uncountable compact metric space, X, into Rn. The key question is 'what is the generic dimension of f(X)?' and we consider two different approaches to answering it: Baire category and prevalence. In the Baire category setting we prove that typically the packing and upper box dimensions are as large as possible, n, but find that the behaviour of the Hausdorff, lower box and topological dimensions is considerably more subtle. In fact, they are typically equal to the minimum of n and the topological dimension of X. We also study, the typical Hausdorff and packing measures of f (X) and, in particular, give necessary and sufficient conditions for them to be zero, positive and finite, or infinite. It is interesting to compare the Baire category results with results in the prevalence setting. As such we also discuss a result of Dougherty on the prevalent topological dimension of f (X) and give some simple applications concerning the prevalent dimensions of graphs of realvalued continuous functions on compact metric spaces, allowing us to extend a recent result of Bayart and Heurteaux.

Dimension theory and fractal constructions based on selfaffine carpets
http://hdl.handle.net/10023/3869
The aim of this thesis is to develop the dimension theory of selfaffine carpets in several directions. Selfaffine carpets are an important class of planar selfaffine sets which have received a great deal of attention in the literature on fractal geometry over the last 30 years. These constructions are important for several reasons. In particular, they provide a bridge between the relatively wellunderstood world of selfsimilar sets and the far from understood world of general selfaffine sets. These carpets are designed in such a way as to facilitate the computation of their dimensions, and they display many interesting and surprising features which the simpler selfsimilar constructions do not have. For example, they can have distinct Hausdorff and packing dimensions and the Hausdorff and packing measures are typically infinite in the critical dimensions. Furthermore, they often provide exceptions to the seminal result of Falconer from 1988 which gives the `generic' dimensions of selfaffine sets in a natural setting. The work in this thesis will be based on five research papers I wrote during my time as a PhD student.
The first contribution of this thesis will be to introduce a new class of selfaffine carpets, which we call boxlike selfaffine sets, and compute their box and packing dimensions via a modified singular value function. This not only generalises current results on selfaffine carpets, but also helps to reconcile the `exceptional constructions' with Falconer's singular value function approach in the generic case. This will appear in Chapter 2 and is based on a paper which appeared in 'Nonlinearity' in 2012.
In Chapter 3 we continue studying the dimension theory of selfaffine sets by computing the Assouad and lower dimensions of certain classes. The Assouad and lower dimensions have not received much attention in the literature on fractals to date and their importance has been more related to quasiconformal maps and embeddability problems. This appears to be changing, however, and so our results constitute a timely and important contribution to a growing body of literature on the subject. The material in this Chapter will be based on a paper which has been accepted for publication in 'Transactions of the American Mathematical Society'.
In Chapters 46 we move away from the classical setting of iterated function systems to consider two more exotic constructions, namely, inhomogeneous attractors and random 1variable attractors, with the aim of developing the dimension theory of selfaffine carpets in these directions.
In order to put our work into context, in Chapter 4 we consider inhomogeneous selfsimilar sets and significantly generalise the results on box dimensions obtained by Olsen and Snigireva, answering several questions posed in the literature in the process. We then move to the selfaffine setting and, in Chapter 5, investigate the dimensions of inhomogeneous selfaffine carpets and prove that new phenomena can occur in this setting which do not occur in the setting of selfsimilar sets. The material in Chapter 4 will be based on a paper which appeared in 'Studia Mathematica' in 2012, and the material in Chapter 5 is based on a paper, which is in preparation.
Finally, in Chapter 6 we consider random selfaffine sets. The traditional approach to random iterated function systems is probabilistic, but here we allow the randomness in the construction to be provided by the topological structure of the sample space, employing ideas from Baire category. We are able to obtain very general results in this setting, relaxing the conditions on the maps from `affine' to `biLipschitz'. In order to get precise results on the Hausdorff and packing measures of typical attractors, we need to specialise to the setting of random selfsimilar sets and we show again that several interesting and new phenomena can occur when we relax to the setting of random selfaffine carpets. The material in this Chapter will be based on a paper which has been accepted for publication by 'Ergodic Theory and Dynamical Systems'.
20131129T00:00:00Z
Fraser, Jonathan M.
The aim of this thesis is to develop the dimension theory of selfaffine carpets in several directions. Selfaffine carpets are an important class of planar selfaffine sets which have received a great deal of attention in the literature on fractal geometry over the last 30 years. These constructions are important for several reasons. In particular, they provide a bridge between the relatively wellunderstood world of selfsimilar sets and the far from understood world of general selfaffine sets. These carpets are designed in such a way as to facilitate the computation of their dimensions, and they display many interesting and surprising features which the simpler selfsimilar constructions do not have. For example, they can have distinct Hausdorff and packing dimensions and the Hausdorff and packing measures are typically infinite in the critical dimensions. Furthermore, they often provide exceptions to the seminal result of Falconer from 1988 which gives the `generic' dimensions of selfaffine sets in a natural setting. The work in this thesis will be based on five research papers I wrote during my time as a PhD student.
The first contribution of this thesis will be to introduce a new class of selfaffine carpets, which we call boxlike selfaffine sets, and compute their box and packing dimensions via a modified singular value function. This not only generalises current results on selfaffine carpets, but also helps to reconcile the `exceptional constructions' with Falconer's singular value function approach in the generic case. This will appear in Chapter 2 and is based on a paper which appeared in 'Nonlinearity' in 2012.
In Chapter 3 we continue studying the dimension theory of selfaffine sets by computing the Assouad and lower dimensions of certain classes. The Assouad and lower dimensions have not received much attention in the literature on fractals to date and their importance has been more related to quasiconformal maps and embeddability problems. This appears to be changing, however, and so our results constitute a timely and important contribution to a growing body of literature on the subject. The material in this Chapter will be based on a paper which has been accepted for publication in 'Transactions of the American Mathematical Society'.
In Chapters 46 we move away from the classical setting of iterated function systems to consider two more exotic constructions, namely, inhomogeneous attractors and random 1variable attractors, with the aim of developing the dimension theory of selfaffine carpets in these directions.
In order to put our work into context, in Chapter 4 we consider inhomogeneous selfsimilar sets and significantly generalise the results on box dimensions obtained by Olsen and Snigireva, answering several questions posed in the literature in the process. We then move to the selfaffine setting and, in Chapter 5, investigate the dimensions of inhomogeneous selfaffine carpets and prove that new phenomena can occur in this setting which do not occur in the setting of selfsimilar sets. The material in Chapter 4 will be based on a paper which appeared in 'Studia Mathematica' in 2012, and the material in Chapter 5 is based on a paper, which is in preparation.
Finally, in Chapter 6 we consider random selfaffine sets. The traditional approach to random iterated function systems is probabilistic, but here we allow the randomness in the construction to be provided by the topological structure of the sample space, employing ideas from Baire category. We are able to obtain very general results in this setting, relaxing the conditions on the maps from `affine' to `biLipschitz'. In order to get precise results on the Hausdorff and packing measures of typical attractors, we need to specialise to the setting of random selfsimilar sets and we show again that several interesting and new phenomena can occur when we relax to the setting of random selfaffine carpets. The material in this Chapter will be based on a paper which has been accepted for publication by 'Ergodic Theory and Dynamical Systems'.

Finiteness conditions for unions of semigroups
http://hdl.handle.net/10023/3687
In this thesis we prove the following:
The semigroup which is a disjoint union of two or three copies of a group is a Clifford semigroup, Rees matrix semigroup or a combination between a Rees matrix semigroup and a group. Furthermore, the semigroup which is a disjoint union of finitely many copies of a finitely presented (residually finite) group is finitely presented (residually finite) semigroup.
The constructions of the semigroup which is a disjoint union of two copies of the free monogenic semigroup are parallel to the constructions of the semigroup which is a disjoint union of two copies of a group, i.e. such a semigroup is Clifford (strong semilattice of groups) or Rees matrix semigroup. However, the semigroup which is a disjoint union of three copies of the free monogenic semigroup is not just a strong semillatice of semigroups, Rees matrix semigroup or combination between a Rees matrix semigroup and a semigroup, but there are two more semigroups which do not arise from the constructions of the semigroup which is a disjoint union of three copies of a group. We also classify semigroups which are disjoint unions of two or three copies of the free monogenic semigroup. There are three types of semigroups which are unions of two copies of the free monogenic semigroup and nine types of semigroups which are unions of three copies of the free monogenic semigroup. For each type of such semigroups we exhibit a presentation defining semigroups of this type.
The semigroup which is a disjoint union of finitely many copies of the free monogenic semigroup is finitely presented, residually finite, hopfian, has soluble word problem and has soluble subsemigroup membership problem.
20130628T00:00:00Z
AbuGhazalh, Nabilah Hani
In this thesis we prove the following:
The semigroup which is a disjoint union of two or three copies of a group is a Clifford semigroup, Rees matrix semigroup or a combination between a Rees matrix semigroup and a group. Furthermore, the semigroup which is a disjoint union of finitely many copies of a finitely presented (residually finite) group is finitely presented (residually finite) semigroup.
The constructions of the semigroup which is a disjoint union of two copies of the free monogenic semigroup are parallel to the constructions of the semigroup which is a disjoint union of two copies of a group, i.e. such a semigroup is Clifford (strong semilattice of groups) or Rees matrix semigroup. However, the semigroup which is a disjoint union of three copies of the free monogenic semigroup is not just a strong semillatice of semigroups, Rees matrix semigroup or combination between a Rees matrix semigroup and a semigroup, but there are two more semigroups which do not arise from the constructions of the semigroup which is a disjoint union of three copies of a group. We also classify semigroups which are disjoint unions of two or three copies of the free monogenic semigroup. There are three types of semigroups which are unions of two copies of the free monogenic semigroup and nine types of semigroups which are unions of three copies of the free monogenic semigroup. For each type of such semigroups we exhibit a presentation defining semigroups of this type.
The semigroup which is a disjoint union of finitely many copies of the free monogenic semigroup is finitely presented, residually finite, hopfian, has soluble word problem and has soluble subsemigroup membership problem.

Adventures in applying iteration lemmas
http://hdl.handle.net/10023/3671
The word problem of a finitely generated group is commonly defined to be a formal language over a finite generating set.
The class of finite groups has been characterised as the class of finitely generated groups that have word problem decidable by a finite state automaton.
We give a natural generalisation of the notion of word problem from finitely generated groups to finitely generated semigroups by considering relations of strings. We characterise the class of finite semigroups by the class of finitely generated semigroups whose word problem is decidable by finite state automata.
We then examine the class of semigroups with word problem decidable by asynchronous two tape finite state automata. Algebraic properties of semigroups in this class are considered, towards an algebraic characterisation.
We take the next natural step to further extend the classes of semigroups under consideration to semigroups that have word problem decidable by a finite collection of asynchronous automata working independently.
A central tool used in the derivation of structural results are socalled iteration lemmas.
We define a hierarchy of the considered classes of semigroups and connect our original results with previous research.
20130628T00:00:00Z
Pfeiffer, Markus Johannes
The word problem of a finitely generated group is commonly defined to be a formal language over a finite generating set.
The class of finite groups has been characterised as the class of finitely generated groups that have word problem decidable by a finite state automaton.
We give a natural generalisation of the notion of word problem from finitely generated groups to finitely generated semigroups by considering relations of strings. We characterise the class of finite semigroups by the class of finitely generated semigroups whose word problem is decidable by finite state automata.
We then examine the class of semigroups with word problem decidable by asynchronous two tape finite state automata. Algebraic properties of semigroups in this class are considered, towards an algebraic characterisation.
We take the next natural step to further extend the classes of semigroups under consideration to semigroups that have word problem decidable by a finite collection of asynchronous automata working independently.
A central tool used in the derivation of structural results are socalled iteration lemmas.
We define a hierarchy of the considered classes of semigroups and connect our original results with previous research.

Ends of semigroups
http://hdl.handle.net/10023/3590
The aim of this thesis is to understand the algebraic structure of a semigroup
by studying the geometric properties of its Cayley graph. We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by subsemigroups
and extensions of finite Rees index. We prove an analogue of Hopfs Theorem, stating that a group has 1, 2 or infinitely many ends, for left cancellative
semigroups and that the cardinality of the set of ends is invariant in subsemigroups and extension of finite Green index in left cancellative semigroups.
We classify all semigroups with one end and make use of this classification
to prove various finiteness properties for semigroups with one end.
We also consider the ends of digraphs with certain algebraic properties.
We prove that two quasiisometric digraphs have isomorphic end sets. We also prove that vertex transitive digraphs have 1, 2 or infinitely many ends and construct a topology that reflects the properties of the ends of a digraph.
20130101T00:00:00Z
Craik, Simon
The aim of this thesis is to understand the algebraic structure of a semigroup
by studying the geometric properties of its Cayley graph. We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by subsemigroups
and extensions of finite Rees index. We prove an analogue of Hopfs Theorem, stating that a group has 1, 2 or infinitely many ends, for left cancellative
semigroups and that the cardinality of the set of ends is invariant in subsemigroups and extension of finite Green index in left cancellative semigroups.
We classify all semigroups with one end and make use of this classification
to prove various finiteness properties for semigroups with one end.
We also consider the ends of digraphs with certain algebraic properties.
We prove that two quasiisometric digraphs have isomorphic end sets. We also prove that vertex transitive digraphs have 1, 2 or infinitely many ends and construct a topology that reflects the properties of the ends of a digraph.

Random generation and chief length of finite groups
http://hdl.handle.net/10023/3578
Part I of this thesis studies P[subscript(G)](d), the probability of generating a nonabelian
simple group G with d randomly chosen elements, and extends this
idea to consider the conditional probability P[subscript(G,Soc(G))](d), the probability
of generating an almost simple group G by d randomly chosen elements,
given that they project onto a generating set of G/Soc(G). In particular
we show that for a 2generated almost simple group, P[subscript(G,Soc(G))](2) 53≥90,
with equality if and only if G = A₆ or S₆. Furthermore P[subscript(G,Soc(G))](2) 9≥10
except for 30 almost simple groups G, and we specify this list and provide
exact values for P[subscript(G,Soc(G))](2) in these cases. We conclude Part I by showing
that for all almost simple groups P[subscript(G,Soc(G))](3)≥139/150.
In Part II we consider a related notion. Given a probability ε, we wish
to determine d[superscript(ε)] (G), the number of random elements needed to generate a finite group G with failure probabilty at most ε. A generalisation of a result
of Lubotzky bounds d[superscript(ε)](G) in terms of l(G), the chief length of G, and d(G),
the minimal number of generators needed to generate G. We obtain bounds
on the chief length of permutation groups in terms of the degree n, and
bounds on the chief length of completely reducible matrix groups in terms
of the dimension and field size. Combining these with existing bounds on
d(G), we obtain bounds on d[superscript(ε)] (G) for permutation groups and completely
reducible matrix groups.
20130101T00:00:00Z
Menezes, Nina E.
Part I of this thesis studies P[subscript(G)](d), the probability of generating a nonabelian
simple group G with d randomly chosen elements, and extends this
idea to consider the conditional probability P[subscript(G,Soc(G))](d), the probability
of generating an almost simple group G by d randomly chosen elements,
given that they project onto a generating set of G/Soc(G). In particular
we show that for a 2generated almost simple group, P[subscript(G,Soc(G))](2) 53≥90,
with equality if and only if G = A₆ or S₆. Furthermore P[subscript(G,Soc(G))](2) 9≥10
except for 30 almost simple groups G, and we specify this list and provide
exact values for P[subscript(G,Soc(G))](2) in these cases. We conclude Part I by showing
that for all almost simple groups P[subscript(G,Soc(G))](3)≥139/150.
In Part II we consider a related notion. Given a probability ε, we wish
to determine d[superscript(ε)] (G), the number of random elements needed to generate a finite group G with failure probabilty at most ε. A generalisation of a result
of Lubotzky bounds d[superscript(ε)](G) in terms of l(G), the chief length of G, and d(G),
the minimal number of generators needed to generate G. We obtain bounds
on the chief length of permutation groups in terms of the degree n, and
bounds on the chief length of completely reducible matrix groups in terms
of the dimension and field size. Combining these with existing bounds on
d(G), we obtain bounds on d[superscript(ε)] (G) for permutation groups and completely
reducible matrix groups.

Multistable processes and localizability
http://hdl.handle.net/10023/3560
We use characteristic functions to construct alphamultistable measures and integrals, where the measures behave locally like stable measures, but with the stability index alpha(x) varying with x. This enables us to construct alphamultistable processes on R, that is processes whose scaling limit at time t is an alpha(t)stable process. We present several examples of such multistable processes and examine their localisability.
20120101T00:00:00Z
Falconer, Kenneth John
Liu, Lining
We use characteristic functions to construct alphamultistable measures and integrals, where the measures behave locally like stable measures, but with the stability index alpha(x) varying with x. This enables us to construct alphamultistable processes on R, that is processes whose scaling limit at time t is an alpha(t)stable process. We present several examples of such multistable processes and examine their localisability.

Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances
http://hdl.handle.net/10023/3383
Let ΩΩ be the semigroup of all mappings of a countably infinite set Ω. If U and V are subsemigroups of ΩΩ, then we write U≈V if there exists a finite subset F of ΩΩ such that the subsemigroup generated by U and F equals that generated by V and F. The relative rank of U in ΩΩ is the least cardinality of a subset A of ΩΩ such that the union of U and A generates ΩΩ. In this paper we study the notions of relative rank and the equivalence ≈ for semigroups of endomorphisms of binary relations on Ω. The semigroups of endomorphisms of preorders, bipartite graphs, and tolerances on Ω are shown to lie in two equivalence classes under ≈. Moreover such semigroups have relative rank 0, 1, 2, or d in ΩΩ where d is the minimum cardinality of a dominating family for NN. We give examples of preorders, bipartite graphs, and tolerances on Ω where the relative ranks of their endomorphism semigroups in ΩΩ are 0, 1, 2, and d. We show that the endomorphism semigroups of graphs, in general, fall into at least four classes under ≈ and that there exist graphs where the relative rank of the endomorphism semigroup is 2ℵ0.
20100901T00:00:00Z
Mitchell, James David
Morayne, Michal
Peresse, Yann Hamon
Quick, Martyn
Let ΩΩ be the semigroup of all mappings of a countably infinite set Ω. If U and V are subsemigroups of ΩΩ, then we write U≈V if there exists a finite subset F of ΩΩ such that the subsemigroup generated by U and F equals that generated by V and F. The relative rank of U in ΩΩ is the least cardinality of a subset A of ΩΩ such that the union of U and A generates ΩΩ. In this paper we study the notions of relative rank and the equivalence ≈ for semigroups of endomorphisms of binary relations on Ω. The semigroups of endomorphisms of preorders, bipartite graphs, and tolerances on Ω are shown to lie in two equivalence classes under ≈. Moreover such semigroups have relative rank 0, 1, 2, or d in ΩΩ where d is the minimum cardinality of a dominating family for NN. We give examples of preorders, bipartite graphs, and tolerances on Ω where the relative ranks of their endomorphism semigroups in ΩΩ are 0, 1, 2, and d. We show that the endomorphism semigroups of graphs, in general, fall into at least four classes under ≈ and that there exist graphs where the relative rank of the endomorphism semigroup is 2ℵ0.

Endomorphisms of Fraïssé limits and automorphism groups of algebraically closed relational structures
http://hdl.handle.net/10023/3358
Let Ω be the Fraïssé limit of a class of relational structures. We seek to
answer the following semigroup theoretic question about Ω. What are the group Hclasses, i.e. the maximal subgroups, of End(Ω)? Fraïssé limits for which we answer this question include the random graph
R, the random directed graph D, the random tournament T, the random bipartite graph B, Henson's graphs G[subscript n] (for n greater or equal to 3) and the total order Q. The maximal subgroups of End(Ω) are closely connected to the automorphism groups of the relational structures induced by the images of idempotents from End(Ω). It has been shown that the relational structure induced by the image of an idempotent from End(Ω) is algebraically closed. Accordingly, we investigate which groups can be realised as the automorphism group of an algebraically closed relational structure in order to
determine the maximal subgroups of End(Ω) in each case. In particular, we show that if Γ is a countable graph and Ω = R,D,B,
then there exist 2[superscript alephnaught] maximal subgroups of End(Ω) which are isomorphic to Aut(Γ). Additionally, we provide a complete description of the subsets
of Q which are the image of an idempotent from End(Q). We call these subsets retracts of Q and show that if Ω is a total order and f is an embedding of Ω into Q such that im f is a retract of Q, then there exist 2[superscript alephnaught] maximal subgroups of End(Q) isomorphic to Aut(Ω). We also show that any countable maximal subgroup of End(Q) must be isomorphic to Zⁿ for some natural number n. As a consequence of the methods developed, we are also able to show that when Ω = R,D,B,Q there exist 2[superscript alephnaught] regular Dclasses of End(Ω) and when Ω = R,D,B there exist 2[superscript alephnaught] Jclasses of End(Ω). Additionally we show
that if Ω = R,D then all regular Dclasses contain 2[superscript alephnaught] group Hclasses. On the other hand, we show that when
Ω = B,Q there exist regular Dclasses
which contain countably many group Hclasses.
20121130T00:00:00Z
McPhee, Jillian Dawn
Let Ω be the Fraïssé limit of a class of relational structures. We seek to
answer the following semigroup theoretic question about Ω. What are the group Hclasses, i.e. the maximal subgroups, of End(Ω)? Fraïssé limits for which we answer this question include the random graph
R, the random directed graph D, the random tournament T, the random bipartite graph B, Henson's graphs G[subscript n] (for n greater or equal to 3) and the total order Q. The maximal subgroups of End(Ω) are closely connected to the automorphism groups of the relational structures induced by the images of idempotents from End(Ω). It has been shown that the relational structure induced by the image of an idempotent from End(Ω) is algebraically closed. Accordingly, we investigate which groups can be realised as the automorphism group of an algebraically closed relational structure in order to
determine the maximal subgroups of End(Ω) in each case. In particular, we show that if Γ is a countable graph and Ω = R,D,B,
then there exist 2[superscript alephnaught] maximal subgroups of End(Ω) which are isomorphic to Aut(Γ). Additionally, we provide a complete description of the subsets
of Q which are the image of an idempotent from End(Q). We call these subsets retracts of Q and show that if Ω is a total order and f is an embedding of Ω into Q such that im f is a retract of Q, then there exist 2[superscript alephnaught] maximal subgroups of End(Q) isomorphic to Aut(Ω). We also show that any countable maximal subgroup of End(Q) must be isomorphic to Zⁿ for some natural number n. As a consequence of the methods developed, we are also able to show that when Ω = R,D,B,Q there exist 2[superscript alephnaught] regular Dclasses of End(Ω) and when Ω = R,D,B there exist 2[superscript alephnaught] Jclasses of End(Ω). Additionally we show
that if Ω = R,D then all regular Dclasses contain 2[superscript alephnaught] group Hclasses. On the other hand, we show that when
Ω = B,Q there exist regular Dclasses
which contain countably many group Hclasses.

Every group is a maximal subgroup of the free idempotent generated semigroup over a band
http://hdl.handle.net/10023/3342
Given an arbitrary group G we construct a semigroup of idempotents (band) BG with the property that the free idempotent generated semigroup over BG has a maximal subgroup isomorphic to G. If G is finitely presented then BG is finite. This answers several questions from recent papers in the area.
20130501T00:00:00Z
Dolinka, I
Ruskuc, Nik
Given an arbitrary group G we construct a semigroup of idempotents (band) BG with the property that the free idempotent generated semigroup over BG has a maximal subgroup isomorphic to G. If G is finitely presented then BG is finite. This answers several questions from recent papers in the area.

On disjoint unions of finitely many copies of the free monogenic semigroup
http://hdl.handle.net/10023/3341
Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.
20130801T00:00:00Z
Abughazalah, Nabilah
Ruskuc, Nik
Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.

Ideals and finiteness conditions for subsemigroups
http://hdl.handle.net/10023/3335
In this paper we consider a number of finiteness conditions for semigroups related to their ideal structure, and ask whether such conditions are preserved by sub or supersemigroups with finite Rees or Green index. Specific properties under consideration include stability, D=J and minimal conditions on ideals.
20140101T00:00:00Z
Gray, Robert Duncan
Maltcev, Victor
Mitchell, James David
Ruskuc, N.
In this paper we consider a number of finiteness conditions for semigroups related to their ideal structure, and ask whether such conditions are preserved by sub or supersemigroups with finite Rees or Green index. Specific properties under consideration include stability, D=J and minimal conditions on ideals.

Attractors of directed graph IFSs that are not standard IFS attractors and their Hausdorff measure
http://hdl.handle.net/10023/3237
For directed graph iterated function systems (IFSs) defined on R, we prove that a class of 2vertex directed graph IFSs have attractors that cannot be the attractors of standard (1vertex directed graph) IFSs, with or without separation conditions. We also calculate their exact Hausdorff measure. Thus we are able to identify a new class of attractors for which the exact Hausdorff measure is known.
"GCB was supported by an EPSRC Doctoral Training Grant whilst undertaking this work"
20130101T00:00:00Z
Boore, Graeme
Falconer, Kenneth John
For directed graph iterated function systems (IFSs) defined on R, we prove that a class of 2vertex directed graph IFSs have attractors that cannot be the attractors of standard (1vertex directed graph) IFSs, with or without separation conditions. We also calculate their exact Hausdorff measure. Thus we are able to identify a new class of attractors for which the exact Hausdorff measure is known.

Topics in combinatorial semigroup theory
http://hdl.handle.net/10023/3226
In this thesis we discuss various topics from Combinatorial Semigroup Theory: automaton semigroups; finiteness conditions and their preservation under certain semigroup theoretic notions of index; Markov semigroups; wordhyperbolic semigroups; decision problems for finitely presented
and onerelator monoids. First, in order to show that general ideas from Combinatorial Semigroup Theory can apply to uncountable semigroups, at the beginning of the thesis we discuss semigroups with Bergman’s property. We prove that an automaton semigroup generated by a Cayley machine
of a finite semigroup S is itself finite if and only if S is aperiodic, which yields a new characterisation of finite aperiodic monoids. Using this, we derive some further results about Cayley automaton semigroups.
We investigate how various semigroup finiteness conditions, linked to
the notion of ideal, are preserved under finite Rees and Green indices. We
obtain a surprising result that J = D is preserved by supersemigroups of finite Green index, but it is not preserved by subsemigroups of finite Rees index even in the finitely generated case. We also consider the question of preservation of hopficity for finite Rees index. We prove that in general hopficity is preserved neither by finite Rees index subsemigroups, nor by finite Rees index extensions. However, under finite generation assumption,
hopficity is preserved by finite Rees index extensions. Still, there is
an example of a finitely generated hopfian semigroup with a nonhopfian subsemigroup of finite Rees index. We prove also that monoids presented by confluent contextfree monadic rewriting systems are wordhyperbolic, and provide an example of such a monoid, which does not admit a wordhyperbolic structure with uniqueness.
This answers in the negative a question of Duncan & Gilman. We initiate in this thesis a study of Markov semigroups. We investigate
how the property of being Markov is preserved under finite Rees and
Green indices. For various semigroup properties P we examine whether P , ¬P are Markov properties, and whether P is decidable for finitely presented and
onerelator monoids.
20121130T00:00:00Z
Maltcev, Victor
In this thesis we discuss various topics from Combinatorial Semigroup Theory: automaton semigroups; finiteness conditions and their preservation under certain semigroup theoretic notions of index; Markov semigroups; wordhyperbolic semigroups; decision problems for finitely presented
and onerelator monoids. First, in order to show that general ideas from Combinatorial Semigroup Theory can apply to uncountable semigroups, at the beginning of the thesis we discuss semigroups with Bergman’s property. We prove that an automaton semigroup generated by a Cayley machine
of a finite semigroup S is itself finite if and only if S is aperiodic, which yields a new characterisation of finite aperiodic monoids. Using this, we derive some further results about Cayley automaton semigroups.
We investigate how various semigroup finiteness conditions, linked to
the notion of ideal, are preserved under finite Rees and Green indices. We
obtain a surprising result that J = D is preserved by supersemigroups of finite Green index, but it is not preserved by subsemigroups of finite Rees index even in the finitely generated case. We also consider the question of preservation of hopficity for finite Rees index. We prove that in general hopficity is preserved neither by finite Rees index subsemigroups, nor by finite Rees index extensions. However, under finite generation assumption,
hopficity is preserved by finite Rees index extensions. Still, there is
an example of a finitely generated hopfian semigroup with a nonhopfian subsemigroup of finite Rees index. We prove also that monoids presented by confluent contextfree monadic rewriting systems are wordhyperbolic, and provide an example of such a monoid, which does not admit a wordhyperbolic structure with uniqueness.
This answers in the negative a question of Duncan & Gilman. We initiate in this thesis a study of Markov semigroups. We investigate
how the property of being Markov is preserved under finite Rees and
Green indices. For various semigroup properties P we examine whether P , ¬P are Markov properties, and whether P is decidable for finitely presented and
onerelator monoids.

Growth of generating sets for direct powers of classical algebraic structures
http://hdl.handle.net/10023/3058
For an algebraic structure A denote by d(A) the smallest size of a generating set for A, and let d(A)=(d(A),d(A2),d(A3),…), where An denotes a direct power of A. In this paper we investigate the asymptotic behaviour of the sequence d(A) when A is one of the classical structures—a group, ring, module, algebra or Lie algebra. We show that if A is finite then d(A) grows either linearly or logarithmically. In the infinite case constant growth becomes another possibility; in particular, if A is an infinite simple structure belonging to one of the above classes then d(A) is eventually constant. Where appropriate we frame our exposition within the general theory of congruence permutable varieties.
20100801T00:00:00Z
Quick, Martyn
Ruskuc, Nik
For an algebraic structure A denote by d(A) the smallest size of a generating set for A, and let d(A)=(d(A),d(A2),d(A3),…), where An denotes a direct power of A. In this paper we investigate the asymptotic behaviour of the sequence d(A) when A is one of the classical structures—a group, ring, module, algebra or Lie algebra. We show that if A is finite then d(A) grows either linearly or logarithmically. In the infinite case constant growth becomes another possibility; in particular, if A is an infinite simple structure belonging to one of the above classes then d(A) is eventually constant. Where appropriate we frame our exposition within the general theory of congruence permutable varieties.

Presentations and efficiency of semigroups
http://hdl.handle.net/10023/2843
In this thesis we consider in detail the following two problems for semigroups:
(i) When are semigroups finitely generated and presented?
(ii) Which families of semigroups can be efficiently presented?
We also consider some other finiteness conditions for semigroups, homology of
semigroups and wreath product of groups.
In Chapter 2 we investigate finite presentability and some other finiteness conditions
for the Odirect union of semigroups with zero. In Chapter 3 we investigate
finite generation and presentability of Rees matrix semigroups over semigroups.
We find necessary and sufficient conditions for finite generation and presentability.
In Chapter 4 we investigate some other finiteness conditions for Rees matrix
semigroups.
In Chapter 5 we consider groups as semigroups and investigate their semigroup
efficiency. In Chapter 6 we look at "proper" semigroups, that is semigroups
that are not groups. We first give examples of efficient and inefficient "proper"
semigroups by computing their homology and finding their minimal presentations.
In Chapter 7 we compute the second homology of finite simple semigroups and
find a "small" presentation for them. If that "small" presentation has a special
relation, we prove that finite simple semigroups are efficient. Finally, in Chapter
8, we investigate the efficiency of wreath products of finite groups as groups and
as semigroups. We give more examples of efficient groups and inefficient groups.
19980101T00:00:00Z
Ayik, Hayrullah
In this thesis we consider in detail the following two problems for semigroups:
(i) When are semigroups finitely generated and presented?
(ii) Which families of semigroups can be efficiently presented?
We also consider some other finiteness conditions for semigroups, homology of
semigroups and wreath product of groups.
In Chapter 2 we investigate finite presentability and some other finiteness conditions
for the Odirect union of semigroups with zero. In Chapter 3 we investigate
finite generation and presentability of Rees matrix semigroups over semigroups.
We find necessary and sufficient conditions for finite generation and presentability.
In Chapter 4 we investigate some other finiteness conditions for Rees matrix
semigroups.
In Chapter 5 we consider groups as semigroups and investigate their semigroup
efficiency. In Chapter 6 we look at "proper" semigroups, that is semigroups
that are not groups. We first give examples of efficient and inefficient "proper"
semigroups by computing their homology and finding their minimal presentations.
In Chapter 7 we compute the second homology of finite simple semigroups and
find a "small" presentation for them. If that "small" presentation has a special
relation, we prove that finite simple semigroups are efficient. Finally, in Chapter
8, we investigate the efficiency of wreath products of finite groups as groups and
as semigroups. We give more examples of efficient groups and inefficient groups.

Semigroups of orderdecreasing transformations
http://hdl.handle.net/10023/2834
Let X be a totally ordered set and consider the semigroups of orderdecreasing (increasing) full (partial, partial onetoone) transformations of X. In this
Thesis the study of orderincreasing full (partial, partial onetoone) transformations
has been reduced to that of orderdecreasing full (partial, partial onetoone)
transformations and the study of orderdecreasing partial transformations to that of
orderdecreasing full transformations for both the finite and infinite cases.
For the finite orderdecreasing full (partial onetoone) transformation
semigroups, we obtain results analogous to Howie (1971) and Howie and McFadden
(1990) concerning products of idempotents (quasiidempotents), and concerning
combinatorial and rank properties. By contrast with the semigroups of orderpreserving
transformations and the full transformation semigroup, the semigroups of orderdecreasing
full (partial onetoone) transformations and their Rees quotient semigroups
are not regular. They are, however, abundant (type A) semigroups in the sense of
Fountain (1982,1979). An explicit characterisation of the minimum semilattice
congruence on the finite semigroups of orderdecreasing transformations and their Rees
quotient semigroups is obtained.
If X is an infinite chain then the semigroup S of orderdecreasing full
transformations need not be abundant. A necessary and sufficient condition on X is
obtained for S to be abundant. By contrast, for every chain X the semigroup of
orderdecreasing partial onetoone transformations is type A.
The ranks of the nilpotent subsemigroups of the finite semigroups of orderdecreasing
full (partial onetoone) transformations have been investigated.
19920101T00:00:00Z
Umar, Abdullahi
Let X be a totally ordered set and consider the semigroups of orderdecreasing (increasing) full (partial, partial onetoone) transformations of X. In this
Thesis the study of orderincreasing full (partial, partial onetoone) transformations
has been reduced to that of orderdecreasing full (partial, partial onetoone)
transformations and the study of orderdecreasing partial transformations to that of
orderdecreasing full transformations for both the finite and infinite cases.
For the finite orderdecreasing full (partial onetoone) transformation
semigroups, we obtain results analogous to Howie (1971) and Howie and McFadden
(1990) concerning products of idempotents (quasiidempotents), and concerning
combinatorial and rank properties. By contrast with the semigroups of orderpreserving
transformations and the full transformation semigroup, the semigroups of orderdecreasing
full (partial onetoone) transformations and their Rees quotient semigroups
are not regular. They are, however, abundant (type A) semigroups in the sense of
Fountain (1982,1979). An explicit characterisation of the minimum semilattice
congruence on the finite semigroups of orderdecreasing transformations and their Rees
quotient semigroups is obtained.
If X is an infinite chain then the semigroup S of orderdecreasing full
transformations need not be abundant. A necessary and sufficient condition on X is
obtained for S to be abundant. By contrast, for every chain X the semigroup of
orderdecreasing partial onetoone transformations is type A.
The ranks of the nilpotent subsemigroups of the finite semigroups of orderdecreasing
full (partial onetoone) transformations have been investigated.

Semigroup presentations
http://hdl.handle.net/10023/2821
In this thesis we consider in detail the following two fundamental problems for
semigroup presentations:
1. Given a semigroup find a presentation defining it.
2. Given a presentation describe the semigroup defined by it.
We also establish two links between these two approaches: semigroup constructions
and computational methods.
After an introduction to semigroup presentations in Chapter 3, in Chapters 4
and 5 we consider the first of the two approaches. The semigroups we examine in
these two chapters include completely Osimple semigroups, transformation semigroups,
matrix semigroups and various endomorphism semigroups. In Chapter 6
we find presentations for the following semi group constructions: wreath product,
BruckReilly extension, Schiitzenberger product, strong semilattices of monoids,
Rees matrix semigroups, ideal extensions and subsemigroups. We investigate in
more detail presentations for subsemigroups in Chapters 7 and 10, where we prove
a number of ReidemeisterSchreier type results for semigroups. In Chapter 9
we examine the connection between the semi group and the group defined by the
same presentation. The general results from Chapters 6, 7, 9 and 10 are applied
in Chapters 8, 11, 12 and 13 to subsemigroups of free semigroups, Fibonacci
semigroups, semigroups defined by Coxeter type presentations and one relator
products of cyclic groups. Finally, in Chapter 14 we describe the ToddCoxeter
enumeration procedure and introduce three modifications of this procedure.
19950101T00:00:00Z
Ruškuc, Nik
In this thesis we consider in detail the following two fundamental problems for
semigroup presentations:
1. Given a semigroup find a presentation defining it.
2. Given a presentation describe the semigroup defined by it.
We also establish two links between these two approaches: semigroup constructions
and computational methods.
After an introduction to semigroup presentations in Chapter 3, in Chapters 4
and 5 we consider the first of the two approaches. The semigroups we examine in
these two chapters include completely Osimple semigroups, transformation semigroups,
matrix semigroups and various endomorphism semigroups. In Chapter 6
we find presentations for the following semi group constructions: wreath product,
BruckReilly extension, Schiitzenberger product, strong semilattices of monoids,
Rees matrix semigroups, ideal extensions and subsemigroups. We investigate in
more detail presentations for subsemigroups in Chapters 7 and 10, where we prove
a number of ReidemeisterSchreier type results for semigroups. In Chapter 9
we examine the connection between the semi group and the group defined by the
same presentation. The general results from Chapters 6, 7, 9 and 10 are applied
in Chapters 8, 11, 12 and 13 to subsemigroups of free semigroups, Fibonacci
semigroups, semigroups defined by Coxeter type presentations and one relator
products of cyclic groups. Finally, in Chapter 14 we describe the ToddCoxeter
enumeration procedure and introduce three modifications of this procedure.

Green index in semigroups : generators, presentations and automatic structures
http://hdl.handle.net/10023/2760
The Green index of a subsemigroup T of a semigroup S is given by counting strong orbits in the complement S n T under the natural actions of T on S via right and left multiplication. This partitions the complement S nT into Trelative H classes, in the sense of Wallace, and with each such class there is a naturally associated group called the relative Schützenberger group. If the Rees index ΙS n TΙ is finite, T also has finite Green index in S. If S is a group and T a subgroup then T has finite Green index in S if and only if it has finite group index in S. Thus Green index provides a common generalisation of Rees index and group index. We prove a rewriting theorem which shows how generating sets for S may be used to obtain generating sets for T and the Schützenberger groups, and vice versa. We also give a method for constructing a presentation for S from given presentations of T and the Schützenberger groups. These results are then used to show that several important properties are preserved when passing to finite Green index subsemigroups or extensions, including: finite generation, solubility of the word problem, growth type, automaticity (for subsemigroups), finite presentability (for extensions) and finite Malcev presentability (in the case of groupembeddable semigroups).
20120101T00:00:00Z
Cain, A.J.
Gray, R
Ruskuc, Nik
The Green index of a subsemigroup T of a semigroup S is given by counting strong orbits in the complement S n T under the natural actions of T on S via right and left multiplication. This partitions the complement S nT into Trelative H classes, in the sense of Wallace, and with each such class there is a naturally associated group called the relative Schützenberger group. If the Rees index ΙS n TΙ is finite, T also has finite Green index in S. If S is a group and T a subgroup then T has finite Green index in S if and only if it has finite group index in S. Thus Green index provides a common generalisation of Rees index and group index. We prove a rewriting theorem which shows how generating sets for S may be used to obtain generating sets for T and the Schützenberger groups, and vice versa. We also give a method for constructing a presentation for S from given presentations of T and the Schützenberger groups. These results are then used to show that several important properties are preserved when passing to finite Green index subsemigroups or extensions, including: finite generation, solubility of the word problem, growth type, automaticity (for subsemigroups), finite presentability (for extensions) and finite Malcev presentability (in the case of groupembeddable semigroups).

The visible part of plane selfsimilar sets
http://hdl.handle.net/10023/2756
Given a compact subset F of R2, the visible part VθF of F from direction θ is the set of x in F such that the halfline from x in direction θ intersects F only at x. It is suggested that if dimH F ≥ 1 then dimH VθF = 1 for almost all θ , where dimH denotes Hausdorff dimension. We conrm this when F is a selfsimilar set satisfying the convex open set condition and such that the orthogonal projection of F onto every line is an interval. In particular the underlying similarities may involve arbitrary rotations and F need not be connected.
JMF was supported by an EPSRC grant whilst undertaking this work.
20130101T00:00:00Z
Falconer, Kenneth John
Fraser, Jonathan Macdonald
Given a compact subset F of R2, the visible part VθF of F from direction θ is the set of x in F such that the halfline from x in direction θ intersects F only at x. It is suggested that if dimH F ≥ 1 then dimH VθF = 1 for almost all θ , where dimH denotes Hausdorff dimension. We conrm this when F is a selfsimilar set satisfying the convex open set condition and such that the orthogonal projection of F onto every line is an interval. In particular the underlying similarities may involve arbitrary rotations and F need not be connected.

Topics in computational group theory : primitive permutation groups and matrix group normalisers
http://hdl.handle.net/10023/2561
Part I of this thesis presents methods for finding the primitive permutation
groups of degree d, where 2500 ≤ d < 4096, using the O'NanScott Theorem
and Aschbacher's theorem. Tables of the groups G are given for each O'NanScott class. For the nonaffine groups, additional information is given: the
degree d of G, the shape of a stabiliser in G of the primitive action, the
shape of the normaliser N in S[subscript(d)] of G and the rank of N.
Part II presents a new algorithm NormaliserGL for computing the normaliser
in GL[subscript(n)](q) of a group G ≤ GL[subscript(n)](q). The algorithm is implemented in
the computational algebra system MAGMA and employs Aschbacher's theorem
to break the problem into several cases. The attached CD contains the
code for the algorithm as well as several test cases which demonstrate the
improvement over MAGMA's existing algorithm.
20111101T00:00:00Z
Coutts, Hannah Jane
Part I of this thesis presents methods for finding the primitive permutation
groups of degree d, where 2500 ≤ d < 4096, using the O'NanScott Theorem
and Aschbacher's theorem. Tables of the groups G are given for each O'NanScott class. For the nonaffine groups, additional information is given: the
degree d of G, the shape of a stabiliser in G of the primitive action, the
shape of the normaliser N in S[subscript(d)] of G and the rank of N.
Part II presents a new algorithm NormaliserGL for computing the normaliser
in GL[subscript(n)](q) of a group G ≤ GL[subscript(n)](q). The algorithm is implemented in
the computational algebra system MAGMA and employs Aschbacher's theorem
to break the problem into several cases. The attached CD contains the
code for the algorithm as well as several test cases which demonstrate the
improvement over MAGMA's existing algorithm.

Generation problems for finite groups
http://hdl.handle.net/10023/2529
It can be deduced from the Burnside Basis Theorem that if G is a finite pgroup with d(G)=r then given any generating set A for G there exists a subset of A of size r that generates G. We have denoted this property B. A group is said to have the basis property if all subgroups have property B. This thesis is a study into the nature of these two properties. Note all groups are finite unless stated otherwise.
We begin this thesis by providing examples of groups with and without property B and several results on the structure of groups with property B, showing that under certain conditions property B is inherited by quotients. This culminates with a result which shows that groups with property B that can be expressed as direct products are exactly those arising from the Burnside Basis Theorem.
We also seek to create a class of groups which have property B. We provide a method for constructing groups with property B and trivial Frattini subgroup using finite fields. We then classify all groups G where the quotient of G by the Frattini subgroup is isomorphic to this construction. We finally note that groups arising from this construction do not in general have the basis property.
Finally we look at groups with the basis property. We prove that groups with the basis property are soluble and consist only of elements of primepower order. We then exploit the classification of all such groups by Higman to provide a complete classification of groups with the basis property.
20111130T00:00:00Z
McDougallBagnall, Jonathan M.
It can be deduced from the Burnside Basis Theorem that if G is a finite pgroup with d(G)=r then given any generating set A for G there exists a subset of A of size r that generates G. We have denoted this property B. A group is said to have the basis property if all subgroups have property B. This thesis is a study into the nature of these two properties. Note all groups are finite unless stated otherwise.
We begin this thesis by providing examples of groups with and without property B and several results on the structure of groups with property B, showing that under certain conditions property B is inherited by quotients. This culminates with a result which shows that groups with property B that can be expressed as direct products are exactly those arising from the Burnside Basis Theorem.
We also seek to create a class of groups which have property B. We provide a method for constructing groups with property B and trivial Frattini subgroup using finite fields. We then classify all groups G where the quotient of G by the Frattini subgroup is isomorphic to this construction. We finally note that groups arising from this construction do not in general have the basis property.
Finally we look at groups with the basis property. We prove that groups with the basis property are soluble and consist only of elements of primepower order. We then exploit the classification of all such groups by Higman to provide a complete classification of groups with the basis property.

Substitutionclosed pattern classes
http://hdl.handle.net/10023/2149
The substitution closure of a pattern class is the class of all permutations obtained by repeated substitution. The principal pattern classes (those defined by a single restriction) whose substitution closure can be defined by a finite number of restrictions are classied by listing them as a set of explicit families.
20110201T00:00:00Z
Atkinson, M.D.
Ruskuc, Nik
Smith, R
The substitution closure of a pattern class is the class of all permutations obtained by repeated substitution. The principal pattern classes (those defined by a single restriction) whose substitution closure can be defined by a finite number of restrictions are classied by listing them as a set of explicit families.

Automatic presentations and semigroup constructions
http://hdl.handle.net/10023/2148
An automatic presentation for a relational structure is, informally, an abstract representation of the elements of that structure by means of a regular language such that the relations can all be recognized by finite automata. A structure admitting an automatic presentation is said to be FApresentable. This paper studies the interaction of automatic presentations and certain semigroup constructions, namely: direct products, free products, finite Rees index extensions and subsemigroups, strong semilattices of semigroups, Rees matrix semigroups, BruckReilly extensions, zerodirect unions, semidirect products, wreath products, ideals, and quotient semigroups. For each case, the closure of the class of FApresentable semigroups under that construction is considered, as is the question of whether the FApresentability of the semigroup obtained from such a construction implies the FApresentability of the original semigroup[s]. Classifications are also given of the FApresentable finitely generated Clifford semigroups, completely simple semigroups, and completely 0simple semigroups.
20100801T00:00:00Z
Cain, Alan J.
Oliver, Graham
Ruskuc, Nik
Thomas, Richard M.
An automatic presentation for a relational structure is, informally, an abstract representation of the elements of that structure by means of a regular language such that the relations can all be recognized by finite automata. A structure admitting an automatic presentation is said to be FApresentable. This paper studies the interaction of automatic presentations and certain semigroup constructions, namely: direct products, free products, finite Rees index extensions and subsemigroups, strong semilattices of semigroups, Rees matrix semigroups, BruckReilly extensions, zerodirect unions, semidirect products, wreath products, ideals, and quotient semigroups. For each case, the closure of the class of FApresentable semigroups under that construction is considered, as is the question of whether the FApresentability of the semigroup obtained from such a construction implies the FApresentability of the original semigroup[s]. Classifications are also given of the FApresentable finitely generated Clifford semigroups, completely simple semigroups, and completely 0simple semigroups.

Automatic presentations for semigroups
http://hdl.handle.net/10023/2147
This paper applies the concept of FApresentable structures to semigroups. We give a complete classification of the finitely generated FApresentable cancellative semigroups: namely, a finitely generated cancellative semigroup is FApresentable if and only if it is a subsemigroup of a virtually abelian group. We prove that all finitely generated commutative semigroups are FApresentable. We give a complete list of FApresentable onerelation semigroups and compare the classes of FApresentable semigroups and automatic semigroups. (C) 2009 Elsevier Inc. All rights reserved.
Special Issue: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008)
20091101T00:00:00Z
Cain, Alan James
Oliver, Graham
Ruskuc, Nik
Thomas, Richard M.
This paper applies the concept of FApresentable structures to semigroups. We give a complete classification of the finitely generated FApresentable cancellative semigroups: namely, a finitely generated cancellative semigroup is FApresentable if and only if it is a subsemigroup of a virtually abelian group. We prove that all finitely generated commutative semigroups are FApresentable. We give a complete list of FApresentable onerelation semigroups and compare the classes of FApresentable semigroups and automatic semigroups. (C) 2009 Elsevier Inc. All rights reserved.

On residual finiteness of direct products of algebraic systems
http://hdl.handle.net/10023/2146
It is well known that if two algebraic structures A and B are residually finite then so is their direct product. Here we discuss the converse of this statement. It is of course true if A and B contain idempotents, which covers the case of groups, rings, etc. We prove that the converse also holds for semigroups even though they need not have idempotents. We also exhibit three examples which show that the converse does not hold in general.
20090901T00:00:00Z
Gray, R.
Ruskuc, Nik
It is well known that if two algebraic structures A and B are residually finite then so is their direct product. Here we discuss the converse of this statement. It is of course true if A and B contain idempotents, which covers the case of groups, rings, etc. We prove that the converse also holds for semigroups even though they need not have idempotents. We also exhibit three examples which show that the converse does not hold in general.

The Bergman property for semigroups
http://hdl.handle.net/10023/2145
In this article, we study the Bergman property for semigroups and the associated notions of cofinality and strong cofinality. A large part of the paper is devoted to determining when the Bergman property, and the values of the cofinality and strong cofinality, can be passed from semigroups to subsemigroups and vice versa. Numerous examples, including many important semigroups from the literature, are given throughout the paper. For example, it is shown that the semigroup of all mappings on an infinite set has the Bergman property but that its finitary power semigroup does not; the symmetric inverse semigroup on an infinite set and its finitary power semigroup have the Bergman property; the BaerLevi semigroup does not have the Bergman property.
20090801T00:00:00Z
Maltcev, V.
Mitchell, J. D.
Ruskuc, N.
In this article, we study the Bergman property for semigroups and the associated notions of cofinality and strong cofinality. A large part of the paper is devoted to determining when the Bergman property, and the values of the cofinality and strong cofinality, can be passed from semigroups to subsemigroups and vice versa. Numerous examples, including many important semigroups from the literature, are given throughout the paper. For example, it is shown that the semigroup of all mappings on an infinite set has the Bergman property but that its finitary power semigroup does not; the symmetric inverse semigroup on an infinite set and its finitary power semigroup have the Bergman property; the BaerLevi semigroup does not have the Bergman property.

Green index and finiteness conditions for semigroups
http://hdl.handle.net/10023/2144
Let S be a semigroup and let T be a subsemigroup of S. Then T acts on S by left and by right multiplication. If the complement S \ T has finitely many strong orbits by both these actions we say that T has finite Green index in S. This notion of finite index encompasses subgroups of finite index in groups, and also subsemigroups of finite Rees index (complement). Therefore, the question of S and T inheriting various finiteness conditions from each other arises. In this paper we consider and resolve this question for the following finiteness conditions: finiteness, residual finiteness, local finiteness, periodicity, having finitely many right ideals, and having finitely many idempotents. (c) 2008 Elsevier Inc. All rights reserved.
20081015T00:00:00Z
Gray, Robert Duncan
Ruskuc, Nik
Let S be a semigroup and let T be a subsemigroup of S. Then T acts on S by left and by right multiplication. If the complement S \ T has finitely many strong orbits by both these actions we say that T has finite Green index in S. This notion of finite index encompasses subgroups of finite index in groups, and also subsemigroups of finite Rees index (complement). Therefore, the question of S and T inheriting various finiteness conditions from each other arises. In this paper we consider and resolve this question for the following finiteness conditions: finiteness, residual finiteness, local finiteness, periodicity, having finitely many right ideals, and having finitely many idempotents. (c) 2008 Elsevier Inc. All rights reserved.

Properties of the subsemigroups of the bicyclic monoid
http://hdl.handle.net/10023/2142
In this paper we study some properties of the subsemigroups of the bicyclic monoid B, by using a recent description of its subsemigroups. We start by giving necessary and sufficient conditions for a subsemigroup to be finitely generated. Then we show that all finitely generated subsemigroups are automatic and finitely presented. Finally we prove that a subsemigroup of B is residually finite if and only if it does not contain a copy of B.
20080601T00:00:00Z
Descalco, L.
Ruskuc, Nik
In this paper we study some properties of the subsemigroups of the bicyclic monoid B, by using a recent description of its subsemigroups. We start by giving necessary and sufficient conditions for a subsemigroup to be finitely generated. Then we show that all finitely generated subsemigroups are automatic and finitely presented. Finally we prove that a subsemigroup of B is residually finite if and only if it does not contain a copy of B.

Pattern classes of permutations via bijections between linearly ordered sets
http://hdl.handle.net/10023/2140
A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which is atomic, i.e. indecomposable as a union of proper subclasses, has a representation as the set of subpermutations of a bijection between two countable (or finite) linearly ordered sets A and B. Concentrating on the situation where A is arbitrary and B = N, we demonstrate how the ordertheoretic properties of A determine the structure of X and we establish results about independence, contiguousness and subrepresentations for classes admitting multiple representations of this form.
20080101T00:00:00Z
Huczynska, Sophie
Ruskuc, Nikola
A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which is atomic, i.e. indecomposable as a union of proper subclasses, has a representation as the set of subpermutations of a bijection between two countable (or finite) linearly ordered sets A and B. Concentrating on the situation where A is arbitrary and B = N, we demonstrate how the ordertheoretic properties of A determine the structure of X and we establish results about independence, contiguousness and subrepresentations for classes admitting multiple representations of this form.

Cancellative and Malcev presentations for finite Rees index subsemigroups and extensions
http://hdl.handle.net/10023/2138
It is known that, for semigroups, the property of admitting a finite presentation is preserved on passing to subsemigroups and extensions of finite Rees index. The present paper shows that the same holds true for Malcev, cancellative, leftcancellative and rightcancellative presentations. (A Malcev (respectively, cancellative, leftcancellative, rightcancellative) presentation is a presentation of a special type that can be used to define any groupembeddable (respectively, cancellative, leftcancellative, rightcancellative) semigroup.).
20080201T00:00:00Z
Cain, Alan James
Robertson, Edmund Frederick
Ruskuc, Nik
It is known that, for semigroups, the property of admitting a finite presentation is preserved on passing to subsemigroups and extensions of finite Rees index. The present paper shows that the same holds true for Malcev, cancellative, leftcancellative and rightcancellative presentations. (A Malcev (respectively, cancellative, leftcancellative, rightcancellative) presentation is a presentation of a special type that can be used to define any groupembeddable (respectively, cancellative, leftcancellative, rightcancellative) semigroup.).

Growth rates for subclasses of Av(321)
http://hdl.handle.net/10023/2137
Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or all of the other patterns. The method of proof is to show that the elements of the latter classes can be represented as bounded merges of elements of the original class, and that the bounded merge construction does not change growth rates.
20101022T00:00:00Z
Albert, M.H.
Atkinson, M.D.
Brignall, R
Ruskuc, Nik
Smith, R
West, J
Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or all of the other patterns. The method of proof is to show that the elements of the latter classes can be represented as bounded merges of elements of the original class, and that the bounded merge construction does not change growth rates.

On generators and presentations of semidirect products in inverse semigroups
http://hdl.handle.net/10023/2136
In this paper we prove two main results. The first is a necessary and sufficient condition for a semidirect product of a semilattice by a group to be finitely generated. The second result is a necessary and sufficient condition for such a semidirect product to be finitely presented.
20090601T00:00:00Z
Dombi, Erzsebet Rita
Ruskuc, Nik
In this paper we prove two main results. The first is a necessary and sufficient condition for a semidirect product of a semilattice by a group to be finitely generated. The second result is a necessary and sufficient condition for such a semidirect product to be finitely presented.

Maximal subgroups of free idempotentgenerated semigroups over the full transformation monoid
http://hdl.handle.net/10023/2134
Let Tn be the full transformation semigroup of all mappings from the set {1, . . . , n} to itself under composition. Let E = E(Tn) denote the set of idempotents of Tn and let e ∈ E be an arbitrary idempotent satisfying im (e) = r ≤ n − 2. We prove that the maximal subgroup of the free idempotent generated semigroup over E containing e is isomorphic to the symmetric group Sr.
20120501T00:00:00Z
Gray, R
Ruskuc, Nik
Let Tn be the full transformation semigroup of all mappings from the set {1, . . . , n} to itself under composition. Let E = E(Tn) denote the set of idempotents of Tn and let e ∈ E be an arbitrary idempotent satisfying im (e) = r ≤ n − 2. We prove that the maximal subgroup of the free idempotent generated semigroup over E containing e is isomorphic to the symmetric group Sr.

Generators and relations for subsemigroups via boundaries in Cayley graphs
http://hdl.handle.net/10023/2131
Given a finitely generated semigroup S and subsemigroup T of S we define the notion of the boundary of T in S which, intuitively, describes the position of T inside the left and right Cayley graphs of S. We prove that if S is finitely generated and T has a finite boundary in S then T is finitely generated. We also prove that if S is finitely presented and T has a finite boundary in S then T is finitely presented. Several corollaries and examples are given.
20111101T00:00:00Z
Gray, R
Ruskuc, Nik
Given a finitely generated semigroup S and subsemigroup T of S we define the notion of the boundary of T in S which, intuitively, describes the position of T inside the left and right Cayley graphs of S. We prove that if S is finitely generated and T has a finite boundary in S then T is finitely generated. We also prove that if S is finitely presented and T has a finite boundary in S then T is finitely presented. Several corollaries and examples are given.

On the growth of generating sets for direct powers of semigroups
http://hdl.handle.net/10023/2129
For a semigroup S its dsequence is d(S) = (d1, d2, d3, . . .), where di is the smallest number of elements needed to generate the ith direct power of S. In this paper we present a number of facts concerning the type of growth d(S) can have when S is an infinite semigroup, comparing them with the corresponding known facts for infinite groups, and also for finite groups and semigroups.
20120101T00:00:00Z
Hyde, James Thomas
Loughlin, Nicholas
Quick, Martyn
Ruskuc, Nik
Wallis, Alistair
For a semigroup S its dsequence is d(S) = (d1, d2, d3, . . .), where di is the smallest number of elements needed to generate the ith direct power of S. In this paper we present a number of facts concerning the type of growth d(S) can have when S is an infinite semigroup, comparing them with the corresponding known facts for infinite groups, and also for finite groups and semigroups.

On maximal subgroups of free idempotent generated semigroups
http://hdl.handle.net/10023/2128
We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite semigroup. (3) Every group is a maximal subgroup of some free regular idempotent generated semigroup. (4) Every finite group is a maximal subgroup of some free regular idempotent generated semigroup arising from a finite regular semigroup. As a technical prerequisite for these results we establish a general presentation for the maximal subgroups based on a Reidemeister–Schreier type rewriting.
20120101T00:00:00Z
Gray, R
Ruskuc, Nik
We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite semigroup. (3) Every group is a maximal subgroup of some free regular idempotent generated semigroup. (4) Every finite group is a maximal subgroup of some free regular idempotent generated semigroup arising from a finite regular semigroup. As a technical prerequisite for these results we establish a general presentation for the maximal subgroups based on a Reidemeister–Schreier type rewriting.

Directed graph iterated function systems
http://hdl.handle.net/10023/2109
This thesis concerns an active research area within fractal geometry.
In the first part, in Chapters 2 and 3, for directed graph iterated function systems
(IFSs) defined on ℝ, we prove that a class of 2vertex directed graph IFSs have attractors
that cannot be the attractors of standard (1vertex directed graph) IFSs, with
or without separation conditions. We also calculate their exact Hausdorff measure.
Thus we are able to identify a new class of attractors for which the exact Hausdorff
measure is known.
We give a constructive algorithm for calculating the set of gap lengths of any
attractor as a finite union of cosets of finitely generated semigroups of positive real
numbers. The generators of these semigroups are contracting similarity ratios of
simple cycles in the directed graph. The algorithm works for any IFS defined on ℝ
with no limit on the number of vertices in the directed graph, provided a separation
condition holds.
The second part, in Chapter 4, applies to directed graph IFSs defined on ℝⁿ . We
obtain an explicit calculable value for the power law behaviour as r → 0⁺ , of the qth
packing moment of μᵤ, the selfsimilar measure at a vertex u, for the nonlattice case,
with a corresponding limit for the lattice case. We do this
(i) for any q ∈ ℝ if the strong separation condition holds,
(ii) for q ≥ 0 if the weaker open set condition holds and a specified nonnegative
matrix associated with the system is irreducible.
In the nonlattice case this enables the rate of convergence of the packing L[superscript(q)]spectrum
of μᵤ to be determined. We also show, for (ii) but allowing q ∈ ℝ, that the upper
multifractal q boxdimension with respect to μᵤ, of the set consisting of all the intersections
of the components of Fᵤ, is strictly less than the multifractal q Hausdorff
dimension with respect to μᵤ of Fᵤ.
20111130T00:00:00Z
Boore, Graeme C.
This thesis concerns an active research area within fractal geometry.
In the first part, in Chapters 2 and 3, for directed graph iterated function systems
(IFSs) defined on ℝ, we prove that a class of 2vertex directed graph IFSs have attractors
that cannot be the attractors of standard (1vertex directed graph) IFSs, with
or without separation conditions. We also calculate their exact Hausdorff measure.
Thus we are able to identify a new class of attractors for which the exact Hausdorff
measure is known.
We give a constructive algorithm for calculating the set of gap lengths of any
attractor as a finite union of cosets of finitely generated semigroups of positive real
numbers. The generators of these semigroups are contracting similarity ratios of
simple cycles in the directed graph. The algorithm works for any IFS defined on ℝ
with no limit on the number of vertices in the directed graph, provided a separation
condition holds.
The second part, in Chapter 4, applies to directed graph IFSs defined on ℝⁿ . We
obtain an explicit calculable value for the power law behaviour as r → 0⁺ , of the qth
packing moment of μᵤ, the selfsimilar measure at a vertex u, for the nonlattice case,
with a corresponding limit for the lattice case. We do this
(i) for any q ∈ ℝ if the strong separation condition holds,
(ii) for q ≥ 0 if the weaker open set condition holds and a specified nonnegative
matrix associated with the system is irreducible.
In the nonlattice case this enables the rate of convergence of the packing L[superscript(q)]spectrum
of μᵤ to be determined. We also show, for (ii) but allowing q ∈ ℝ, that the upper
multifractal q boxdimension with respect to μᵤ, of the set consisting of all the intersections
of the components of Fᵤ, is strictly less than the multifractal q Hausdorff
dimension with respect to μᵤ of Fᵤ.

On convex permutations
http://hdl.handle.net/10023/2000
A selection of points drawn from a convex polygon, no two with the same vertical or horizontal coordinate, yields a permutation in a canonical fashion. We characterise and enumerate those permutations which arise in this manner and exhibit some interesting structural properties of the permutation class they form. We conclude with a permutation analogue of the celebrated Happy Ending Problem.
20110501T00:00:00Z
Albert, M.H.
Linton, Stephen Alexander
Ruskuc, Nik
Vatter, V
Waton, S
A selection of points drawn from a convex polygon, no two with the same vertical or horizontal coordinate, yields a permutation in a canonical fashion. We characterise and enumerate those permutations which arise in this manner and exhibit some interesting structural properties of the permutation class they form. We conclude with a permutation analogue of the celebrated Happy Ending Problem.

Presentations of inverse semigroups, their kernels and extensions
http://hdl.handle.net/10023/1998
Let S be an inverse semigroup and let π:S→T be a surjective homomorphism with kernel K. We show how to obtain a presentation for K from a presentation for S, and vice versa. We then investigate the relationship between the properties of S, K and T, focusing mainly on finiteness conditions. In particular we consider finite presentability, solubility of the word problem, residual finiteness, and the homological finiteness property FPn. Our results extend several classical results from combinatorial group theory concerning group extensions to inverse semigroups. Examples are also provided that highlight the differences with the special case of groups.
"Part of this work was done while Gray was an EPSRC Postdoctoral Research Fellow at the University of St Andrews, Scotland"
20110601T00:00:00Z
Carvalho, C.A.
Gray, R
Ruskuc, Nik
Let S be an inverse semigroup and let π:S→T be a surjective homomorphism with kernel K. We show how to obtain a presentation for K from a presentation for S, and vice versa. We then investigate the relationship between the properties of S, K and T, focusing mainly on finiteness conditions. In particular we consider finite presentability, solubility of the word problem, residual finiteness, and the homological finiteness property FPn. Our results extend several classical results from combinatorial group theory concerning group extensions to inverse semigroups. Examples are also provided that highlight the differences with the special case of groups.

Simple extensions of combinatorial structures
http://hdl.handle.net/10023/1997
An interval in a combinatorial structure R is a set I of points which are related to every point in R \ I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a simple structure by structures of smaller sizes — this is called the substitution (or modular) decomposition. In this paper we prove several results of the following type: An arbitrary structure S of size n belonging to a class C can be embedded into a simple structure from C by adding at most f (n) elements. We prove such results when C is the class of all tournaments, graphs, permutations, posets, digraphs, oriented graphs and general relational structures containing a relation of arity greater than 2. The function f (n) in these cases is 2, ⌈log2(n + 1)⌉, ⌈(n + 1)/2⌉, ⌈(n + 1)/2⌉, ⌈log4(n + 1)⌉, ⌈log3(n + 1)⌉ and 1, respectively. In each case these bounds are the best possible.
20110701T00:00:00Z
Brignall, R
Ruskuc, Nik
Vatter, V
An interval in a combinatorial structure R is a set I of points which are related to every point in R \ I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a simple structure by structures of smaller sizes — this is called the substitution (or modular) decomposition. In this paper we prove several results of the following type: An arbitrary structure S of size n belonging to a class C can be embedded into a simple structure from C by adding at most f (n) elements. We prove such results when C is the class of all tournaments, graphs, permutations, posets, digraphs, oriented graphs and general relational structures containing a relation of arity greater than 2. The function f (n) in these cases is 2, ⌈log2(n + 1)⌉, ⌈(n + 1)/2⌉, ⌈(n + 1)/2⌉, ⌈log4(n + 1)⌉, ⌈log3(n + 1)⌉ and 1, respectively. In each case these bounds are the best possible.

The horizon problem for prevalent surfaces
http://hdl.handle.net/10023/1956
We investigate the box dimensions of the horizon of a fractal surface defined by a function $f \in C[0,1]^2 $. In particular we show that a prevalent surface satisfies the `horizon property', namely that the box dimension of the horizon is one less than that of the surface. Since a prevalent surface has box dimension 3, this does not give us any information about the horizon of surfaces of dimension strictly less than 3. To examine this situation we introduce spaces of functions with surfaces of upper box dimension at most $\alpha$, for $\alpha \in [2,3)$. In this setting the behaviour of the horizon is more subtle. We construct a prevalent subset of these spaces where the lower box dimension of the horizon lies between the dimension of the surface minus one and 2. We show that in the sense of prevalence these bounds are as tight as possible if the spaces are defined purely in terms of dimension. However, if we work in Lipschitz spaces, the horizon property does indeed hold for prevalent functions. Along the way, we obtain a range of properties of box dimensions of sums of functions.
JMF was supported by an EPSRC Doctoral Training Grant whilst undertaking this work.
20110101T00:00:00Z
Falconer, Kenneth John
Fraser, Jonathan Macdonald
We investigate the box dimensions of the horizon of a fractal surface defined by a function $f \in C[0,1]^2 $. In particular we show that a prevalent surface satisfies the `horizon property', namely that the box dimension of the horizon is one less than that of the surface. Since a prevalent surface has box dimension 3, this does not give us any information about the horizon of surfaces of dimension strictly less than 3. To examine this situation we introduce spaces of functions with surfaces of upper box dimension at most $\alpha$, for $\alpha \in [2,3)$. In this setting the behaviour of the horizon is more subtle. We construct a prevalent subset of these spaces where the lower box dimension of the horizon lies between the dimension of the surface minus one and 2. We show that in the sense of prevalence these bounds are as tight as possible if the spaces are defined purely in terms of dimension. However, if we work in Lipschitz spaces, the horizon property does indeed hold for prevalent functions. Along the way, we obtain a range of properties of box dimensions of sums of functions.

A commutative noncommutative fractal geometry
http://hdl.handle.net/10023/1710
In this thesis examples of spectral triples, which represent fractal sets, are examined and new insights into their noncommutative geometries are obtained.
Firstly, starting with Connes' spectral triple for a nonempty compact totally disconnected subset E of {R} with no isolated points, we develop a noncommutative coarse multifractal formalism. Specifically, we show how multifractal properties of a measure supported on E can be expressed in terms of a spectral triple and the Dixmier trace of certain operators. If E satisfies a given porosity condition, then we prove that the coarse multifractal boxcounting dimension can be recovered. We show that for a selfsimilar measure μ, given by an iterated function system S defined on a compact subset of {R} satisfying the strong separation condition, our noncommutative coarse multifractal formalism gives rise to a noncommutative integral which recovers the selfsimilar multifractal measure ν associated to μ, and we establish a relationship between the noncommutative volume of such a noncommutative integral and the measure theoretical entropy of ν with respect to S.
Secondly, motivated by the results of AntonescuIvan and Christensen, we construct a family of (1, +)summable spectral triples for a onesided topologically exact subshift of finite type (∑{{A}}^{{N}}, σ). These spectral triples are constructed using equilibrium measures obtained from the PerronFrobeniusRuelle operator, whose potential function is nonarithemetic and Hölder continuous. We show that the Connes' pseudometric, given by any one of these spectral triples, is a metric and that the metric topology agrees with the weak*topology on the state space {S}(C(∑{{A}}^{{N}}); {C}). For each equilibrium measure ν[subscript(φ)] we show that the noncommuative volume of the associated spectral triple is equal to the reciprocal of the measure theoretical entropy of ν[subscript(φ)] with respect to the left shift σ (where it is assumed, without loss of generality, that the pressure of the potential function is equal to zero). We also show that the measure ν[subscript(φ)] can be fully recovered from the noncommutative integration theory.
20100101T00:00:00Z
Samuel, Anthony
In this thesis examples of spectral triples, which represent fractal sets, are examined and new insights into their noncommutative geometries are obtained.
Firstly, starting with Connes' spectral triple for a nonempty compact totally disconnected subset E of {R} with no isolated points, we develop a noncommutative coarse multifractal formalism. Specifically, we show how multifractal properties of a measure supported on E can be expressed in terms of a spectral triple and the Dixmier trace of certain operators. If E satisfies a given porosity condition, then we prove that the coarse multifractal boxcounting dimension can be recovered. We show that for a selfsimilar measure μ, given by an iterated function system S defined on a compact subset of {R} satisfying the strong separation condition, our noncommutative coarse multifractal formalism gives rise to a noncommutative integral which recovers the selfsimilar multifractal measure ν associated to μ, and we establish a relationship between the noncommutative volume of such a noncommutative integral and the measure theoretical entropy of ν with respect to S.
Secondly, motivated by the results of AntonescuIvan and Christensen, we construct a family of (1, +)summable spectral triples for a onesided topologically exact subshift of finite type (∑{{A}}^{{N}}, σ). These spectral triples are constructed using equilibrium measures obtained from the PerronFrobeniusRuelle operator, whose potential function is nonarithemetic and Hölder continuous. We show that the Connes' pseudometric, given by any one of these spectral triples, is a metric and that the metric topology agrees with the weak*topology on the state space {S}(C(∑{{A}}^{{N}}); {C}). For each equilibrium measure ν[subscript(φ)] we show that the noncommuative volume of the associated spectral triple is equal to the reciprocal of the measure theoretical entropy of ν[subscript(φ)] with respect to the left shift σ (where it is assumed, without loss of generality, that the pressure of the potential function is equal to zero). We also show that the measure ν[subscript(φ)] can be fully recovered from the noncommutative integration theory.

The lesser names : the teachers of the Edinburgh Mathematical Society and other aspects of Scottish mathematics, 1867–1946
http://hdl.handle.net/10023/1700
The Edinburgh Mathematical Society started out in 1883 as a society with a large proportion of teachers. Today, the member base is mainly academical and there are only a few teachers left. This thesis explores how and when this change came about, and discusses what this meant for the Society.
It argues that the exit of the teachers is related to the rising standard of mathematics, but even more to a change in the Society’s printing policy in the 1920s, that turned the Society’s Proceedings into a pure research publication and led to the death of the ‘teacher journal’, the Mathematical Notes. The thesis also argues that this change, drastic as it may seem, does not represent a change in the Society’s nature.
For this aim, the role of the teachers within the Society has been studied and compared to that of the academics, from 1883 to 1946. The mathematical contribution of the teachers to the Proceedings is studied in some detail, in particular the papers by John Watt Butters.
A paper in the Mathematical Notes by A. C. Aitken on the Bell numbers is considered in connection with a series of letters on the same topic from 1938–39. These letters, written by Aitken, Sir D’Arcy Thompson, another EMS member, and the Cambridge mathematician G. T. Bennett, explores the relation between the three and gives valuable insight into the status of the Notes.
Finally, the role of the first women in the Society is studied. The first woman joined without any official university education, but had received the necessary mathematical background from her studies under the Edinburgh Association for the University Education of Women. The final chapter is largely an assessment of this Association’s mathematical classes.
20110622T00:00:00Z
Hartveit, Marit
The Edinburgh Mathematical Society started out in 1883 as a society with a large proportion of teachers. Today, the member base is mainly academical and there are only a few teachers left. This thesis explores how and when this change came about, and discusses what this meant for the Society.
It argues that the exit of the teachers is related to the rising standard of mathematics, but even more to a change in the Society’s printing policy in the 1920s, that turned the Society’s Proceedings into a pure research publication and led to the death of the ‘teacher journal’, the Mathematical Notes. The thesis also argues that this change, drastic as it may seem, does not represent a change in the Society’s nature.
For this aim, the role of the teachers within the Society has been studied and compared to that of the academics, from 1883 to 1946. The mathematical contribution of the teachers to the Proceedings is studied in some detail, in particular the papers by John Watt Butters.
A paper in the Mathematical Notes by A. C. Aitken on the Bell numbers is considered in connection with a series of letters on the same topic from 1938–39. These letters, written by Aitken, Sir D’Arcy Thompson, another EMS member, and the Cambridge mathematician G. T. Bennett, explores the relation between the three and gives valuable insight into the status of the Notes.
Finally, the role of the first women in the Society is studied. The first woman joined without any official university education, but had received the necessary mathematical background from her studies under the Edinburgh Association for the University Education of Women. The final chapter is largely an assessment of this Association’s mathematical classes.

Primitive free cubics with specified norm and trace
http://hdl.handle.net/10023/1615
The existence of a primitive free (normal) cubic x(3) ax(2) + cx b over a finite field F with arbitrary specified values of a (not equal 0) and b (primitive) is guaranteed. This is the most delicate case of a general existence theorem whose proof is thereby completed.
20030801T00:00:00Z
Huczynska, Sophie
Cohen, SD
The existence of a primitive free (normal) cubic x(3) ax(2) + cx b over a finite field F with arbitrary specified values of a (not equal 0) and b (primitive) is guaranteed. This is the most delicate case of a general existence theorem whose proof is thereby completed.

Subsemigroups of virtually free groups : finite Malcev presentations and testing for freeness
http://hdl.handle.net/10023/1561
This paper shows that, given a finite subset X of a finitely generated virtually free group F, the freeness of the subsemigroup of F generated by X can be tested algorithmically. (A group is virtually free if it contains a free subgroup of finite index.) It is then shown that every finitely generated subsemigroup, of F has a finite Malcev presentation (a type of semigroup presentation which can be used to define any semigroup that embeds in a group), and that such a presentation can be effectively found from any finite generating set.
20060701T00:00:00Z
Cain, AJ
Robertson, Edmund Frederick
Ruskuc, Nikola
This paper shows that, given a finite subset X of a finitely generated virtually free group F, the freeness of the subsemigroup of F generated by X can be tested algorithmically. (A group is virtually free if it contains a free subgroup of finite index.) It is then shown that every finitely generated subsemigroup, of F has a finite Malcev presentation (a type of semigroup presentation which can be used to define any semigroup that embeds in a group), and that such a presentation can be effectively found from any finite generating set.

Generating the full transformation semigroup using order preserving mappings
http://hdl.handle.net/10023/1553
For a linearly ordered set X we consider the relative rank of the semigroup of all order preserving mappings OX on X modulo the full transformation semigroup Ex. In other words, we ask what is the smallest cardinality of a set A of mappings such that <OX boolean OR A> = TX. When X is countably infinite or wellordered (of arbitrary cardinality) we show that this number is one, while when X = R (the set of real numbers) it is uncountable.
20030901T00:00:00Z
Higgins, PM
Mitchell, James David
Ruskuc, Nikola
For a linearly ordered set X we consider the relative rank of the semigroup of all order preserving mappings OX on X modulo the full transformation semigroup Ex. In other words, we ask what is the smallest cardinality of a set A of mappings such that <OX boolean OR A> = TX. When X is countably infinite or wellordered (of arbitrary cardinality) we show that this number is one, while when X = R (the set of real numbers) it is uncountable.

On defining groups efficiently without using inverses
http://hdl.handle.net/10023/1442
Let G be a group, and let <A \ R> be a finite group presentation for G with \R\ greater than or equal to \A\. Then there exists a, finite semigroup, presentation <B \ Q> for G such that \Q\  \B\ = \R\  \A\. Moreover, B is either the same generating set or else it contains one additional generator.
20020701T00:00:00Z
Campbell, Colin Matthew
Mitchell, James David
Ruskuc, Nikola
Let G be a group, and let <A \ R> be a finite group presentation for G with \R\ greater than or equal to \A\. Then there exists a, finite semigroup, presentation <B \ Q> for G such that \Q\  \B\ = \R\  \A\. Moreover, B is either the same generating set or else it contains one additional generator.

Stable and multistable processes and localisability
http://hdl.handle.net/10023/948
We first review recent work on stable and multistable random processes and their
localisability. Then most of the thesis concerns a new approach to these topics
based on characteristic functions.
Our aim is to construct processes on R, which are α(x)multistable, where the
stability index α(x) varies with x. To do this we first use characteristic functions
to define α(x)multistable random integrals and measures and examine their properties.
We show that an α(x)multistable random measure may be obtained as the
limit of a sequence of measures made up of αstable random measures restricted
to small intervals with α constant on each interval.
We then use the multistable random integrals to define multistable random
processes on R and study the localisability of these processes. Thus we find conditions
that ensure that a process locally ‘looks like’ a given stochastic process
under enlargement and appropriate scaling. We give many examples of multistable
random processes and examine their local forms.
Finally, we examine the dimensions of graphs of αstable random functions
defined by series with αstable random variables as coefficients.
20100623T00:00:00Z
Liu, Lining
We first review recent work on stable and multistable random processes and their
localisability. Then most of the thesis concerns a new approach to these topics
based on characteristic functions.
Our aim is to construct processes on R, which are α(x)multistable, where the
stability index α(x) varies with x. To do this we first use characteristic functions
to define α(x)multistable random integrals and measures and examine their properties.
We show that an α(x)multistable random measure may be obtained as the
limit of a sequence of measures made up of αstable random measures restricted
to small intervals with α constant on each interval.
We then use the multistable random integrals to define multistable random
processes on R and study the localisability of these processes. Thus we find conditions
that ensure that a process locally ‘looks like’ a given stochastic process
under enlargement and appropriate scaling. We give many examples of multistable
random processes and examine their local forms.
Finally, we examine the dimensions of graphs of αstable random functions
defined by series with αstable random variables as coefficients.

Classification and enumeration of finite semigroups
http://hdl.handle.net/10023/945
The classification of finite semigroups is difficult even for small
orders because of their large number. Most finite semigroups are
nilpotent of nilpotency rank 3. Formulae for their number up to
isomorphism, and up to isomorphism and antiisomorphism of any order
are the main results in the theoretical part of this thesis. Further
studies concern the classification of nilpotent semigroups by rank,
leading to a full classification for large ranks.
In the computational part, a method to find and
enumerate multiplication tables of semigroups and subclasses is
presented. The approach combines the advantages of computer algebra
and constraint satisfaction, to allow for an efficient and fast
search. The problem of avoiding isomorphic and antiisomorphic
semigroups is dealt with by supporting standard methods from
constraint satisfaction with structural knowledge about the semigroups
under consideration. The approach is adapted to various
problems, and realised using the computer algebra system GAP and the
constraint solver Minion. New results include the numbers of
semigroups of order 9, and of monoids and bands of order 10. Up to
isomorphism and antiisomorphism there are 52,989,400,714,478 semigroups
with 9 elements, 52,991,253,973,742 monoids with 10 elements, and
7,033,090 bands with 10 elements. That constraint satisfaction can also
be utilised for the analysis of algebraic objects is demonstrated by
determining the automorphism groups of all semigroups with 9 elements.
A classification of the semigroups of orders 1 to 8 is made available
as a data library in form of the GAP package Smallsemi. Beyond the
semigroups themselves a large amount of precomputed properties is
contained in the library. The package as well as the code used to
obtain the enumeration results are available on the attached DVD.
20100623T00:00:00Z
Distler, Andreas
The classification of finite semigroups is difficult even for small
orders because of their large number. Most finite semigroups are
nilpotent of nilpotency rank 3. Formulae for their number up to
isomorphism, and up to isomorphism and antiisomorphism of any order
are the main results in the theoretical part of this thesis. Further
studies concern the classification of nilpotent semigroups by rank,
leading to a full classification for large ranks.
In the computational part, a method to find and
enumerate multiplication tables of semigroups and subclasses is
presented. The approach combines the advantages of computer algebra
and constraint satisfaction, to allow for an efficient and fast
search. The problem of avoiding isomorphic and antiisomorphic
semigroups is dealt with by supporting standard methods from
constraint satisfaction with structural knowledge about the semigroups
under consideration. The approach is adapted to various
problems, and realised using the computer algebra system GAP and the
constraint solver Minion. New results include the numbers of
semigroups of order 9, and of monoids and bands of order 10. Up to
isomorphism and antiisomorphism there are 52,989,400,714,478 semigroups
with 9 elements, 52,991,253,973,742 monoids with 10 elements, and
7,033,090 bands with 10 elements. That constraint satisfaction can also
be utilised for the analysis of algebraic objects is demonstrated by
determining the automorphism groups of all semigroups with 9 elements.
A classification of the semigroups of orders 1 to 8 is made available
as a data library in form of the GAP package Smallsemi. Beyond the
semigroups themselves a large amount of precomputed properties is
contained in the library. The package as well as the code used to
obtain the enumeration results are available on the attached DVD.

Generating uncountable transformation semigroups
http://hdl.handle.net/10023/867
We consider naturally occurring, uncountable transformation semigroups S and investigate the following three questions.
(i) Is every countable subset F of S also a subset of a ﬁnitely generated subsemigroup of S? If so, what is the least number n such that for every countable
subset F of S there exist n elements of S that generate a subsemigroup of S
containing F as a subset.
(ii) Given a subset U of S, what is the least cardinality of a subset A of S such
that the union of A and U is a generating set for S?
(iii) Deﬁne a preorder relation ≤ on the subsets of S as follows. For subsets V and
W of S write V ≤ W if there exists a countable subset C of S such that V
is contained in the semigroup generated by the union of W and C. Given a
subset U of S, where does U lie in the preorder ≤ on subsets of S?
Semigroups S for which we answer question (i) include: the semigroups of the injec
tive functions and the surjective functions on a countably inﬁnite set; the semigroups
of the increasing functions, the Lebesgue measurable functions, and the differentiable
functions on the closed unit interval [0, 1]; and the endomorphism semigroup of the
random graph.
We investigate questions (ii) and (iii) in the case where S is the semigroup Ω[superscript Ω] of all functions on a countably inﬁnite set Ω. Subsets U of Ω[superscript Ω] under consideration
are semigroups of Lipschitz functions on Ω with respect to discrete metrics on Ω and
semigroups of endomorphisms of binary relations on Ω such as graphs or preorders.
20090101T00:00:00Z
Péresse, Yann
We consider naturally occurring, uncountable transformation semigroups S and investigate the following three questions.
(i) Is every countable subset F of S also a subset of a ﬁnitely generated subsemigroup of S? If so, what is the least number n such that for every countable
subset F of S there exist n elements of S that generate a subsemigroup of S
containing F as a subset.
(ii) Given a subset U of S, what is the least cardinality of a subset A of S such
that the union of A and U is a generating set for S?
(iii) Deﬁne a preorder relation ≤ on the subsets of S as follows. For subsets V and
W of S write V ≤ W if there exists a countable subset C of S such that V
is contained in the semigroup generated by the union of W and C. Given a
subset U of S, where does U lie in the preorder ≤ on subsets of S?
Semigroups S for which we answer question (i) include: the semigroups of the injec
tive functions and the surjective functions on a countably inﬁnite set; the semigroups
of the increasing functions, the Lebesgue measurable functions, and the differentiable
functions on the closed unit interval [0, 1]; and the endomorphism semigroup of the
random graph.
We investigate questions (ii) and (iii) in the case where S is the semigroup Ω[superscript Ω] of all functions on a countably inﬁnite set Ω. Subsets U of Ω[superscript Ω] under consideration
are semigroups of Lipschitz functions on Ω with respect to discrete metrics on Ω and
semigroups of endomorphisms of binary relations on Ω such as graphs or preorders.

The geometry of selfaffine fractals
http://hdl.handle.net/10023/838
In this thesis we study the dimension theory of selfaffine sets. We begin by
introducing a number of notions from fractal geometry, in particular, dimensions,
measure properties and iterated functions systems. We give a review of existing
work on selfaffine sets. We then develop a variety of new results on selfaffine
sets and their dimensional properties.
This work falls into three parts:
Firstly, we look at the dimension formulae for a class of selfaffine sets generated
by upper triangular matrices. In this case, we simplify the affine dimension
formula into equations only involving the diagonal elements of the matrices.
Secondly, since the Hausdorff dimensions of selfaffine sets depend not only
on the linear parts of the contractions but also on the translation parameters, we
obtain an upper bound for the dimensions of exceptional sets, that is, the set of
parameters such that the Hausdorff dimension of the attractor is smaller than the
affine dimension.
Thirdly, we investigate dimensions of a class of random selfaffine sets, aiming
to extend the ‘almost sure’ formula for random selfsimilar sets to random selfaffine
sets.
20080101T00:00:00Z
Miao, Jun Jie
In this thesis we study the dimension theory of selfaffine sets. We begin by
introducing a number of notions from fractal geometry, in particular, dimensions,
measure properties and iterated functions systems. We give a review of existing
work on selfaffine sets. We then develop a variety of new results on selfaffine
sets and their dimensional properties.
This work falls into three parts:
Firstly, we look at the dimension formulae for a class of selfaffine sets generated
by upper triangular matrices. In this case, we simplify the affine dimension
formula into equations only involving the diagonal elements of the matrices.
Secondly, since the Hausdorff dimensions of selfaffine sets depend not only
on the linear parts of the contractions but also on the translation parameters, we
obtain an upper bound for the dimensions of exceptional sets, that is, the set of
parameters such that the Hausdorff dimension of the attractor is smaller than the
affine dimension.
Thirdly, we investigate dimensions of a class of random selfaffine sets, aiming
to extend the ‘almost sure’ formula for random selfsimilar sets to random selfaffine
sets.

Intersection problems in combinatorics
http://hdl.handle.net/10023/765
With the publication of the famous ErdősKoRado Theorem in 1961, intersection problems became a popular area of combinatorics. A family of combinatorial objects is tintersecting if any two of its elements mutually tintersect, where the latter concept needs to be specified separately in each instance. This thesis is split into two parts; the first is concerned with intersecting injections while the second investigates intersecting posets.
We classify maximum 1intersecting families of injections from {1, ..., k} to {1, ..., n}, a generalisation of the corresponding result on permutations from the early 2000s. Moreover, we obtain classifications in the general t>1 case for different parameter limits:
if n is large in terms of k and t, then the socalled fixfamilies, consisting of all injections which map some fixed set of t points to the same image points, are the only tintersecting injection families of maximal size. By way of contrast, fixing the differences kt and nk while increasing k leads to optimal families which are equivalent to one of the socalled saturation families, consisting of all injections fixing at least r+t of the first 2r+t points, where r=_ (kt)/2 _. Furthermore we demonstrate that, among injection families with tintersecting and leftcompressed fixed point sets, for some value of r the saturation family has maximal size .
The concept that two posets intersect if they share a comparison is new. We begin by classifying maximum intersecting families in several isomorphism classes of posets which are linear, or almost linear. Then we study the union of the almost linear classes, and derive a bound for an intersecting family by adapting Katona's elegant cycle method to posets. The thesis ends with an investigation of the intersection structure of poset classes whose elements are close to the antichain.
The overarching theme of this thesis is fixing versus saturation: we compare the sizes and structures of intersecting families obtained from these two distinct principles in the context of various classes of combinatorial objects.
20091130T00:00:00Z
Brunk, Fiona
With the publication of the famous ErdősKoRado Theorem in 1961, intersection problems became a popular area of combinatorics. A family of combinatorial objects is tintersecting if any two of its elements mutually tintersect, where the latter concept needs to be specified separately in each instance. This thesis is split into two parts; the first is concerned with intersecting injections while the second investigates intersecting posets.
We classify maximum 1intersecting families of injections from {1, ..., k} to {1, ..., n}, a generalisation of the corresponding result on permutations from the early 2000s. Moreover, we obtain classifications in the general t>1 case for different parameter limits:
if n is large in terms of k and t, then the socalled fixfamilies, consisting of all injections which map some fixed set of t points to the same image points, are the only tintersecting injection families of maximal size. By way of contrast, fixing the differences kt and nk while increasing k leads to optimal families which are equivalent to one of the socalled saturation families, consisting of all injections fixing at least r+t of the first 2r+t points, where r=_ (kt)/2 _. Furthermore we demonstrate that, among injection families with tintersecting and leftcompressed fixed point sets, for some value of r the saturation family has maximal size .
The concept that two posets intersect if they share a comparison is new. We begin by classifying maximum intersecting families in several isomorphism classes of posets which are linear, or almost linear. Then we study the union of the almost linear classes, and derive a bound for an intersecting family by adapting Katona's elegant cycle method to posets. The thesis ends with an investigation of the intersection structure of poset classes whose elements are close to the antichain.
The overarching theme of this thesis is fixing versus saturation: we compare the sizes and structures of intersecting families obtained from these two distinct principles in the context of various classes of combinatorial objects.

Resonances for graph directed Markov systems, and geometry of infinitely generated dynamical systems
http://hdl.handle.net/10023/719
In the first part of this thesis we transfer a result of Guillopé et al. concerning the
number of zeros of the Selberg zeta function for convex
cocompact Schottky groups to the setting of certain types of graph directed Markov systems (GDMS).
For these systems the zeta function will be a type of Ruelle zeta function.
We show that for a finitely generated primitive conformal GDMS S, which satisfies the strong separation
condition (SSC) and the nestedness condition (NC), we have for each
c>0 that the following holds, for each w \in\$C$ with Re(w)>c, \Im(w)>1 and for all k \in\$N$ sufficiently large:
log  zeta(w)  <<e^{delta(S).log(Imw)} and card{w \in\ Q(k)  zeta(w)=0} << k^{delta(S)}.
Here, Q(k)\subset\%C$ denotes a certain box of height k, and
delta(S) refers to the Hausdorff dimension of the limit set of S.
In the second part of this thesis we show that in any dimension
m \in\$N$ there are GDMSs for which the Hausdorff dimension of the uniformly radial limit set
is equal to a given arbitrary number d \in\(0,m) and the Hausdorff dimension of the Jørgensen limit set
is equal to a given arbitrary number j \in\ [0,m).
Furthermore, we derive various relations between the exponents of
convergence and the Hausdorff dimensions of certain different types of limit sets for iterated function systems (IFS), GDMSs, pseudo GDMSs and normal subsystems
of finitely generated GDMSs.
Finally, we apply our results to Kleinian groups and generalise
a result of Patterson by showing that in any dimension m \in\$N$ there
are Kleinian groups for which the Hausdorff dimension of their uniformly
radial limit set is less than a given arbitrary number d \in\ (0,m) and the Hausdorff dimension
of their Jørgensen limit set is equal to a given arbitrary number j \in\ [0,m).
20090624T00:00:00Z
Hille, Martial R.
In the first part of this thesis we transfer a result of Guillopé et al. concerning the
number of zeros of the Selberg zeta function for convex
cocompact Schottky groups to the setting of certain types of graph directed Markov systems (GDMS).
For these systems the zeta function will be a type of Ruelle zeta function.
We show that for a finitely generated primitive conformal GDMS S, which satisfies the strong separation
condition (SSC) and the nestedness condition (NC), we have for each
c>0 that the following holds, for each w \in\$C$ with Re(w)>c, \Im(w)>1 and for all k \in\$N$ sufficiently large:
log  zeta(w)  <<e^{delta(S).log(Imw)} and card{w \in\ Q(k)  zeta(w)=0} << k^{delta(S)}.
Here, Q(k)\subset\%C$ denotes a certain box of height k, and
delta(S) refers to the Hausdorff dimension of the limit set of S.
In the second part of this thesis we show that in any dimension
m \in\$N$ there are GDMSs for which the Hausdorff dimension of the uniformly radial limit set
is equal to a given arbitrary number d \in\(0,m) and the Hausdorff dimension of the Jørgensen limit set
is equal to a given arbitrary number j \in\ [0,m).
Furthermore, we derive various relations between the exponents of
convergence and the Hausdorff dimensions of certain different types of limit sets for iterated function systems (IFS), GDMSs, pseudo GDMSs and normal subsystems
of finitely generated GDMSs.
Finally, we apply our results to Kleinian groups and generalise
a result of Patterson by showing that in any dimension m \in\$N$ there
are Kleinian groups for which the Hausdorff dimension of their uniformly
radial limit set is less than a given arbitrary number d \in\ (0,m) and the Hausdorff dimension
of their Jørgensen limit set is equal to a given arbitrary number j \in\ [0,m).

Inhomogeneous selfsimilar sets and measures
http://hdl.handle.net/10023/682
The thesis consists of four main chapters. The first chapter includes an introduction to inhomogeneous selfsimilar sets and
measures. In particular, we show that these sets and measures
are natural generalizations of the well known selfsimilar sets and
measures. We then investigate the structure of these sets and measures. In the second chapter we study various fractal
dimensions (Hausdorff, packing and box dimensions) of inhomogeneous selfsimilar sets and compare our results with the wellknown results for (ordinary)
selfsimilar sets. In the third chapter we investigate the L^{q}
spectra and the Renyi dimensions of inhomogeneous selfsimilar
measures and prove that new multifractal phenomena, not exhibited by (ordinary) selfsimilar measures, appear in the inhomogeneous case.
Namely, we show that inhomogeneous selfsimilar measures may
have phase transitions which is in sharp contrast to the
behaviour of the
L^{q} spectra
of (ordinary) selfsimilar
measures satisfying the Open Set Condition. Then we study the significantly more difficult problem of computing the multifractal spectra
of inhomogeneous selfsimilar measures. We show that
the multifractal spectra
of
inhomogeneous selfsimilar
measures
may be nonconcave which is again in sharp contrast to the
behaviour of the
multifractal spectra
of (ordinary) selfsimilar
measures satisfying the Open Set Condition. Then we present a number of
applications of our results. Many of them are related to the notoriously difficult problem of computing (or simply obtaining nontrivial bounds) for the multifractal spectra of selfsimilar measures not satisfying the Open Set Condition. More precisely, we will show that our results provide a systematic approach to obtain nontrivial bounds (and in some cases even exact values) for the multifractal spectra of several large and interesting classes of selfsimilar measures not satisfying the Open Set Condition. In the fourth chapter we investigate the asymptotic behaviour of the Fourier transforms of
inhomogeneous selfsimilar measures and again we present a
number of applications of our results, in particular to nonlinear
selfsimilar measures.
20080101T00:00:00Z
Snigireva, Nina
The thesis consists of four main chapters. The first chapter includes an introduction to inhomogeneous selfsimilar sets and
measures. In particular, we show that these sets and measures
are natural generalizations of the well known selfsimilar sets and
measures. We then investigate the structure of these sets and measures. In the second chapter we study various fractal
dimensions (Hausdorff, packing and box dimensions) of inhomogeneous selfsimilar sets and compare our results with the wellknown results for (ordinary)
selfsimilar sets. In the third chapter we investigate the L^{q}
spectra and the Renyi dimensions of inhomogeneous selfsimilar
measures and prove that new multifractal phenomena, not exhibited by (ordinary) selfsimilar measures, appear in the inhomogeneous case.
Namely, we show that inhomogeneous selfsimilar measures may
have phase transitions which is in sharp contrast to the
behaviour of the
L^{q} spectra
of (ordinary) selfsimilar
measures satisfying the Open Set Condition. Then we study the significantly more difficult problem of computing the multifractal spectra
of inhomogeneous selfsimilar measures. We show that
the multifractal spectra
of
inhomogeneous selfsimilar
measures
may be nonconcave which is again in sharp contrast to the
behaviour of the
multifractal spectra
of (ordinary) selfsimilar
measures satisfying the Open Set Condition. Then we present a number of
applications of our results. Many of them are related to the notoriously difficult problem of computing (or simply obtaining nontrivial bounds) for the multifractal spectra of selfsimilar measures not satisfying the Open Set Condition. More precisely, we will show that our results provide a systematic approach to obtain nontrivial bounds (and in some cases even exact values) for the multifractal spectra of several large and interesting classes of selfsimilar measures not satisfying the Open Set Condition. In the fourth chapter we investigate the asymptotic behaviour of the Fourier transforms of
inhomogeneous selfsimilar measures and again we present a
number of applications of our results, in particular to nonlinear
selfsimilar measures.

Simplicity in relational structures and its application to permutation classes
http://hdl.handle.net/10023/431
The simple relational structures form the units, or atoms, upon which all other relational structures are constructed by means of the substitution decomposition. This decomposition appears to have first been introduced in 1953 in a talk by FraÃ¯ssÃ©, though it did not appear in an article until a paper by Gallai in 1967. It has subsequently been frequently rediscovered from a wide variety of perspectives, ranging from game theory to combinatorial optimization.
Of all the relational structures  a set which also includes graphs, tournaments and posets  permutations are receiving ever increasing amounts of attention. A simple permutation is one that maps every nontrivial contiguous set of indices to a set of indices that is never contiguous. Simple permutations and intervals of permutations are important in biomathematics, while permutation classes  downsets under the pattern containment order  arise naturally in settings ranging from sorting to algebraic geometry.
We begin by studying simple permutations themselves, though always aim to establish this theory within the broader context of relational structures. We first develop the technology of "pin sequences", and prove that every sufficiently long simple permutation must contain either a long horizontal or parallel alternation, or a long pin sequence. This gives rise to a simpler unavoidable substructures result, namely that every sufficiently long simple permutation contains a long alternation or oscillation.
ErdÅ s, Fried, Hajnal and Milner showed in 1972 that every tournament could be extended to a simple tournament by adding at most two additional points. We prove analogous results for permutations, graphs, and posets, noting that in these three cases we may need to extend a structure by adding (n+1)/2 points in the case of permutations and posets, and logâ (n+1) points in the graph case.
The importance of simple permutations in permutation classes has been well established in recent years. We extend this knowledge in a variety of ways, first by showing that, in a permutation class containing only finitely many simple permutations, every subset defined by properties belonging to a finite "querycomplete set" is enumerated by an algebraic generating function. Such properties include being an even or alternating permutation, or avoiding generalised (blocked or barred) permutations. We further indicate that membership of a permutation class containing only finitely many simple permutations can be computed in linear time.
Using the decomposition of simple permutations, we establish, by representing pin sequences as a language over an eightletter alphabet, that it is decidable if a permutation class given by a finite basis contains only finitely many simple permutations. We also discuss possible approaches to the same question for other relational structures, in particular the difficulties that arise for graphs. The pin sequence technology provides a further result relating to the wreath product of two permutation classes, namely that C â D is finitely based whenever D does not admit arbitrarily long pin sequences. As a partial converse, we also exhibit a number of explicit examples of wreath products that are not finitely based.
20071130T00:00:00Z
Brignall, Robert
The simple relational structures form the units, or atoms, upon which all other relational structures are constructed by means of the substitution decomposition. This decomposition appears to have first been introduced in 1953 in a talk by FraÃ¯ssÃ©, though it did not appear in an article until a paper by Gallai in 1967. It has subsequently been frequently rediscovered from a wide variety of perspectives, ranging from game theory to combinatorial optimization.
Of all the relational structures  a set which also includes graphs, tournaments and posets  permutations are receiving ever increasing amounts of attention. A simple permutation is one that maps every nontrivial contiguous set of indices to a set of indices that is never contiguous. Simple permutations and intervals of permutations are important in biomathematics, while permutation classes  downsets under the pattern containment order  arise naturally in settings ranging from sorting to algebraic geometry.
We begin by studying simple permutations themselves, though always aim to establish this theory within the broader context of relational structures. We first develop the technology of "pin sequences", and prove that every sufficiently long simple permutation must contain either a long horizontal or parallel alternation, or a long pin sequence. This gives rise to a simpler unavoidable substructures result, namely that every sufficiently long simple permutation contains a long alternation or oscillation.
ErdÅ s, Fried, Hajnal and Milner showed in 1972 that every tournament could be extended to a simple tournament by adding at most two additional points. We prove analogous results for permutations, graphs, and posets, noting that in these three cases we may need to extend a structure by adding (n+1)/2 points in the case of permutations and posets, and logâ (n+1) points in the graph case.
The importance of simple permutations in permutation classes has been well established in recent years. We extend this knowledge in a variety of ways, first by showing that, in a permutation class containing only finitely many simple permutations, every subset defined by properties belonging to a finite "querycomplete set" is enumerated by an algebraic generating function. Such properties include being an even or alternating permutation, or avoiding generalised (blocked or barred) permutations. We further indicate that membership of a permutation class containing only finitely many simple permutations can be computed in linear time.
Using the decomposition of simple permutations, we establish, by representing pin sequences as a language over an eightletter alphabet, that it is decidable if a permutation class given by a finite basis contains only finitely many simple permutations. We also discuss possible approaches to the same question for other relational structures, in particular the difficulties that arise for graphs. The pin sequence technology provides a further result relating to the wreath product of two permutation classes, namely that C â D is finitely based whenever D does not admit arbitrarily long pin sequences. As a partial converse, we also exhibit a number of explicit examples of wreath products that are not finitely based.

On permutation classes defined by token passing networks, gridding matrices and pictures : three flavours of involvement
http://hdl.handle.net/10023/237
The study of pattern classes is the study of the involvement order on finite
permutations. This order can be traced back to the work of Knuth. In recent
years the area has attracted the attention of many combinatoralists and there
have been many structural and enumerative developments. We consider permutations
classes defined in three different ways and demonstrate that asking the same
fixed questions in each case
motivates a different view of involvement. Token passing networks encourage us
to consider permutations as sequences of integers; grid classes encourage us to
consider them as point sets; picture classes, which are developed for the first
time in this thesis, encourage a purely geometrical approach. As we journey
through each area we present several new results.
We begin by
studying the basic definitions of a permutation. This is followed by a discussion
of the questions one would wish to ask of permutation classes. We concentrate on
four particular areas: partial well order, finite basis, atomicity and
enumeration. Our third chapter asks these questions of token passing networks;
we also develop the concept of completeness
and show that it is decidable whether or not a particular network is
complete. Next we move onto grid classes, our analysis using generic sets yields
an algorithm for determining when a grid class is atomic; we also present a new
and elegant proof which demonstrates that certain grid classes are partially
well ordered.
The final chapter
comprises the development and analysis of picture classes. We completely classify
and enumerate those permutations which can be drawn from a circle, those which can be drawn from an X and
those which can be drawn from some convex polygon. We exhibit the first
uncountable set of closed classes to be found in a natural setting; each class
is drawn from three parallel lines. We present a permutation version
of the famous `happy ending' problem of Erdös and Szekeres. We conclude with a
discussion of permutation classes in higher dimensional space.
20070619T00:00:00Z
Waton, Stephen D.
The study of pattern classes is the study of the involvement order on finite
permutations. This order can be traced back to the work of Knuth. In recent
years the area has attracted the attention of many combinatoralists and there
have been many structural and enumerative developments. We consider permutations
classes defined in three different ways and demonstrate that asking the same
fixed questions in each case
motivates a different view of involvement. Token passing networks encourage us
to consider permutations as sequences of integers; grid classes encourage us to
consider them as point sets; picture classes, which are developed for the first
time in this thesis, encourage a purely geometrical approach. As we journey
through each area we present several new results.
We begin by
studying the basic definitions of a permutation. This is followed by a discussion
of the questions one would wish to ask of permutation classes. We concentrate on
four particular areas: partial well order, finite basis, atomicity and
enumeration. Our third chapter asks these questions of token passing networks;
we also develop the concept of completeness
and show that it is decidable whether or not a particular network is
complete. Next we move onto grid classes, our analysis using generic sets yields
an algorithm for determining when a grid class is atomic; we also present a new
and elegant proof which demonstrates that certain grid classes are partially
well ordered.
The final chapter
comprises the development and analysis of picture classes. We completely classify
and enumerate those permutations which can be drawn from a circle, those which can be drawn from an X and
those which can be drawn from some convex polygon. We exhibit the first
uncountable set of closed classes to be found in a natural setting; each class
is drawn from three parallel lines. We present a permutation version
of the famous `happy ending' problem of Erdös and Szekeres. We conclude with a
discussion of permutation classes in higher dimensional space.