Prescribed block types and abundance in bicolored Steiner triple systems

Paper III in Bicolorings of Steiner triple systems. For each fixed number of colors at least three, the paper establishes exact prescribed interior block-type matrices with sparse completion, optimal leading counting coefficient 1/6, and any fixed finite number of distinct Pasch counts at the same exact matrix. For each fixed number of colors at least four, it also establishes existence at every sufficiently large admissible order. The arithmetic threshold is ineffective. The proof uses T and T+ of Triangle decompositions III. The bilingual manuscripts and formal companions, complete portable Lean sources, source-bound clean reconstruction evidence, axiom reports and internal release audit accompany this first public preprint edition. All 1,306 project modules compiled; the four main endpoints use only propext, Classical.choice and Quot.sound. Only pinned external Mathlib ecosystem caches were reused; Mathlib itself was not rebuilt. Internal verification is not journal peer review.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-14
DOI
https://doi.org/10.5281/zenodo.24201562
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Prescribed block types and abundance in bicolored Steiner triple systems

Juan Pablo Traverso Gianini
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Prescribed block types and abundance in bicolored Steiner triple systems

Juan Pablo Traverso Gianini
preprint en

Abstract

Paper III in Bicolorings of Steiner triple systems. For each fixed number of colors at least three, the paper establishes exact prescribed interior block-type matrices with sparse completion, optimal leading counting coefficient 1/6, and any fixed finite number of distinct Pasch counts at the same exact matrix. For each fixed number of colors at least four, it also establishes existence at every sufficiently large admissible order. The arithmetic threshold is ineffective. The proof uses T and T+ of Triangle decompositions III. The bilingual manuscripts and formal companions, complete portable Lean sources, source-bound clean reconstruction evidence, axiom reports and internal release audit accompany this first public preprint edition. All 1,306 project modules compiled; the four main endpoints use only propext, Classical.choice and Quot.sound. Only pinned external Mathlib ecosystem caches were reused; Mathlib itself was not rebuilt. Internal verification is not journal peer review.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon