Related papers: Context-free graphs and their transition groups
Algorithms on grammars/transducers with context-free derivations: hypergraph reachability, shortest path, and inside-outside pruning of 'relatively useless' arcs that are unused by any near-shortest paths.
This is a survey of some of the consequences of the recently introduced congruences on the theory of connectednesses (radical classes) and disconnectednesses (semisimple classes) of graphs and topological spaces. In particular, it is shown…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
We study the problem of grammar-constrained context-free language reachability in graphs, focusing on complexity and empirical performance. We present an algorithmic framework for evaluating reachability queries constrained by context-free…
We give a counterexample to a conjecture by Miasnikov, Ventura and Weil, stating that an extension of free groups is algebraic if and only if the corresponding morphism of their core graphs is onto, for every basis of the ambient group. In…
Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…
The theory of graphons is an important tool in understanding properties of large networks. We investigate a power-law random graph model and cast it in the graphon framework. The distinctively different structures of the limit graph are…
In a series of papers, of which this is the first, we study sufficient conditions for Hamiltonicity in terms of forbidden induced subgraphs and extend such results to locally finite infinite graphs. For this we use topological circles…
In this paper we study CAT(0) groups and their splittings as graphs of groups. For one-ended CAT(0) groups with isolated flats we prove a theorem characterizing exactly when the visual boundary is locally connected. This characterization…
We generalize the graphical small cancellation theory of Gromov to a graphical small cancellation theory over the free product. We extend Gromov's small cancellation theorem to the free product. We explain and generalize Rips-Segev's…
In this note we study the generation of $C_0$-semigroups by first order differential operators on $\mathrm{L}^p (\mathbb{R}_+,\mathbb{C}^{\ell})\times \mathrm{L}^p ([0,1],\mathbb{C}^{m})$ with general boundary conditions. In many cases we…
In this note, we study the problem on the existence of non-cyclic free subgroups of the skew group algebra of a locally finite group over a field.
In this paper we study the elementary theory of graph products of groups and show that under natural conditions on the vertex groups we can recover (the core of) the underlying graph and the associated vertex groups. More precisely, we…
We give a technical result that implies a straightforward necessary and sufficient conditions for a graph of groups with virtually cyclic edge groups to be one ended. For arbitrary graphs of groups, we show that if their fundamental group…
In this note, we describe how the study of backgrounds for general quantum systems can be formulated in terms of the representation theory of abstract $C^*$ algebras. We illustrate our general framework through two example systems:…
We introduce context-free languages of morphisms in monoidal categories, extending recent work on the categorification of context-free languages, and regular languages of string diagrams. Context-free languages of string diagrams include…
This paper studies $k$-claw-free graphs, exploring the connection between an extremal combinatorics question and the power of a convex program in approximating the maximum-weight independent set in this graph class. For the extremal…
Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…
We explore the graph approach to contextuality to restate the extended definition of noncontextuality as given by J. Kujala et. al. [Phys. Rev. Lett. 115, 150401 (2015)] using graph-theoretical terms. This extended definition avoids the…
We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…