Reducibility of pointlike problems

Pointlike sets for varieties determined by groups

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike with respect to $\overline{\mathbf H}$. Our characterization is effective whenever $\mathbf H$ has a decidable membership problem. In particular, the separation problem for $\overline{\mathbf H}$-languages is decidable for any decidable variety of finite groups $\mathbf H$. This generalizes Henckell's theorem on decidability of aperiodic pointlikes.

Separability and complete reducibility of subgroups of the Weyl group of a simple algebraic group of type $E_7$

Let $G$ be a connected reductive algebraic group defined over an algebraically closed field $k$. The aim of this paper is to present a method to find triples $(G,M,H)$ with the following three properties. Property 1: $G$ is simple and $k$ has characteristic 2. Property 2: $H$ and $M$ are closed reductive subgroups of $G$ such that $H<M<G$, and $(G,M)$ is a reductive pair. Property 3: $H$ is $G$-completely reducible, but not $M$-completely reducible. We exhibit our method by presenting a new example of such a triple in $G=E_7$. Then we consider a rationality problem and a problem concerning con…

Complete reducibility of subgroups of reductive algebraic groups over nonperfect fields IV: An $F_4$ example

Let $k$ be a nonperfect separably closed field. Let $G$ be a connected reductive algebraic group defined over $k$. We study rationality problems for Serre's notion of complete reducibility of subgroups of $G$. In particular, we present the first example of a connected nonabelian $k$-subgroup $H$ of $G$ that is $G$-completely reducible but not $G$-completely reducible over $k$, and the first example of a connected nonabelian $k$-subgroup $H'$ of $G$ that is $G$-completely reducible over $k$ but not $G$-completely reducible. This is new: all previously known such examples are for finite (or non-…

A polynomial-time solution to the reducibility problem

We propose an algorithm for deciding whether a given braid is pseudo-Anosov, reducible, or periodic. The algorithm is based on Garside's weighted decomposition and is polynomial-time in the word-length of an input braid. Moreover, a reduction system of circles can be found completely if the input is a certain type of reducible braids.

可数有序群与 Weihrauch 可归约性

Countable Ordered Groups and Weihrauch Reducibility

本文从逆数学与 Weihrauch 可归约性角度分析 Maltsev 定理，指出其强度源于无端点稠密线性序，且相关问题等价于 ŴF 必须在输出中包含保序函数。

Davenport-Lewis-Schinzel问题关于$f(X)-g(Y)$的可约性

The Davenport-Lewis-Schinzel problem on the reducibility of $f(X)-g(Y)$

本文解决Davenport-Lewis-Schinzel问题，确定多项式映射$f$的纤维在哪些整数上可约，并应用于算术动力学中的迭代稳定性及函数方程解法。

Fast nielsen-thurston classification of braids

We prove the existence of an algorithm which solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index.

Generalized small cancellation conditions, non-positive curvature and diagrammatic reducibility

We present a metric condition ${\LARGEτ}'$ which describes the geometry of classical small cancellation groups and applies also to other known classes of groups such as two-dimensional Artin groups. We prove that presentations satisfying condition ${\LARGEτ}'$ are diagrammatically reducible in the sense of Sieradski and Gersten. In particular we deduce that the standard presentation of an Artin group is aspherical if and only if it is diagrammatically reducible. We show that, under some extra hypotheses, ${\LARGEτ}'$-groups have quadratic Dehn functions and solvable conjugacy problem. In the s…

On Borel complexity of the isomorphism problems for graph-related classes of Lie algebras and finite p-groups

We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional $2$-step nilpotent Lie algebras over a field and for a class of finite $p$-groups. We show that the isomorphism problem for graphs is harder than the two latter isomorphism problems in the sense of Borel reducibility. A computable analogue of Borel reducibility was introduced by S. Coskey, J.D. Hamkins, and R. Miller. A relation of the isomorphism problem for undirected graphs to the well-known problem of classifying pairs of matrices over a field (up to similarit…

Reducible Fibers of Polynomial Maps

For a degree $n$ polynomial $f$ over the rationals, the elements in the fiber $f^{-1}(a)$ are of degree $n$ over $\mathbb Q$ for most rational values $a$ by Hilbert's irreducibility theorem. Determining the set of exceptional $a$'s without this property is a long standing open problem that is closely related to the Davenport--Lewis--Schinzel problem (1959) on reducibility of separated polynomials. As opposed to previous work which mostly concerns indecomposable $f$, we answer both problems for decomposable $f=f_1\circ\cdots\circ f_r$, as long as the indecomposable factors $f_i\in\mathbb Q[x]$ …