Benjamin Merlin Bumpus
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Benjamin Merlin Bumpus has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Kitty Meeks
University of Glasgow
3 shared publications - James Fairbanks
University of Florida
2 shared publications - Daniel Rosiak1 shared publication
- Ernst Althaus
Institute of Computer Science Johannes Gutenberg University Mainz Saarstraße 21 55122 Mainz Germany
1 shared publication - Frédéric Simard
School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, Canada
1 shared publication James Fairbanks
Computer & Information Science & Engineering, University of Florida, Gainesville, USA
1 shared publication
Latest Publications
- Open Access
- 25 October 2026
- Published by Springer Nature in Applied Categorical Structures
- Vol. 34 (6) , 63
Lassos: Pushing Tree Decompositions Forward Along Homomorphisms
It is folklore that tree-width is monotone under taking subgraphs (i.e. injective graph homomorphisms) and contractions (certain kinds of surjective graph homomorphisms). However, although tree-width is obviously not monotone under any surjective graph homomorphism, it is not clear whether contractions are canonically the only class of surjections with respect to which it is monotone. Under the requirement that the decomposition shape must be preserved, we prove that this is indeed the case. Our results provide a framework for answering questions of this sort for many other kinds of combinatorial data structures (such as directed multigraphs, hypergraphs, Petri nets, circular port graphs, half-edge graphs, databases, simplicial sets etc.) for which natural analogues of tree decompositions can be defined. Furthermore and of independent interest, we prove these results by introducing the notion of a lasso , a generalization of contractions of graphs to arbitrary categories with pushouts of monomorphisms.
- 25 October 2026
- Published by Springer Nature in Applied Categorical Structures
- Vol. 34 (6) , 63
Open AccessLassos: Pushing Tree Decompositions Forward Along Homomorphisms
It is folklore that tree-width is monotone under taking subgraphs (i.e. injective graph homomorphisms) and contractions (certain kinds of surjective graph homomorphisms). However, although tree-width is obviously not monotone under any surjective graph homomorphism, it is not clear whether contractions are canonically the only class of surjections with respect to which it is monotone. Under the requirement that the decomposition shape must be preserved, we prove that this is indeed the case. Our results provide a framework for answering questions of this sort for many other kinds of combinatorial data structures (such as directed multigraphs, hypergraphs, Petri nets, circular port graphs, half-edge graphs, databases, simplicial sets etc.) for which natural analogues of tree decompositions can be defined. Furthermore and of independent interest, we prove these results by introducing the notion of a lasso , a generalization of contractions of graphs to arbitrary categories with pushouts of monomorphisms.
- Open Access
- 4 April 2026
- Published by Springer Nature in Applied Categorical Structures
- Vol. 34 (3) , 23
Towards a Unified Theory of Time-Varying Data
What is a time-varying graph, a time-varying topological space, or, more generally, a mathematical structure that evolves over time? In this work, we lay the foundations for a general theory of temporal data by introducing categories of narratives . These are sheaves on posets of time intervals that encode snapshots of a temporal object along with the relationships between them. This theory satisfies five desiderata distilled from the burgeoning field of time-varying graphs: (D1) it defines both time-varying objects and their morphisms; (D2) it distinguishes between cumulative and persistent interpretations and provides principled methods for transitioning between them; (D3) it systematically lifts static notions to their temporal analogues; (D4) it is object agnostic; (D5) it integrates with theories of dynamical systems. To achieve this, we build upon existing categorical and sheaf-theoretic approaches to temporal graph theory, generalizing them to any category with limits and colimits. We also formalize tacit intuitions that, while present, often remain implicit in temporal graph theory. Beyond synthesizing and reformulating existing ideas in categorical language, we introduce sheaf-theoretic constructions and prove results that, to our knowledge, have not appeared in the temporal data literature—such as the adjunction between persistent and cumulative narratives. More importantly, we integrate these existing and novel elements into a consistent and coherent framework, setting the stage for a unified theory of time-varying data.
- 4 April 2026
- Published by Springer Nature in Applied Categorical Structures
- Vol. 34 (3) , 23
Open AccessTowards a Unified Theory of Time-Varying Data
What is a time-varying graph, a time-varying topological space, or, more generally, a mathematical structure that evolves over time? In this work, we lay the foundations for a general theory of temporal data by introducing categories of narratives . These are sheaves on posets of time intervals that encode snapshots of a temporal object along with the relationships between them. This theory satisfies five desiderata distilled from the burgeoning field of time-varying graphs: (D1) it defines both time-varying objects and their morphisms; (D2) it distinguishes between cumulative and persistent interpretations and provides principled methods for transitioning between them; (D3) it systematically lifts static notions to their temporal analogues; (D4) it is object agnostic; (D5) it integrates with theories of dynamical systems. To achieve this, we build upon existing categorical and sheaf-theoretic approaches to temporal graph theory, generalizing them to any category with limits and colimits. We also formalize tacit intuitions that, while present, often remain implicit in temporal graph theory. Beyond synthesizing and reformulating existing ideas in categorical language, we introduce sheaf-theoretic constructions and prove results that, to our knowledge, have not appeared in the temporal data literature—such as the adjunction between persistent and cumulative narratives. More importantly, we integrate these existing and novel elements into a consistent and coherent framework, setting the stage for a unified theory of time-varying data.
- 9 January 2024
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 90 (2) , 533-551
DEGREE OF SATISFIABILITY IN HEYTING ALGEBRAS
We investigate degree of satisfiability questions in the context of Heyting algebras and intuitionistic logic. We classify all equations in one free variable with respect to finite satisfiability gap, and determine which common principles of classical logic in multiple free variables have finite satisfiability gap. In particular we prove that, in a finite non-Boolean Heyting algebra, the probability that a randomly chosen element satisfies $x \vee \neg x = \top $ is no larger than $\frac {2}{3}$ . Finally, we generalize our results to infinite Heyting algebras, and present their applications to point-set topology, black-box algebras, and the philosophy of logic.- 9 January 2024
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 90 (2) , 533-551
DEGREE OF SATISFIABILITY IN HEYTING ALGEBRAS
We investigate degree of satisfiability questions in the context of Heyting algebras and intuitionistic logic. We classify all equations in one free variable with respect to finite satisfiability gap, and determine which common principles of classical logic in multiple free variables have finite satisfiability gap. In particular we prove that, in a finite non-Boolean Heyting algebra, the probability that a randomly chosen element satisfies $x \vee \neg x = \top $ is no larger than $\frac {2}{3}$ . Finally, we generalize our results to infinite Heyting algebras, and present their applications to point-set topology, black-box algebras, and the philosophy of logic.- Open Access
Compositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to mathematical structures writ large. We achieve this horizontal generality by adopting a categorial perspective which allows us to show that: (1) structured decompositions (a recent, abstract generalization of many graph decompositions) define Grothendieck topologies on categories of data (adhesive categories) and that (2) any computational problem which can be represented as a sheaf with respect to these topologies can be decided in linear time on classes of inputs which admit decompositions of bounded width and whose decomposition shapes have bounded feedback vertex number. This immediately leads to algorithms on objects of any C-set category; these include -- to name but a few examples -- structures such as: symmetric graphs, directed graphs, directed multigraphs, hypergraphs, directed hypergraphs, databases, simplicial complexes, circular port graphs and half-edge graphs. Thus we initiate the bridging of tools from sheaf theory, structural graph theory and parameterized complexity theory; we believe this to be a very fruitful approach for a general, algebraic theory of dynamic programming algorithms. Finally we pair our theoretical results with concrete implementations of our main algorithmic contribution in the AlgebraicJulia ecosystem.
Open AccessCompositional Algorithms on Compositional Data: Deciding Sheaves on Presheaves
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to mathematical structures writ large. We achieve this horizontal generality by adopting a categorial perspective which allows us to show that: (1) structured decompositions (a recent, abstract generalization of many graph decompositions) define Grothendieck topologies on categories of data (adhesive categories) and that (2) any computational problem which can be represented as a sheaf with respect to these topologies can be decided in linear time on classes of inputs which admit decompositions of bounded width and whose decomposition shapes have bounded feedback vertex number. This immediately leads to algorithms on objects of any C-set category; these include -- to name but a few examples -- structures such as: symmetric graphs, directed graphs, directed multigraphs, hypergraphs, directed hypergraphs, databases, simplicial complexes, circular port graphs and half-edge graphs. Thus we initiate the bridging of tools from sheaf theory, structural graph theory and parameterized complexity theory; we believe this to be a very fruitful approach for a general, algebraic theory of dynamic programming algorithms. Finally we pair our theoretical results with concrete implementations of our main algorithmic contribution in the AlgebraicJulia ecosystem.
- Open Access
Directed branch-width: A directed analogue of tree-width
We introduce a new digraph width measure called directed branch-width. To do this, we generalize a characterization of graph classes of bounded tree-width in terms of their line graphs to digraphs. Although we prove that underlying branch-width cannot be bounded in terms of our new measure, we show that directed branch-width is a natural generalization of its undirected counterpart and indeed the two invariants can be related via the operation of identifying pairs of sources or pairs of sinks. Leveraging these operations and the relationship to underlying tree-width allows us to extend a range of algorithmic results from directed graphs with bounded underlying treewidth to the larger class of digraphs having bounded directed branch-width.
Open AccessDirected branch-width: A directed analogue of tree-width
We introduce a new digraph width measure called directed branch-width. To do this, we generalize a characterization of graph classes of bounded tree-width in terms of their line graphs to digraphs. Although we prove that underlying branch-width cannot be bounded in terms of our new measure, we show that directed branch-width is a natural generalization of its undirected counterpart and indeed the two invariants can be related via the operation of identifying pairs of sources or pairs of sinks. Leveraging these operations and the relationship to underlying tree-width allows us to extend a range of algorithmic results from directed graphs with bounded underlying treewidth to the larger class of digraphs having bounded directed branch-width.
- Open Access
- 22 August 2022
- Published by Springer Nature in Algorithmica
- Vol. 85 (3) , 688-716
Edge Exploration of Temporal Graphs
We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast to the static case, it is $${\textsc {NP}}$$ -hard to determine whether a given temporal graph is temporally Eulerian even if strong restrictions are placed on the structure of the underlying graph and each edge is active at only three times. However, we do obtain an $${\textsc {FPT}}$$ -algorithm with respect to a new parameter calledinterval-membership-widthwhich restricts the times assigned to different edges; we believe that this parameter will be of independent interest for other temporal graph problems. Our techniques also allow us to resolve two open questions of Akrida, Mertzios and Spirakis [CIAC 2019] concerning a related problem of exploring temporal stars.- 22 August 2022
- Published by Springer Nature in Algorithmica
- Vol. 85 (3) , 688-716
Open AccessEdge Exploration of Temporal Graphs
We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast to the static case, it is $${\textsc {NP}}$$ -hard to determine whether a given temporal graph is temporally Eulerian even if strong restrictions are placed on the structure of the underlying graph and each edge is active at only three times. However, we do obtain an $${\textsc {FPT}}$$ -algorithm with respect to a new parameter calledinterval-membership-widthwhich restricts the times assigned to different edges; we believe that this parameter will be of independent interest for other temporal graph problems. Our techniques also allow us to resolve two open questions of Akrida, Mertzios and Spirakis [CIAC 2019] concerning a related problem of exploring temporal stars.