相关论文: The simultaneous conjugacy problem in groups of pi…

In this article, we propose a geometric framework dedicated to the study of van Kampen diagrams of graph products of groups. As an application, we find information on the word and the conjugacy problems. The main new result of the paper…

Functional conjugation methods are used to analyze the global structure of various renormalization group trajectories, and to gain insight into the interplay between continuous and discrete rescaling. With minimal assumptions, the methods…

In a recent paper, we introduced the simultaneous representation problem (defined for any graph class C) and studied the problem for chordal, comparability and permutation graphs. For interval graphs, the problem is defined as follows. Two…

In this paper we introduce the 'simultaneous membership problem', defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two graphs G_1 and G_2, sharing some vertices X (and the…

Although the conjugacy classes of the general linear group are known, it is not obvious (from the canonic form of matrices) that two permutation matrices are similar if and only if they are conjugate as permutations in the symmetric group,…

We establish a connection between the generalized conjugacy problem for a $G$-by-$\mathbb{Z}$ group, $GCP(G \rtimes \mathbb{Z})$, and two algorithmic problems for $G$: the generalized Brinkmann's conjugacy problem, $GBrCP(G)$, and the…

Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization,…

Many assembly lines related optimization problems have been tackled by researchers in the last decades due to its relevance for the decision makers within manufacturing industry. Many of theses problems, more specifically Assembly Lines…

Averaging linear functional on the space continuous functions of the group of diffeomorphisms of interval is found. Amenability of several discrete subgroups of the group of diffeomorphisms $\Diff^3([0,1])$ of interval is prove. In…

Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…

We prove that fundamental groups of orientable (geometrizable) 3-manifolds have a solvable conjugacy problem.

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…

The study of associativity of the commutator operation in groups goes back to some work of Levi in 1942. In the 1960's Richard J. Thompson created a group F whose elements are representatives of the generalized associative law for an…

We solve the seventh problem of Oliver's list [M.\ Aschbacher, R.\ Kessar, B.\ Oliver, \textit{Fusion systems in algebra and topology}, LMS Lecture Note Series: 31, Cambridge University Press, 2011] via an explicit signalizer functor…

Let $N_1$ (resp., $N_2$) be the normal closure of a finite symmetrized set $R_1$ (resp., $R_2$) of a finitely generated free group $F = F(A)$. It is well-known that if $R_i$ satisfies the condition C(6), then the conjugacy problem is…

Valiant introduced matchgate computation and holographic algorithms. A number of seemingly exponential time problems can be solved by this novel algorithmic paradigm in polynomial time. We show that, in a very strong sense, matchgate…

Normal form theory is developed deeply for planar smooth systems but has few results for piecewise-smooth systems because difficulties arise from continuity of the near-identity transformation, which is constructed piecewise. In this paper,…

This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as…

We determine when two almost automorphisms of a regular tree are conjugate. This is done by combining the classification of conjugacy classes in the automorphism group of a level-homogeneous tree by Gawron, Nekrashevych and Sushchansky and…

Let $G$ be one of the finite general linear, unitary, symplectic or orthogonal groups over finite fields of odd order. We find the cardinality of the fibers of the square map at a given generic element. Using this we find the number of real…