English
Related papers

Related papers: Hypergraphic zonotopes and acyclohedra

200 papers

A $k$-graph system $\textbf{H}=\{H_i\}_{i\in[m]}$ is a family of not necessarily distinct $k$-graphs on the same $n$-vertex set $V$ and a $k$-graph $H$ on $V$ is said to be $\textbf{H}$-transversal provided that there exists an injection…

Combinatorics · Mathematics 2023-05-12 Yangyang Cheng , Jie Han , Bin Wang , Guanghui Wang , Donglei Yang

A smooth affine hypersurface Z of complex dimension n is homotopy equivalent to an n-dimensional cell complex. Given a defining polynomial f for Z as well as a regular triangulation of its Newton polytope, we provide a purely combinatorial…

Algebraic Geometry · Mathematics 2014-11-11 Helge Ruddat , Nicolò Sibilla , David Treumann , Eric Zaslow

Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of…

Quantum Algebra · Mathematics 2015-06-16 Satyan L. Devadoss , Stefan Forcey

We construct a concrete isomorphism from the permutohedral variety to the regular semisimple Hessenberg variety associated to the Hessenberg function $h_+(i)=i+1$, $1\le i\le n-1$. In the process of defining the isomorphism, we introduce a…

Algebraic Geometry · Mathematics 2022-10-13 Jan-Li Lin

Given a hypergraph $H=(V,E)$, define for every edge $e\in E$ a linear expression with arguments corresponding with the vertices. Next, let the polynomial $p_H$ be the product of such linear expressions for all edges. Our main goal was to…

We generalize the study of higher-form-symmetries to theories with supersymmetry. Using a supergeometry formulation, we find that ordinary higher-form-symmetries nicely combine with supersymmetry to give rise to a much larger spectrum of…

High Energy Physics - Theory · Physics 2025-07-08 P. A. Grassi , S. Penati

Given an integer $k\geq 3$ and an initial $k-1$ isolated vertices, an {\em antiregular $k$-hypergraph} is constructed by alternatively adding an isolated vertex (connected to no other vertices) or a dominating vertex (connected to every…

Combinatorics · Mathematics 2023-03-03 Erchuan Zhang

Let X be a complex analytic manifold. Given a closed subspace $Y\subset X$ of pure codimension p>0, we consider the sheaf of local algebraic cohomology $H^p_{[Y]}({\cal O}_X)$, and ${\cal L}(Y,X)\subset H^p_{[Y]}({\cal O}_X)$ the…

Algebraic Geometry · Mathematics 2008-05-25 Tristan Torrelli

We give a full classification of vertex-transitive zonotopes. We prove that a vertex-transitive zonotope is a $\Gamma$-permutahedron for some finite reflection group $\Gamma\subset\mathrm{O}(\mathbb R^d)$. The same holds true for zonotopes…

Metric Geometry · Mathematics 2020-06-02 Martin Winter

Cosmological polytopes of graphs are a geometric tool in physics to study wavefunctions for cosmological models whose Feynman diagram is given by the graph. After their recent introduction by Arkani-Hamed, Benincasa and Postnikov the focus…

Combinatorics · Mathematics 2026-05-12 Aenne Benjes , Kamillo Ferry , Benjamin Schröter

A perfect $K_t$-matching in a graph $G$ is a spanning subgraph consisting of vertex disjoint copies of $K_t$. A classic theorem of Hajnal and Szemer\'edi states that if $G$ is a graph of order $n$ with minimum degree $\delta(G) \ge…

Combinatorics · Mathematics 2013-01-01 Allan Lo , Klas Markström

We study unit ball graphs (and, more generally, so-called noisy uniform ball graphs) in $d$-dimensional hyperbolic space, which we denote by $\mathbb{H}^d$. Using a new separator theorem, we show that unit ball graphs in $\mathbb{H}^d$…

Computational Geometry · Computer Science 2019-10-01 Sándor Kisfaludi-Bak

A complex unit hypergraph is a hypergraph where each vertex-edge incidence is given a complex unit label. We define the adjacency, incidence, Kirchoff Laplacian and normalized Laplacian of a complex unit hypergraph and study each of them.…

Combinatorics · Mathematics 2024-05-17 Raffaella Mulas , Nathan Reff

Given an arrangement of hyperplanes in $\P^n$, possibly with non-normal crossings, we give a vanishing lemma for the cohomology of the sheaf of $q$-forms with logarithmic poles along our arrangement. We give a basis for the ideal $\cal J$…

alg-geom · Mathematics 2008-02-03 Herbert Kanarek

We initiate the study of convex geometry over ordered hyperfields. We define convex sets and halfspaces over ordered hyperfields, presenting structure theorems over hyperfields arising as quotients of fields. We prove hyperfield analogues…

Metric Geometry · Mathematics 2025-09-24 James Maxwell , Ben Smith

Adjacency between two vertices in graphs or hypergraphs is a pairwise relationship. It is redefined in this article as 2-adjacency. In general hypergraphs, hyperedges hold for $n$-adic relationship. To keep the $n$-adic relationship the…

Discrete Mathematics · Computer Science 2018-05-31 Xavier Ouvrard , Jean-Marie Le Goff , Stéphane Marchand-Maillet

For a finite set $X$ of points in the plane, a set $S$ in the plane, and a positive integer $k$, we say that a $k$-element subset $Y$ of $X$ is captured by $S$ if there is a homothetic copy $S'$ of $S$ such that $X\cap S' = Y$, i.e., $S'$…

Combinatorics · Mathematics 2015-07-14 Maria Axenovich , Torsten Ueckerdt

Generalized permutahedra are the polytopes obtained from the permutahedron by changing the edge lengths while preserving the edge directions, possibly identifying vertices along the way. We introduce a "lifting" construction for these…

Combinatorics · Mathematics 2013-02-25 Federico Ardila , Jeffrey Doker

The definition of a holomorphic function over a general measurable space $S$ endowed with a Markov process is defined by Zeghib and Barre. In this article we consider holomorphic functions over graphs whose ranges are a given finite field…

Rings and Algebras · Mathematics 2016-12-30 Hossein Mohades

We say that a Hamilton cycle $C=(x_1,\ldots,x_n)$ in a graph $G$ is $k$-symmetric, if the mapping $x_i\mapsto x_{i+n/k}$ for all $i=1,\ldots,n$, where indices are considered modulo $n$, is an automorphism of $G$. In other words, if we lay…

Combinatorics · Mathematics 2023-09-15 Petr Gregor , Arturo Merino , Torsten Mütze