Search arXivSearch

arXiv · 2408.14337

Complex analogues of the Tverberg--Vrećica conjecture and central transversal theorems

Abstract

The Tverberg--Vrećica conjecture claims a broad generalization of Tverberg's classical theorem. One of its consequences, the central transversal theorem, extends both the centerpoint theorem and the ham sandwich theorem. In this manuscript, we establish complex analogues of these results, where the corresponding transversals are complex affine spaces. The proofs of the complex Tverberg--Vrećica conjecture and its optimal colorful version rely on the non-vanishing of an equivariant Euler class. Furthermore, we obtain new Borsuk--Ulam-type theorems on complex Stiefel manifolds. These theorems yield complex analogues of recent extensions of the ham sandwich theorem for mass assignments by Axelrod-Freed and Soberón, and provide a direct proof of the complex central transversal theorem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nikola Sadovek, Pablo Soberón. 2025-07-31. Complex analogues of the Tverberg--Vrećica conjecture and central transversal theorems. https://arxiv.org/abs/2408.14337

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO