Author

Byungwoong Yoo

0 works0 citationsORCID

Recent research

  • BiologyOpen access

    A candidate identity for UNK-g in the Trypanosoma brucei mitoribosome: a public-data research summary

    Public structural records contain a mitochondrial ribosome assembly component whose gene identity remains unassigned in the records examined. A computational comparison nominates Q38DP6 (Tb927.9.11350) as a candidate for this component, UNK-g, in Trypanosoma brucei. Structural re...

    Zenodo (CERN European Organization for Nuclear Research)2026-10-080 citationsDOI
  • AI & ComputingOpen access

    A universal 23-dimensional realization of Steiner triple codes

    For every finite complete Steiner triple system, we construct bounded full-dimensional strictly convex compact sets in 23-dimensional Euclidean space whose code and interior code are exactly the associated Steiner triple code. Three simultaneous quadratic coefficient relations re...

    Zenodo (CERN European Organization for Nuclear Research)2026-09-130 citationsDOI
  • AI & ComputingOpen access

    A universal 23-dimensional realization of Steiner triple codes

    For every finite complete Steiner triple system, we construct bounded full-dimensional strictly convex compact sets in 23-dimensional Euclidean space whose code and interior code are exactly the associated Steiner triple code. Three simultaneous quadratic coefficient relations re...

    Zenodo (CERN European Organization for Nuclear Research)2026-09-130 citationsDOI
  • AI & ComputingOpen access

    Exact cardinality enumeration for two-neighbour bootstrap percolation on the 8 by 8 grid

    For the labeled 8 by 8 square grid with open boundaries, exactly 18,158,494,206,600,367,941 initially occupied subsets eventually fill the grid under the two-neighbour bootstrap rule. This note gives all 65 coefficients by initial cardinality and a replayable exact computation. T...

    Zenodo (CERN European Organization for Nuclear Research)2026-09-050 citationsDOI
  • AI & ComputingOpen access

    A proof of Mathar's recurrence for OEIS A026124 with exact boundary terms

    This note proves Mathar's recurrence for OEIS A026124 from its nonnegative-walk definition, for every n >= 5 with a(0) = a(1) = 0. It provides explicit polynomial certificates and the exact exceptional residuals 8, -16, 8 at n = 2, 3, 4, together with executable integer-arithmeti...

    Zenodo (CERN European Organization for Nuclear Research)2026-09-050 citationsDOI
  • AI & ComputingOpen access

    Exact cardinality enumeration for two-neighbour bootstrap percolation on the 8 by 8 grid

    For the labeled 8 by 8 square grid with open boundaries, exactly 18,158,494,206,600,367,941 initially occupied subsets eventually fill the grid under the two-neighbour bootstrap rule. This note gives all 65 coefficients by initial cardinality and a replayable exact computation. T...

    Zenodo (CERN European Organization for Nuclear Research)2026-09-050 citationsDOI
  • AI & ComputingOpen access

    Reproducible exhaustive searches for slope-distinct grid sets and reflection-invariant cyclic packings

    We provide executable finite-enumeration arguments for two small extremal problems. Exact searches establish that a subset of the ten by ten grid with distinct undirected slopes has at most ten points. For cyclic triple packings by five-subsets of Z/31Z, a witness and an exhausti...

    Zenodo (CERN European Organization for Nuclear Research)2026-09-050 citationsDOI
  • AI & ComputingOpen access

    Reproducible exhaustive searches for slope-distinct grid sets and reflection-invariant cyclic packings

    We provide executable finite-enumeration arguments for two small extremal problems. Exact searches establish that a subset of the ten by ten grid with distinct undirected slopes has at most ten points. For cyclic triple packings by five-subsets of Z/31Z, a witness and an exhausti...

    Zenodo (CERN European Organization for Nuclear Research)2026-09-050 citationsDOI
  • AI & ComputingOpen access

    An Explicit Infinite Model Refuting Ulrich's u4 as a Single Axiom for Positive Implication

    We construct an explicit infinite model showing that Ulrich's remaining 15-symbol candidate u4 is not a single axiom for positive implicational logic under substitution and modus ponens. The model satisfies every substitution instance of u4 and is closed under modus ponens, while...

    Zenodo (CERN European Organization for Nuclear Research)2026-08-180 citationsDOI