Related papers: Standard Generators of Finite Fields and their Cyc…
The paper presents a method to generate some families of linear codes over finite fields of characteristics greater than two in the widest class due to the size of Grassmann manifold, i.e. when the dimension is equal to codimension. Our…
We give a nonstandard treatment of the notion of ends of proper geodesic metric spaces. We then apply this nonstandard treatment to Cayley graphs of finitely generated groups and give nonstandard proofs of many of the fundamental results…
We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…
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…
We describe algorithms to compute fixed fields, splitting fields and towers of radical extensions without using polynomial factorisation in towers or constructing any field containing the splitting field, instead extending Galois group…
We study cyclic finite Galois extensions of the rational function field of the projective line P^{1}(F_q) over a finite field F_q with q elements defined by considering quotient curves by finite subgroups of the projective linear group…
This gem describes a standard method for generating synthetic spatial data that can be used in benchmarking and scalability tests. The goal is to improve the reproducibility and increase the trust in experiments on synthetic data by using…
We consider (projectively) linearly sofic groups, i.e. groups which can be approximated using (projective) matrices over arbitrary fields, as a generalization of sofic groups. We generalize known results for sofic groups and groups which…
This note presents Galois theory for finite fields. It was written as a handout for the MAT401 course ``Polynomial equations and fields'' taught at the University of Toronto in Spring 2026. We use without proofs some basic properties of…
Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…
We propose the use of hyperedge replacement graph grammars for factor graphs, or factor graph grammars (FGGs) for short. FGGs generate sets of factor graphs and can describe a more general class of models than plate notation, dynamic…
A group is metabelian if its commutator subgroup is abelian. For finitely generated metabelian groups, classical commutative algebra, algebraic geometry and geometric group theory, especially the latter two subjects, can be brought to bear…
Linear finite dynamical systems play an important role, for example, in coding theory and simulations. Methods for analyzing such systems are often restricted to cases in which the system is defined over a field %and usually strive to…
The paper contains a survey of train constructions for infinite symmetric groups and related groups. For certain pairs (a group $G$, a subgroup $K$), we construct categories, whose morphisms are two-dimensional surfaces tiled by polygons…
Necessary and sufficient conditions for finite semihypergroups to be built from groups of the same order are established
Normal subgroups and there properties for finite and infinite iterated wreath products $S_{n_1}\wr \ldots \wr S_{n_m}$, $n, m \in \mathbb{N}$ are founded. The special classes of normal subgroups and there orders are investigated. Special…
This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a mathematical theory of computer simulation. It contains a classification of finite dynamical systems on binary strings, which are obtained by…
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
We investigate when the clone of congruence preserving functions is finitely generated. We obtain a full description for all finite $p$-groups, and for all finite algebras with Mal'cev term and simple congruence lattice. The…
We introduce and study the concept of cyclicity degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be cyclic. Explicit formulas are obtained for some particular classes of finite groups. An…