Related papers: Prodsimplicial-Neighborly Polytopes

The interrelations between (upper and lower) Minkowski contents and (upper and lower) surface area based contents (S-contents) as well as between their associated dimensions have recently been investigated for general sets in R^d (cf. [3]).…

Given an undirected $n$-vertex graph and $k$ pairs of terminal vertices $(s_1,t_1), \ldots, (s_k,t_k)$, the $k$-Disjoint Shortest Paths ($k$-DSP)-problem asks whether there are $k$ pairwise vertex-disjoint paths $P_1,\ldots, P_k$ such that…

Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed…

Let $\Delta_k(n)$ denote the simplicial complex of $(k+1)$-crossing-free subsets of edges in $\binom{[n]}{2}$. Here $k,n\in \mathbb N$ and $n\ge 2k+1$. Jonsson (2003) proved that (neglecting the short edges that cannot be part of any…

Let $P$ be a polygon with $r>0$ reflex vertices and possibly with holes and islands. A subsuming polygon of $P$ is a polygon $P'$ such that $P \subseteq P'$, each connected component $R$ of $P$ is a subset of a distinct connected component…

Symmetric Jack polynomials arise naturally in several contexts, including statistics, physics, combinatorics, and representation theory. They are pairwise orthogonal with repsect to two different inner products, the first defined by…

We establish simultaneous approximation properties of weighted first-order Sobolev orthogonal projectors onto spaces of polynomials of bounded total degree in the Euclidean unit ball. The simultaneity is in the sense that we provide bounds…

A combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there at most $2^{d+1}-2$ neighbourly simplices in $\mathbb R^d$, is presented.

This paper introduces a general construction of self-similar metric spaces as limits of discrete graphs. Our framework produces many classical examples, such as the Sierpi\'nski carpet and the higher dimensional Menger sponges, but also a…

For some self-similar sets K in d-dimensional Euclidean space we obtain certain lower bounds for the lower Minkowski dimension of K+E in terms of the lower Minkowski dimension of E.

We show that by cutting off the vertices and then the edges of neighborly cubical polytopes, one obtains simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log^{3/2}n)$. This…

For every pattern $P$, consisting of a finite set of points in the plane, $S_{P}(n,m)$ is defined as the largest number of similar copies of $P$ among sets of $n$ points in the plane without $m$ points on a line. A general construction,…

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…

We construct a family of polytopes, which we call Chevalley polytopes, associated to homogeneous spaces $X=G/P$ in their projective embeddings $X\hookrightarrow \mathbb{P}(V_{\varpi})$ together with a choice of reduced expression for the…

We consider two multi-dimensional generalisations of the dispersionless Kadomtsev-Petviashvili (dKP) equation, both allowing for arbitrary dimensionality, and non-linearity. For one of these generalisations, we characterise all solutions…

This paper introduces modern geometric combinatorial technology from the theory of triangulations in order to derive results in toric symplectic geometry. In the main part of the paper we prove a number of properties of the space…

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

We study locality-sensitive hash methods for the nearest neighbor problem for the angular distance, focusing on the approach of first projecting down onto a low-dimensional subspace, and then partitioning the projected vectors according to…

Many problems in combinatorial geometry can be formulated in terms of curves or surfaces containing many points of a cartesian product. In 2000, Elekes and R\'onyai proved that if the graph of a polynomial contains $cn^2$ points of an…

We construct 2^{\Omega(n^{5/4})} combinatorial types of triangulated 3-spheres on n vertices. Since by a result of Goodman and Pollack (1986) there are no more than 2^{O(n log n)} combinatorial types of simplicial 4-polytopes, this proves…