Related papers: Subgroups of Finite Fields As Cap Sets
In this article we present a characterization of elliptic curves defined over a finite field Fq which possess a rational subgroup of order three. There are two posible cases depending on the rationality of the points in these groups. We…
The first open case of the Brown, Erd\H{o}s, S\'os conjecture is equivalent to the following; For every $c>0$ there is a threshold $n_0$ so that if a quasigroup has order $n\geq n_0$ then for every subset of triples of the form $(a,b,ab),$…
In the paper it is proven that Carter subgroups of a finite group are conjugate. A complete classification of Carter subgroups in finite almost simple groups is also obtained.
In this paper we investigate the structure of finite $p$-groups with the property that every subgroup of index $p^i$ is powerful for some $i$. For odd primes $p$, we show that under certain conditions these groups must be potent. Then,…
Let $G$ be a finite group and assume $p$ is a prime dividing the order of $G$. Suppose for any such $p$, that every two abelian $p$-subgroups of $G$ of equal order are conjugate. The structure of such a group $G$ has been settled in this…
A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of allowed actions. We provide criteria for determining when a…
We study the structure of the zero set of a finite point charge electrical field $F = (X,Y,Z)$ in $\mathbb R^3$. Indeed, mostly we focus on a finite point charge electrical field $F =(X,Y)$ in $\mathbb R^2$. The well-known conjecture is…
A representation field for a non-maximal order H in a central simple algebra A is a subfield of the spinor class field of maximal orders which determines the set of spinor genera of maximal orders representing H. In our previous work we…
We investigate the automorphism group of the substructure ordering of finite directed graphs. The second author conjectured that it is isomorphic to the 768-element group $(\mathbb{Z}_2^4 \times S_4)\rtimes_{\alpha} \mathbb{Z}_2$. Though…
The (proper) power graph of a group is a graph whose vertex set is the set of all (nontrivial) elements of the group and two distinct vertices are adjacent if one is a power of the other. Various kinds of planarity of (proper) power graphs…
We classify closed abelian subgroups of the simple groups $G_2$, $F_4$, $Aut(so(8))$ having centralizer the same dimension as the dimension of the subgroup, as well as finite abelian subgroups of certain spin and half-spin groups having…
In this paper, we consider covers of finite groups by centralizers of elements. We show that the set of centralizers that are maximal under the partial ordering form a cover of the group. We also show that the set of centralizers that are…
We obtain several results concerning the concept of isotypic structures. Namely we prove that any field of finite transcendence degree over a prime subfield is defined by types; then we construct isotypic but not isomorphic structures with…
The power graph $\mathcal{P}(G)$ of a finite group $G$ is a graph whose vertex set is the group $G$ and distinct elements $x,y\in G$ are adjacent if one is a power of the other, that is, $x$ and $y$ are adjacent if $x\in\langle y\rangle$ or…
In this paper, we investigate a problem concerning quartets, which are a particular type of tree on four leaves. Loosely speaking, a set of quartets is said to be `definitive' if it completely encapsulates the structure of some larger tree,…
A finite $p$-group $G$ is called \textit{powerful} if either $p$ is odd and $[G,G]\subseteq G^p$ or $p=2$ and $[G,G]\subseteq G^4$. A {\em{cover}} for a group is a collection of subgroups whose union is equal to the entire group. We will…
Finite nonassociative division algebras (i.e., finite semifields) with 243 elements are completely classified.
Let $G$ be a simple graph. A dissociation set of $G$ is defined as a set of vertices that induces a subgraph in which every vertex has a degree of at most 1. A dissociation set is maximal if it is not contained as a proper subset in any…
We show that, for a positive integer $r$, every minimal 1-saturating set in ${\rm PG}(r-1,2)$ of size at least ${11/36} 2^r+3$ is either a complete cap or can be obtained from a complete cap $S$ by fixing some $s\in S$ and replacing every…
A forcing set for a perfect matching of a graph is defined as a subset of the edges of that perfect matching such that there exists a unique perfect matching containing it. A complete forcing set for a graph is a subset of its edges, such…