Related papers: Framed Polytopes and Higher Categories
The constrained linear representability problem (CLRP) for polymatroids determines whether there exists a polymatroid that is linear over a specified field while satisfying a collection of constraints on the rank function. Using a computer…
The category of framed correspondences $Fr_*(k)$ and framed sheaves were invented by Voevodsky in his unpublished notes [V2]. Based on the theory, framed motives are introduced and studied in [GP1]. These are Nisnivich sheaves of…
Matroids give rise to several natural constructions of polytopes. Inspired by this, we examine polytopes that arise from the signed circuits of an oriented matroid. We give the dimensions of these polytopes arising from graphical oriented…
We study the properties of a set of vectors called tight frames that obtained as the orthogonal projection of some orthonormal basis of $\R^n$ onto $\R^k.$ We show that a set of vectors is a tight frame if and only if the set of all cross…
In view of the result of Kontsevich, now often called ``the fundamental theorem of Vassiliev theory'', identifying the graded dual of the associated graded vector space to the space of Vassiliev invariants filtered by degree with the linear…
This paper is a self-contained presentation of certain aspects of the theory of weighted Sobolev spaces and elliptic operators on non-compact Riemannian manifolds. Specifically, we discuss (i) the standard and weighted Sobolev Embedding…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
Explicit high-order non-canonical symplectic particle-in-cell algorithms for classical particle-field systems governed by the Vlasov-Maxwell equations are developed. The algorithm conserves a discrete non-canonical symplectic structure…
We show that, in a highest weight category with duality, the endomorphism algebra of a tilting object is naturally a cellular algebra. Our proof generalizes a recent construction of Andersen, Stroppel, and Tubbenhauer. This result raises…
The collection of $d \times N$ complex matrices with prescribed column norms and prescribed (nonzero) singular values forms a compact algebraic variety, which we refer to as a frame space. Elements of frame spaces -- i.e., frames -- are…
We give an overview of the theory of framed correspondences in motivic homotopy theory. Motivic spaces with framed transfers are the analogue in motivic homotopy theory of $E_{\infty}$-spaces in classical homotopy theory, and in particular…
We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs…
In this research announcement we associate to each convex polytope, possibly nonrational and nonsimple, a family of compact spaces that are stratified by quasifolds, i.e. the strata are locally modelled by $\R^k$ modulo the action of a…
Braverman, Finkelberg and Nakajima have recently given a mathematical construction of the Coulomb branches of a large class of $3d$ $\mathcal{N} =4$ gauge theories, as algebraic varieties with Poisson structure. They conjecture that these…
A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…
Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the orignial polytope are hereditary to its…
We introduce the classes of holomorphic $p$-contact manifolds and holomorphic $s$-symplectic manifolds that generalise the classical holomorphic contact and holomorphic symplectic structures. After observing their basic properties and…
Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…
Gromov's famous non-squeezing theorem (1985) states that the standard symplectic ball cannot be symplectically squeezed into any cylinder of smaller radius. Does there exist an analogue of this result in contact geometry? Our main finding…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…