On the volumes and affine types of trades

DOI10.37236/8367MaRDI QIDQ2290357zbMATH OpenOpenAlexFDO

Authors Sara Kamali, Denis S. Krotov, E. Ghorbani, Gholamreza Khosrovshahi

Publication date 27 January 2020

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1810.02296, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i1p29

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Kasami-Tokura characterization

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Abstract: A $[t]$-trade is a pair $T=(T_{+},T_{-})$ of disjoint collections of subsets (blocks) of a $v$-set $V$ such that for every $0leilet$, any $i$-subset of $V$ is included in the same number of blocks of $T_{+}$ and of $T_{-}$. It follows that $|T_{+}|=|T_{-}|$ and this common value is called the volume of $T$. If we restrict all the blocks to have the same size, we obtain the classical $t$-trades as a special case of $[t]$-trades. It is known that the minimum volume of a nonempty $[t]$-trade is $2^t$. Simple $[t]$-trades (i.e., those with no repeated blocks) correspond to a Boolean function of degree at most $v-t-1$. From the characterization of Kasami--Tokura of such functions with small number of ones, it is known that any simple $[t]$-trade of volume at most $2cdot{2}^t$ belongs to one of two affine types, called Type,(A) and Type,(B) where Type,(A) $[t]$-trades are known to exist. By considering the affine rank, we prove that $[t]$-trades of Type,(B) do not exist. Further, we derive the spectrum of volumes of simple trades up to $2.5cdot{2}^t$, extending the known result for volumes less than $2cdot{2}^t$. We also give a characterization of "small" $[t]$-trades for $t=1,2$. Finally, an algorithm to produce $[t]$-trades for specified $t$, $v$ is given. The result of the implementation of the algorithm for $tle4$, $vle7$ is reported.

Review text

Summary: A \([t]\)-trade is a pair \(T=(T_+, T_-)\) of disjoint collections of subsets (blocks) of a \(v\)-set \(V\) such that for every \(0\le i\le t\), any \(i\)-subset of \(V\) is included in the same number of blocks of \(T_+\) and of \(T_-\). It follows that \(|T_+| = |T_-|\) and this common value is called the volume of \(T\). If we restrict all the blocks to have the same size, we obtain the classical \(t\)-trades as a special case of \([t]\)-trades. It is known that the minimum volume of a nonempty \([t]\)-trade is \(2^t\). Simple \([t]\)-trades (i.e., those with no repeated blocks) correspond to a Boolean function of degree at most \(v-t-1\). From the characterization of \textit{T. Kasami} and \textit{N. Tokura} [IEEE Trans. Inf. Theory 16, 752--759 (1970; Zbl 0205.20604)] of such functions with small number of ones, it is known that any simple \([t]\)-trade of volume at most \(2\cdot2^t\) belongs to one of two affine types, called Type (A) and Type (B) where Type (A) \([t]\)-trades are known to exist. By considering the affine rank, we prove that \([t]\)-trades of Type (B) do not exist. Further, we derive the spectrum of volumes of simple trades up to \(2.5\cdot 2^t\), extending the known result for volumes less than \(2\cdot 2^t\). We also give a characterization of ``small \([t]\)-trades for \(t=1,2\). Finally, an algorithm to produce \([t]\)-trades for specified \(t, v\) is given. The result of the implementation of the algorithm for \(t\le 4\), \(v\le 7\) is reported.

Recommendations

• On the gaps of the spectrum of volumes of trades
• On the possible volume of \(\mu\)-\((v,k,t)\) trades
• scientific article; zbMATH DE number 1334637
• scientific article; zbMATH DE number 1051285
• scientific article; zbMATH DE number 2192136
• On the volume of -way G-trade
• On the structure of (v,k,t) trades
• Trading volume in models of financial derivatives
• On the spectrum of \([v,k,t]\) trades
• The minimum volume of subspace trades

Cites work

• Classification algorithms for codes and designs
• scientific article; zbMATH DE number 4047735 (Why is no real title available?)
• scientific article; zbMATH DE number 166095 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 2104717 (Why is no real title available?)
• On the gaps of the spectrum of volumes of trades
• On the number of sets in a null t-design
• On the structure of (v,k,t) trades
• On the weight enumeration of weights less than 2.5d of Reed—Muller codes
• On the weight structure of Reed-Muller codes
• On trades and designs
• Practical graph isomorphism. II.
• Weight enumerator for second-order Reed-Muller codes

Cited in

(8)

• On the structure of (v,k,t) trades
• On the cardinality spectrum and the number of Latin bitrades of order 3
• The minimum volume of subspace trades
• The volume and foundation of star trades
• Orthogonal trades and the intersection problem for orthogonal arrays
• scientific article; zbMATH DE number 2192136 (Why is no real title available?)
• Optimal functions with spectral constraints in hypercubes
• Inclusion matrices for rainbow subsets

Describes a project that uses

Uses Software

• nauty
• Traces

This page was built for publication: On the volumes and affine types of trades

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