English
Related papers

Related papers: The Endomorphism Conjecture for Graded Posets of W…

200 papers

J.-P. Roudneff conjectured in 1991 that every arrangement of $n \ge 2d+1\ge 5$ pseudohyperplanes in the real projective space $\mathbb{P}^d$ has at most $\sum_{i=0}^{d-2} \binom{n-1}{i}$ complete cells (i.e., cells bounded by each…

Combinatorics · Mathematics 2023-03-28 Rangel Hernández-Ortiz , Kolja Knauer , Luis Pedro Montejano , Manfred Scheucher

We investigate the queue number of posets in terms of their width, that is, the maximum number of pairwise incomparable elements. A long-standing conjecture of Heath and Pemmaraju asserts that every poset of width w has queue number at most…

Data Structures and Algorithms · Computer Science 2020-08-26 Jawaherul Md. Alam , Michael A. Bekos , Martin Gronemann , Michael Kaufmann , Sergey Pupyrev

We prove the four-dimensional Gaussian random vector maximum conjecture. This conjecture asserts that among all centered Gaussian random vectors $X=(X_1,X_2,X_3,X_4)$ with $E[X_i^2]=1$, $1\le i\le 4$, the expectation…

Probability · Mathematics 2020-08-18 Wei Sun , Ze-Chun Hu , Guolie Lan

We prove that in each dimension $d$ there is a constant $w^\infty(d)\in \mathbb{N}$ such that for every $n\in \mathbb{N}$ all but finitely many $d$-polytopes with $n$ lattice points have width at most $w^\infty(d)$. We call $w^\infty(d)$…

Combinatorics · Mathematics 2021-05-31 Mónica Blanco , Christian Haase , Jan Hofmann , Francisco Santos

In 1977, Trotter and Moore proved that a poset has dimension at most $3$ whenever its cover graph is a forest, or equivalently, has treewidth at most $1$. On the other hand, a well-known construction of Kelly shows that there are posets of…

Combinatorics · Mathematics 2016-05-05 Gwenaël Joret , Piotr Micek , William T. Trotter , Ruidong Wang , Veit Wiechert

It has been known for more than 40 years that there are posets with planar cover graphs and arbitrarily large dimension. Recently, Streib and Trotter proved that such posets must have large height. In fact, all known constructions of such…

Combinatorics · Mathematics 2018-12-21 David M. Howard , Noah Streib , William T. Trotter , Bartosz Walczak , Ruidong Wang

In this paper we prove a conjecture of Bryant, Griffiths, and Yang concerning the characteristic variety for the determined isometric embedding system. In particular, we show that the characteristic variety is not smooth for any dimension…

Differential Geometry · Mathematics 2014-01-17 Qing Han , Marcus Khuri

Erd\H{o}s asked the following question: given $n$ points in the plane in almost general position (no 4 collinear), how large a set can we guarantee to find that is in general position (no 3 collinear)? F\"uredi constructed a set of $n$…

Combinatorics · Mathematics 2016-01-28 Luka Milićević

We show that any graded digraph $D$ on $n$ vertices with maximum degree $\Delta$ has an oriented Ramsey number of at most $C^\Delta n$ for some absolute constant $C > 1$, improving upon a recent result of Fox, He, and Wigderson. In…

Combinatorics · Mathematics 2024-05-03 Patryk Morawski , Yuval Wigderson

We show that height $h$ posets that have planar cover graphs have dimension $\mathcal{O}(h^6)$. Previously, the best upper bound was $2^{\mathcal{O}(h^3)}$. Planarity plays a key role in our arguments, since there are posets such that (1)…

Combinatorics · Mathematics 2022-10-13 Jakub Kozik , Piotr Micek , William T. Trotter

An $N$-free poset is a poset whose comparability graph does not embed an induced path with four vertices. We use the well-quasi-order property of the class of countable $N$-free posets and some labelled ordered trees to show that a…

Combinatorics · Mathematics 2023-01-09 Davoud Abdi

Anders Bjorner characterized which finite graded partially ordered sets arise as the posets of closure relations on cells of a finite, regular CW complex. His characterization of these "CW posets" required each open interval $(\hat{0},u)$…

Combinatorics · Mathematics 2014-11-06 Patricia Hersh

Borsuk conjectured that every n-dimensional bounded set of positive diameter can be partitioned into n+1 sets of smaller diameters. This conjecture was proved for n=2 by Borsuk, for n=3 first by Eggleston, and disproved for n > 297 by…

Metric Geometry · Mathematics 2010-08-12 Zsolt Langi

We determine all isomorphism classes of hyperfields of a given finite order which can be obtained as quotients of finite fields of sufficiently large order. Using this result, we determine which hyperfields of order at most 4 are quotients…

Rings and Algebras · Mathematics 2020-07-01 Matthew Baker , Tong Jin

We prove that every planar poset $P$ of height $h$ has dimension at most $192h + 96$. This improves on previous exponential bounds and is best possible up to a constant factor. We complement this result with a construction of planar posets…

Combinatorics · Mathematics 2018-01-11 Gwenaël Joret , Piotr Micek , Veit Wiechert

A polarizable endomorphism on a projective variety enables us to consider given morphism as constant multiplication in the height function. In this paper, we will generalize it for arbitrary dominant endomorphism by defining the height…

Number Theory · Mathematics 2010-10-28 Chong Gyu Lee

A famous conjecture in gauge theory mathematics, attributed to Witten, suggests that the polynomial invariants of Donaldson are expressible in terms of the Seiberg-Witten invariants if the underlying four-manifold is of simple type.…

Differential Geometry · Mathematics 2008-03-04 Raphael Zentner

We determine the maximal angular perturbation of the (n+1)th roots of unity permissible in the Marcinkiewicz-Zygmund theorem on L^p means of polynomials of degree at most n. For p=2, the result is an analogue of the Kadets 1/4 theorem on…

Classical Analysis and ODEs · Mathematics 2009-08-26 J. Marzo , K. Seip

We prove the Tate conjecture for integral degree 4 classes on a smooth cubic hypersurface X of dimension 4 over an algebraic closure of a field finitely generated over its prime subfield.

Algebraic Geometry · Mathematics 2019-02-20 François Charles , Alena Pirutka

A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The first author recently showed that the…

Combinatorics · Mathematics 2012-02-28 Francisco Santos , Tamon Stephen , Hugh Thomas