Related papers: Graham Higman's PORC theorem
In two important papers from 1960 Graham Higman introduced the notion of PORC functions, and he proved that for any given positive integer $n$ the number of $p$-class two groups of order $p^n$ is a PORC function of $p$. A key result in his…
We prove that the number of groups of order $p^n$ whose Frattini subgroup is central is for fixed $n$ a PORC (`polynomial on residue classes') function of $p$. This extends a result of G. Higman.
We prove that the number of immediate descendants of order $p^10$ of $G_p$ is not PORC (Polynomial On Residue Classes) where $G_p$ is the $p$-group of order $p^9$ defined by du Sautoy's nilpotent group encoding the elliptic curve…
Much progress has been made on the problem of calculating $g(n)$ for various classes of integers $n$, where $g$ is the group-counting function. We approach the inverse problem of solving the equations $g(n) = 6$ and $g(n) = 7$ in $n$. The…
A classical conjecture by Graham Higman states that the number of conjugacy classes of $U_n(q)$, the group of upper triangular $n\times n$ matrices over $\mathbb{F}_q$, is polynomial in $q$, for all $n$. In this paper we present both…
An unresolved conjecture by Graham Higman states that for all $n\geq 1$ the number of conjugacy classes of the group of $n \times n$ unitriangular matrices with entries in the finite field $\mathbb{F}_q$ is a polynomial in $q$. In this…
Generalized Higman's Theorem is the direct counterpart of Higman's Theorem that asserts the closure of the class of \emph{better} quasi-orders, instead of the class of \emph{well} quasi-orders, under the construction $P\mapsto P^{<\omega}$…
In this work, we use probability groups, introduced by Harrison in 1979, as a tool to study a semisimple Hopf algebra $H$ with a commutative character ring and prove that the algebra generalized by the dual probability group is the center…
Let R denote the reals, and let h: R^n --> R be a continuous, piecewise-polynomial function. The Pierce-Birkhoff conjecture (1956) is that any such h is representable in the form sup_i inf_j f_{ij}, for some finite collection of polynomials…
In this article, we shall generalize a theorem due to Frobenius in group theory, which asserts that if $p$ is a prime and $p^{r}$ divides the order of a finite group, then the number of subgroups of order $p^{r}$ is $\equiv$ 1(mod $p$).…
An introduction to the universal algebra approach to Higman-Thompson groups (including Thompson's group $V$) is given, following a series of lectures by Graham Higman in 1973. In these talks, Higman outlined an algorithm for the conjugacy…
Building upon previous results, a classification is given of finite $p$-groups of which subgroups of order $p$ are all fused. This completes the classification problem dated back to Higman 1963 on the so-called Suzuki $2$-groups, and…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…
In 1951, Higman constructed a remarkable group $$H=\left\langle a,b,c,d \, \left| \, b^a = b^2, c^b = c^2, d^c = d^2, a^d = a^2 \right. \right\rangle$$ and used it to produce the first examples of infinite simple groups. By studying fixed…
Let G be a group of permutations of a denumerable set E. The profile of G is the function phi which counts, for each n, the number phi(n) of orbits of G acting on the n-subsets of E. Counting functions arising this way, and their associated…
A sequence $s_1,s_2,\ldots, s_k$ of elements of a group $G$ is called a valid ordering if the partial products $s_1, s_1 s_2, \ldots, s_1\cdots s_k$ are all distinct. A long-standing problem in combinatorial group theory asks whether, for a…
We use the Bateman--Horn Conjecture from number theory to give strong evidence of a positive answer to Peter Neumann's question, whether there are infinitely many simple groups of order a product of six primes. (Those with fewer than six…
Let $n=2g+2$ be a positive even integer, $f(x)$ a degree $n$ complex polynomial without multiple roots and $C_f: y^2=f(x)$ the corresponding genus $g$ hyperelliptic curve over the field $\C$ of complex numbers. Let a $(g-1)$-dimensional…
A 1971 conjecture of Graham (later repeated by Erd\H{o}s and Graham) asserts that every set $A \subseteq \mathbb{F}_p \setminus \{0\}$ has an ordering whose partial sums are all distinct. We prove this conjecture for sets of size $|A|…
A conjecture of Boone and Higman from the 1970's asserts that a finitely generated group $G$ has solvable word problem if and only if $G$ can be embedded into a finitely presented simple group. We comment on the history of this conjecture…