A Nesting-Free Normal Form for Nested Conditions in Finite Lattices of Subgraphs

Mathematics > Category Theory [Submitted on 26 Jan 2026 (v1), last revised 1 Jun 2026 (this version, v3)] Title:A Nesting-Free Normal Form for Nested Conditions in Finite Lattices of Subgraphs View PDF HTML (experimental)Abstract:We present a nesting-free normal form for the formalism of nested conditions and constraints in the context of finite lattices of subgraphs. Submission history From: Jens Kosiol [view email][v1] Mon, 26 Jan 2026 11:29:08 UTC (547 KB) [v2] Wed, 25 Mar 2026 11:57:08 UTC (440 KB) [v3] Mon, 1 Jun 2026 09:30:59 UTC (438 KB) Current browse context: math.CT References & Citations Loading... Bibliographic and Citation Tools Bibliographic Explorer (What is the Explorer?) Connected Papers (What is Connected Papers?) Litmaps (What is Litmaps?) scite Smart Citations (What are Smart Citations?) Code, Data and Media Associated with this Article alphaXiv (What is alphaXiv?) CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub (What is DagsHub?) Gotit.pub (What is GotitPub?) Hugging Face (What is Huggingface?) ScienceCast (What is ScienceCast?) Demos Recommenders and Search Tools Influence Flower (What are Influence Flowers?) CORE Recommender (What is CORE?) arXivLabs: experimental projects with community collaborators Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.