Search arXivSearch

arXiv · 2511.14176

On an extension problem on the moment curve

Abstract

We show that for $2\le d\le 4$, every finite geometric simplicial complex $Δ$ in $\mathbb{R}^d$ with vertices on the moment curve can be extended to a triangulation $T$ of the cyclic polytope $C$ where $Δ, T$ and $C$ all have the same vertex set. Further, for $d\ge 5$ we construct for every $n\ge d+3$ complexes $Δ$ on $n$ vertices for which no such triangulations $T$ exist. Our result for $d=4$ has the following novel algebraic application, due to a correspondence by Oppermann and Thomas (JEMS, 2012): every maximal rigid object in $\mathcal{O}_{A_n^{2}}$ is cluster tilting, where $\mathcal{O}_{A_n^δ}$ denotes a higher dimensional cluster category introduced by Oppermann and Thomas for $A_n^δ$, where $A_n^δ$ denotes a higher Auslander algebra of linearly oriented type $A$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Seunghun Lee, Eran Nevo. 2025-11-20. On an extension problem on the moment curve. https://arxiv.org/abs/2511.14176

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