Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.12909

The mapping index through the lens of the cross-index

Vuong Bui·Hamid Reza Daneshpajouh·Roman Karasev
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the cross-index of free \(G\)-posets as a combinatorial analogue of the equivariant topological index. We demonstrate that the cross-index exhibits many structural properties closely paralleling those of the topological index, while its behavior with respect to unions displays a pronounced dichotomy depending on the acting group. Specifically, if \(P = A \cup B\) is a union of \(G\)-invariant subposets, then for \(G = \mathbb{Z}_2\) we obtain the sharp inequality \[ \operatorname{xind} P \le \operatorname{xind} A + \operatorname{xind} B + 1, \] which is directly analogous to the classical union inequality for the topological index. In contrast, for every group \(G\neq \mathbb{Z}_2\), this phenomenon fails in general, and we establish the best possible weaker estimate \[ \operatorname{xind} P \le \operatorname{xind} A + 2(\operatorname{xind} B+1). \] This reveals a fundamental distinction between the \(\mathbb{Z}_2\)-equivariant and non-\(\mathbb{Z}_2\)-equivariant settings at the purely combinatorial level. As further consequences, we compare the cross-index with both the topological index and the simplicial index, showing in particular that the gap between the cross-index and the topological index can be arbitrarily large. These results clarify the role of the cross-index as a combinatorial analogue of the equivariant topological index and further strengthen the interplay between equivariant topological methods and combinatorial structures endowed with symmetry.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vuong Bui, Hamid Reza Daneshpajouh, Roman Karasev. 2026-05-13. The mapping index through the lens of the cross-index. https://arxiv.org/abs/2605.12909

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗