To the theory of q-ary Steiner and other-type trades

DOI10.1016/J.DISC.2015.11.002zbMATH Open1328.05025arXiv1412.3792OpenAlexW1928275009MaRDI QIDQ897311FDOQ897311

Authors: Denis S. Krotov, Ivan Yu. Mogilnykh, Vladimir N. Potapov 

Publication date: 17 December 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We introduce the concept of a clique bitrade, which generalizes several known types of bitrades, including latin bitrades, Steiner $T(k-1,k,v)$ bitrades, extended $1$-perfect bitrades. For a distance-regular graph, we show a one-to-one correspondence between the clique bitrades that meet the weight-distribution lower bound on the cardinality and the bipartite isometric subgraphs that are distance-regular with certain parameters. As an application of the results, we find the minimum cardinality of $q$-ary Steiner $T_q(k-1,k,v)$ bitrades and show a connection of minimum such bitrades with dual polar subgraphs of the Grassmann graph $J_q(v,k)$. Keywords: bitrades, trades, Steiner systems, subspace designs

Full work available at URL: https://arxiv.org/abs/1412.3792

Recommendations

• scientific article; zbMATH DE number 1529467
• On the spectrum of Steiner \((v, k, t)\) trades. II
• Existence of \(q\)-analogs of Steiner systems
• scientific article; zbMATH DE number 2192199
• Steiner trade spectra of complete partite graphs
• A new approach for examining \(q\)-Steiner systems
• \(L_p\)-Steiner quermassintegrals
• Subcubic trades in Steiner triple systems
• On \(q\)-analogs of Steiner systems and covering designs
• scientific article; zbMATH DE number 1229628

zbMATH Keywords

Steiner systemssubspace designstradesbitrades

Mathematics Subject Classification ID

Triple systems (05B07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Delsarte clique graphs
• Title not available (Why is that?)
• On the number of inequivalent steiner triple systems
• Title not available (Why is that?)
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Title not available (Why is that?)
• Existence of \(q\)-analogs of Steiner systems
• Coding for Errors and Erasures in Random Network Coding
• The theory and application of latin bitrades: A survey
• Large sets of subspace designs
• Title not available (Why is that?)
• Multidimensional Latin bitrades
• On the number of \(n\)-ary quasigroups of finite order.
• On weight distributions of perfect colorings and completely regular codes
• Switching codes and designs
• Nontrivial \(t\)-designs over finite fields exist for all \(t\)
• On the structure of non-full-rank perfect \(q\)-ary codes
• Perfect binary codes: constructions, properties, and enumeration
• On one transformation of Steiner quadruple systems \(S(\upsilon , 4, 3)\)
• Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
• On the structure of (v,k,t) trades
• Combinatorial designs and algebras
• On the number of maximum independent sets in Doob graphs

Cited In (29)

• Minimum supports of functions on the Hamming graphs with spectral constraints
• On existence of perfect bitrades in Hamming graphs
• The extended 1-perfect trades in small hypercubes
• On a correspondence between maximal cliques in Paley graphs of square order
• Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
• The minimum volume of subspace trades
• Minimum supports of eigenfunctions of Johnson graphs
• On eigenfunctions and maximal cliques of Paley graphs of square order
• \(PI\)-eigenfunctions of the Star graphs
• Optimal functions with spectral constraints in hypercubes
• Large sets of subspace designs
• Inclusion matrices for rainbow subsets
• On completely regular codes with minimum eigenvalue in geometric graphs
• MMS-type problems for Johnson scheme
• Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs
• Minimal solutions of the isometry equation
• On extended 1-perfect bitrades
• On the non-existence of some Steiner $t$-$(v,k)$ trades of certain volumes
• Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs
• On the cardinality spectrum and the number of Latin bitrades of order 3
• Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs
• A new series of large sets of subspace designs over the binary field
• Minimum supports of eigenfunctions with the second largest eigenvalue of the star graph
• On eigenfunctions and maximal cliques of generalised Paley graphs of square order
• Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
• Minimum supports of eigenfunctions in bilinear forms graphs
• Minimum supports of eigenfunctions of Hamming graphs
• Extremal Peisert-type graphs without the strict-EKR property
• Minimum supports of eigenfunctions of graphs: a survey

This page was built for publication: To the theory of \(q\)-ary Steiner and other-type trades

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