Related papers: A Schnyder-type drawing algorithm for 5-connected …
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…
In this work, we show that the checkerboard model exhibits the phenomenon of foliated fracton order. We introduce a renormalization group transformation for the model that utilizes toric code bilayers as an entanglement resource, and show…
Polygon representation learning is essential for diverse applications, encompassing tasks such as shape coding, building pattern classification, and geographic question answering. While recent years have seen considerable advancements in…
We construct the tensor hierarchies of generic, bosonic, 5- and 6-dimensional field theories. The construction of the tensor hierarchy starts with the introduction of two tensors: the embedding tensor which tells us which vector is used for…
We prove that any triangulation of a surface different from the sphere and the projective plane admits an orientation without sinks such that every vertex has outdegree divisible by three. This confirms a conjecture of Bar\'at and Thomassen…
Take S to be a 4-dimensional Sklyanin (elliptic) algebra that is module-finite over its center Z; thus, S is PI. Our first result is the construction of a Poisson Z-order structure on S such that the induced Poisson bracket on Z is…
We explore the $\mathbb{Z}_{2,3,4,6}$ S-foldings of some 5d superconformal field theories from the $(p,q)$ 5-brane web perspective. The S-folding involves both a spatial quotient and an $\mathrm{SL}(2,\mathbb{Z})$ transformation on 5-branes…
We present bijections for planar maps with boundaries. In particular, we obtain bijections for triangulations and quadrangulations of the sphere with boundaries of prescribed lengths. For triangulations we recover the beautiful factorized…
We investigate the combinatorics of quivers that arise from triangulations of even-dimensional cyclic polytopes. Work of Oppermann and Thomas pinpoints such quivers as the prototypes for higher-dimensional cluster theory. We first show that…
In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…
Euclidean Steiner trees are relevant to model minimal networks in real-world applications ubiquitously. In this paper, we study the feasibility of a hierarchical approach embedded with bundling operations to compute multiple and mutually…
We present a new normal form for cubic surfaces that is well suited for p-adic geometry, as it reveals the intrinsic del Pezzo combinatorics of the 27 trees in the tropicalization. The new normal form is a polynomial with eight terms,…
Triangulation algorithms that conform to a set of non-intersecting input segments typically proceed in an incremental fashion, by inserting points first, and then segments. Inserting a segment amounts to: (1) deleting all the triangles it…
This paper describes in detail how (discrete) quaternions - ie. the abstract structure of 3-D space - emerge from, first, the Void, and thence from primitive combinatorial structures, using only the exclusion and co-occurrence of otherwise…
A {\em $1-$vertex triangulation} of an oriented compact surface $S$ of genus $g$ is an embedded graph $T\subset S$ with a unique vertex such that all connected components of $S\setminus T$ are triangles (adjacent to exactly 3 edges of $T$).…
We present several bijections, in terms of combinatorial objects counted by the Schr\"oder numbers, that are then used (via coloring) for the construction and enumeration of rational Schr\"oder paths with integer slope, ordered rooted…
The Euclidean Steiner problem is the problem of finding a set $St$, with the shortest length, such that $St \cup A$ is connected, where $A$ is a given set in a Euclidean space. The solutions $St$ to the Steiner problem will be called…
The main goal of this paper is to describe a data structure called binary join trees that are useful in computing multiple marginals efficiently using the Shenoy-Shafer architecture. We define binary join trees, describe their utility, and…
It is well-known that plane partitions, lozenge tilings of a hexagon, perfect matchings on a honeycomb graph, and families of non-intersecting lattice paths in a hexagon are all in bijection. In this work we consider regions that are more…
We present a combinatorial model of configuration spaces and polytopes associated to the quotients of $\mathbb{C} A_n$, the path algebra of the linearly oriented $A_n$ quiver, i.e. the algebra of upper triangular matrices. These quotient…