Related papers: Partial Word and Equality problems and Banach dens…
The topological group version of the celebrated Banach-Mazur problem asks wether every infinite topological group has a non-trivial separable quotient group. It is known that compact groups have infinite separable metrizable quotient…
We study generalized games defined over Banach spaces using variational analysis. To reformulate generalized games as quasi-variational inequality problems, we will first form a suitable principal operator and study some significant…
We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…
We give a ranker-based description using finite-index congruences for the variety $\boldsymbol{\mathrm{DAb}}$ of finite monoids whose regular $\mathcal{D}$-classes form Abelian groups. This combinatorial description yields a normal form for…
Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered…
We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.
With each semigroup one can associate a partial algebra, called the biordered set, which captures important algebraic and geometric features of the structure of idempotents of that semigroup. For a biordered set $\mathcal{E}$, one can…
We prove new complexity results for computational problems in certain wreath products of groups and (as an application) for free solvable group. For a finitely generated group we study the so-called power word problem (does a given…
Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…
The concept of nonlinear split ordered variational inequality problems on partially ordered vector spaces is a natural extension of linear split vector variational inequality problems on Banach spaces. The results about nonlinear split…
The finite section method is a classical scheme to approximate the solution of an infinite system of linear equations. We present quantitative estimates for the rate of the convergence of the finite section method on weighted $\ell…
We design new deterministic and randomized algorithms for computational problems in free solvable groups. In particular, we prove that the word problem and the power problem can be solved in quasi-linear time and the conjugacy problem can…
In this paper we study unimodular amenable groups. The first part is devoted to results on the existence of uniform families of epsilon-quasi tilings for these groups. In this context, constructions of Ornstein and Weiss are extended by…
The probabilistic Waring problem for finite simple groups asks whether every word of the form $w_1w_2$, where $w_1$ and $w_2$ are non-trivial words in disjoint sets of variables, induces almost uniform distribution on finite simple groups…
Variational inequality problems allow for capturing an expansive class of problems, including convex optimization problems, convex Nash games and economic equilibrium problems, amongst others. Yet in most practical settings, such problems…
Benjelloun et al. \cite{BGSWW} considered the Entity Resolution (ER) problem as the generic process of matching and merging entity records judged to represent the same real world object. They treated the functions for matching and merging…
Let $w$ be a word in the free group of rank $n \in \mathbb{N}$ and let $\mathcal{V}(w)$ be the variety of groups defined by the law $w=1$. Define $\mathcal{V}(w^*)$ to be the class of all groups $G$ in which for any infinite subsets $X_1,…
We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of…
We show that every group $H$ of at most exponential growth with respect to some left invariant metric admits a bi-Lipschitz embedding into a finitely generated group $G$ such that $G$ is amenable (respectively, solvable, satisfies a…
The braid group has recently attracted much attention. This is primarily based upon the discovery of its usage in various cryptosystems [AAG],[KLCHKP]. One major focus of current research has been in solving decision problems in braid…