相关论文: Random generation of subgroups of the modular grou…
Among the simplest invariants of the sporadic finite simple groups are their outer automorphism groups. For 12 of the 26 possible isomorphism types of a sporadic simple group G, the outer automorphism group Out(G) has order 2, and in the…
We give a computationally effective criterion for determining whether a finite-index subgroup of SL(2, Z) is a congruence subgroup, extending earlier work of Hsu for subgroups of PSL(2, Z).
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
For any finite group Q not of prime power order, we construct a group G that is virtually of type F, contains infinitely many conjugacy classes of subgroups isomorphic to Q, and contains only finitely many conjugacy classes of other finite…
We study a family of finitely generated residually finite groups. These groups are doubles $F_2*_H F_2$ of a rank-$2$ free group $F_2$ along an infinitely generated subgroup $H$. Varying $H$ yields uncountably many groups up to isomorphism.
We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
For any algebraically closed field $K$ and any endomorphism $f$ of $\mathbb{P}^1(K)$ of degree at least 2, the automorphisms of $f$ are the M\"obius transformations that commute with $f$, and these form a finite subgroup of…
If a discrete subset S of a topological group G with the identity 1 generates a dense subgroup of G and S \cup {1} is closed in G, then S is called a suitable set for G. We apply Michael's selection theorem to offer a direct,…
We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…
Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…
In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…
We introduce the concept of a pants decomposition for a finitely generated free group and construct the corresponding pants graph. A pants decomposition of a free group leads to the formation of a simplicial graph, referred to as the pants…
We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…
The purpose of this paper is to define equivariant class group of a locally Krull scheme (that is, a scheme which is locally a prime spectrum of a Krull domain) with an action of a flat group scheme, study its basic properties, and apply it…
Let p be a prime and q=p^g. We show that the Grothendieck ring of finitely generated F_{q}[SL(2,F_{q})]-modules is naturally isomorphic to the quotient of the polynomial algebra Z[x] by the ideal generated by f^[g](x)-x, where…
In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…
We find the automorphism group of the moduli space of parabolic bundles on a smooth curve (with fixed determinant and system of weights). This group is generated by: automorphisms of the marked curve, tensoring with a line bundle, taking…
In this paper, we propose a method to generate personalized filled pauses (FPs) with group-wise prediction models. Compared with fluent text generation, disfluent text generation has not been widely explored. To generate more human-like…
We prove a rigidity theorem for semi-arithmetic Fuchsian groups: If $\Gamma_1$, $\Gamma_2$ are two semi-arithmetic lattices in $\mathrm{PSL}(2,\mathbb{R})$ virtually admitting modular embeddings and $f\colon\Gamma_1\to\Gamma_2$ is a group…