<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=22058"><dc:title>Some bounds on the number of cyclic Steiner 2-designs</dc:title><dc:creator>Buratti,	Marco	(Avtor)
	</dc:creator><dc:creator>Muzychuk,	Mikhail	(Avtor)
	</dc:creator><dc:subject>cyclic Steiner 2-design</dc:subject><dc:subject>difference family</dc:subject><dc:subject>multiplier</dc:subject><dc:description>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.</dc:description><dc:publisher>Založba Univerze na Primorskem</dc:publisher><dc:date>2025</dc:date><dc:date>2025-11-03 09:49:46</dc:date><dc:type>Članek v reviji</dc:type><dc:identifier>22058</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>