نتایج جستجو برای: subgroup coverings

تعداد نتایج: 88455  

2012
Daniele Bartoli Massimo Giulietti Stefano Marcugini Fernanda Pambianco

For the kind of coverings codes called multiple coverings of the farthestoff points (MCF) we define μ-density as a characteristic of quality. A concept of multiple saturating sets ((ρ, μ)-saturating sets) in projective spaces PG(N, q) is introduced. A fundamental relationship of these sets with MCF codes is showed. Lower and upper bounds for the smallest possible cardinality of (1, μ)-saturatin...

Journal: :J. Comb. Optim. 2013
Guang-Siang Lee

The Stein-Lovász theorem provides an algorithmic way to deal with the existence of certain good coverings, and thus offers bounds related to some combinatorial structures. An extension of the classical Stein-Lovász theorem for multiple coverings is given, followed by some applications for finding upper bounds of the sizes of (d, s out of r; z]-disjunct matrices and (k, m, c, n; z)selectors, res...

Journal: :Discrete Mathematics 1978

Journal: :Journal of Geometry and Physics 2015

Journal: :Journal of Algebra 2005

Journal: :Journal of Combinatorial Theory 1970

Journal: :Kyoto Journal of Mathematics 2007

Journal: :Tsukuba Journal of Mathematics 2000

Journal: :Annales Academiae Scientiarum Fennicae. Series A. I. Mathematica 1985

Journal: :Groups, Geometry, and Dynamics 2015

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید