Author

Daniel Andrés Chillemi

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#edge computing Open access Sep 2026

§23.32 · The Lookup Purity Restored, and Unified: n1 Alone Classifies All Three Vertex-Figure Classes

Abstract§23.27 §6.4 found that, restricted to one defect per arm, grouping the holonomy angle by (transportclass, δ, (k1+k2) mod 5) gives a pure lookup for vertex-figure class T: 24 keys (6 per δ), each mapping to a single angle. §23.31 §6 tested the same grouping, using the same transport-class test, on classes M and...

Daniel Andrés Chillemi · Zenodo (CERN European Organi... · 0 citations

#edge computing Open access Sep 2026

§23.30 · Closing the Loop for Classes M and A: the Chain Is Free, and Why the Symmetric Crossing Is a Dead End

Abstract§23.28 §7 flagged two related gaps for the vertex-figure classes M and A (hinge-sharing edge pairs whose tetrahedra do not share an edge): no discrete defect/holonomy loop had been defined for them, and no exponent formula existed for arbitrary defect multiplicities, since the §23.21 construction anchors both t...

Daniel Andrés Chillemi · Zenodo (CERN European Organi... · 0 citations