File size: 370 Bytes
8df23f4 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 | import OAI.Computability.BinPacking.Packing.PhaseIteration
namespace OAI
namespace BinPackingGap
def competingTrees (d : ℕ) (hd : 0 < d) : CompetingTrees d :=
CompetingTrees.ofAuxiliary d hd (buildAuxiliary (2 * d - 1))
theorem exists_competingTrees (d : ℕ) (hd : 0 < d) : Nonempty (CompetingTrees d) :=
⟨competingTrees d hd⟩
end BinPackingGap
end OAI
|