Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.26656

Numerical topology of the clique complex of the partition graph: Euler characteristic, clique counts, and sequence data

Fedor B. Lyudogovskiy
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the numerical topology of the clique complex $K_n=\mathrm{Cl}(G_n)$, where $G_n$ is the partition graph on the set of integer partitions of $n$. Building on the previously established homotopy equivalence $K_n \simeq \vee^{\,b_n} S^2$, we shift the focus from qualitative topology to its numerical content. Our main objects are the Euler characteristic $\chi(K_n)$, the derived sequence $b_n=\chi(K_n)-1$, the clique counts $c_r(n)$, and several related maximal-simplex counts. We develop two exact counting languages for the same invariant. The first is the direct clique-counting formula $\chi(K_n)=\sum_{r\ge 1}(-1)^{r-1}c_r(n)$, which expresses Euler characteristic through clique counts in the partition graph. The second is a nerve-side formula arising from the canonical good cover by distinct full star- and full top-simplices, which yields $\chi(K_n)=\chi(N_n)$, where $N_n$ is the corresponding nerve. We further use the classification of maximal simplices into star-, top-, and edge-type pieces to formulate a local-to-global counting framework based on local admissibility data and global deduplication. The paper is primarily organizational and computational. It fixes a consistent counting dictionary, separates intrinsic global counts from auxiliary based counts, records exact data for the full main sequence package on $1\le n\le 25$, and extends the low-dimensional clique-count layer through $n=60$. We do not claim closed formulas for $\chi(K_n)$ or for the full family of clique counts. Rather, the paper provides a framework in which such questions can be studied systematically.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fedor B. Lyudogovskiy. 2026-03-27. Numerical topology of the clique complex of the partition graph: Euler characteristic, clique counts, and sequence data. https://arxiv.org/abs/2603.26656

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

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗