Related papers: Shuffles and Concatenations in Constructing of Gra…
This paper provides a preparatory introduction to torsors, written with a view toward later applications in the author's work. Rather than aiming at a comprehensive survey, the exposition focuses on those aspects of torsors that are most…
We prove `twisted' versions of Kirchhoff's network theorem and Kirchhoff's matrix-tree theorem on connected finite graphs. Twisting here refers to chains with coefficients in a flat unitary line bundle.
We study the behaviour of random labelled and unlabelled cographs with n vertices as n tends to infinity. Our main result is a novel probabilistic limit in the space of graphons.
The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations research and statistics it is still open whether the Hirsch…
This note discusses recent new approaches to studying flopping curves on 3-folds. In a joint paper, the author and Michael Wemyss introduced a 3-fold invariant, the contraction algebra, which may be associated to such curves. It…
The study of subshifts on groups different from $\mathbb{Z}$, such as $\mathbb{Z}^d$, $d\geq 2$, has been a subject of intense research in recent years. These investigations have unveiled aremarkable connection between dynamics and…
We show that the theory of sorting by reversals fits into the well-established theory of circuit partitions of 4-regular multigraphs (which also involves the combinatorial structures of circle graphs and delta-matroids). In this way, we…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Order and symmetry are main structural principles in mathematics. We give five examples where on the face of it order is not apparent, but deeper investigations reveal that they are governed by order structures. These examples are finite…
Graph transformers are a recent advancement in machine learning, offering a new class of neural network models for graph-structured data. The synergy between transformers and graph learning demonstrates strong performance and versatility…
A graph associahedron is a simple polytope whose face lattice encodes the nested structure of the connected subgraphs of a given graph. In this paper, we study certain graph properties of the 1-skeleta of graph associahedra, such as their…
We study the evolution, under convex Hamiltonian flows on cotangent bundles of compact manifolds, of certain distinguished subsets of the phase space. These subsets are generalizations of Lagrangian graphs, we call them pseudographs. They…
We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different…
Covtree - a partial order on certain sets of finite, unlabeled causal sets - is a manifestly covariant framework for causal set dynamics. Here, as a first step in picking out a class of physically well-motivated covtree dynamics, we study…
This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…
This paper analyzes a certain action called "whirling" that can be defined on any family of functions between two finite sets equipped with a linear (or cyclic) ordering. Many maps of interest in dynamical algebraic combinatorics, such as…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
We model problems as presheaves that assign sets of certificates to input instances, and we show how to use presheaf \v{C}ech cohomology to capture the precise ways in which local solutions fail to patch into global ones. Applied to…
In this paper two important aspects related to Caputo fractional-order discrete variant of a class of maps defined on the complex plane, are analytically and numerically revealed: attractors symmetry-broken induced by the fractional-order…
In this paper we further develop the theory of one sided shift spaces over infinite alphabets, characterizing one-step shifts as edge shifts of ultragraphs and partially answering a conjecture regarding shifts of finite type (we show that…