20.500.12556/RUP-22058 Some bounds on the number of cyclic Steiner 2-designs Nekaj mej v zvezi s številom cikličnih Steinerjevih 2-dizajnov Combining some difference methods with the famous Bays-Lambossy theorem and its generalizations we establish some non-trivial lower bounds on the number of cyclic 2-(v,k,1) designs up to isomorphism. cyclic Steiner 2-design difference family multiplier ciklični Steinerjev 2-dizajn diferenčna družina množitelj true false true Založba Univerze na Primorskem Angleški jezik Slovenski jezik Članek v reviji 2025-11-03 09:49:46 2025-11-03 09:49:47 2025-11-04 03:08:24 0000-00-00 00:00:00 2025 0 0 13 str. no. 1, [article no.] P1.01 Vol. 8 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2025-02-20 51 2590-9770 10.26493/2590-9770.1790.18e ADAM_Buratti,Muzychuk_2025.pdf ADAM_Buratti,Muzychuk_2025.pdf 1 E5FFD29A0CF38584BA384ABBC577DC5F 60917c0137e069d46402e5505efd2f7339e24d60bea2afca0e972d8c07f01ead dd506dfc-b892-11f0-8f0b-005056ac49c0 https://repozitorij.upr.si/Dokument.php?lang=slv&id=32003 Založba Univerze na Primorskem 0 0 0