相关论文: Explicit left orders on free groups extending the …
An arrangement of curves in the real plane divides it into a collection of faces. In the case of line arrangements, there exists an associative product which gives this collection a structure of a left regular band. A natural question is…
A logic formalism is presented which increases the expressive power of the ID/LP format of GPSG by enlarging the inventory of ordering relations and extending the domain of their application to non-siblings. This allows a concise, modular…
Lexicographic composition is a natural way to build an aggregate choice function from component choice functions. As the name suggests, the components are ordered and choose sequentially. The sets that subsequent components select from are…
A totally ordered monoid, or tomonoid for short, is a monoid endowed with a compatible total order. We deal in this paper with tomonoids that are finite and negative, where negativity means that the monoidal identity is the top element.…
Every finite flat finitely presented group scheme G of square free order over a scheme S can be written as an extension of a finite etale S-group scheme G" by a commutative finite flat finitely presented S-group scheme G' that is a direct…
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…
We introduce a new class of arrangements of hyperplanes, called (strictly) plus-one generated arrangements, from algebraic point of view. Plus-one generatedness is close to freeness, i.e., plus-one generated arrangements have their…
While a language assigns a value of either `yes' or `no' to each word, a lattice language assigns an element of a given lattice to each word. An advantage of lattice languages is that joins and meets of languages can be defined as…
Given a totally finite ordered alphabet $ A $, endowing the set of words over $ A $ with the alternating lexicographic order, we define a new class of Lyndon words. We study the fundamental properties of the associated symbolic dynamical…
The order of orbit generation in one-dimensional Lorenz-like maps is presented within a two letter symbolics scheme. This order is derived from the natural order of a set of fractions associated to the binary sequences. Its relation to the…
A bi-order on a group $G$ is a total, bi-multiplication invariant order. A subset $S$ in an ordered group $(G,\leqslant)$ is convex if for all $f\leqslant g$ in $S$, every element $h\in G$ satisfying $f\leqslant h \leqslant g$ belongs to…
We show that every trace monoid is isomorphic to a sub-monoid of a monoid of word vectors. It provides a concrete representation of the elements of a trace monoid as processes associated with a resource sharing mechanism. We illustrate this…
We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition numerical predicate are also definable with the order predicate as the only numerical…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as word transformers as a tool toward rigorous analyses of their…
This note aims to introduce a left adjoint functor to the functor which assigns a heap to a group. The adjunction is monadic. It is explained how one can decompose a free group functor through the previously introduced adjoint and employ it…
The first author showed in a previous paper that there is a correspondence between self-similar group actions and a class of left cancellative monoids called left Rees monoids. These monoids can be constructed either directly from the…
Given a pseudoword over suitable pseudovarieties, we associate to it a labeled linear order determined by the factorizations of the pseudoword. We show that, in the case of the pseudovariety of aperiodic finite semigroups, the pseudoword…
The 4-simplex has vertices 5 unit quaternions, which we arrange so that one of them is the unit. We show that the remaining 4 vertices are the generators of a free group. For the proof, we introduce a new alternating length on words in free…
A tree automatic structure is a structure whose domain can be encoded by a regular tree language such that each relation is recognisable by a finite automaton processing tuples of trees synchronously. Words can be regarded as specific…