Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System

TL;DR

This paper characterizes when the Hasse diagram of a specific lattice can be embedded as a subgraph in the reduction graph of a one-rule string rewriting system, revealing a dichotomy in possible maximal sizes.

Contribution

It provides a complete characterization of the conditions under which the lattice's Hasse diagram appears as a subgraph, identifying a clear dichotomy in maximal embedding size.

Findings

Maximal size of subgraph embeddings is either 2 or unbounded.

A complete characterization of when the lattice is embeddable.

Existence of a dichotomy in embedding sizes.

Abstract

In this paper, we study a certain case of a subgraph isomorphism problem. We consider the Hasse diagram of the lattice $M_{k}$ (the unique lattice with $k+2$ elements and one anti-chain of length $k$) and want to find the maximal $k$ for which it is isomorphic to a subgraph of the reduction graph of a given one-rule string rewriting system. We obtain a complete characterization for this problem and show that there is a dichotomy. There are one-rule string rewriting systems for which the maximal such $k$ is $2$ and there are cases where there is no maximum. No other intermediate option is possible.