487 research outputs found
The Tutte-Grothendieck group of a convergent alphabetic rewriting system
The two operations, deletion and contraction of an edge, on multigraphs
directly lead to the Tutte polynomial which satisfies a universal problem. As
observed by Brylawski in terms of order relations, these operations may be
interpreted as a particular instance of a general theory which involves
universal invariants like the Tutte polynomial, and a universal group, called
the Tutte-Grothendieck group. In this contribution, Brylawski's theory is
extended in two ways: first of all, the order relation is replaced by a string
rewriting system, and secondly, commutativity by partial commutations (that
permits a kind of interpolation between non commutativity and full
commutativity). This allows us to clarify the relations between the semigroup
subject to rewriting and the Tutte-Grothendieck group: the later is actually
the Grothendieck group completion of the former, up to the free adjunction of a
unit (this was even not mention by Brylawski), and normal forms may be seen as
universal invariants. Moreover we prove that such universal constructions are
also possible in case of a non convergent rewriting system, outside the scope
of Brylawski's work.Comment: 17 page
On the rational subset problem for groups
We use language theory to study the rational subset problem for groups and
monoids. We show that the decidability of this problem is preserved under graph
of groups constructions with finite edge groups. In particular, it passes
through free products amalgamated over finite subgroups and HNN extensions with
finite associated subgroups. We provide a simple proof of a result of
Grunschlag showing that the decidability of this problem is a virtual property.
We prove further that the problem is decidable for a direct product of a group
G with a monoid M if and only if membership is uniformly decidable for
G-automata subsets of M. It follows that a direct product of a free group with
any abelian group or commutative monoid has decidable rational subset
membership.Comment: 19 page
Two polygraphic presentations of Petri nets
This document gives an algebraic and two polygraphic translations of Petri
nets, all three providing an easier way to describe reductions and to identify
some of them. The first one sees places as generators of a commutative monoid
and transitions as rewriting rules on it: this setting is totally equivalent to
Petri nets, but lacks any graphical intuition. The second one considers places
as 1-dimensional cells and transitions as 2-dimensional ones: this translation
recovers a graphical meaning but raises many difficulties since it uses
explicit permutations. Finally, the third translation sees places as
degenerated 2-dimensional cells and transitions as 3-dimensional ones: this is
a setting equivalent to Petri nets, equipped with a graphical interpretation.Comment: 28 pages, 24 figure
Silent Transitions in Automata with Storage
We consider the computational power of silent transitions in one-way automata
with storage. Specifically, we ask which storage mechanisms admit a
transformation of a given automaton into one that accepts the same language and
reads at least one input symbol in each step.
We study this question using the model of valence automata. Here, a finite
automaton is equipped with a storage mechanism that is given by a monoid.
This work presents generalizations of known results on silent transitions.
For two classes of monoids, it provides characterizations of those monoids that
allow the removal of \lambda-transitions. Both classes are defined by graph
products of copies of the bicyclic monoid and the group of integers. The first
class contains pushdown storages as well as the blind counters while the second
class contains the blind and the partially blind counters.Comment: 32 pages, submitte
Graph products of spheres, associative graded algebras and Hilbert series
Given a finite, simple, vertex-weighted graph, we construct a graded
associative (non-commutative) algebra, whose generators correspond to vertices
and whose ideal of relations has generators that are graded commutators
corresponding to edges. We show that the Hilbert series of this algebra is the
inverse of the clique polynomial of the graph. Using this result it easy to
recognize if the ideal is inert, from which strong results on the algebra
follow. Non-commutative Grobner bases play an important role in our proof.
There is an interesting application to toric topology. This algebra arises
naturally from a partial product of spheres, which is a special case of a
generalized moment-angle complex. We apply our result to the loop-space
homology of this space.Comment: 19 pages, v3: elaborated on connections to related work, added more
citations, to appear in Mathematische Zeitschrif
Monads, partial evaluations, and rewriting
Monads can be interpreted as encoding formal expressions, or formal
operations in the sense of universal algebra. We give a construction which
formalizes the idea of "evaluating an expression partially": for example, "2+3"
can be obtained as a partial evaluation of "2+2+1". This construction can be
given for any monad, and it is linked to the famous bar construction, of which
it gives an operational interpretation: the bar construction induces a
simplicial set, and its 1-cells are partial evaluations.
We study the properties of partial evaluations for general monads. We prove
that whenever the monad is weakly cartesian, partial evaluations can be
composed via the usual Kan filler property of simplicial sets, of which we give
an interpretation in terms of substitution of terms.
In terms of rewritings, partial evaluations give an abstract reduction system
which is reflexive, confluent, and transitive whenever the monad is weakly
cartesian.
For the case of probability monads, partial evaluations correspond to what
probabilists call conditional expectation of random variables.
This manuscript is part of a work in progress on a general rewriting
interpretation of the bar construction.Comment: Originally written for the ACT Adjoint School 2019. To appear in
Proceedings of MFPS 202
Towards 3-Dimensional Rewriting Theory
String rewriting systems have proved very useful to study monoids. In good
cases, they give finite presentations of monoids, allowing computations on
those and their manipulation by a computer. Even better, when the presentation
is confluent and terminating, they provide one with a notion of canonical
representative of the elements of the presented monoid. Polygraphs are a
higher-dimensional generalization of this notion of presentation, from the
setting of monoids to the much more general setting of n-categories. One of the
main purposes of this article is to give a progressive introduction to the
notion of higher-dimensional rewriting system provided by polygraphs, and
describe its links with classical rewriting theory, string and term rewriting
systems in particular. After introducing the general setting, we will be
interested in proving local confluence for polygraphs presenting 2-categories
and introduce a framework in which a finite 3-dimensional rewriting system
admits a finite number of critical pairs
The submonoid and rational subset membership problems for graph groups
We show that the membership problem in a finitely generated submonoid of a
graph group (also called a right-angled Artin group or a free partially
commutative group) is decidable if and only if the independence graph
(commutation graph) is a transitive forest. As a consequence we obtain the
first example of a finitely presented group with a decidable generalized word
problem that does not have a decidable membership problem for finitely
generated submonoids. We also show that the rational subset membership problem
is decidable for a graph group if and only if the independence graph is a
transitive forest, answering a question of Kambites, Silva, and the second
author. Finally we prove that for certain amalgamated free products and
HNN-extensions the rational subset and submonoid membership problems are
recursively equivalent. In particular, this applies to finitely generated
groups with two or more ends that are either torsion-free or residually finite
- …