SearcharxivSearch

arXiv subjects

Jonathan Kliem

Publications and source records attributed to Jonathan Kliem.

4 recordsLinked to original sources

A new $k$-partite graph $k$-clique iterator and the optimal colored Tverberg problem for ten colored points

We provide an algorithm that verifies the optimal colored Tverberg problem for $10$ points in the plane: Every $10$ points in the plane in color classes of size at most $3$ can be partitioned in $4$ rainbow pieces such that their convex hulls intersect in a common point. This is achieved by translating the problem to $k$-partite graphs and using a new algorithm to verify that those graphs do not have a $k$-clique.

math.CO

Counting Gray codes for an improved upper bound of the Gr\"unbaum-Hadwiger-Ramos problem

We give an improved upper bound for the Gr\"unbaum--Hadwiger--Ramos problem: Let $d,n,k \in \mathbb{N}$ such that $d \geq 2^n(1+2^{k-1})$. Given $2^{n+1}$ masses on $\mathbb{R}^d$, there exist $k$ hyperplanes in $\mathbb{R}^d$ that partition it into $2^k$ sets of equal size with respect to all measures. This is an improvement to the previous bound $d \geq 2^{n + k}$ by Mani-Levitska, Vre\'cica & \v{Z}ivaljevi\'c in 2006. This is achieved by classifying the number of certain Gray code patterns modulo 2. The reduction was developed by Blagojevi\'c, Frick, Haase & Ziegler in 2016. It utilizes the group action of the symmetric group $(\mathbb{Z}/2)^k \rtimes \mathfrak{S}_k$ of $k$ oriented hyperplanes. If we restrict to the subgroup $(\mathbb{Z}/2)^k$ as Mani-Levitska et al. we retrieve their bound.

math.CO

A new face iterator for polyhedra and more general finite locally branched lattices

We discuss a new memory-efficient depth-first algorithm and its implementation that iterates over all elements of a finite locally branched lattice. This algorithm can be applied to face lattices of polyhedra and to various generalizations such as finite polyhedral complexes and subdivisions of manifolds, extended tight spans and closed sets of matroids. Its practical implementation is very fast compared to state-of-the-art implementations of previously considered algorithms. Based on recent work of Bruns, Garc\'ia-S\'anchez, O'Neill and Wilburne, we apply this algorithm to prove Wilf's conjecture for all numerical semigroups of multiplicity 19 by iterating through the faces of the Kunz cone and identifying the possible bad faces and then checking that these do not yield counterexamples to Wilf's conjecture.

math.CO

More bisections by hyperplane arrangements

A union of an arrangement of affine hyperplanes $H$ in $R^d$ is the real algebraic variety associated to the principal ideal generated by the polynomial $p_{H}$ given as the product of the degree one polynomials which define the hyperplanes of the arrangement. A finite Borel measure on $R^d$ is bisected by the arrangement of affine hyperplanes $H$ if the measure on the "non-negative side" of the arrangement $\{x\in R^d : p_{H}(x)\ge 0\}$ is the same as the measure on the "non-positive" side $\{x\in R^d : p_{H}(x)\le 0\}$. In 2017 Barba, Pilz \& Schnider considered special cases of the following measure partition hypothesis: For a given collection of $j$ finite Borel measures on $R^d$ there exists a $k$-element affine hyperplane arrangement that bisects each of the measures into equal halves simultaneously. They showed that there are simultaneous bisections in the case when $d=k=2$ and $j=4$. They conjectured that every collection of $j$ measures on $R^d$ can be simultaneously bisected with a $k$-element affine hyperplane arrangement provided that $d\ge \lceil j/k \rceil$. The conjecture was confirmed in the case when $d\ge j/k=2^a$ by Hubard and Karasev in 2018. In this paper we give a different proof of the Hubard and Karasev result using the framework of Blagojevi\'c, Frick, Haase \& Ziegler (2016), based on the equivariant relative obstruction theory of tom Dieck, which was developed for handling the Gr\"unbaum--Hadwiger--Ramos hyperplane measure partition problem. Furthermore, this approach allowed us to prove even more, that for every collection of $2^a(2h+1)+\ell$ measures on $R^{2^a+\ell}$, where $1\leq \ell\leq 2^a-1$, there exists a $(2h+1)$-element affine hyperplane arrangement that bisects all of them simultaneously. Our result was extended to the case of spherical arrangements and reproved by alternative methods in a beautiful way by Crabb in 2020.

math.MG