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.

Publication Details

Journal
Repository of the University of Primorsk (University of Primorska)
Published
2025-02-20
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Nekaj mej v zvezi s številom cikličnih Steinerjevih 2-dizajnov

Repository of the University of Primorsk (University of Primorska)
graph theory and CDMA systems
article

Nekaj mej v zvezi s številom cikličnih Steinerjevih 2-dizajnov

article en

Abstract

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.

Repository of the University of Primorsk (University of Primorska)
Openalex Percentile: Top 44%
graph theory and CDMA systems
Open Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Nekaj mej v zvezi s številom cikličnih Steinerjevih 2-dizajnov · Repository of the University of Primorsk (University of Primorska) (2025) | TGRS Research Map | TGRS