English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

A word equation with one variable in a free group is given as U = V , where both U and V are words over the alphabet of generators of the free group and X, X−1, for a fixed variable X. An element of the free group is a solution when substituting it for X yields a true equality (interpreted in the free group) of leftand right-hand sides. It is known that the set of all solutions of a given word equation with one variable is a finite union of sets of the form {αwβ : i ∈ Z}, where α, w, β are reduced words over the alphabet of generators, and a polynomial-time algorithm (of a high degree) computing this set is known. We provide a cubic time algorithm for this problem, which also shows that the set of solutions consists of at most a quadratic number of the above-mentioned sets. The algorithm uses only simple tools of word combinatorics and group theory and is simple to state. Its analysis is involved and focuses on the combinatorics of occurrences of powers of a word within a larger word. 2012 ACM Subject Classification Mathematics of computing → Combinatorics on words; Theory of computation → Formalisms; Computing methodologies → Equation and inequality solving algorithms

Solving One Variable Word Equations in the Free Group in Cubic Time.