Related papers: On Intersection of Conjugate Subgoups

Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…

The results of computational experiments with ABS algorithms for overdetermined linear systems are reported.

Intersection graphs are very important in both theoretical as well as application point of view. Depending on the geometrical representation, different type of intersection graphs are defined. Among them interval, circular-arc, permutation,…

We developed computer algebra tools for enumerating conjugacy classes of independent subsets and generating sets of symmetric groups up to $n=7$, and carried out an initial analysis of the obtained results.

Many clustering problems in computer vision and other contexts are also classification problems, where each cluster shares a meaningful label. Subspace clustering algorithms in particular are often applied to problems that fit this…

The paper addresses the graph classification problem and introduces a modification of the lazy associative classification method to efficiently handle intersections of graphs. Graph intersections are approximated with all common subgraphs…

By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…

We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…

Graphical models are widely used to make inferences concerning interplay in multivariate systems. In many applications, data are collected from multiple related but nonidentical units whose underlying networks may differ but are likely to…

In a previous paper (q-alg/9501022) we suggested some algorithms that could be useful in solving the problem of knot classification. Here we continue this discussion by answering questions raised in that paper and by commenting on practical…

We prove a new effective recursion formula for computing all intersection indices (integrals of $\psi$ classes) on the moduli space of curves, inducting only on the genus.

We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…

In this paper, we consider the optimal coordination of automated vehicles at intersections under fixed crossing orders. We formulate the problem using direct optimal control and exploit the structure to construct a semi-distributed…

In this article we give a classification of the sub-groups in PSL(2,Z) and of the conjugacy classes of these sub-groups by the mean of an combinatorial invariant: some trivalent diagrams (dotted or not). We give explicit formulae enabling…

Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…

Considering a clique as a conservative definition of community structure, we examine how graph partitioning algorithms interact with cliques. Many popular community-finding algorithms partition the entire graph into non-overlapping…

We consider two group actions on $m$-tuples of $n \times n$ matrices. The first is simultaneous conjugation by $\operatorname{GL}_n$ and the second is the left-right action of $\operatorname{SL}_n \times \operatorname{SL}_n$. We give…

The action of any group on itself by conjugation and the corresponding conjugacy relation play an important role in group theory. There have been many attempts to find notions of conjugacy in semigroups that would be useful in special…

We investigate the method of conjugate gradients, exploiting inaccurate matrix-vector products, for the solution of convex quadratic optimization problems. Theoretical performance bounds are derived, and the necessary quantities occurring…

Local graph clustering is an important algorithmic technique for analysing massive graphs, and has been widely applied in many research fields of data science. While the objective of most (local) graph clustering algorithms is to find a…