惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

V
Visual Studio Blog
量子位
大猫的无限游戏
大猫的无限游戏
Hugging Face - Blog
Hugging Face - Blog
S
SegmentFault 最新的问题
Blog — PlanetScale
Blog — PlanetScale
月光博客
月光博客
Google DeepMind News
Google DeepMind News
小众软件
小众软件
WordPress大学
WordPress大学
宝玉的分享
宝玉的分享
MongoDB | Blog
MongoDB | Blog
B
Blog RSS Feed
博客园 - Franky
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
B
Blog
博客园 - 聂微东
The GitHub Blog
The GitHub Blog
Recent Announcements
Recent Announcements
Y
Y Combinator Blog
Microsoft Security Blog
Microsoft Security Blog
雷峰网
雷峰网
Jina AI
Jina AI
酷 壳 – CoolShell
酷 壳 – CoolShell

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Token-sliding realizability for complements, Cartesian-pr...
Duc A. Hoang · 2026-06-02 · via math.CO updates on arXiv.org

For an integer $k\ge 0$ and a graph $G$, the \emph{token-sliding reconfiguration graph $\mathsf{TS}_k(G)$} has the independent $k$-sets of $G$ as vertices. Two vertices are adjacent if one token can slide along an edge of $G$ and the resulting $k$-set is still independent. We study the following realizability problem: for fixed $k\ge 2$, which graphs are isomorphic to $\mathsf{TS}_k(G)$ for some graph $G$? This inverse viewpoint asks which abstract state spaces can occur exactly under a local token rule. We give positive realizability results for the complement targets $\overline{K_n}$, $\overline{K_{m,n}}$, and $\overline{K_n-e}$, and we determine sharp cutoffs for complements of paths and cycles. We also prove a product formula for token-sliding graphs of disjoint unions and apply it to Cartesian products of complete graphs, paths, and cycles. For every grid $Γ_{m,n}=P_m\square P_n$ with $2\le m\le n$, we realize $Γ_{m,n}$ at token value $m+n-2$ and at every token value $k\ge 4$. At small token values, we prove that $C_4\square C_n$ is not a $\mathsf{TS}_2$-graph for $n\ge 4$, classify ladders $Γ_{2,n}$, and settle the first non-ladder grid: for $k\ge 2$, $Γ_{3,3}$ is realizable if and only if $k\ge 4$.