English
Related papers

Related papers: A counterexample to Wegner's conjecture on good co…

200 papers

The classical Kneser-Milnor theorem says that every closed oriented connected 3-dimensional manifold admits a unique connected sum decomposition into manifolds that cannot be decomposed any further. We discuss to what degree such…

We show that optimal polynomial meshes exist for every convex body in $\mathbb{R}^d$, confirming a conjecture by A. Kroo.

Numerical Analysis · Mathematics 2025-04-15 Feng Dai , Andriy Prymak

Let K and L be compact convex sets in R^n. The following two statements are shown to be equivalent: (i) For every polytope Q inside K having at most n+1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 <= d <=…

Metric Geometry · Mathematics 2010-10-25 Daniel A. Klain

It is well known that in dimension one the set of Dirichlet improvable real numbers consists precisely of badly approximable and singular numbers. We show that in higher dimensions this is not the case by proving that there exist continuum…

Number Theory · Mathematics 2020-12-25 Victor Beresnevich , Lifan Guan , Antoine Marnat , Felipe Ramirez , Sanju Velani

A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…

Combinatorics · Mathematics 2019-07-16 Hoa T. Bui , Guillermo Pineda-Villavicencio , Julien Ugon

Let $P$ be a set of $n$ points in $\mathbb{R}^d$, in general position. We remove all of them one by one, in each step erasing one vertex of the convex hull of the current remaining set. Let $g_d(P)$ denote the number of different removal…

Combinatorics · Mathematics 2024-11-15 Dániel Gábor Simon

We consider $d$-dimensional simplicial complexes which can be PL embedded in the $2d$-dimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is…

Computational Geometry · Computer Science 2020-01-28 Salman Parsa

This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one…

Algebraic Topology · Mathematics 2015-09-11 Rafal Komendarczyk , Jeffrey Pullen

A $k$-uniform, $d$-regular instance of Exact Cover is a family of $m$ sets $F_{n,d,k} = \{ S_j \subseteq \{1,...,n\} \}$, where each subset has size $k$ and each $1 \le i \le n$ is contained in $d$ of the $S_j$. It is satisfiable if there…

Computational Complexity · Computer Science 2015-03-05 Cristopher Moore

We give a counterexample to a conjecture of S.E. Morris by showing that there is a compact plane set X such that R(X) has no non-zero, bounded point derivations but such that R(X) is not weakly amenable. We also give an example of a…

Functional Analysis · Mathematics 2007-05-23 J. F. Feinstein

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

Combinatorics · Mathematics 2018-11-20 Eran Nevo , Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

We consider packings of the plane using discs of radius 1 and r. A packing is compact if every disc D is tangent to a sequence of discs D_1, D_2, ..., D_n such that D_i is tangent to D_{i+1}. We prove that there are only nine values of r…

Metric Geometry · Mathematics 2008-03-03 Tom Kennedy

Let G be an almost simple, simply connected algebraic group over an algebraically closed field of characteristic p>0. In this paper we restate our conjecture from 1979 on the characters of irreducible modular representations of G so that it…

Representation Theory · Mathematics 2014-08-19 G. Lusztig

This work is concerned with a representation of shapes that disentangles fine, local and possibly repeating geometry, from global, coarse structures. Achieving such disentanglement leads to two unrelated advantages: i) a significant…

Computer Vision and Pattern Recognition · Computer Science 2022-04-06 Luca Morreale , Noam Aigerman , Paul Guerrero , Vladimir G. Kim , Niloy J. Mitra

We consider the realization space of the $d$-dimensional cube, and show that any two realizations are connected by a finite sequence of projective transformations and normal transformations. We use this fact to define an analog of the…

Combinatorics · Mathematics 2019-12-23 Karim Adiprasito , Daniel Kalmanovich , Eran Nevo

A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is $k$-linked if, for every…

Combinatorics · Mathematics 2019-09-30 Hoa Thi Bui , Guillermo Pineda-Villavicencio , Julien Ugon

Let $X_1,X_2, \ldots $ be independent random uniform points in a bounded domain $A \subset \mathbb{R}^d$ with smooth boundary. Define the coverage threshold $R_n$ to be the smallest $r$ such that $A$ is covered by the balls of radius $r$…

Probability · Mathematics 2022-01-12 Mathew D. Penrose

We prove that any convex geometry $\mathcal{A}=(U,\mathcal{C})$ on $n$ points and any ideal $\mathcal{I}=(U',\mathcal{C}')$ of $\mathcal{A}$ can be realized as the intersection pattern of an open convex polyhedral cone $K\subseteq {\mathbb…

Combinatorics · Mathematics 2025-07-30 Jérémie Chalopin , Victor Chepoi , Kolja Knauer

Sommese has conjectured a classification of smooth projective varieties X containing, as an ample divisor, a P^d-bundle Y over a smooth variety Z. This conjecture is known if d>1, if dim(X)<5, or if Z admits a finite morphism to an Abelian…

Algebraic Geometry · Mathematics 2016-02-03 Daniel Litt

We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X for which the membership question: ``given an x in V, does x belong to X?'' can be answered efficiently (in time polynomial in…

Metric Geometry · Mathematics 2007-05-23 Alexander Barvinok , Ellen Veomett