The following pages link to Peter J. Dukes (Q331483):
Displaying 50 items.
- Nerve complexes of circular arcs (Q312133) (← links)
- Pairwise balanced designs covered by bounded flats (Q331484) (← links)
- Nonexistence results for tight block designs (Q356745) (← links)
- (Q417510) (redirect page) (← links)
- Rational decomposition of dense hypergraphs and some related eigenvalue estimates (Q417511) (← links)
- Corrigendum to ``Rational decomposition of dense hypergraphs and some related eigenvalue estimates'' (Q477766) (← links)
- Coding with injections (Q690670) (← links)
- Resolvable group divisible designs with large groups (Q727201) (← links)
- Existence of balanced sampling plans avoiding cyclic distances (Q745463) (← links)
- On the intersection problem for Steiner triple systems of different orders (Q855301) (← links)
- Generalized laminar families and certain forbidden matrices (Q890016) (← links)
- Graph divisible designs and packing constructions (Q897275) (← links)
- Matching divisible designs with block size four (Q898140) (← links)
- Small maximally disjoint union-free families (Q941357) (← links)
- Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles (Q949803) (← links)
- On the possible orders of a basis for a finite cyclic group (Q976738) (← links)
- Linear spaces with small generated subspaces (Q1003656) (← links)
- (Q1284912) (redirect page) (← links)
- On Vlasov-Manev equations. II: Local existence and uniqueness (Q1284913) (← links)
- On Vlasov-Manev equations. I: Foundations, properties, and nonglobal existence (Q1285174) (← links)
- On opposite orthogonal Steiner triple systems of non-prime-power order (Q1613498) (← links)
- Fractional triangle decompositions of dense 3-partite graphs (Q1713787) (← links)
- Sequentially perfect and uniform one-factorizations of the complete graph (Q1773191) (← links)
- Sets of three pairwise orthogonal Steiner triple systems (Q1865412) (← links)
- Constructions for permutation codes in powerline communications (Q1877339) (← links)
- A combinatorial error bound for \(t\)-point-based sampling (Q1884988) (← links)
- The orthogonality spectrum for Latin squares of different orders (Q1938888) (← links)
- A finite embedding theorem for partial Steiner 3-designs (Q2011479) (← links)
- Schurity of association schemes whose thin residues are elementary abelian \(p\)-groups of rank 2 (Q2025123) (← links)
- Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry (Q2025155) (← links)
- Combinatorial properties of the enhanced principal rank characteristic sequence over finite fields (Q2076174) (← links)
- Local balance in graph decompositions (Q2115139) (← links)
- Constructions of Sarvate-Beam group divisible designs (Q2149597) (← links)
- On the algebraic combinatorics of injections (Q2199901) (← links)
- A result on fractional \((a,b,k)\)-critical covered graphs (Q2240647) (← links)
- Pairwise balanced designs with prescribed minimum dimension (Q2250055) (← links)
- Bounds on permutation codes of distance four (Q2269535) (← links)
- A lower bound on permutation codes of distance \(n-1\) (Q2285776) (← links)
- Constructions and uses of incomplete pairwise balanced designs (Q2334435) (← links)
- Mutually orthogonal Latin squares with large holes (Q2343836) (← links)
- The cone condition and \(t\)-designs (Q2372424) (← links)
- Threefold triple systems with nonsingular \(N_2\) (Q2407015) (← links)
- Relative difference sets partitioned by cosets (Q2409828) (← links)
- Linear programming bounds for balanced arrays (Q2433839) (← links)
- Group divisible designs in MOLS of order ten (Q2448073) (← links)
- Semidefinite programming for permutation codes (Q2449151) (← links)
- A Sidon-type condition on set systems (Q2449974) (← links)
- Directed complete bipartite graph decompositions: indirect constructions (Q2468018) (← links)
- On the structure of uniform one-factorizations from starters in finite fields (Q2490141) (← links)
- On constant composition codes (Q2492193) (← links)
