Searcharxiv⌕ Search

arXiv subjects

Andreas F. Holmsen

Publications and source records attributed to Andreas F. Holmsen.

22 records · Page 2Linked to original sources

Orthogonal colorings of the sphere

An orthogonal coloring of the two-dimensional unit sphere $\mathbb{S}^2$, is a partition of $\mathbb{S}^2$ into parts such that no part contains a pair of orthogonal points, that is, a pair of points at spherical distance $π/2$ apart. It is a well-known result that an orthogonal coloring of $\mathbb{S}^2$ requires at least four parts, and orthogonal colorings with exactly four parts can easily be constructed from a regular octahedron centered at the origin. An intriguing question is whether or not every orthogonal 4-coloring of $\mathbb{S}^2$ is such an octahedral coloring. In this paper we address this question and show that if every color class has a non-empty interior, then the coloring is octahedral. Some related results are also given.

math.CO↗

Topology of geometric joins

We consider the geometric join of a family of subsets of the Euclidean space. This is a construction frequently used in the (colorful) Carathéodory and Tverberg theorems, and their relatives. We conjecture that when the family has at least $d+1$ sets, where $d$ is the dimension of the space, then the geometric join is contractible. We are able to prove this when $d$ equals $2$ and $3$, while for larger $d$ we show that the geometric join is contractible provided the number of sets is quadratic in $d$. We also consider a matroid generalization of geometric joins and provide similar bounds in this case.

math.MG↗

Regular systems of paths and families of convex sets in convex position

In this paper we show that every sufficiently large family of convex bodies in the plane has a large subfamily in convex position provided that the number of common tangents of each pair of bodies is bounded and every subfamily of size five is in convex position. (If each pair of bodies have at most two common tangents it is enough to assume that every triple is in convex position, and likewise, if each pair of bodies have at most four common tangents it is enough to assume that every quadruple is in convex position.) This confirms a conjecture of Pach and Toth, and generalizes a theorem of Bisztriczky and Fejes Toth. Our results on families of convex bodies are consequences of more general Ramsey-type results about the crossing patterns of systems of graphs of continuous functions $f:[0,1] \to \mathbb{R}$. On our way towards proving the Pach-Toth conjecture we obtain a combinatorial characterization of such systems of graphs in which all subsystems of equal size induce equivalent crossing patterns. These highly organized structures are what we call regular systems of paths and they are natural generalizations of the notions of cups and caps from the famous theorem of Erdos and Szekeres. The characterization of regular systems is combinatorial and introduces some auxiliary structures which may be of independent interest.

math.MG↗

The Colored Hadwiger Transversal Theorem in $\mathbb R^d$

Hadwiger's transversal theorem gives necessary and sufficient conditions for a family of convex sets in the plane to have a line transversal. A higher dimensional version was obtained by Goodman, Pollack and Wenger, and recently a colorful version appeared due to Arocha, Bracho and Montejano. We show that it is possible to combine both results to obtain a colored version of Hadwiger's theorem in higher dimensions. The proofs differ from the previous ones and use a variant of the Borsuk-Ulam theorem. To be precise, we prove the following. Let $F$ be a family of convex sets in $\mathbb R^d$ in bijection with a family $P$ of points in $\mathbb R^{d-1}$. Assume that there is a coloring of $F$ with sufficiently many colors such that any colorful Radon partition of points in $P$ corresponds to a colorful Radon partition of sets in $F$. Then some monochromatic subfamily of $F$ has a hyperplane transversal.

math.MG↗