Related papers: Clean tangled clutters, simplices, and projective …
We describe convex hulls of the simplest compact space curves, reducible quartics consisting of two circles. When the circles do not meet in complex projective space, their algebraic boundary contains an irrational ruled surface of degree…
We consider the bin packing problem with $d$ different item sizes and revisit the structure theorem given by Goemans and Rothvo\ss [6] about solutions of the integer cone. We present new techniques on how solutions can be modified and give…
We demonstrate that pure C*-algebras form a robust class by proving that pureness follows from very weak comparison and divisibility properties. Using this, we show that every simple, non-elementary C*-algebra with a unique quasitrace and…
We prove that an $\omega$-categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its polymorphism clone has a homomorphism to the clone of projections, and that…
Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines. A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest…
For a given clutter $\mathcal{C}$, let $I:=I ( \bar{\mathcal{C}} )$ be the circuit ideal in the polynomial ring $S$. In this paper, we show that the Betti numbers of $I$ and $I + ( \textbf{x}_F )$ are the same in their non-linear strands,…
A plane curve C defined by a homogeneous polynomial satisfying Laplace's equation appears canonically as the vanishing of the Pfaffian of a skew-symmetric matrix of linear forms. As a consequence there is a natural semi-stable rank two…
We characterize embedded $\C^1$ hypersurfaces of $\R^n$ as the only locally closed sets with continuously varying flat tangent cones whose measure-theoretic-multiplicity is at most $m<3/2$. It follows then that any (topological)…
This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container…
The neutral inclusion problem in two dimensional isotropic elasticity is considered. The neutral inclusion, when inserted in a matrix having a uniform applied field, does not disturb the field outside the inclusion. The inclusion consists…
Given $d+1$ sets of points, or colours, $S_1,\ldots,S_{d+1}$ in $\mathbb R^d$, a colourful simplex is a set $T\subseteq\bigcup_{i=1}^{d+1}S_i$ such that $|T\cap S_i|\leq 1$, for all $i\in\{1,\ldots,d+1\}$. The colourful Carath\'eodory…
We concern $C^2$-compactness of the solution set of the boundary Yamabe problem on smooth compact Riemannian manifolds with boundary provided that their dimensions are $4$, $5$ or $6$. By conducting a quantitative analysis of a linear…
A convex geometric hypergraph (abbreviated cgh) consists of a collection of subsets of a strictly convex set of points in the plane. Extremal problems for cgh's have been extensively studied in the literature, and in this paper we consider…
The weak variant of Hanani-Tutte theorem says that a graph is planar, if it can be drawn in the plane so that every pair of edges cross an even number of times. Moreover, we can turn such a drawing into an embedding without changing the…
We show that packing axis-aligned unit squares into a simple polygon $P$ is NP-hard, even when $P$ is an orthogonal and orthogonally convex polygon with half-integer coordinates. It has been known since the early 80s that packing unit…
This paper views the honeycomb conjecture and the Kepler problem essentially as extreme value problems and solves them by partitioning 2-space and 3-space into building blocks and determining those blocks that have the universal extreme…
We give evidence that particles interacting via the simple, radially symmetric square-shoulder potential can self-organize in highly complex, low-symmetry lattices, forming thereby clusters, columns, or lamellae; only at high pressure…
We consider discretization of the 'geometric cover problem' in the plane: Given a set $P$ of $n$ points in the plane and a compact planar object $T_0$, find a minimum cardinality collection of planar translates of $T_0$ such that the union…
High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical, Euclidean and…
The clustering of a data set is one of the core tasks in data analytics. Many clustering algorithms exhibit a strong contrast between a favorable performance in practice and bad theoretical worst-cases. Prime examples are least-squares…