English
Related papers

Related papers: Planar posets have dimension at most linear in the…

200 papers

We prove the endomorphism conjecture for graded posets whose largest Whitney number is at most 4. In particular, this implies the endomorphism conjecture is true for graded posets of width at most 4.

Combinatorics · Mathematics 2023-06-02 Miklós Bóna , Ryan R. Martin

The dimension of a partial order $P$ is the minimum number of linear orders whose intersection is $P$. There are efficient algorithms to test if a partial order has dimension at most $2$. In 1982 Yannakakis showed that for $k\geq 3$ to test…

Combinatorics · Mathematics 2016-04-26 Stefan Felsner , Irina Mustata , Martin Pergel

The structure of maximal faces of the cone of completely positive matrices is still not well understood in higher dimensions, mainly due to the lack of a general characterization of extreme exposed rays of the copositive cone beyond small…

Optimization and Control · Mathematics 2026-03-11 O. I. Kostyukova , T. V. Tchemisova

We construct a hollow lattice polytope (resp. a hollow lattice simplex) of dimension $14$ (resp.$~404$) and of width $15$ (resp.$~408$). They are the first known hollow lattice polytopes of width larger than dimension. We also construct a…

Combinatorics · Mathematics 2019-12-24 Giulia Codenotti , Francisco Santos

We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…

Combinatorics · Mathematics 2024-08-01 Swee Hong Chan , Igor Pak

We derive a new upper bound on the diameter of a polyhedron P = {x \in R^n : Ax <= b}, where A \in Z^{m\timesn}. The bound is polynomial in n and the largest absolute value of a sub-determinant of A, denoted by \Delta. More precisely, we…

Combinatorics · Mathematics 2014-04-30 Nicolas Bonifas , Marco Di Summa , Friedrich Eisenbrand , Nicolai Hähnle , Martin Niemeier

We study integer coefficient polynomials of fixed degree and maximum height $H$, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as $H$…

Number Theory · Mathematics 2017-07-12 Randell Heyman

We present slight refinements of known general lower and upper bounds on sizes of extended formulations for polytopes. With these observations we are able to compute the extension complexities of all 0/1-polytopes up to dimension 4. We…

Combinatorics · Mathematics 2014-06-20 Michael Oelze , Arnaud Vandaele , Stefan Weltge

The main goal of this paper is to present an algorithm bounding the dimension of a linear system of curves of given degree (or monomial basis) with multiple points in general position. As a result we prove the Hirschowitz--Harbourne…

Algebraic Geometry · Mathematics 2016-09-07 Marcin Dumnicki , Witold Jarnicki

For P a poset or lattice, let Id(P) denote the poset, respectively, lattice, of upward directed downsets in P, including the empty set, and let id(P)=Id(P)-\{\emptyset\}. This note obtains various results to the effect that Id(P) is always,…

Rings and Algebras · Mathematics 2013-05-10 George M. Bergman

The aim of this paper is to prove that if a planar set $A$ has a difference set $\Delta(A)$ satisfying $\Delta(A)\subset \Z^++s$ for suitable $s$ than $A$ has at most 3 elements. This result is motivated by the conjecture that the disk has…

Classical Analysis and ODEs · Mathematics 2009-09-02 Alex Iosevich , Philippe Jaming

We prove a lower bound on the rank of tensors constructed from families of linear maps that `expand' the dimension of every subspace. Such families, called {\em dimension expanders} have been studied for many years with several known…

Combinatorics · Mathematics 2025-12-10 Zeev Dvir

For a polygon $P$ with holes in the plane, we denote by $\varrho(P)$ the ratio between the geodesic and the Euclidean diameters of $P$. It is shown that over all convex polygons with $h$~convex holes, the supremum of $\varrho(P)$ is between…

Computational Geometry · Computer Science 2026-02-10 Adrian Dumitrescu , Csaba D. Tóth

The symmetry dimension of a geometric structure is the dimension of its symmetry algebra. We investigate symmetries of almost quaternionic structures of quaternionic dimension $n$. The maximal possible symmetry is realized by the…

Differential Geometry · Mathematics 2016-07-08 Boris Kruglikov , Henrik Winther , Lenka Zalabova

Let $\mathcal{X}$ be a set of $(h-1)$-dimensional subspaces of $\mathrm{PG}(kh-1,q)$ with the property that every hyperplane contains at most $t$ elements of $\mathcal{X}$. We prove the upper bound $|\mathcal{X}| \leq (t-k+2)q^h + t$, and…

Combinatorics · Mathematics 2026-03-31 Tim Alderson , Simeon Ball

This article is a part of a series aimed at classifying normal del Pezzo surfaces of Picard rank one over an algebraically closed field of arbitrary characteristic, up to an isomorphism. The key invariant guiding our classification is the…

Algebraic Geometry · Mathematics 2025-08-20 Karol Palka , Tomasz Pełka

A linear extension of a poset $P$ is a permutation of the elements of the set that respects the partial order. Let $L(P)$ denote the number of linear extensions. It is a #P complete problem to determine $L(P)$ exactly for an arbitrary…

Probability · Mathematics 2017-07-03 Jacqueline Banks , Scott Garrabrant , Mark L. Huber , Anne Perizzolo

In this paper we show that, given a planar Reifenberg flat domain with small constant and a divergence form operator associated to a real (not necessarily symmetric) uniformly elliptic matrix with Lipschitz coefficients, the Hausdorff…

Analysis of PDEs · Mathematics 2025-05-01 Ignasi Guillén-Mola , Martí Prats , Xavier Tolsa

We prove that posets of bounded height whose cover graphs belong to a fixed class with bounded expansion have bounded dimension. Bounded expansion, introduced by Ne\v{s}et\v{r}il and Ossona de Mendez as a model for sparsity in graphs, is a…

Combinatorics · Mathematics 2019-02-11 Gwenaël Joret , Piotr Micek , Veit Wiechert

Planar graphs are the graphs with Dushnik-Miller dimension at most three (W. Schnyder, Planar graphs and poset dimension, Order 5, 323-343, 1989). Consider the intersection graph of interior disjoint axis parallel rectangles in the plane.…

Discrete Mathematics · Computer Science 2018-09-17 Mathew C. Francis , Daniel Gonçalves
‹ Prev 1 3 4 5 6 7 10 Next ›