Researchers from the Center for Ancient Mathematics have published a detailed analysis of 11th-century Sanskrit manuscripts discovered at a monastic site in Vidarbha. The study, appearing in the Journal of South Asian Sciences, demonstrates that these texts contain the earliest known formalization of recursive set partitions, a concept previously thought to have emerged in Western mathematics much later in the late 17th century.
The manuscripts utilize a unique notational system to model complex combinatorial problems related to ritual altar configurations. By applying computational logic, the research team verified that the mathematical proofs provided in the text are both rigorous and consistent with modern set theory, marking a significant breakthrough in our understanding of the depth of ancient Indian logic and combinatorial analysis.