Related papers: Polynomial-time right-ideal morphisms and congruen…
Let $p(x_1,...,x_n) =\sum_{(r_1,...,r_n) \in I_{n,n}} a_{(r_1,...,r_n)} \prod_{1 \leq i \leq n} x_{i}^{r_{i}}$ be homogeneous polynomial of degree $n$ in $n$ real variables with integer nonnegative coefficients. The support of such…
Richard Thompson's group F is the group of piecewise linear homeomorphisms of the unit interval with a finite number of break points, all at dyadic rational numbers (their denominators are powers of 2) and with slopes which are powers of 2.…
We show that Thompson's group F is the symmetry group of the "generic idempotent". That is, take the monoidal category freely generated by an object A and an isomorphism A \otimes A --> A; then F is the group of automorphisms of A.
We study the P versus NP problem through properties of functions and monoids, continuing the work of [3]. Here we consider inverse monoids whose properties and relationships determine whether P is different from NP, or whether injective…
We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
The aim of this paper is to give verifiable criteria for the existence of {\em irreducible} homomorphisms of $\pi_{1}(\mathbb P^1 - \mathcal R)$ into compact semisimple groups, for a finite subset $\mathcal R$ such that the conjugacy…
Smooth structures on high dimensional manifolds are classified by maps to the infinite loop space $TOP/O$. The homotopy groups of this space are known to be finite. Given a compact Lie group $G$, this space can be regarded as an equivariant…
We study topological groups of monotonic autohomeomorphisms on a generalized ordered space $L$. We find a condition that is necessary and sufficient for the set of all monotonic autohomeomorphisms on $L$ along with the function composition…
We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…
We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…
We compute the rational stable homology of the automorphism groups of free nilpotent groups. These groups interpolate between the general linear groups over the ring of integers and the automorphism groups of free groups, and we employ…
The Monotonocity Principle (MP), stating a monotonic relationship between a material property and a proper corresponding boundary operator, is attracting great interest in the field of inverse problems, because of its fundamental role in…
Let $\mathbb C$ be the set of complex numbers, and let $\mathcal P$ be a collection of complex polynomial maps in several variables. Assuming at least one $P\in\mathcal P$ depends on at least two variables, we classify all possibilities for…
Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda_0 + \sum_{k = 1}^d \lambda_k [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are…
Let $P$ be an $m$-homogeneous polynomial in $n$-complex variables $x_1, \dotsc, x_n$. Clearly, $P$ has a unique representation in the form \begin{equation*} P(x)= \sum_{1 \leq j_1 \leq \dotsc \leq j_m \leq n} c_{(j_1, \dotsc, j_m)} \,…
We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether…
In this paper we define a relative rigid fundamental group, which associates to a section $p$ of a smooth and proper morphism $f:X\rightarrow S$ in characteristic $p$, a Hopf algebra in the ind-category of overconvergent $F$-isocrystals on…
The structure of finite and locally finite groups in which every element has prime power order (CP-groups) is well known. In this paper we note that the combination of our earlier results with the available information on the structure of…