We show that an elation generalized quadrangle that has p+1 lines on each point, for some prime p, is classical or arises from a flock of a quadratic cone (that is, is a flock quadrangle).

We consider the Fourier restriction operators associated to certain degenerate curves in ℝd for which the highest torsion vanishes. We prove estimates with respect to affine arclength and with respect to the Euclidean arclength measure on the curve. The estimates have certain uniform features, and the affine arclength results cover families of flat curves.

The core of a graph Γ is the smallest graph Δ that is homomorphically equivalent to Γ (that is, there exist homomorphisms in both directions). The core of Γ is unique up to isomorphism and is an induced subgraph of Γ. We give a construction in some sense dual to the core. The hull of a graph Γ is a graph containing Γ as a spanning subgraph, admitting all the endomorphisms of Γ, and having as core a complete graph of the same order as the core of Γ. This construction is related to the notion of a synchronizing permutation group, which arises in semigroup theory; we provide some more insight by characterizing these permutation groups in terms of graphs. It is known that the core of a vertex-transitive graph is vertex-transitive. In some cases we can make stronger statements: for example, if Γ is a non-edge-transitive graph, we show that either the core of Γ is complete, or Γ is its own core. Rank-three graphs are non-edge-transitive. We examine some families of these to decide which of the two alternatives for the core actually holds. We will see that this question is very difficult, being equivalent in some cases to unsolved questions in finite geometry (for example, about spreads, ovoids and partitions into ovoids in polar spaces).

An S3-involution graph for a group G is a graph with vertex set a union of conjugacy classes of involutions of G such that two involutions are adjacent if they generate an S3-subgroup in a particular set of conjugacy classes. We investigate such graphs in general and also for the case where G=PSL(2,q).

We prove that if f:I=[0,1]→I is a C3-map with negative Schwarzian derivative, nonflat critical points and without wild attractors, then exactly one of the following alternatives must occur: (i) R(f) has full Lebesgue measure λ; (ii) both S(f) and Scramb(f) have positive measure. Here R(f), S(f), and Scramb(f) respectively stand for the set of approximately periodic points of f, the set of sensitive points to the initial conditions of f, and the two-dimensional set of points (x,y) such that {x,y} is a scrambled set for f. Also, we show that if f is piecewise monotone and has no wandering intervals, then either λ(R(f))=1 or λ(S(f))>0, and provide examples of maps g,h of this type satisfying S(g)=S(h)=I such that, on the one hand, λ(R(g))=0 and λ2 (Scramb (g))=0 , and, on the other hand, λ(R(h))=1 .

An enumeration result for orientably regular hypermaps of a given type with automorphism groups isomorphic to PSL(2,q) or PGL(2,q) can be extracted from a 1969 paper by Sah. We extend the investigation to orientable reflexible hypermaps and to nonorientable regular hypermaps, providing many more details about the associated computations and explicit generating sets for the associated groups.

In 2006 we completed the proof of a five-part conjecture that was made in 1977 about a family of groups related to trivalent graphs. This family covers all 2-generator, 2-relator groups where one relator specifies that a generator is an involution and the other relator has three syllables. Our proof relies upon detailed but general computations in the groups under question. The proof is theoretical, but based upon explicit proofs produced by machine for individual cases. Here we explain how we derived the general proofs from specific cases. The conjecture essentially addressed only the finite groups in the family. Here we extend the results to infinite groups, effectively determining when members of this family of finitely presented groups are simply isomorphic to a specific quotient.

We derive bivariate polynomial formulae for cocycles and coboundaries in Z2(ℤpn,ℤpn), and a basis for the (pn−1−n)-dimensional GF(pn)-space of coboundaries. When p=2 we determine a basis for the -dimensional GF(2n)-space of cocycles and show that each cocycle has a unique decomposition as a direct sum of a coboundary and a multiplicative cocycle of restricted form.

It is known that for a given and a given strictly stationary sequence of random variables, the p-norms of the partial sums are bounded if and only if the sequence consists of successive differences from another strictly stationary sequence with finite p-norm. Here this is generalized to random fields, and the assumption of stationarity is relaxed. The index is included.

We give a new proof that a finitely generated congruence-distributive variety has finitely determined syntactic congruences (or, equivalently, term finite principal congruences), and show that the same does not hold for finitely generated congruence-permutable varieties, even under the additional assumption that the variety is residually very finite.

We study Frobenius groups acting on curves.

A construction of finite semifield planes of order n using irreducible semilinear transformations on a finite vector space of size n is shown to produce fewer than different nondesarguesian planes.

This note contains some remarks on generating pairs for automorphism groups of free groups. There has been significant use of electronic assistance. Little of this is used to verify the results.

We prove that a finitely generated semigroup whose word problem is a one-counter language has a linear growth function. This provides us with a very strong restriction on the structure of such a semigroup, which, in particular, yields an elementary proof of a result of Herbst, that a group with a one-counter word problem is virtually cyclic. We prove also that the word problem of a group is an intersection of finitely many one-counter languages if and only if the group is virtually abelian.

A submonoid S of a monoid M is said to be cofull if it contains the group of units of M. We extract from the work of Easdown, East and FitzGerald (2002) a sufficient condition for a monoid to embed as a cofull submonoid of the coset monoid of its group of units, and show further that this condition is necessary. This yields a simple description of the class of finite monoids which embed in the coset monoids of their group of units. We apply our results to give a simple proof of the result of McAlister [D. B. McAlister, ‘Embedding inverse semigroups in coset semigroups’, Semigroup Forum20 (1980), 255–267] which states that the symmetric inverse semigroup on a finite set X does not embed in the coset monoid of the symmetric group on X. We also explore examples, which are necessarily infinite, of embeddings whose images are not cofull.

We exhibit an interesting Cayley graph X of the elementary abelian group Z26 with the property that Aut(X) contains two regular subgroups, exactly one of which is normal. This demonstrates the existence of two subsets of Z26 that yield isomorphic Cayley graphs, even though the two subsets are not equivalent under the automorphism group of Z26.

We consider a random algebraic polynomial of the form Pn,θ,α(t)=θ0ξ0+θ1ξ1t+⋯+θnξntn, where ξk, k=0,1,2,…,n have identical symmetric stable distribution with index α, 0<α≤2. First, for a general form of θk,α≡θk we derive the expected number of real zeros of Pn,θ,α(t). We then show that our results can be used for special choices of θk. In particular, we obtain the above expected number of zeros when . The latter generate a polynomial with binomial elements which has recently been of significant interest and has previously been studied only for Gaussian distributed coefficients. We see the effect of α on increasing the expected number of zeros compared with the special case of Gaussian coefficients.

A star is a planar set of three lines through a common point in which the angle between each pair is 60∘. A set of lines through a point in which the angle between each pair of lines is 60 or 90∘ is star-closed if for every pair of its lines at 60∘ the set contains the third line of the star. In 1976 Cameron, Goethals, Seidel and Shult showed that the indecomposable star-closed sets in Euclidean space are the root systems of types An, Dn, E6, E7 and E8. This result was a key part of their determination of all graphs with least eigenvalue −2. Subsequently, Cvetković, Rowlinson and Simić determined all star-closed extensions of these line systems. We generalize this result on extensions of line systems to complex n-space equipped with a hermitian inner product. There is one further infinite family, and two exceptional types arising from Burkhardt and Mitchell’s complex reflection groups in dimensions five and six. The proof is a geometric version of Mitchell’s classification of complex reflection groups in dimensions greater than four.

Let G be isomorphic to a group H satisfying SL(d,q)≤H≤GL(d,q) and let W be an irreducible FqG-module of dimension at most d2. We present a Las Vegas polynomial-time algorithm which takes as input W and constructs a d-dimensional projective representation of G.

A cover of a group is a finite collection of proper subgroups whose union is the whole group. A cover is minimal if no cover of the group has fewer members. It is conjectured that a group with a minimal cover of nilpotent subgroups is soluble. It is shown that a minimal counterexample to this conjecture is almost simple and that none of a range of almost simple groups are counterexamples to the conjecture.