Related papers: Detecting geometric splittings in finitely present…

We show that there exists an algorithm that takes as input two closed, simply connected, topological 4-manifolds and decides whether or not these 4-manifolds are homeomorphic. In particular, we explain in detail how closed, simply…

We consider the problem of generating uniformly random partitions of the vertex set of a graph such that every piece induces a connected subgraph. For the case where we want to have partitions with linearly many pieces of bounded size, we…

We study the linear extension complexity of stable set polytopes of perfect graphs. We make use of known structural results permitting to decompose perfect graphs into basic perfect graphs by means of two graph operations: 2-join and skew…

This paper focuses on vertices of the master corner polyhedra $P(G,g_0),$ the core of the group-theoretical approach to integer linear programming. We introduce two combinatorial operations that transform each vertex of $P(G,g_0)$ to…

For an arbitrary word $w$ on an alphabet, we can define the alternating symbol graph, $G(w)$, as the graph in which the edge $(a, b)$ is in $E$ iff the letters $a$ and $b$ alternate in the word $w$. A graph $G = (V, E)$ is said to be…

In this paper we present an algorithm for determining whether a subgroup H of a non-connected reductive group G is G-completely reducible. The algorithm consists of a series of reductions; at each step, we perform operations involving…

The main result of this article is a refinement of the well-known subgroup separability results of Hall and Scott for free and surface groups. We show that for any finitely generated subgroup, there is a finite dimensional representation of…

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

Let E be a division ring and G a finite group of automorphisms of E whose elements are distinct modulo inner automorphisms of E. Given a representation \rho: B-> GL(d,E) of an F-algebra B, we give necessary and sufficient conditions for…

A general theory of topological classification of defects is introduced. We illustrate the application of tools from algebraic topology, including homotopy and cohomology groups, to classify defects including several explicit calculations…

Consider a group G and a family $\mathcal{A}$ of subgroups of G. We say that vertex finiteness holds for splittings of G over $\mathcal{A}$ if, up to isomorphism, there are only finitely many possibilities for vertex stabilizers of minimal…

We construct here the first known examples of non-split sharply 2-transitive groups of bounded exponent in odd positive characteristic for every large enough prime $p \equiv 3 \pmod{4}$. In fact, we show that there are countably many…

We establish a $K-$type decomposition of the Harish-Chandra Schwartz algebra $\mathcal{C}^{p}(G),$ for any real-rank $1$ reductive group $G$ with a maximal compact subgroup $K$ and $0<p\leq2.$ This decomposition is then used to give an…

Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…

We generalize the Plesken-Fabia\'nska $\mathrm{L}_2$-quotient algorithm for finitely presented groups on two or three generators to allow an arbitrary number of generators. The main difficulty lies in a constructive description of the…

A group $G$ has cube-free order if no prime to the third power divides $|G|$. We describe an algorithm that given two cube-free groups $G$ and $H$ of known order, decides whether $G\cong H$, and, if so, constructs an isomorphism $G\to H$.…

In recent work on holomorphic maps that are symmetric under certain complex reflection groups---generated by complex reflections through a set of hyperplanes, the author announced a general conjecture related to reflection groups. The claim…

Amendola et al. proposed a method for solving systems of polynomial equations lying in a family which exploits a recursive decomposition into smaller systems. A family of systems admits such a decomposition if and only if the corresponding…

We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.

The discreteness problem, that is, the problem of determining whether or not a given finitely generated group G of orientation preserving isometries of hyperbolic three-space is discrete as a subgroup of the whole isometry group of…