Related papers: Framed Polytopes and Higher Categories
Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…
We consider a class of line operators in d=4, N=2 supersymmetric field theories which leave four supersymmetries unbroken. Such line operators support a new class of BPS states which we call "framed BPS states." These include halo bound…
We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…
Motivated by and extending the technical results in our earlier work on symplectic Calabi-Yau $4$-manifolds, a general and systematic approach for studying certain unions of symplectic embedded surfaces in a rational $4$-manifold $X=CP^2\#…
In the context of higher gauge theory, we construct a flat and fake flat 2-connection, in the configuration space of $n$ particles in the complex plane, categorifying the Knizhnik-Zamolodchikov connection. To this end, we define the…
As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph $G=(V,E)$, a multiset…
We provide descriptions of the derived categories of degree $d$ hypersurface fibrations which generalize a result of Kuznetsov for quadric fibrations and give a relative version of a well-known theorem of Orlov. Using a local generator and…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
The cosmohedron was recently proposed as a polytope underlying the cosmological wavefunction for $\text{Tr}(\Phi^3)$ theory. Its faces were conjectured to be in bijection with Matryoshkas, which are obtained from a subdivision of a polygon…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
The goal of this paper is twofold: (i) define a symplectic Khovanov type homology for a transverse link in a fibered closed $3$-manifold $M$ (with an auxiliary choice of a homotopy class of loops that intersect each fiber once) and (ii)…
The aim of this paper is to develop a method for proving almost sure convergence in Gromov-Hausodorff-Prokhorov topology for a class of models of growing random graphs that generalises R\'emy's algorithm for binary trees. We describe the…
We conduct a systematic study of the Ehrhart theory of certain slices of rectangular prisms. Our polytopes are generalizations of the hypersimplex and are contained in the larger class of polypositroids introduced by Lam and Postnikov;…
A string polytope is a rational convex polytope whose lattice points parametrize a highest weight crystal basis, which is obtained from a string cone by explicit affine inequalities depending on a highest weight. It also inherits geometric…
We investigate a recent semantics for intermediate (and modal) logics in terms of polyhedra. The main result is a finite axiomatisation of the intermediate logic of the class of all polytopes -- i.e., compact convex polyhedra -- denoted PL.…
Planar bicolored (plabic) graphs are combinatorial objects introduced by Postnikov to give parameterizations of the positroid cells of the totally nonnegative Grassmannian $\text{Gr}^{\geq 0}(n,k)$. Any two plabic graphs for the same…
This is a research monograph on symplectic cohomology (disguised as an advanced graduate textbook), which provides a construction of this version of Hamiltonian Floer cohomology for cotangent bundles of closed manifolds. The focus is on the…
Constrained coding is a fundamental field in coding theory that tackles efficient communication through constrained channels. While channels with fixed constraints have a general optimal solution, there is increasing demand for parametric…
In this paper, we explore a connection between binary hierarchical models, their marginal polytopes and codeword polytopes, the convex hulls of linear codes. The class of linear codes that are realizable by hierarchical models is…
Nested (or reconciled) phylogenetic trees model co-evolutionary systems in which one evolutionary history is embedded within another. We introduce a geometric framework for such systems by defining $\sigma$-space, a moduli space of fully…