Related papers: Subgroup Chains and Lagrange Coordinatizations of …
A number system coding for the permutations generated by cyclic shift is described. The system allows to find the rank of a permutation given how it has been generated, and to determine a permutation given its rank. It defines a code…
Following our previous work, we develop an algorithm to compute a presentation of the fundamental group of certain partial compactifications of the complement of a complex arrangement of lines in the projective plane. It applies, in…
In this paper we give the generalization of lifted codes over any finite chain ring. This has been done by using the construction of finite chain rings from $p$-adic fields. Further we propose a lattice construction from linear codes over…
Working in a theory with an integer-valued dimension on interpretable sets, we classify pseudofinite definably primitive permutation groups acting on one-dimensional sets which satisfy a version of chain condition on centralizers and on…
Given a subgroup H of a finite group G, we begin a systematic study of the partial representations of G that restrict to global representations of H. After adapting several results from [DEP00] (which correspond to the case where H is…
We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…
Finding the relation between the symmetry transformations in the continuum and on the lattice might be a nontrivial task as illustrated by the history of chiral symmetry. Lattice actions induced by a renormalization group procedure inherit…
The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…
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…
We study spacetime diffeomorphisms in Hamiltonian and Lagrangian formalisms of generally covariant systems. We show that the gauge group for such a system is characterized by having generators which are projectable under the Legendre map.…
Hypersubstitutions are mappings which map operation symbols to terms. Terms can be visualized by trees. Hypersubstitutions can be extended to mappings defined on sets of trees. The nodes of the trees, describing terms, are labelled by…
We obtain several structure results for a class of spherical subgroups of connected reductive complex algebraic groups that extends the class of strongly solvable spherical subgroups. Based on these results, we construct certain…
We introduce a new framework for solving an important class of computational problems involving finite permutation groups, which includes calculating set stabilisers, intersections of subgroups, and isomorphisms of combinatorial structures.…
We survey new results on finite groups of birational transformations of algebraic varieties.
This paper investigates a novel connection between reductions of companion matrices associated with a symmetric family of certain binomial ideals in the coordinate ring of affine n-space and permutation matrices. Specifically, for fixed…
We study cohomology for $p$-local finite groups with non-constant coefficient systems. In particular we show that under certain restrictions there exists a cohomology transfer map in this context, and deduce the standard consequences.
A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…
We describe the spreading property for finite transitive permutation groups in terms of properties of their associated coherent configurations, in much the same way that separating and synchronising groups can be described via properties of…
In this note we study the finite groups whose subgroup lattices are dismantlable.
Central issues of the Dirac constraint formalism are discussed in relation to the algorithmic methods of commutative algebra based on the Groebner basis techniques. For a wide class of finite dimensional polynomial degenerate Lagrangian…