On the existence of $d$-homogeneous $3$-way Steiner trades
H. Amjadi, N. Soltankhah

TL;DR
This paper characterizes 3-way 3-homogeneous Steiner trades of volume v and provides constructions for certain values of d, advancing the understanding of combinatorial trade structures.
Contribution
It offers a complete characterization of 3-way 3-homogeneous (v,3,2) Steiner trades and constructs for specific d values, filling gaps in existing combinatorial trade theory.
Findings
Characterization of 3-way 3-homogeneous (v,3,2) Steiner trades
Construction methods for 3-way d-homogeneous trades with d in {4,5,6}
Identification of seven small v values where constructions are not provided
Abstract
A -way trade of volume consists of disjoint collections , each of blocks of size , such that for every -subset of -set the number of blocks containing this -subset is the same in each (for ). A -way trade is called -way Steiner trade if any -subset of found occurs at most once in . A -way trade is called -homogeneous if each element of occurs in precisely blocks of . In this paper we characterize the -way -homogeneous Steiner trades of volume . Also we show how to construct a -way -homogeneous Steiner trade for , except for seven small values of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · graph theory and CDMA systems · Advanced Graph Theory Research
