Related papers: Standard Generators of Finite Fields and their Cyc…
For certain real quadratic fields $K$ with sufficiently small discriminant we produce explicit unit generators for specific ray class fields of $K$ using a numerical method that arose in the study of complete sets of equiangular lines in…
A characterization of finitely generated shift-invariant subspaces is given when generators are g-minimal. An algorithm is given for the determination of the coefficients in the well known representation of the Fourier transform of an…
Dynamical semigroups have become the key structure for describing open system dynamics in all of physics. Bounded generators are known to be of a standard form, due to Gorini, Kossakowski, Sudarshan and Lindblad. This form is often used…
Linear quasi-cyclic product codes over finite fields are investigated. Given the generating set in the form of a reduced Gr{\"o}bner basis of a quasi-cyclic component code and the generator polynomial of a second cyclic component code, an…
The recently developed theory of extended generating functions of symplectic maps are combined with methods to prove invertibility via high-order Taylor model methods to obtain rigorous lower bounds for the domains of definition of…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
This paper investigates the finite generation of cluster automorphism groups. By applying the pseudo $\mathbb{N}$-grading introduced in our previous work, we establish a sufficient condition for a cluster automorphism group to be finitely…
We give a general constructive proof for hierarchical coordinatizations (Lagrange Decompositions) of permutation groups. The generalization originates from the investigation of how the subgroup chains of finite permutation groups yield…
We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the…
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…
We investigate circular planar nearrings constructed from finite fields as well the complex number field using a multiplicative subgroup of order $k$, and characterize the overlaps of the basic graphs which arise in the associated…
We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…
An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length $\ell^tp^s$ are characterized, where $p$ is the characteristic of the finite…
In this paper we introduce and study the concept of cyclic factorization number of a finite group G. By using the Mobius inversion formula and other methods involving the cyclic subgroup structure, this is explicitly computed for some…
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.
Following ideas of Lawvere and Linton we prove that classical varieties are precisely the exact categories with a varietal generator. This means a strong generator which is abstractly finite and regularly projective. An analogous…
The existence of invariant generators for distributions satisfying a compatibility condition with the symmetry algebra is proved.
Linear codes are widely employed in communication systems, consumer electronics, and storage devices. All linear codes over finite fields can be generated by a generator matrix. Due to this, the generator matrix approach is called a…
In this paper, we study dilation of cyclic polytopes with the vertices defined by a generator of the simplest cubic fields. In particular, for a specific range of values, we give a precise number of the contained lattice points.
Slattery (2007) described computational methods to enumerate, construct, and identify finite groups of squarefree order. We generalise Slattery's result to the class of finite groups that have cyclic Sylow subgroups and provide an…