Related papers: Simple right conjugacy closed loops

Let $\mathbb{C}$ be the field of complex numbers. Let $k$ be natural number with $k \geq 2$ and let $p$ be a rational prime. In this paper we count the number of conjugacy classes of admissible cyclic subgroups of…

Given a group $G$ we write $h(G)$ to denote the maximum number of times that a field extension of $\mathbb{Q}$ appears as the field of values of a conjugacy class of a group. In this work, we prove that $|G|$ is bounded in terms of $h(G)$.…

Although little can be gleaned about a loop with the property that its squares are, say, left nuclear ($xx\cdot yz = (xx\cdot y)z$), if its squares are also, say, middle nuclear ($(x\cdot yy)z = x(yy\cdot z)$), then the loop exhibits more…

Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit…

We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.

Let $G$ be a finite group, and let $\Delta(G)$ be the prime graph built on the set of conjugacy class sizes of $G$: this is the simple undirected graph whose vertices are the prime numbers dividing some conjugacy class size of $G$, two…

Let G be a connected reductive group over an algebraically closed field. We define a decomposition of G into finitely many strata such that each stratum is a union of conjugacy classes of fixed dimension; the strata are indexed by a set…

We added an additional result (theorem 1.6) that strengthenns our main theorem in the G=GL-case by establishing an equivalence of tensor categories.

Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of…

Normal forms for wide classes of closed IL formulas were given in [4]. Here we quantify asymptotically, in exact numbers, how wide those classes are. As a consequence, we show that the "majority" of closed IL formulas have GL-equivalents,…

Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism $f : G \longrightarrow K$ between multiplicative systems $G$ and $K$ is a…

We extend the loop algebra construction for algebras graded by abelian groups to study graded-simple algebras over the field of real numbers (or any real closed field). As an application, we classify up to isomorphism the graded-simple…

If $G$ is a finite group and $k =q>2$ or $k=q+1$ for a prime power $q$ then, for infinitely many integers $v$, there is a $2$-$(v,k,1)$-design ${\bf D}$ for which ${\rm Aut} {\bf D}\cong G$.

Answering a question of Geoff Robinson, we compute the large n limiting proportion of i(n,q)/q^[n^2/2], where i(n,q) denotes the number of involutions in GL(n,q). We give similar results for the finite unitary, symplectic, and orthogonal…

Jordan Normal Forms serve as excellent representatives of conjugacy classes of matrices over closed fields. Once we knows normal forms, we can compute functions of matrices, their main invariant, etc. The situation is much more complicated…

Every metric symplectic Lie algebra has the structure of a quadratic extension. We give a standard model and describe the equivalence classes on the level of corresponding quadratic cohomology sets. Finally, we give a scheme to classify the…

In [2] we show how to construct information sets for Reed-Muller codes only in terms of their basic parameters. In this work we deal with the corresponding problem for q-ary Generalized Reed-Muller codes of first and second order. We see…

We investigate structural and rigidity properties of \emph{Lie skew braces} (LSBs), objects essentially known in the literature as \emph{post--Lie groups}, obtained by endowing a manifold with two compatible group laws that share the same…

The metohod of ortogonal rotations introduced in the previous papers of the author is used for construction of the explicit form the generators of the simple roots for quantum (and ussual) semisimple algebras. All calculations are presented…

We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…