Search arXivSearch

arXiv · 1501.04612

Average-Value Tverberg Partitions via Finite Fourier Analysis

Abstract

The long-standing topological Tverberg conjecture claimed, for any continuous map from the boundary of an $N(q,d):=(q-1)(d+1)$-simplex to $d$-dimensional Euclidian space, the existence of $q$ pairwise disjoint subfaces whose images have non-empty $q$-fold intersection. The affine cases, true for all $q$, constitute Tverberg's famous 1966 generalization of the classical Radon's Theorem. Although established for all prime powers in 1987 by Özaydin, counterexamples to the conjecture, relying on 2014 work of Mabillard and Wagner, were first shown to exist for all non-prime-powers in 2015 by Frick. Starting with a reformulation of the topological Tverberg conjecture in terms of harmonic analysis on finite groups, we show that despite the failure of the conjecture, continuous maps \textit{below} the tight dimension $N(q,d)$ are nonetheless guaranteed $q$ pairwise disjoint subfaces -- including when $q$ is not a prime power -- which satisfy a variety of "average value" coincidences, the latter obtained as the vanishing of prescribed Fourier transforms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Steven Simon. 2016-07-25. Average-Value Tverberg Partitions via Finite Fourier Analysis. https://doi.org/10.1007/s11856-016-1432-4

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