Related papers: On Intersection of Conjugate Subgoups

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

An algorithm for computing power conjugate presentations for finite soluble quotients of predetermined structure of finitely presented groups is described. Practical aspects of an implementation are discussed.

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

We compute numerically the homology of several graph complexes in low loop orders, extending previous results.

Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…

In the last decade the broad scope of complex networks has led to a rapid progress. In this area a particular interest has the study of community structures. The analysis of this type of structure requires the formalization of the intuitive…

In this paper we introduce and experimentally compare alternative algorithms to join uncertain relations. Different algorithms are based on specific principles, e.g., sorting, indexing, or building intermediate relational tables to apply…

We present here algorithms for efficient computation of linear algebra problems over finite fields.

We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that…

This thesis is in the area called computational social choice which is an intersection area of algorithms and social choice theory.

We present new algorithm for computing the union and intersection of all justifications for a given ontological consequence without first computing the set of all justifications. Through an empirical evaluation, we show that our approach…

We exploit the classical correspondence between finitely generated abelian groups and abelian complex algebraic reductive groups to study the intersection theory of translated subgroups in an abelian complex algebraic reductive group, with…

An overview of the current status of algorithmic approaches to dynamical overlap fermions is given. In particular the issue of changing the topological sector is discussed.

Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…

We describe an algorithm that computes possible corners of hypothetical counterexamples to the Jacobian Conjecture up to a given bound. Using this algorithm we compute the possible families corresponding to $\gcd(deg(P),deg(Q))\le 35$, and…

We consider the problem of cooperative intersection management. It arises in automated transportation systems for people or goods but also in multi-robots environment. Therefore many solutions have been proposed to avoid collisions. The…

We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.

We extend the methods developed in our earlier work to algorithmically compute the intersection cohomology Betti numbers of reductive varieties. These form a class of highly symmetric varieties that includes equivariant compactifications of…

We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…

The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…