Related papers: Partial Word and Equality problems and Banach dens…
We study existence and partial regularity relative to the weighted Steiner problem in Banach spaces. We show $C^1$ regularity almost everywhere for almost minimizing sets in uniformly rotund Banach spaces whose modulus of uniform convexity…
We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…
In this paper, we introduce a new class of subsets of bounded linear operators between Banach spaces which is p-version of the uniformly completely continuous sets. Then, we study the relationship between these sets with the equicompact…
We study the impact of certain identities and probabilistic identities on the structure of finite groups. More specifically, let $w$ be a nontrivial word in $d$ distinct variables and let $G$ be a finite group for which the word map…
In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…
The study of verbal subgroups within a group is well-known for being an effective tool to obtain structural information about a group. Therefore, conditions that allow the classification of words in a free group are of paramount importance.…
We develop a theory of eventually positive $C_0$-semigroups on Banach lattices, that is, of semigroups for which, for every positive initial value, the solution of the corresponding Cauchy problem becomes positive for large times. We give…
In this paper, we prove several fixed point theorems on both of normal partially ordered Banach spaces and regular partially ordered Banach spaces by using the normality, regularity, full regularity, and chain -complete property. Then, by…
The additive square problem is a relatively famous open problem in the area of combinatorics on words: Does there exist an infinite word over a finite alphabet, such that no two consecutive blocks of the same length have the same sum? In…
If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple…
Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More…
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…
In this paper, we introduce the concept of the generalized right group inverse within the context of a *-Banach algebra. This represents a natural extension of the generalized (weak) group inverse. Notably, this generalized inverse is…
We consider a class of elliptic quasivariational inequalities in a reflexive Banach space $X$ for which we recall a convergence criterion obtained in [10]. Each inequality $\cal P$ in the class is governed by a set of constraints $K$ and…
Recently, there has been much attention devoted to resolving the quantum corrections to the Bekenstein--Hawking (black hole) entropy. In particular, many researchers have expressed a vested interest in fixing the coefficient of the…
The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an…
We review various characterizations of uniform convexity and smoothness on norm balls in finite-dimensional spaces and connect results stemming from the geometry of Banach spaces with \textit{scaling inequalities} used in analysing the…
We investigate questions of maximal symmetry in Banach spaces and the structure of certain bounded non-unitarisable groups on Hilbert space. In particular, we provide structural information about bounded groups with an essentially unique…
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…
The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a…