486,056 research outputs found
Patterns theory and geodesic automatic structure for a class of groups
We introduce a theory of "patterns" in order to study geodesics in a certain
class of group presentations. Using patterns we show that there does not exist
a geodesic automatic structure for certain group presentations, and that
certain group presentations are almost convex.Comment: Appeared in 2003. I am putting all my past papers on arxi
Partial mirror symmetry, lattice presentations and algebraic monoids
This is the second in a series of papers that develops the theory of
reflection monoids, motivated by the theory of reflection groups. Reflection
monoids were first introduced in arXiv:0812.2789. In this paper we study their
presentations as abstract monoids. Along the way we also find general
presentations for certain join-semilattices (as monoids under join) which we
interpret for two special classes of examples: the face lattices of convex
polytopes and the geometric lattices, particularly the intersection lattices of
hyperplane arrangements. Another spin-off is a general presentation for the
Renner monoid of an algebraic monoid, which we illustrate in the special case
of the "classical" algebraic monoids.Comment: 41 page
Unary FA-presentable semigroups
Automatic presentations, also called FA-presentations, were introduced to extend nite model theory to innite structures whilst retaining the solubility of interesting decision problems. A particular focus of research has been the classication of those structures of some species that admit automatic presentations. Whilst some successes have been obtained, this appears to be a dicult problem in general. A restricted problem, also of signicant interest, is to ask this question for unary automatic presentations: auto-matic presentations over a one-letter alphabet. This paper studies unary FA-presentable semigroups. We prove the following: Every unary FA-presentable structure admits an injective unary automatic presentation where the language of representatives consists of every word over a one-letter alphabet. Unary FA-presentable semigroups are locally nite, but non-nitely generated unary FA-presentable semigroups may be innite. Every unary FA-presentable semigroup satises some Burnside identity.We describe the Green's relations in unary FA-presentable semigroups. We investigate the relationship between the class of unary FA-presentable semigroups and various semigroup constructions. A classication is given of the unary FA-presentable completely simple semigroups.PostprintPeer reviewe
Second-Order Algebraic Theories
Fiore and Hur recently introduced a conservative extension of universal
algebra and equational logic from first to second order. Second-order universal
algebra and second-order equational logic respectively provide a model theory
and a formal deductive system for languages with variable binding and
parameterised metavariables. This work completes the foundations of the subject
from the viewpoint of categorical algebra. Specifically, the paper introduces
the notion of second-order algebraic theory and develops its basic theory. Two
categorical equivalences are established: at the syntactic level, that of
second-order equational presentations and second-order algebraic theories; at
the semantic level, that of second-order algebras and second-order functorial
models. Our development includes a mathematical definition of syntactic
translation between second-order equational presentations. This gives the first
formalisation of notions such as encodings and transforms in the context of
languages with variable binding
Free constructions and coproducts of d-frames
A general theory of presentations for d-frames does not yet exist. We review
the difficulties and give sufficient conditions for when they can be overcome.
As an application we prove that the category of d-frames is closed under
coproducts
- …