1,505 research outputs found
Every semilinear set is a finite union of disjoint linear sets
AbstractWe prove in this paper that every semilinear set is a finite union of disjoint linear sets, using elementary combinatorial-topological lemmas
Automatic Equivalence Structures of Polynomial Growth
In this paper we study the class EqP of automatic equivalence structures of the form ?=(D, E) where the domain D is a regular language of polynomial growth and E is an equivalence relation on D. Our goal is to investigate the following two foundational problems (in the theory of automatic structures) aimed for the class EqP. The first is to find algebraic characterizations of structures from EqP, and the second is to investigate the isomorphism problem for the class EqP. We provide full solutions to these two problems. First, we produce a characterization of structures from EqP through multivariate polynomials. Second, we present two contrasting results. On the one hand, we prove that the isomorphism problem for structures from the class EqP is undecidable. On the other hand, we prove that the isomorphism problem is decidable for structures from EqP with domains of quadratic growth
Interpretations of Presburger Arithmetic in Itself
Presburger arithmetic PrA is the true theory of natural numbers with
addition. We study interpretations of PrA in itself. We prove that all
one-dimensional self-interpretations are definably isomorphic to the identity
self-interpretation. In order to prove the results we show that all linear
orders that are interpretable in (N,+) are scattered orders with the finite
Hausdorff rank and that the ranks are bounded in terms of the dimension of the
respective interpretations. From our result about self-interpretations of PrA
it follows that PrA isn't one-dimensionally interpretable in any of its finite
subtheories. We note that the latter was conjectured by A. Visser.Comment: Published in proceedings of LFCS 201
Groups with poly-context-free word problem
We consider the class of groups whose word problem is poly-context-free; that
is, an intersection of finitely many context-free languages. We show that any
group which is virtually a finitely generated subgroup of a direct product of
free groups has poly-context-free word problem, and conjecture that the
converse also holds. We prove our conjecture for several classes of soluble
groups, including metabelian groups and torsion-free soluble groups, and
present progress towards resolving the conjecture for soluble groups in
general. Some of the techniques introduced for proving languages not to be
poly-context-free may be of independent interest.Comment: 38 pages, no figure
Countable locally 2-arc-transitive bipartite graphs
We present an order-theoretic approach to the study of countably infinite
locally 2-arc-transitive bipartite graphs. Our approach is motivated by
techniques developed by Warren and others during the study of cycle-free
partial orders. We give several new families of previously unknown countably
infinite locally-2-arc-transitive graphs, each family containing continuum many
members. These examples are obtained by gluing together copies of incidence
graphs of semilinear spaces, satisfying a certain symmetry property, in a
tree-like way. In one case we show how the classification problem for that
family relates to the problem of determining a certain family of highly
arc-transitive digraphs. Numerous illustrative examples are given.Comment: 29 page
- …