Related papers: Polynomial-time right-ideal morphisms and congruen…

${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…

We determine the v1-periodic homotopy groups of all irreducible p-compact groups (BX,X). In the most difficult, modular, cases, we follow a direct path from their associated invariant polynomials to these homotopy groups. We show that, if p…

Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…

We characterize the algebraic structure of semi-direct product of cyclic groups, $\Z_{N}\rtimes\Z_{p}$, where $p$ is an odd prime number which does not divide $q-1$ for any prime factor $q$ of $N$, and provide a polynomial-time quantum…

Among (regular, normal) parabolic geometries of type $(G,P)$, there is a locally unique maximally symmetric structure and it has symmetry dimension $\dim(G)$. The symmetry gap problem concerns the determination of the next realizable…

Let $A$ be a commutative noetherian ring, containing a field $k$, with $1/2\in k$, $\dim A=d$, and let $P$ be a projective $A$-module or $rank(P)=n$. In continuation of \cite{MM}, we study Homotopy obstructions for $P$ to split off a free…

We present the ideas behind an algorithm to compute normalizers of primitive groups with non-regular socle in polynomial time. We highlight a concept we developed called permutation morphisms and present timings for a partial implementation…

The input of the popular roommates problem consists of a graph $G = (V, E)$ and for each vertex $v\in V$, strict preferences over the neighbors of $v$. Matching $M$ is more popular than $M'$ if the number of vertices preferring $M$ to $M'$…

The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that…

For fixed compact connected Lie groups H \subseteq G, we provide a polynomial time algorithm to compute the multiplicity of a given irreducible representation of H in the restriction of an irreducible representation of G. Our algorithm is…

In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope…

Let $\mathcal{M}$ be a von Neumann algebra with a normal semifinite faithful trace $\tau$. We prove that every continuous $m$-homogeneous polynomial $P$ from $L^p(\mathcal{M},\tau)$, with $0<p<\infty$, into each topological linear space $X$…

We investigate subgroups of the group PLo(I) of piecewise-linear, orientation preserving homeomorphisms of the unit interval with finitely many breaks in slope, and also subgroups of Thompson's group F. We find geometric criteria…

We classify the pairs $(X,\pi)$, where $\pi\colon X\to S$ is a $\mathbb{P}^1$-bundle over a non-rational geometrically ruled surface $S$ and $\mathrm{Aut}^\circ(X)$ is relatively maximal, i.e., maximal with respect to the inclusion in the…

Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…

For several computational problems in homotopy theory, we obtain algorithms with running time polynomial in the input size. In particular, for every fixed k>1, there is a polynomial-time algorithm that, for a 1-connected topological space X…

The Matrix Torsion Problem (MTP) is: given a square matrix M with rational entries, decide whether two distinct powers of M are equal. It has been shown by Cassaigne and the author that the MTP reduces to the Matrix Power Problem (MPP) in…

In this article we develop the theory of residually finite rationally $p$ (RFR$p$) groups, where $p$ is a prime. We first prove a series of results about the structure of finitely generated RFR$p$ groups (either for a single prime $p$, or…

The Thompson-Higman groups G_{k,i} have a natural generalization to monoids M_{k,i}, and inverse monoids Inv_{k,i}. We study some structural features of M_{k,i} and Inv_{k,i} and investigate the computational complexity of decision…

There is a Lorenzian group acting on the conformal space ${\mathbb Q}^n_p$. We study the regular submanifolds in the conformal space ${\mathbb Q}^n_p$ and construct general submanifold theory in the conformal space ${\mathbb Q}^n_p$.…