Related papers: Refined solvable presentations for polycyclic grou…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
We describe a presentation for the descent algebra of the symmetric group $\sym{n}$ as a quiver with relations. This presentation arises from a new construction of the descent algebra as a homomorphic image of an algebra of forests of…
Presentations of groups by rewriting systems (that is, by monoid presentations), have been fruitfully studied by encoding the rewriting system in a $2$--complex -- the Squier complex -- whose fundamental groupoid then describes the…
We propose a novel polyhedral uncertainty set for robust optimization, termed the smooth uncertainty set, which captures dependencies of uncertain parameters by constraining their pairwise differences. The bounds on these differences may be…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equations. We apply this principle by finding some \emph{affine…
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…
We produce two separate algebraic descriptions of the isomorphism classes of the solvable subgroups of the group PLo(I) of piecewise-linear orientation-preserving homeomorphisms of the unit interval under the operation of composition, and…
Our main objective is to show that the computational methods that we previously developed to search for difference families in cyclic groups can be fully extended to the more general case of arbitrary finite abelian groups. In particular…
As modeling and visualization applications proliferate, there arises a need to simplify large polygonal models at interactive rates. Unfortunately existing polygon mesh simplification algorithms are not well suited for this task because…
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical…
We propose a new cryptosystem based on polycyclic groups. The cryptosystem is based on the fact that the word problem can be solved effectively in polycyclic groups, while the known solutions to the conjugacy problem are far less efficient.
We describe a formalism, using groupoids, for the study of rewriting for presentations of inverse monoids, that is based on the Squier complex construction for monoid presentations. We introduce the class of pseudoregular groupoids, an…
Group Theory techniques can aid greatly the determination of magnetic structures. The integration of their calculations into new and existing refinement programs is an ongoing development that will simplify and make more rigorous the…
The balanced superelliptic handlebody group is the normalizer of the transformation group of the balanced superelliptic covering space in the handlebody group of the total space. We give a finite presentation for the balanced superelliptic…
Clustering is an unsupervised learning problem that aims to partition unlabelled data points into groups with similar features. Traditional clustering algorithms provide limited insight into the groups they find as their main focus is…
The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},\ldots , a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}\cdots a_{n} =a_{\sigma (1)} a_{\sigma (2)} \cdots a_{\sigma (n)}$, where…
If a finite group G has a presentation with d generators and r relations, it is well-known that r - d is at least the rank of the Schur multiplier of G; a presentation is called efficient if equality holds. There is an analogous definition…
A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…
In this paper, we provide new criteria for the solvability and supersolvability of a finite group based on its number of cyclic subgroups. A finite group G is called n-cyclic if it contains n cyclic subgroups. This paper also partially…