{
 "artifacts": null,
 "category": "geometry",
 "description": "Build a refined Freudenthal-Kuhn simplicial graph over mesh vertices or geometric samples and inject its piecewise-linear metric into attention logits. Refinement is increased until the explicit distortion target is met, making attention scores less sensitive to arbitrary mesh resolution, triangulation, or local curvature.",
 "formulas_latex": [
  "$$\\left(1+\\frac{\\gamma}{\\ell}\\right)^{-1}\\leq\\frac{\\mathsf{d}_{M}(\\psi_{\\ell}(x),\\psi_{\\ell}(y))}{\\mathsf{d}_{\\mathsf{PL}}(x,y)}\\leq\\left(1+\\frac{\\gamma}{\\ell}\\right),\\qquad x\\neq y\\in\\widetilde K_{\\ell}.$$",
  "$$\\gamma=3\\sqrt{d}\\cdot\\frac{\\sup_{z\\in K}\\|\\operatorname{Hess}_{z}\\phi\\|}{\\inf_{z\\in K}{\\mathsf{s}}_{\\min}(\\mathsf{D}_{z}\\phi)}\\cdot\\frac{\\max_{\\sigma\\in K}\\mathcal{L}(\\sigma)^{2}}{\\min_{\\sigma\\in K}\\mathcal{S}(\\sigma)}.$$",
  "$$b_{ij}=-\\tau\\log\\left(1+\\frac{\\mathsf{d}_{\\mathsf{PL}}(i,j)^{2}}{\\rho^{2}}\\right),\\qquad A_{ij}=\\operatorname{softmax}_{j}\\left(\\frac{q_i^{\\top}k_j}{\\sqrt{h}}+b_{ij}\\right),$$",
  "$$\\ell_{\\mathrm{target}}=\\left\\lceil\\frac{\\widehat\\gamma}{\\varepsilon}\\right\\rceil,\\qquad \\frac{\\mathsf d_M}{\\mathsf d_{\\mathsf{PL}}}\\in\\left[(1+\\varepsilon)^{-1},1+\\varepsilon\\right].$$"
 ],
 "id": 1494,
 "implementation": "Integrate the method at the geometric preprocessing and attention-bias stages of a point-cloud or mesh transformer. For a mesh, use its existing simplices; for a point cloud, first construct a local Delaunay, alpha-complex, or k-nearest-neighbor triangulation. Apply one or more Freudenthal-Kuhn subdivisions using a fixed vertex ordering, place new vertices by barycentric or multilinear interpolation, and retain edges inside each local simplex. Compute local shortest-path distances on this refined graph, restricting them to k-hop or radius neighborhoods so the cost remains manageable. Estimate gamma with robust statistics: fit local quadratic charts to estimate the Hessian norm H, use the SVD of local affine Jacobians to estimate the smallest singular value s_min, use the maximum local edge scale L, and use a minimum simplex-quality statistic S. Set gamma_hat = 3 sqrt(d) (H/s_min)(L^2/S), choose ell = ceil(gamma_hat/epsilon), and stop refinement at a fixed token or FLOP budget. Add b_ij = -tau log(1+d_PL(i,j)^2/rho^2) to each attention head's scaled dot-product logits; learn tau and rho, or initialize them from the median graph distance. The theorem determines the distortion-controlled refinement rule; all geometric extrema are empirical estimates. First test on ModelNet40 or ShapeNet using Point Transformer or a mesh transformer, comparing no bias, Euclidean bias, and simplicial bias under random remeshing, vertex decimation, and nonuniform sampling. Keep training FLOPs equal. Success is higher classification or segmentation accuracy, lower performance variance across remeshings, and stable attention-distance correlations as resolution changes.",
 "math_summary": "The paper's geometric transfer theorem states that for a compact d-dimensional space M contained in R^D, a C^2 triangulation phi, and sufficiently fine ell-th Freudenthal-Kuhn subdivision, the rectified complex with piecewise-linear metric d_PL satisfies, for all distinct x and y, (1+gamma/ell)^(-1) \u003c= d_M(psi_ell(x),psi_ell(y))/d_PL(x,y) \u003c= 1+gamma/ell. Here d_M is the metric on M, psi_ell is the rectified map from the subdivided complex to M, d_PL is the piecewise-linear metric, and ell is the subdivision depth. The distortion constant is gamma = 3 sqrt(d) times the ratio of the supremum Hessian norm of phi to the infimum smallest singular value of its Jacobian, multiplied by the ratio of the squared maximum simplex scale L(sigma)^2 to the minimum simplex quality S(sigma). Hess phi measures chart curvature, D phi is the Jacobian, s_min is its smallest singular value, L is a simplex length scale, and S measures nondegeneracy. The neural adaptation uses d_PL as a proxy for d_M and adds a decreasing distance bias to attention, with target relative distortion epsilon obtained by choosing ell \u003e= gamma_hat/epsilon.",
 "math_tags": [
  "geometry",
  "metric-geometry",
  "combinatorics"
 ],
 "ml_areas": [
  "attention",
  "graph-nn",
  "embedding"
 ],
 "paper": {
  "arxiv_id": "2607.27535",
  "arxiv_url": "https://arxiv.org/abs/2607.27535",
  "summary_what_math_gives_to_ml": "The paper gives a constructive geometric-transfer mechanism: repeated Freudenthal-Kuhn subdivision followed by rectification produces a piecewise-linear complex whose intrinsic metric approximates the original triangulated space with explicit multiplicative distortion. The transferable asset is not persistent homology itself, but a resolution-controlled, nearly isometric simplicial representation that can remain meaningful across smooth pieces and singular strata. A practical neural-network adaptation is to use the refined piecewise-linear metric as a graph or attention positional bias. The explicit distortion constant provides a principled refinement target and a falsifiable test of geometric stability under remeshing and nonuniform sampling.",
  "title": "Universal topological statistics on triangulated singular spaces",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 6,
  "novelty": 7,
  "usefulness": 6
 },
 "solves": [
  "accuracy",
  "stability",
  "scalability"
 ],
 "title": "Near-isometric simplicial attention",
 "url": "https://synthcore.org/idea/1494/near-isometric-simplicial-attention",
 "verification": {
  "peer_reviewed": false,
  "status": "unverified",
  "status_label": "Unverified",
  "verdict_source": "deterministic test code (paired-seed permutation statistics)",
  "verification_axes": {
   "benchmark_mechanism": {
    "confirmed": null,
    "tested": false
   },
   "practical_benchmark": {
    "beats_baseline": null,
    "tested": false
   },
   "toy_mechanism_gate": {
    "confirmed": null,
    "tested": false
   }
  }
 }
}