{"paper":{"title":"Circles and line segments as independence attractors of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.CO","authors_text":"Garima Khetawat, Moumita Manna, Tarakanta Nayak","submitted_at":"2025-05-27T08:41:27Z","abstract_excerpt":"By an independent set in a simple graph $G$, we mean a set of pairwise non-adjacent vertices in $G$. The independence polynomial of $G$ is defined as $I_G(z)=a_0 + a_1 z + a_2 z^2+\\cdots+a_\\alpha z^{\\alpha}$, where $a_i$ is the number of independent sets in $G$ with cardinality $i$ and $\\alpha$ is the cardinality of a largest independent set in $G$, known as the independence number of $G$. Let $G^m$ denote the $m$-times lexicographic product of $G$ with itself. The independence attractor of $G$, denoted by $\\mathcal{A}(G)$, is defined as $\\mathcal{A}(G) = \\lim_{m\\rightarrow \\infty} \\{z: I_{G^m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.20898","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.20898/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}