The following pages link to P. G. Boyvalenkov (Q510490):
Displayed 50 items.
- Item:Q510490 (redirect page) (← links)
- Item:Q510490 (redirect page) (← links)
- Nonexistence of binary orthogonal arrays via their distance distributions (Q327301) (← links)
- Energy bounds for codes and designs in Hamming spaces (Q510492) (← links)
- Nonexistence of a few binary orthogonal arrays (Q516803) (← links)
- New asymptotic bounds on the size of multiple packings of the Euclidean sphere (Q650105) (← links)
- Buekenhout-Tits unitals (Q679086) (← links)
- The metamorphosis of lambda-fold block designs with block size four into lambda-fold triple systems (Q697991) (← links)
- On the \((v,5,\lambda)\)-family of Bhaskar Rao designs (Q698020) (← links)
- Universal lower bounds for potential energy of spherical codes (Q730083) (← links)
- A method for proving nonexistence of spherical designs of odd strength and odd cardinality (Q734300) (← links)
- Existence of almost resolvable directed \(7\)-cycle systems (Q812215) (← links)
- Transversals in long rectangular arrays (Q856842) (← links)
- All graphs with maximum degree three whose complements have 4-cycle decompositions (Q924981) (← links)
- Packing superballs from codes and algebraic curves (Q928222) (← links)
- Translative packing of a convex body by sequences of its positive homothetic copies (Q955193) (← links)
- A new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designs (Q982624) (← links)
- Polynomial techniques for investigation of spherical designs (Q1009158) (← links)
- On the existence of elementary Abelian cycle systems (Q1043796) (← links)
- Frieze patterns for punctured discs (Q1043840) (← links)
- Latin trades in groups defined on planar triangulations (Q1043843) (← links)
- Packing and covering k-chain free subsets in Boolean lattices (Q1043999) (← links)
- On the maximum number of points at least one unit away from each other in the unit \(n\)-cube (Q1046801) (← links)
- Nonexistence of certain symmetric spherical codes (Q1209225) (← links)
- Covering a three-dimensional convex body by smaller homothetic copies (Q1267321) (← links)
- Finite and uniform stability of sphere packings (Q1269454) (← links)
- On linear programming bounds for codes in polynomial metric spaces (Q1276778) (← links)
- Some new Latin power sets not based on groups (Q1279657) (← links)
- The densest packing of 19 congruent circles in a circle (Q1282296) (← links)
- Nonexistence of certain spherical designs of odd strengths and cardinalities (Q1283747) (← links)
- Necessary conditions for existence of some designs in polynomial metric spaces (Q1289074) (← links)
- Inductive extensions of some \(Z\)-cyclic whist tournaments (Q1292838) (← links)
- Switching equivalence classes of perfect codes (Q1299914) (← links)
- Kirkman school project designs (Q1301652) (← links)
- Covering \(t\)-sets with \((t+2)\)-sets (Q1302176) (← links)
- Affine distance-transitive graphs: The cross characteristic case (Q1304431) (← links)
- On the extremality of the polynomials used for obtaining the best known upper bounds for the kissing numbers (Q1321691) (← links)
- On lower bounds on the size of designs in compact symmetric spaces of rank 1 (Q1359065) (← links)
- Mappings of Latin squares (Q1362666) (← links)
- Circle covering with a margin (Q1375064) (← links)
- Finite packings of spheres (Q1380775) (← links)
- Constructions of spherical 3-designs (Q1393024) (← links)
- A new bound on the size of the largest critical set in a Latin square (Q1394806) (← links)
- Diagonal-complete Latin squares (Q1395006) (← links)
- Bounds for DNA codes with constant GC-content (Q1408538) (← links)
- Spectrum of directed Kirkman packing designs (Q1430964) (← links)
- A minimal design of order 11 on the 3-sphere (Q1585650) (← links)
- Kirkman packing designs KPD\((\{3, 5^*\},v)\) (Q1611360) (← links)
- On spherical codes with inner products in a prescribed interval (Q1727345) (← links)
- On maximal antipodal spherical codes with few distances (Q1743284) (← links)