English
Related papers

Related papers: Tight Chiral Polytopes

200 papers

We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of $d$-polytopes with at most $d+4$ vertices according to their extension complexity: Out of the…

Combinatorics · Mathematics 2016-09-14 Arnau Padrol

We prove that for every $t\in \mathbb{N}$ there is a constant $\gamma_t$ such that every graph with twin-width at most $t$ and clique number $\omega$ has chromatic number bounded by $2^{\gamma_t \log^{4t+3} \omega}$. In other words, we…

Combinatorics · Mathematics 2022-02-16 Michał Pilipczuk , Marek Sokołowski

We show that all knots up to $6$ crossings can be represented by polynomial knots of degree at most $7$, among which except for $5_2, 5_2^*, 6_1, 6_1^*, 6_2, 6_2^*$ and $6_3$ all are in their minimal degree representation. We provide…

Geometric Topology · Mathematics 2021-01-05 Rama Mishra , Hitesh Raundal

The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…

Combinatorics · Mathematics 2013-04-30 Francisco Santos

A positroid is an ordered matroid realizable by a real matrix with all nonnegative maximal minors. Postnikov gave a map from ordered matroids to Grassmann necklaces, for which there is a unique positroid in each fiber of the map. Here, we…

Combinatorics · Mathematics 2024-07-12 Jeremy Quail

Let $(R,\mathfrak m)$ be an analytically unramified local ring of positive prime characteristic $p.$ For an ideal $I$, let $I^*$ denote its tight closure. We introduce the tight Hilbert function $H^*_I(n)=\ell(R/(I^n)^*)$ and the…

Commutative Algebra · Mathematics 2020-08-19 Kriti Goel , Vivek Mukundan , J. K. Verma

We define the excess degree $\xi(P)$ of a $d$-polytope $P$ as $2f_1-df_0$, where $f_0$ and $f_1$ denote the number of vertices and edges, respectively. This parameter measures how much $P$ deviates from being simple. It turns out that the…

Combinatorics · Mathematics 2018-02-16 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…

Data Structures and Algorithms · Computer Science 2017-03-07 Grzegorz Głuch , Krzysztof Loryś

We prove that there is an absolute constant $ C$ such that for every $ n \geq 2 $ and $ N\geq 10^n, $ there exists a polytope $ P_{n,N} \subset \mathbb{R}^n $ with at most $ N $ facets that satisfies…

Probability · Mathematics 2020-03-02 Gil Kur

We exhibit the first examples of links which are homologically thin but not quasi-alternating. To show that they are not quasi-alternating, we argue that none of their branched double-covers bounds a negative definite 4-manifold with…

Geometric Topology · Mathematics 2009-06-15 Joshua Greene

We investigate the existence of closed polylines (also known as closed polygonal chains or self-crossing polygons) that intersect each of their edges the same number of times. The most general question in this corner of combinatorial…

Metric Geometry · Mathematics 2026-05-19 Dmitri Fomin

We provide a complete classification up to isomorphism of all smooth convex lattice 3-polytopes with at most 16 lattice points. There exist in total 103 different polytopes meeting these criteria. Of these, 99 are strict Cayley polytopes…

Combinatorics · Mathematics 2012-06-22 Anders Lundman

We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of…

Geometric Topology · Mathematics 2019-05-06 Senja Barthel

We first construct closed spherical CR manifolds of dimension at least five having non-trivial first Chern class with real coefficients. We next prove a constraint on Chern classes with real coefficients of (not necessarily closed)…

Differential Geometry · Mathematics 2022-10-13 Yuya Takeuchi

We analyze a remarkable class of centrally symmetric polytopes, the Hansen polytopes of split graphs. We confirm Kalai's 3^d-conjecture for such polytopes (they all have at least 3^d nonempty faces) and show that the Hanner polytopes among…

Metric Geometry · Mathematics 2012-01-30 Ragnar Freij , Matthias Henze , Moritz W. Schmitt , Günter M. Ziegler

The cohomological rigidity problem for toric manifolds asks whether toric manifolds are diffeomorphic (or homeomorphic) if their integral cohomology rings are isomorphic. Many affirmative partial solutions to the problem have been obtained…

Algebraic Topology · Mathematics 2020-05-29 Akihiro Higashitani , Kazuki Kurimoto , Mikiya Masuda

A tight $\ell$-cycle minus an edge $C_\ell^-$ is the $3$-graph on the vertex set $[\ell]$, where any three consecutive vertices in the string $123\ldots\ell 1$ form an edge. We show that for every $\ell\ge 5$, $\ell$ not divisible by $3$,…

Combinatorics · Mathematics 2024-11-27 Bernard Lidicky , Connor Mattes , Florian Pfender

An $(n+1)$-toroid is a quotient of a tessellation of the $n$-dimensional Euclidean space with a lattice group. Toroids are generalizations of maps in the torus on higher dimensions and also provide examples of abstract polytopes. Equivelar…

Combinatorics · Mathematics 2018-02-23 José Collins , Antonio Montero

We study unbounded 2-dimensional metric polytopes such as those arising as K\"ahler quotients of complete K\"ahler 4-manifolds with two commuting symmetries and zero scalar curvature. Under a mild closedness condition, we obtain a complete…

Differential Geometry · Mathematics 2015-09-16 Brian Weber

We show that there is a sequence of explicit multilinear polynomials $P_n(x_1,\ldots,x_n)\in \mathbb{R}[x_1,\ldots,x_n]$ with non-negative coefficients that lies in monotone VNP such that any monotone algebraic circuit for $P_n$ must have…

Computational Complexity · Computer Science 2020-08-03 Srikanth Srinivasan
‹ Prev 1 8 9 10 Next ›