Related papers: Pairs of Generators for Matrix Groups. I
Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…
We give a short and elementary introduction to Lie group methods. A selection of applications of Lie group integrators are discussed. Finally, a family of symplectic integrators on cotangent bundles of Lie groups is presented and the notion…
An isomorphism between the group ring of a finite group and a ring of certain block diagonal matrices is established. The group ring $RG$ of a finite group $G$ is isomorphic to the set of {\em group ring matrices} over $R$. It is shown that…
We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying…
Noncommutative phase spaces are generated and classified in the framework of centrally extended anisotropic planar kinematical Lie groups as well as in the framework of noncentrally extended planar absolute time Lie groups. Through these…
Some results are presented indicating the distinct advantages that accrue from choosing a real representation for the generators of SU(N) rather than the usual and more popular Gell-Mann type matrices. A few examples in the context of…
We consider the 2-generated free metabelian associative and Lie algebras over the complex field and the invariants of the dihedral groups of finite order acting on these algebras. In the associative case we find a finite set of generators…
We construct supercharacter theories of finite unipotent groups in the orthogonal, symplectic and unitary types. Our method utilizes group actions in a manner analogous to that of Diaconis and Isaacs in their construction of supercharacters…
We describe algorithms and heuristics that allow us to express arbitrary elements of SLn (Z) and Sp2n (Z) as products of generators in particular "standard" generating sets. For elements obtained experimentally as random products, it…
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…
We give generators for a certain complex hyperbolic braid group. That is, we remove a hyperplane arrangement from complex hyperbolic $13$-space, take the quotient of the remaining space by a discrete group, and find generators for the…
The structure of events in high-energy collisions is complex and not predictable from first principles. Event generators allow the problem to be subdivided into more manageable pieces, some of which can be described from first principles,…
In this paper we bring together results about the density of subsemigroups of abelian Lie groups, the minimal number of topological generators of abelian Lie groups and a result about actions of algebraic groups. We find the minimal number…
We describe a random matrix approach that can provide generic and readily soluble mean-field descriptions of the phase diagram for a variety of systems ranging from QCD to high-T_c materials. Instead of working from specific models, phase…
Matrix Lie groups provide a language for describing motion in such fields as robotics, computer vision, and graphics. When using these tools, we are often faced with turning infinite-series expressions into more compact finite series (e.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 study ideal-simple commutative semirings and summarize the results giving their classification, in particular when they are finitely generated. In the principal case of (para)semifields, we then consider their minimal number of…
The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…
A generating function for the Wigner's $D$-matrix elements of $SU(3)$ is derived. From this an explicit expression for the individual matrix elements is obtained in a closed form.
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…