Difference families in Z₂d+1 Z₂d+1 and infinite translation designs in Z Z

DOI10.1007/S00373-006-0685-9MaRDI QIDQ878054zbMATH OpenOpenAlexFDO

Authors Andrea Vietri

Publication date 26 April 2007

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-006-0685-9

zbMATH Keywords

translation invarianttranslation groupscopeperfect familypure family

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Other designs, configurations (05B30)

Recommendations

• Difference families, difference matrices, and BIB-designs
• Translations of the squares in a finite field and an infinite family of 3-designs
• Perfect difference families, perfect difference matrices, and related combinatorial structures
• On the existence of some cyclic difference families and difference matrices
• Recursive construction of a class of cyclic difference families

Cites work

• scientific article; zbMATH DE number 124520 (Why is no real title available?)
• scientific article; zbMATH DE number 1016456 (Why is no real title available?)
• scientific article; zbMATH DE number 1382770 (Why is no real title available?)
• scientific article; zbMATH DE number 874508 (Why is no real title available?)
• scientific article; zbMATH DE number 874509 (Why is no real title available?)
• scientific article; zbMATH DE number 874513 (Why is no real title available?)
• scientific article; zbMATH DE number 874521 (Why is no real title available?)
• scientific article; zbMATH DE number 5174858 (Why is no real title available?)
• scientific article; zbMATH DE number 3218576 (Why is no real title available?)
• scientific article; zbMATH DE number 3238443 (Why is no real title available?)
• scientific article; zbMATH DE number 3258859 (Why is no real title available?)
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Cyclic Hamiltonian cycle systems of the complete graph.
• Cyclically decomposing the complete graph into cycles
• Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
• Existence of cyclic \(k\)-cycle systems of the complete graph
• On the construction of odd cycle systems
• On the cyclic decompositions of the complete graph into polygons with odd number of edges
• Optical orthogonal codes: design, analysis and applications
• Some progress on \((v,4,1)\) difference families and optical orthogonal codes

Cited in

(1)

• On the existence of elementary Abelian cycle systems

This page was built for publication: Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878054)