Related papers: The conjugacy problem and related problems in latt…
Lattice regularizations are pivotal in the non-perturbative quantization of gauge field theories. Wilson's proposal to employ group-valued link fields simplifies the regularization of gauge fields in principal fiber bundles, preserving…
The ability to automatically generalise (interactive) proofs and use such generalisations to discharge related conjectures is a very hard problem which remains unsolved. Here, we develop a notion of goal types to capture key properties of…
The study of rational relations is fundamental to the study of formal languages and automata theory. A rational relation is conjugate if each pair of words in the relation is conjugate (or cyclic shifts of each other). The notion of…
We establish several new bounds for the number of conjugacy classes of a finite group, all of which involve the maximal number c of conjugacy classes of a normal subgroup fixed by some element of a suitable subset of the group. To apply…
We discuss the time complexity of the word and conjugacy search problems for free products $G = A \star_C B$ of groups $A$ and $B$ with amalgamation over a subgroup $C$. We stratify the set of elements of $G$ with respect to the complexity…
The cycling operation endows the super summit set $S_x$ of any element $x$ of a Garside group $G$ with the structure of a directed graph $\Gamma_x$. We establish that the subset $U_x$ of $S_x$ consisting of the circuits of $\Gamma_x$ can be…
Let $n\geq 3$. In this paper we deal with the conjugacy problem in the Artin braid group quotient $B_n/[P_n,P_n]$. To solve it we use systems of equations over the integers arising from the action of $B_n/[P_n,P_n]$ over the abelianization…
We establish that standard arithmetic subgroups of a special orthogonal group ${\rm SO}(1,n)$ are conjugacy separable. As an application we deduce this property for unit groups of certain integer group rings. We also prove that finite…
A constructive procedure is given to determine all ideals of a solvable Lie algebra. This is used in determining algorithmically all conjugacy classes of subalgebras of a given solvable Lie algebra.
Let $M$ be a positive homogeneously presented monoid ${\langle L \mid R\,\rangle}_{mo}$. If $M$ satisfies the cancellation condition and carries certain particular elements similar to the \emph{fundamental elements} in Artin monoids, then…
A characterization is given of the subsets of a group that extend to the positive cone of a right order on the group and used to relate validity of equations in lattice-ordered groups (l-groups) to subsets of free groups that extend to…
In this paper we study different questions concerning automorphisms of quandles. For a conjugation quandle $Q={\rm Conj}(G)$ of a group $G$ we determine several subgroups of ${\rm Aut}(Q)$ and find necessary and sufficient conditions when…
Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…
We study the conjugate gradient method for solving s system of linear equations with coefficients which are measurable functions and establish the rate of convergence of this method.
Given an Artin group $A$ and a parabolic subgroup $P$, we study if every two elements of $P$ that are conjugate in $A$, are also conjugate in $P$. We provide an algorithm to solve this decision problem if $A$ satisfies three properties that…
Baumslag-Solitar groups were introduced in 1962 by Baumslag and Solitar as examples for finitely presented non-Hopfian two-generator groups. Since then, they served as examples for a wide range of purposes. As Baumslag-Solitar groups are…
We study the autonomous systems of quadratic differential equations of the form $\dot{x}_i(t)=\mathbf{x}(t)^T \mathbf{A}_i \mathbf{x}(t) + \mathbf{v}_i^T \mathbf{x}(t)$ with $\mathbf{x}(t) = (x_1(t),x_2(t),\dots,x_i(t),\dots)$ which, in…
The classical linear ordering problem seeks a single ranking representing a given preference matrix. While suitable for homogeneous populations, it fails when observed preferences arise from several latent groups with distinct ranking…
An algorithm is proposed that solves two decision problems for pseudo-Anosov elements in the mapping class group of a surface with at least one marked fixed point. The first problem is the root problem: decide if the element is a power and…
Let $(\Omega, \leq)$ be a totally ordered set. We prove that if Aut$(\Omega,\leq)$ is transitive and satisfies the same first-order sentences as the automorphism group of the real line (in the language of groups) then $\Omega$ and and the…