{"ok":true,"nota":{"id":"0d2afeb1dba90686","slug":"un-trabajo-matematico-cuenta-de-cuantas-formas-se-pueden-armar-ciertas-0d2afe","titulo":"Un trabajo matemático cuenta de cuántas formas se pueden armar ciertas redes de conexiones","resumen":"Un autor publicó en Zenodo un manuscrito que cuenta exactamente cuántas subredes fuertemente conectadas y mínimas existen dentro de una estructura con cuatro nodos y seis caminos. Es una versión dentro de una serie de trabajos sobre la misma teoría. El texto es técnico y no ha pasado revisión por pares.","fuente":"zenodo","fuenteNombre":"Zenodo · Investigación abierta","color":"#1682d4","autor":"Okino, Koji","url":"https://doi.org/10.5281/zenodo.23467762","imagen":"/hoy/portada/0d2afeb1dba90686","tema":"ciencia","subtemas":["teoria de grafos","matematica discreta","combinatoria","conteo exacto","teoria estructural"],"entidades":["Zenodo"],"formato":"dato","entretenimiento":false,"pubTs":"2026-10-22T00:17:27.000Z","indexTs":"2026-10-24T00:50:37.614Z","hash":"43ccdf03449a1255d303324a194e5883619cf42a162bf1208739442545b78279","tsa":{"time":"Oct 24 00:51:05 2026 GMT","provider":"freetsa.org","sobre":"sello"},"stats":{"views":0,"likes":0,"clicks":0,"dwell":0},"tipo":"normal","registro":"hallazgo","porQueImporta":"Es un avance dentro de la matemática pura, sin aplicaciones inmediatas para la vida cotidiana. Su valor está en que resuelve conteos que antes eran aproximados, algo que interesa a quienes trabajan en teoría de grafos. Para el resto, no cambia nada hoy, y el trabajo todavía no tiene la validación de una revista especializada.","quienFirma":"Zenodo (autor independiente, sin institución identificada)","confianza":"preprint","consulta":null},"sello":{"hash":"43ccdf03449a1255d303324a194e5883619cf42a162bf1208739442545b78279","sello":"b6403587fa53a1445f70e805202cf20396056d145c8d26aae9702715be1f62b3","beacon":{"drand":{"cadena":"8990e7a9aaed2ffed73dbd7092123d6f289930540d7651336225dc172e51b2ce","ronda":6579068,"aleatorio":"fa0366b98effa16ffe69576f24e0213714726896ffb29f86cc98c83d1b472606","tiempo":"2026-10-24T00:51:00.000Z"},"nist":{"cadena":2,"pulso":1996727,"salida":"E298816BFBCC54674A4A7340C2EBD066CD4C3E395ABA0111164D2DEEFDC8864B7B87CDCF02C32BE3904A9DBC3D90EFDA303AB166AE17FC86FAF597FD7D785905","tiempo":"2026-10-24T00:50:00.000Z"},"noAntes":"2026-10-24T00:51:00.000Z"},"verificacion":{"drand":true,"nist":true},"tsa":{"time":"Oct 24 00:51:05 2026 GMT","provider":"freetsa.org","sobre":"sello"},"original":{"titulo":"Generative Structural Theory v1.31 — Bidirected K4 Subdivisions: Exact Counting and Minimality","descripcion":"<p>The parent relation is K_4 with each of its six edges replaced by a path of length l_ij >= 1, inner nodes not shared, every pair present (bidirected); for its spanning sub-relations this manuscript counts the strongly connected ones (s), the inclusion-minimal ones (mu) and the least number of pairs of one (mc). A sub-relation is strongly connected iff on every path it is in one of four states (every forward pair and at least one backward pair missing; every backward pair and at least one forward pair missing; all pairs; or exactly one empty edge with every other edge two-way) and its projection to the four branch nodes is strongly connected; for a path of length l the states number 2^l - 1, 2^l - 1, 1 and l. Hence s is a weighted sum over the strongly connected relations on the four branch nodes, and cut inclusion-exclusion with the preorder grouping of v1.30 gives it as a sum over ch","pubDate":"2026-10-22T00:17:27Z","url":"https://doi.org/10.5281/zenodo.23467762"},"indexado":"2026-10-24T00:50:37.614Z"}}