Related papers: Partial Word and Equality problems and Banach dens…

In this paper, two generalized algorithms for solving the variational inequality problem in Banach spaces are proposed. Then the strong convergence of the sequences generated by these algorithms will be proved under the suitable conditions.…

Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.

We study the computational complexity of a robust version of the problem of testing two univariate C-finite functions for eventual inequality at large times. Specifically, working in the bit-model of real computation, we consider the…

Let $X$ be a Banach space. We prove that, for a large class of Banach or quasi-Banach spaces $E$ of $X$-valued sequences, the sets $E-\bigcup _{q\in\Gamma}\ell_{q}(X)$, where $\Gamma$ is any subset of $(0,\infty]$, and $E-c_{0}(X)$ contain…

This paper's major purpose is to continue the work of Zhu and Ma[1]. To begin, the $\mathbf{g}$-almost product property, more general irregular and regular sets, and some new notions of the Banach upper density recurrent points and…

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…

A survey of problems, conjectures, and theorems about quasi-isometric classification and rigidity for finitely generated solvable groups.

We survey the recent investigations on (bounded, sequential) approximate amenability/contractibility and pseudo-amenability/contractibility for Banach algebras. We will discuss the core problems concerning these notions and address the…

We show that every finitely generated group admits weak analogues of an invariant expectation, whose existence characterizes exact groups. This fact has a number of applications. We show that Hopf $G$-modules are relatively injective, which…

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

Given a family of subspaces we investigate existence, quantity and quality of common complements in Hilbert spaces and Banach spaces. In particular we are interested in complements for countable families of closed subspaces of finite…

In this article, we study word equations in free semigroups and the conjecture that the existence of infinitely many solutions entails the existence of solutions with arbitrarily large exponent of periodicity. We examine this question in…

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…

Let $\Omega$ be a nonempty closed and convex subset of a uniformly smooth and uniformly convex real Banach space $\mathcal{X}$ with dual space $\mathcal{X}^*$. This article presents a hybrid algorithm for finding a common element of the set…

Motivated by the local theory of Banach spaces we introduce a notion of finite representability for metric spaces. This allows us to develop a new technique for comparing the generalized roundness of metric spaces. We illustrate this…

We generalize the classical Post correspondence problem ($\mathbf{PCP}_n$) and its non-homogeneous variation ($\mathbf{GPCP}_n$) to non-commutative groups and study the computational complexity of these new problems. We observe that…

We develop a systematic theory of eventually positive semigroups of linear operators mainly on spaces of continuous functions. By eventually positive we mean that for every positive initial condition the solution to the corresponding Cauchy…