A comprehensive Coq formalization of the Collatz conjecture with a combinatorial analysis framework. Proves linear division advantage.
-
Updated
Mar 7, 2026 - Rocq Prover
A comprehensive Coq formalization of the Collatz conjecture with a combinatorial analysis framework. Proves linear division advantage.
A program that calculates anagrams made in Go using the resources of concurrency.
This is my first technical blog post on GitHub. The topic explores a way to represent a two-bin Kanban System using a combinatorial counting argument, as well as the meaning behind the representation related to demand for material in production.
Esse projeto tem como intuito exemplificar como gerar todas as combinações entre elementos de duas ou mais listas, com o diferencial de poder definir separadamente a quantidade de elementos a ser selecionado de cada lista. Essa solução foi desenvolvida em Java mas é possível transcrevê-la para outras linguagens usando as referências.
Calculate and generate all possible NxN RGB images
Combinatorial enumeration of NaCl-type superstructures. Generates cation arrangements in cubic fragments (CF4 to CF108) with global/local valence balance. Reproduces γ-LiFeO₂, β-Li₂CuZrO₄, α-NaFeO₂, LiVO₂ structures.
To associate your repository with the combinatorial-analysis topic, visit your repo's landing page and select "manage topics."