Related papers: Virtually geometric words and Whitehead's algorith…
Gordon and Wilton recently proved that the double D of a free group F amalgamated along a cyclic subgroup C of F contains a surface group if a generator w of C satisfies a certain 3-manifold theoretic condition, called virtually…
We study the problem of computing semantic-preserving word clouds in which semantically related words are close to each other. While several heuristic approaches have been described in the literature, we formalize the underlying geometric…
A virtual link can be understood as a link in a trivial I-bundle over an orientable compact surface with genus. A twisted virtual link is a link in a trivial I-bundle over a not-necessarily orientable compact surface. A twisted virtual…
In this paper we study the behaviour of conjugacy languages in virtual graph products, extending results by Ciobanu, Hermiller, Holt and Rees. We focus primarily on virtual graph products in the form of a semi-direct product. First, we…
We prove that, for a finitely generated group hyperbolic relative to virtually abelian subgroups, the generalised word problem for a parabolic subgroup is the language of a real-time Turing machine. Then, for a hyperbolic group, we show…
We consider involutory virtual biracks with good involutions, also known as symmetric involutory virtual biracks. Any good involution on an involutory virtual birack defines an enhancement of the counting invariant. We provide examples…
In this paper, a visual language, VCP, for queries on complex-value databases is proposed. The main strength of the new language is that it is purely visual: (i) It has no notion of variable, quantification, partiality, join, pattern…
This is a survey on the geometry of warped products, without, or essentially with only soft, calculation. Somewhere in the paper, the goal was to give a synthetic account since existing approaches are rather analytic. Somewhere else, we…
The finite-dimensional symmetric algebras over an algebraically closed field, based on surface triangulations, motivated by the theory of cluster algebras, have been extensively investigated and applied. In particular, the weighted surface…
This paper presents a geometric approach to the problem of modelling the relationship between words and concepts, focusing in particular on analogical phenomena in language and cognition. Grounded in recent theories regarding geometric…
Geometry can be used to explain many properties commonly observed in real networks. It is therefore often assumed that real networks, especially those with high average local clustering, live in an underlying hidden geometric space.…
We define a generalization of virtual links to arbitrary dimensions by extending the geometric definition due to Carter et al. We show that many homotopy type invariants for classical links extend to invariants of virtual links. We also…
In this survey, we address the worst-case, average-case, and generic-case time complexity of the word problem and some other algorithmic problems in several classes of groups and show that it is often the case that the average-case…
We study biinvariant word metrics on groups. We provide an efficient algorithm for computing the biinvariant word norm on a finitely generated free group and we construct an isometric embedding of a locally compact tree into the biinvariant…
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if…
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…
Vector-space representations provide geometric tools for reasoning about the similarity of a set of objects and their relationships. Recent machine learning methods for deriving vector-space embeddings of words (e.g., word2vec) have…
We construct cocompact lattices in a product of trees which are not virtually torsion-free. This gives the first examples of hierarchically hyperbolic groups which are not virtually torsion-free
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
We study word maps with constants on symmetric groups. Even though there are mixed identities of bounded length that are valid for all symmetric groups, we show that no such identities hold in a metric sense. Moreover, we prove that word…