English
Related papers

Related papers: Topological invariants for words of linear factor …

200 papers

The rings of linear continuous operators on the topological spaces of $\mathfrak{G}$-zero maps were described, where $\mathfrak{G}$ is a filter on a set with an involution. This applies to modules of formal series with well ordered support…

Rings and Algebras · Mathematics 2019-07-02 Nikolay Dubrovin

Topology may be interpreted as the study of verifiability, where opens correspond to semi-decidable properties. In this paper we make a distinction between verifiable properties themselves and processes which carry out the verification…

General Topology · Mathematics 2026-04-15 Peter F. Faul , Graham Manuell

The Fibonacci word $W$ on an infinite alphabet was introduced in [Zhang et al., Electronic J. Combinatorics 2017 24(2), 2-52] as a fixed point of the morphism $2i\rightarrow (2i)(2i+1)$, $(2i+1) \rightarrow (2i+2)$, $i\geq 0$. Here, for any…

Combinatorics · Mathematics 2019-12-02 Narges Ghareghani , Pouyeh Sharifani , Morteza Mohammad-Noori

In this paper we introduce and study a family of complexity functions of infinite words indexed by $k \in \ints ^+ \cup {+\infty}.$ Let $k \in \ints ^+ \cup {+\infty}$ and $A$ be a finite non-empty set. Two finite words $u$ and $v$ in $A^*$…

Combinatorics · Mathematics 2013-01-23 Juhani Karhumaki , Aleksi Saarela , Luca Q. Zamboni

We study fibers of word maps in finite, profinite, and residually finite groups. Our main result is that, for any word w in the free group on d generators, there exists $\epsilon > 0$ such that if G is a residually finite group with…

Group Theory · Mathematics 2017-06-27 Michael Larsen , Aner Shalev

We design alignment-free techniques for comparing a sequence or word, called a target, against a set of words, called a reference. A target-specific factor of a target $T$ against a reference $R$ is a factor $w$ of a word in $T$ which is…

Data Structures and Algorithms · Computer Science 2023-04-07 Marie-Pierre Béal , Maxime Crochemore

Starting with a combinatorial partition theorem for words over an infinite alphabet dominated by a fixed sequence, established recently by the authors, we prove recurrence results for topological dynamical systems indexed by such words. In…

General Topology · Mathematics 2011-01-18 Vassiliki Farmaki , Andreas Koutsogiannis

A group-word $w$ is concise in a class of groups $\mathcal X$ if and only if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G\in \mathcal X$. It is a long-standing open problem whether every…

Group Theory · Mathematics 2024-04-30 Cristina Acciarri , Pavel Shumyatsky

To each one-dimensional subshift $X$, we may associate a winning shift $W(X)$ which arises from a combinatorial game played on the language of $X$. Previously it has been studied what properties of $X$ does $W(X)$ inherit. For example, $X$…

Formal Languages and Automata Theory · Computer Science 2022-06-15 Jarkko Peltomäki , Ville Salo

An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…

Group Theory · Mathematics 2014-02-11 Dmitri Zaitsev , Anthony G. O'Farrell

A regular continuant is the denominator $K$ of a terminating regular continued fraction, interpreted as a function of the partial quotients. We regard $K$ as a function defined on the set of all finite words on the alphabet $1<2<3<\dots$…

Combinatorics · Mathematics 2021-05-20 Gerhard Ramharter , Luca Q. Zamboni

We consider classes T of topological spaces (referred to as T-spaces) that are stable under continuous images and frequently under arbitrary products. A local T-space has for each point a neighborhood base consisting of subsets that are…

General Topology · Mathematics 2020-10-09 Simon Brandhorst , Marcel Erné

The category of all idempotent generated semigroups with a prescribed structure $\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\mathcal{E}$,…

Group Theory · Mathematics 2017-12-14 Igor Dolinka , Robert D. Gray , Nik Ruškuc

Using a m\'elange of techniques at the rich intersection of deformation/rigidity theory, finite index subfactor theory, and geometric group theory, we prove the existence of a continuum of property (T) factors that are pairwise non-stably…

Operator Algebras · Mathematics 2025-11-11 Ionut Chifan , Junhwi Lim

Starting in the 1970s with the fundamental work of Imre Simon, \emph{scattered factors} (also known as subsequences or scattered subwords) have remained a consistently and heavily studied object. The majority of work on scattered factors…

Data Structures and Algorithms · Computer Science 2026-03-24 Duncan Adamson , Pamela Fleischmann , Annika Huch

The observed frequency of the longest proper prefix, the longest proper suffix, and the longest infix of a word $w$ in a given sequence $x$ can be used for classifying $w$ as avoided or overabundant. The definitions used for the expectation…

Given any subvariety of a complex torus defined over $\mathbb{Z}$ and any positive integer $k$, we construct a finite CW complex $X$ such that the $k$-th cohomology jump locus of $X$ is equal to the chosen subvariety, and the $i$-th…

Algebraic Geometry · Mathematics 2013-04-04 Botong Wang

Let $\mathbf{F}$ be the free group on two generators $a, b$ and let a family of words $w = [[a, b], [a^3, b^n]]$ in $\mathbf{F}$. In this paper we examine surjectivity of word map $w$ on special unitary group SU(2) over complex field…

Group Theory · Mathematics 2025-05-27 Rohit Yadav

Growing out of the initial connections between subfactors and knot theory that gave rise to the Jones polynomial, Jones' axiomatization of the standard invariant of an extremal finite index $II_1$ subfactor as a spherical $C^*$-planar…

Operator Algebras · Mathematics 2011-11-08 Michael Burns

We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…

Logic in Computer Science · Computer Science 2021-05-14 Dominik D. Freydenberger , Liat Peterfreund