Related papers: The structure of $3$-pyramidal groups

A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points satisfying (i) every two blocks intersect each other in $\lambda$ points for a fixed $\lambda < v$ (ii) there…

We define a 3-loop group $\Omega^3G$ as a subgroup of smooth maps from a 3-ball to a Lie group $G$, and then construct a 2-group based on an automorphic action on the Mickelsson-Faddeev extension of $\Omega^3G$. In this we follow the…

A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor,…

Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…

It is well known that every compact oriented 3-manifold admits an ideal triangulation, and that any two such triangulations with at least two ideal tetrahedra are related by a sequence of Pachner $2$-$3$ moves. Motivated by constructions in…

This paper generalizes the basic notions of additive and multiplicative combinatorics to the setting of group actions: if $G$ is a group acting on a set $X$, and we have subsets $A\subseteq G$ and $Y\subseteq X$ such that the set of pairs…

This paper investigates $2$-$(v,5,\lambda)$ designs $\mathcal{D}$ admitting a block-transitive automorphism group $G$. We first prove that if $G$ is point-imprimitive, then $v$ must be one of 16, 21, or 81. We further provide a complete…

We give a combinatorial description of homotopy groups of $\Sigma K(\pi,1)$. In particular, all of the homotopy groups of the $3$-sphere are combinatorially given.

A strong triangle blocking arrangement is a geometric arrangement of some line segments in a triangle with certain intersection properties. It turns out that they are closely related to blocking sets. Our aim in this paper is to prove a…

We introduce a geometric dynamical system where iteration is defined as a cycling composition of different maps acting on a space composed of three or more lines in $\mathbb{R}^2$. This system is motivated by the dynamics of iterated…

By an additive structure on a hypersurface S in projective space we mean an effective action of commutative unipotent group on projective space which leaves S invariant and acts on S with an open orbit. It is known that these structures…

Let $D_{n}$ be the dihedral group of order $n$. The structure of the unit group $U(F(C_3 \times D_{10}))$ of the group algebra $F(C_3 \times D_{10})$ over a finite field $F$ of characteristic $3$ is given in \cite{sh13}. In this article,…

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…

We study the structure of a Leibniz triple system $\mathcal{E}$ graded by an arbitrary abelian group $G$ which is considered of arbitrary dimension and over an arbitrary base field $\mathbb{K}$. We show that $\mathcal{E}$ is of the form…

The Reidemeister theorem states that any link in $3$-space can be encoded by a diagram (a suitably decorated projection) on a plane, and provides a finite set of combinatorial moves relating two diagrams of the same link up to isotopy. In…

We introduce supergroup analogues of 3-manifold invariants $\hat{Z}$, also known as homological blocks, which were previously considered for ordinary compact semisimple Lie groups. We focus on superunitary groups, and work out the case of…

Given a graph $G$, a configuration space of $G$ can be thought of as the set of all possible configurations of "robots" which can move throughout $G$, subject to some constraints. We introduce a type of configuration space which we call…

We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…

A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous deformations of the vertices arise from…

We explicitly compute the lower algebraic K-theory of the split three-dimensional crystallographic groups; i.e., the groups G that act properly and cocompactly on three-dimensional Euclidean space by isometries, such that the natural map…