Search arXivSearch

arXiv · 1102.5143

Local neighborliness of the symmetric moment curve

Abstract

A centrally symmetric analogue of the cyclic polytope, the bicyclic polytope, was defined in [BN08]. The bicyclic polytope is defined by the convex hull of finitely many points on the symmetric moment curve where the set of points has a symmetry about the origin. In this paper, we study the Barvinok-Novik orbitope, the convex hull of the symmetric moment curve. It was proven in [BN08] that the orbitope is locally $k$-neighborly, that is, the convex hull of any set of $k$ distinct points on an arc of length not exceeding $ϕ_k$ in $\mathbb{S}^1$ is a $(k-1)$-dimensional face of the orbitope for some positive constant $ϕ_k$. We prove that we can choose $ϕ_k $ bigger than $γk^{-3/2} $ for some positive constant $γ$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Seung Jin Lee. 2011-02-25. Local neighborliness of the symmetric moment curve. https://arxiv.org/abs/1102.5143

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