Related papers: String C-groups of 2-power order project onto a co…

We prove that the highest rank of a string C-group constructed from an alternating group $Alt_n$ is 0 if $n=3, 4, 6, 7, 8$; 3 if $n=5$; 4 if $n=9$; 5 if $n=10$; 6 if $n=11$; and $\lfloor\frac{n-1}{2}\rfloor$ if $n\geq 12$. This solves a…

A code ${\mathcal C}$ is a subset of the vertex set of a Hamming graph $H(n,q)$, and ${\mathcal C}$ is $2$-neighbour-transitive if the automorphism group $G={\rm Aut}({\mathcal C})$ acts transitively on each of the sets ${\mathcal C}$,…

We introduce the notion of a $c$-category, which is a kind of category whose behaviour is controlled by connective ring spectra. More precisely, any $c$-category admits a finite step resolution by categories of compact modules over…

The iterated monodromy group of a post-critically finite complex polynomial of degree d \geq 2 acts naturally on the complete d-ary rooted tree T of preimages of a generic point. This group, as well as its pro-finite completion, act on the…

The algebraic degree $Deg(G)$ of a graph $G$ is the dimension of the splitting field of the adjacency polynomial of $G$ over the field $\mathbb{Q}$. It can be shown that for every positive integer $d$, there exists a circulant graph with…

This work continues the study of the properties of finitely constrained groups of binary tree automorphisms in terms of their Hausdorff dimension. We prove that there are exactly $2^{2d-3}$ finitely constrained groups of binary tree…

Previous research established that the maximal rank of the abstract regular polytopes whose automorphism group is a transitive proper subgroup of $\mbox{S}_n$ is $n/2 + 1$. Up to isomorphism and duality, when $n\geq 12$, there are only two…

For a H\'enon map of the form $H(x, y) = (y, p(y) - ax)$, where $p$ is a polynomial of degree at least two and $a \not= 0$, it is known that the sub-level sets of the Green's function $G^+_H$ associated with $H$ are Short $\mathbb C^2$'s.…

Let $G$ be a finite group. The group pseudo-algebra of $G$ is defined as the multi-set $C(G)=\{(d,m_G(d))\mid d\in{\rm Cod}(G)\},$ where $m_G(d)$ is the number of irreducible characters of with codegree $d\in {\rm Cod}(G)$. We show that…

For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$…

We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…

In this paper, string C-groups of all ranks $3 \leq r \leq \frac{n}{2}$ are provided for each alternating group $A_n$, $n \geq 12$. As the string C-group representations of $A_n$ have also been classified for $n \leq 11$, and it is known…

In this paper, we classify regular polytopes with automorphism groups of order $2^n$ and Schl\"afli types $\{4, 2^{n-3}\}, \{4, 2^{n-4}\}$ and $\{4, 2^{n-5}\}$ for $n \geq 10$, therefore giving a partial answer to a problem proposed by…

The twin-width of a graph $G$ is the minimum integer $d$ such that $G$ has a $d$-contraction sequence, that is, a sequence of $|V(G)|-1$ iterated vertex identifications for which the overall maximum number of red edges incident to a single…

If $\Gamma$ is a string C-group which is isomorphic to a transitive subgroup of the symmetric group Sym(n) (other than Sym(n) and the alternating group Alt(n)), then the rank of $\Gamma$ is at most $n/2+1$, with finitely many exceptions…

We study endomorphisms of a free group of finite rank by means of their action on specific sets of elements. In particular, we prove that every endomorphism of the free group of rank 2 which preserves an automorphic orbit (i.e., acts ``like…

It is known that a finite group with an automorphism $\varphi$ of coprime order has a soluble radical of $(|\varphi|,|C_G(\varphi)|)$-bounded Fitting height and index. We extend this classic result as follows. Let $f(x) = a_0 + a_1 \cdot x…

We study the existence and structure of $d$-polytopes for which the number $f_1$ of edges is small compared to the number $f_0$ of vertices. Our results are more elegantly expressed in terms of the excess degree of the polytope, defined as…

An abstract polytope of rank n is said to be chiral if its automorphism group has precisely two orbits on the flags, such that adjacent flags belong to distinct orbits. The present paper describes a general method for deriving new finite…

Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They…