Related papers: The Finitary Andrews-Curtis Conjecture
Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…
In this expository article intended to be accessible to undergraduate students we introduce a finite abelian group that can be associated to any finite connected graph. This group can be defined in an elementary combinatorial way in terms…
T.C. Burness and S.D. Scott \cite{3} classified finite groups $G$ such that the number of prime order subgroups of $G$ is greater than $|G|/2-1$. In this note, we study finite groups $G$ whose subgroup graph contains a vertex of degree…
Several properly countable unions of algebraic sets in $\mathbb{C}^n$ are definable in $\mathbb{C}(t)$ including the set CM of $j$-invariants of complex elliptic curves with complex multiplication. It has been suggested that one could prove…
Assume that the section conjecture holds over number fields. We prove then that it holds for a broad class of curves defined over finitely generated extensions of $\mathbb{Q}$. This class contains every projective, hyperelliptic curve,…
An arithmetical structure on a finite, connected graph without loops is given by an assignment of positive integers to the vertices such that, at each vertex, the integer there is a divisor of the sum of the integers at adjacent vertices,…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
The FPP conjecture, proposed by J. Adams, S. Miller, and D. Vogan and proved by D. Davis and L. Mason-Brown in arXiv:2411.01372, imposes a strong upper bound on the infinitesimal character of a unitary representation of a real reductive…
Barbieri recently showed that the finite graphs realising any given finite automorphism group have unbounded genus, answering a question of Cornwell et al. In this note we give a short proof of a stronger result: they have unbounded clique…
We develop new computational methods for studying potential counterexamples to the Andrews-Curtis conjecture, in particular, Akbulut-Kurby examples AK(n). We devise a number of algorithms in an attempt to disprove the most interesting…
We use the theory of group actions on profinite trees to prove that the fundamental group of a finite, 1-acylindrical graph of free groups with finitely generated edge groups is conjugacy separable. This has several applications: we prove…
In this paper, building among others on earlier works by U. Krause and C. Zahlten (dealing with the case of cyclic groups), we obtain a new upper bound for the little cross number valid in the general case of arbitrary finite Abelian…
In the present paper, we prove, for a large class of elliptic curves defined over $\mathbb{Q}$, the existence of an explicit infinite family of quadratic twists with analytic rank $0$. In addition, we establish the $2$-part of the…
This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…
We reduce the classification of finite extensions of function fields (of curves over finite fields) with the same class number to a finite computation; complete this computation in all cases except when both curves have base field…
We prove that the gcd of certain infinite number of integers associated to generalised arithmetic progressions remains bounded independent of the progression. Using this we also get bounds on the indices of certain congruence subgroups of…
We classify the factorizations of finite classical groups with nonsolvable factors, completing the classification of factorizations of finite almost simple groups.
We give a new proof of a_4\phi_3 summation due to G.E. Andrews and confirm another_4\phi_3 summation conjectured by him recently. Some variations of these two_4\phi_3 summations are also given.
This note contains a report of a proof by computer that the Fibonacci group F(2,9) is automatic. The automatic structure can be used to solve the word problem in the group. Furthermore, it can be seen directly from the word-acceptor that…
Two finitely generated groups have the same set of finite quotients if and only if their profinite completions are isomorphic. Consider the map which sends (the isomorphism class of) an S-arithmetic group to (the isomorphism class of) its…