Related papers: Classification of finite groups that admit an orie…

We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…

By considering appropriate finite covering spaces of closed non-orientable surfaces, we construct linear representations of their mapping class group which have finite index image in certain big arithmetic groups.

In contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…

This report is an account of freely representable groups, which are finite groups admitting linear representations whose only fixed point for a nonidentity element is the zero vector. The standard reference for such groups is Wolf (1967)…

We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…

The orbifold group of the Borromean rings with singular angle 90 degrees, $U$, is a universal group, because every closed oriented 3--manifold $M^{3}$ occurs as a quotient space $M^{3} = H^{3}/G$, where $G$ is a finite index subgroup of…

We provide new examples of groups without rational cross-sections (also called regular normal forms), using connections with bounded generation and rational orders on groups. Specifically, our examples are extensions of infinite torsion…

Several graph properties are characterized as the class of graphs that admit an orientation avoiding finitely many oriented structures. For instance, if $F_k$ is the set of homomorphic images of the directed path on $k+1$ vertices, then a…

An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…

We prove that all finitely generated fully residually free groups (limit groups) have a sequence of finite dimensional unitary representations that `strongly converge' to the regular representation of the group. The corresponding statement…

Which groups can occur as the group of units in a ring? Such groups are called realizable. Though the realizable members of several classes of groups have been determined (e.g., cyclic, odd order, alternating, symmetric, finite simple,…

Let $p$ be a prime and $G$ a subgroup of $GL_d(p)$. We define $G$ to be $p$-exceptional if it has order divisible by $p$, but all its orbits on vectors have size coprime to $p$. We obtain a classification of $p$-exceptional linear groups.…

Let $G$ be a finite group. The co-prime order graph of $G$ is the graph whose vertex set is $G$, and two distinct vertices $x,y$ are adjacent if gcd$(o(x),o(y))$ is either $1$ or a prime, where $o(x)$ and $o(y)$ are the orders of $x$ and…

In this article, we classify disconnected reductive groups over an algebraically closed field with a few caveats. Internal parts of our result are both a classification of finite groups and a classification of integral representations of a…

We show that the classification of simple finite group schemes over an algebraically closed field reduces to the classification of abstract simple finite groups and of simple restricted Lie algebras in positive characteristic. Both these…

We show that a group admits a planar, finitely generated Cayley graph if and only if it admits a special kind of group presentation we introduce, called a planar presentation. Planar presentations can be recognised algorithmically. As a…

Let G be a finite group and let Irr(G) be the set of all irreducible complex characters of G. Let cd(G) be the set of all character degrees of G and denote by \rho(G) the set of primes which divide some character degrees of G. The prime…

Let $K_{m[n]}$ be the complete multipartite graph with $m$ parts, while each part contains $n$ vertices. The orientably-regular embeddings of complete graphs $K_{m[1]}$ have been determined by Biggs (1971) \cite{Big1}, James and Jones…

Let $F$ and $G$ be simple finite oriented graphs (without symmetric arcs). A graph $G$ is called $F$-irregular if any two distinct vertices in $G$ belong to a different number of subgraphs of $G$ isomorphic to $F$. In this paper, we…

By an $\ell$-group $G$ we mean a lattice-ordered abelian group. This paper is concerned with the category $\FP$ of finitely presented {\it unital} $\ell$-groups, those $\ell$-groups having a distinguished order-unit $u$. Using the duality…