Related papers: On Intersection of Conjugate Subgoups
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…
Computations in the cohomology of finite groups.
A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.
The problem of counting collisions or interactions is common in areas as computer graphics and scientific simulations. Since it is a major bottleneck in applications of these areas, a lot of research has been carried out on such subject,…
We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
For suitable subgroups of a finitely generated group, we define the intersection number of one subgroup with another subgroup and show that this number is symmetric. We also give an interpretation of this number.
Conjugate gradient is an efficient algorithm for solving large sparse linear systems. It has been utilized to accelerate the computation in Bayesian analysis for many large-scale problems. This article discusses the applications of…
In this review article, we report on some recent advances on the computational aspects of cohomology intersection numbers of GKZ systems developed in \cite{GM}, \cite{MH}, \cite{MT} and \cite{MT2}. We also discuss the relation between…
We would like to congratulate the authors of "A Bayesian Conjugate Gradient Method" on their insightful paper, and welcome this publication which we firmly believe will become a fundamental contribution to the growing field of probabilistic…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
We study some basic algorithmic problems concerning the intersection of tropical hypersurfaces in general dimension: deciding whether this intersection is nonempty, whether it is a tropical variety, and whether it is connected, as well as…
We determine necessary conditions for ample divisors in arbitrary genus as well as for very ample divisors in genus 2 and 3. We also compute the intersection numbers $\lambda^9$ and $\lambda_{g-1}^3$ in genus 4. The latter number is…
We describe a general algorithm for computing intersection pairings on arithmetic surfaces. We have implemented our algorithm for curves over $\mathbb Q$, and we show how to use it to compute regulators for a number of Jacobians of smooth…
We show the linear convergence of Dykstra's algorithm for sets intersecting in a manner slightly stronger than the usual constraint qualifications.
We consider several computational problems related to conjugacy between subshifts of finite type, restricted to $k$-block codes: verifying a proposed $k$-block conjugacy, deciding if two shifts admit a $k$-block conjugacy, and reducing the…
In this paper we provide an overview of a series of recent results regarding algorithms for searching for subsequences in words or for the analysis of the sets of subsequences occurring in a word.
We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.