Related papers: Lindenmayer graph languages, first-order theories …

Large language models (LLMs) such as GPT-4 have emerged as frontrunners, showcasing unparalleled prowess in diverse applications, including answering queries, code generation, and more. Parallelly, graph-structured data, an intrinsic data…

We give analogues of the Auslander correspondence for two classes of triangulated categories satisfying certain finiteness conditions. The first class is triangulated categories with additive generators and we consider their endomorphism…

Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is the one of the Young graded graph of integer…

A graph $G=(V,E)$ is called an expander if every vertex subset $U$ of size up to $|V|/2$ has an external neighborhood whose size is comparable to $|U|$. Expanders have been a subject of intensive research for more than three decades and…

Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…

In this paper we present two approaches to Lindenmayer systems: the rule-based (or generative) approach, which focuses on L-systems as Thue rewriting systems and a constraint-based (or model-theoretic) approach, in which rules are abandoned…

Pre-trained sequence-to-sequence language models have led to widespread success in many natural language generation tasks. However, there has been relatively less work on analyzing their ability to generate structured outputs such as…

Let us call a simple graph on $n\geq 2$ vertices a prime gap graph if its vertex degrees are $1$ and the first $n-1$ prime gaps. We show that such a graph exists for every large $n$, and in fact for every $n\geq 2$ if we assume the Riemann…

Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs.…

Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…

Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…

We deal with first-order definability in the substructure ordering $(\mathcal{D}; \sqsubseteq)$ of finite directed graphs. In two papers, the author has already investigated the first-order language of the embeddability ordering $(…

Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…

We present a new graph compressor that works by recursively detecting repeated substructures and representing them through grammar rules. We show that for a large number of graphs the compressor obtains smaller representations than other…

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

A unified treatment of Schwinger parametrised Feynman amplitudes is suggested which addresses vertices of arbitrary order on the same footing as propagators. Contributions from distinct diagrams are organised collectively. The scheme is…

We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…

We construct an explicit generating sets $F_n$ and $\tilde F_n$ of the alternating and the symmetric groups, which make the Cayley graphs $C(Alt(n), F_n)$ and $C(Sym(n), \tilde F_n)$ a family of bounded degree expanders for all sufficiently…

Consider two planar graphs which are subject to edge insertions and deletions. We show that whether the two graphs are isomorphic can be maintained with first-order logic formulas and auxiliary data of polynomial size. This places the…

Large language models have evolved to process multiple modalities beyond text, such as images and audio, which motivates us to explore how to effectively leverage them for graph reasoning tasks. The key question, therefore, is how to…