Related papers: Computing conjugating sets and automorphism groups…

This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

We introduce an extension of the (tame) polynomial automorphism group over finite fields: the profinite (tame) polynomial automorphism group, which is obtained by putting a natural topology on the automorphism group. We show that most known…

Let $H$ be a complex Hilbert space. Consider the ortho-Grassmann graph $\Gamma^{\perp}_{k}(H)$ whose vertices are $k$-dimensional subspaces of $H$ (projections of rank $k$) and two subspaces are connected by an edge in this graph if they…

A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are…

Let $\mathcal{L}$ be a finite-dimensional semisimple Lie algebra of rank $N$ over an algebraically closed field of characteristic $0$. Associated to $\mathcal{L}$ is a family of polynomial folding maps…

The purpose of this paper is to propose an efficient method to compute the automorphism group of an arbitrary hyperelliptic function field (genus>1) over a given ground field of characteristic >2 as well as over its algebraic extensions.

This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…

Let G be a group of permutations of a denumerable set E. The profile of G is the function phi which counts, for each n, the number phi(n) of orbits of G acting on the n-subsets of E. Counting functions arising this way, and their associated…

Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…

We investigate the automorphism group of the substructure ordering of finite directed graphs. The second author conjectured that it is isomorphic to the 768-element group $(\mathbb{Z}_2^4 \times S_4)\rtimes_{\alpha} \mathbb{Z}_2$. Though…

We present an algorithm to compute the automorphism group of a Mori dream space. As an example calculation, we determine the automorphism groups of singular cubic surfaces with general parameters. The strategy is to study graded…

This paper proves two results on the field of rationality $\Q(\pi)$ for an automorphic representation $\pi$, which is the subfield of $\C$ fixed under the subgroup of $\Aut(\C)$ stabilizing the isomorphism class of the finite part of $\pi$.…

Morphisms between schemes arising from multigraded rings are essential for understanding geometric relationships in algebraic geometry, yet a systematic theory for such maps has been lacking. In this paper, we develop a comprehensive…

We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…

We classify rational surfaces for which the image of the automorphisms group in the group of linear transformations of the Picard group is the largest possible. This answers a question raised by Arthur Coble in 1928, and can be rephrased in…

This paper is a step towards the complete topological classification of {\Omega}-stable diffeomorphisms on an orientable closed surface, aiming to give necessary and sufficient conditions for two such diffeomorphisms to be topologically…

In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. Also the class of Pascal finite polynomial automorphisms was introduced. Pascal finite polynomial maps constitute a generalization of…

Mapping class groups of locally finite graphs are the analogue of those of infinite-type surfaces, and serve as a "big" version of $\text{Out}(F_n)$. In this paper, we investigate which of these mapping class groups have a dense conjugacy…

Let $G$ be a group. An automorphism of $G$ is called intense if it sends each subgroup of $G$ to a conjugate; the collection of such automorphisms is denoted by $\mathrm{Int}(G)$. In the special case in which $p$ is a prime number and $G$…