Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1403.7540

Associative string functions

Erkko Lehtonen·Jean-Luc Marichal·Bruno Teheux
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce the concept of associativity for string functions, where a string function is a unary operation on the set of strings over a given alphabet. We discuss this new property and describe certain classes of associative string functions. We also characterize the recently introduced preassociative functions as compositions of associative string functions with injective unary maps. Finally, we provide descriptions of the classes of associative and preassociative functions which depend only on the length of the input.

Explore related subjects

math.GRcs.DMmath.RA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Erkko Lehtonen, Jean-Luc Marichal, Bruno Teheux. 2014-12-19. Associative string functions. https://doi.org/10.1142/s1793557114500594

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Finite quotients of spherical Artin groups

We show the smallest non-abelian quotients of spherical and affine Artin groups are isomorphic to the smallest non-abelian quotients of the corresponding Coxeter groups. We deduce irreducible spherical Artin groups are determined by their finite quotient groups.

math.GR↗
arXiv2026

Cosets with constant characteristic polynomial

Let H be a linear group. We show that if there is an invertible matrix x such that all the elements of xH share the same characteristic polynomial then H is virtually solvable. There are plenty of applications that will be presented in future paper. Here, we discuss some applications to the generalized Weigold conjecture and present an alternative straightforward proof of the Formanek--Procesi nonlinearity theorem for Aut(F_n), n>2, over every field. When n>5 our non-linearity proof gives a stronger result than the original Formanek--Procesi theorem.

math.GR↗
arXiv2026

Inherently nonfinitely based additively idempotent semirings

We give a sufficient condition for an additively idempotent semiring to be inherently nonfinitely based. Namely, if its generated variety is locally finite and every Zimin word is minimal in the additive order, then it is contained in no finitely based locally finite variety. For each positive integer $n$, we construct an infinite finitely generated flat semiring satisfying all identities in at most $n$ variables of every semiring with this minimality property. We also characterize Zimin minimality by membership of a countable flat factor semiring $\Finf$ in the generated variety. The variety $\V(\Finf)$ is locally finite and inherently nonfinitely based.

math.GR↗