Related papers: Subgroup Chains and Lagrange Coordinatizations of …
Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…
The subgroup pattern of a finite group $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we describe a collection of sequences realized by the subgroup…
In this note we give some new results concerning the subgroup commutativity degree of a finite group $G$. These are obtained by considering the minimum of subgroup commutativity degrees of all sections of $G$.
In a recent paper Cameron, Lakshmanan and Ajith began an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this can add a new perspective. Following their suggestions, we consider suitable…
We consider the group formed by finite renormalizations as an infinite-dimensional Lie group. It is demonstrated that for the finite renormalization of the gauge coupling constant its generators $\hat L_n$ with $n\ge 1$ satisfy the…
The relationship between mappings of sets and renormalization group transformations is established, and renormalization group invariants of such mappings are found. These results are valid both for continuous and discrete mappings and for…
Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…
We give unique recovery guarantees for matrices of bounded rank that have undergone permutations of their entries. We even do this for a more general matrix structure that we call ladder matrices. We use methods and results of commutative…
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
We prove that the prescription for construction of supersymmetric lattice gauge theories by orbifolding and deconstruction directly leads to Catterall's geometrical discretization scheme in general. These two prescriptions always give the…
In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.
We present an application of the program of groupoidification leading up to a sketch of a categorification of the Hecke algebroid --- the category of permutation representations of a finite group. As an immediate consequence, we obtain a…
A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of…
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
For natural and artificial systems with some symmetry structure, computational understanding and manipulation can be achieved without learning by exploiting the algebraic structure. Here we describe this algebraic coordinatization method…
We determine the structure of the finite groups with the property that every cyclic subgroup is the intersection of maximal subgroups, comparing this property with the one where all proper subgroups are intersections of maximal subgroups.
We study the Picard groups of connected linear algebraic groups, and especially the subgroup of translation-invariant line bundles. We prove that this subgroup is finite over every global function field. We also utilize our study of these…
The problem of detecting and quantifying the presence of symmetries in datasets is useful for model selection, generative modeling, and data analysis, amongst others. While existing methods for hard-coding transformations in neural networks…
In theories like SM or MSSM with a complex gauge group structure the complete set of Feynman diagrams contributed to a particular physics process can be splited to exact gauge invariant subsets. Arguments and examples given in the review…
The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…