SearcharxivSearch

arXiv · 2609.21384

Duality, rigidity, and peeling for multisegments: on hypotheses of Mitra, Offen, and Sayag

Abstract

Mitra, Offen, and Sayag introduced distinguished multisegments and multisegments of Speh type, and proposed that every distinguished multisegment is of Speh type, together with a related duality hypothesis (see A. Mitra, O. Offen, and E. Sayag, Klyachko Models for Ladder Representations, Documenta Math. 22 (2017), 611-657). They proved these statements for sets of segments and when at most two segments share an endpoint. We develop a combinatorial theory of relevant decompositions and prove that relevance is preserved under the involution $Δ\mapstoΔ^\vee$ together with reversal of standard order. Hence, $\mathfrak m$ is distinguished if and only if $\mathfrak m^\vee$ is distinguished, so the two hypotheses are equivalent. We define $S_{\mathfrak m}(Δ)=\sum_{t\ge0}(-1)^t\mathfrak m(ν^tΔ)$ and show that $\mathfrak m$ is of Speh type if and only if $S_{\mathfrak m}(Δ)\ge0$ for every segment $Δ$. Using rigidity properties, we obtain a peeling theorem and a numerical tameness condition, and prove both hypotheses for every tame multisegment, extending the previously known classes. Finally, we construct a five-segment multisegment that is not distinguished, although every standard order with non-increasing endpoints admits a non-trivial relevant decomposition. Thus, endpoint-ordered witnesses alone cannot prove the hypothesis in general. The remaining case reduces to multisegments for which both $\mathfrak m$ and $\mathfrak m^\vee$ are non-tame.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hariom Sharma. 2026-09-18. Duality, rigidity, and peeling for multisegments: on hypotheses of Mitra, Offen, and Sayag. https://arxiv.org/abs/2609.21384

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