Related papers: The cyclic sliding operation in Garside groups
We study the conjugacy problem in cyclic extensions of free groups. It is shown that the conjugacy problem is solvable in split extensions of finitely generated free groups by virtually inner automorphisms. An algorithm for construction of…
Streamline-based quad meshing algorithms use smooth cross fields to partition surfaces into quadrilateral regions by tracing cross field separatrices. In practice, re-entrant corners and misalignment of singularities lead to small regions…
We construct an algorithm that, given a pair of homomorphisms between polycyclic-by-finite groups, determines whether their Reidemeister number is finite, and if so returns a set of representatives of the twisted conjugacy classes.…
We consider the yielding behavior of amorphous solids under cyclic shear deformation and show that it can be mapped into a random walk in a confining potential with an absorbing boundary. The resulting dynamics is governed by the first…
The cyclic shift graph of a monoid is the graph whose vertices are elements of the monoid and whose edges link elements that differ by a cyclic shift. For certain monoids connected with combinatorics, such as the plactic monoid (the monoid…
An improved preconditioned conjugate gradient squared (PCGS) algorithm has recently been proposed, and it performs much better than the conventional PCGS algorithm. In this paper, the improved PCGS algorithm is verified as a coordinative to…
We prove that the generalised non-crossing partitions associated to well-generated complex reflection groups of exceptional type obey two different cyclic sieving phenomena, as conjectured by Armstrong, respectively by Bessis and Reiner.…
Polycyclic groups are natural generalizations of cyclic groups but with more complicated algorithmic properties. They are finitely presented and the word, conjugacy, and isomorphism decision problems are all solvable in these groups.…
Clustering ensemble, or consensus clustering, has emerged as a powerful tool for improving both the robustness and the stability of results from individual clustering methods. Weighted clustering ensemble arises naturally from clustering…
In this paper we introduce the graph $\Gamma_{sc}(G)$ associated with a group $G$, called the solvable conjugacy class graph (abbreviated as SCC-graph), whose vertices are the nontrivial conjugacy classes of $G$ and two distinct conjugacy…
Collective actuation in active solids, the spontaneous condensation of the dynamics on a few elastic modes, takes place whenever the deformations of the structure reorient the forces exerted by the active units composing, or embedded in,…
The truss, a relaxation of the clique based on triangles, serves to identify clusters of actors in a way that is easy to interpret and is computationally attractive. This paper introduces the 4-cycle-based relative to the truss, called the…
We give a sufficient condition for two operators to be disjointly frequently hypercyclic. We apply this criterion to composition operators acting on $H(\mathbb D)$ or on the Hardy space $H^2(\mathbb D)$. We simplify a result on disjoint…
We recently reported that the simple genetic algorithm (SGA) is capable of performing a remarkable form of sublinear computation which has a straightforward connection with the general problem of interacting attributes in data-mining. In…
This contains a new version of the so-called non-commutative Gauss algorithm for polycyclic groups. Its results allow to read off the order and the index of a subgroup in an (possibly infinite) polycyclic group.
In this paper, we study skew frame starters, which are strong frame starters that satisfy an additional "skew" property. We prove three new non-existence results for cyclic skew frame starters of certain types. We also construct several…
A spin space group provides a suitable way to fully exploit the symmetry of a spin arrangement with a negligible spin-orbit coupling. There has been a growing interest in applying spin symmetry analysis with the spin space group in the…
Colloidal particles can create reconfigurable nanomaterials, with applications such as color-changing, self-repairing, and self-regulating materials and reconfigurable drug delivery systems. However, top-down methods for manipulating…
When approximating the joint distribution of the component counts of a decomposable combinatorial structure that is `almost' in the logarithmic class, but nonetheless has irregular structure, it is useful to be able first to establish that…
We discuss a decomposition formula of simple products of fermion correlation functions with cyclic constrains and its applications to spin sums of super string amplitudes. Based on some facts which are noted or derived in this paper, we…