Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Total trades, intersection matrices and Specht modules

Mihalis Maliakas, Dimitra-Dionysia Stergiopoulou

TL;DR

The paper analyzes total trades in combinatorial designs through the lens of symmetric-group and general linear-group representation theory. It proves that the span of $t$-$(n,k)$ total trades is an irreducible $S_n$-module isomorphic to the two-row Specht module $S^{(n-t-1,t+1)}$, and derives a Specht-polynomial–style basis that leads to a decomposition of the full trade space consistent with Graver–Jurkat. Extending these methods, the authors study images of intersection matrices $U_{t,k,l}$ via Weyl modules and the Schur functor, obtaining a complete irreducible decomposition of images and a rank formula in terms of $S^{(n-j,j)}$ components. A key outcome is that the rank of any linear combination of intersection matrices is governed by a well-behaved irreducible decomposition, with the inclusion matrix achieving maximal rank as a special case. Overall, the work connects design-theoretic kernels with classical representation theory, generalizing prior rank results and providing structural insight into the interplay between combinatorics and representation theory.

Abstract

Trades are important objects in combinatorial design theory that may be realized as certain elements of kernels of inclusion matrices. Total trades were introduced recently by Ghorbani, Kamali and Khosravshahi, who showed that over a field of characteristic zero the vector space of trades decomposes into a direct sum of spaces of total trades. In this paper, we show that the vector space spanned by the permutations of a total trade is an irreducible representation of the symmetric group. As a corollary, the previous decomposition theorem is recovered. Also, a basis is obtained for the module of total trades in the spirit of Specht polynomials. More generally, in the second part of the paper we consider intersection matrices and determine the irreducible decompositions of their images. This generalizes previously known results concerning ranks of special cases.

Total trades, intersection matrices and Specht modules

TL;DR

The paper analyzes total trades in combinatorial designs through the lens of symmetric-group and general linear-group representation theory. It proves that the span of - total trades is an irreducible -module isomorphic to the two-row Specht module , and derives a Specht-polynomial–style basis that leads to a decomposition of the full trade space consistent with Graver–Jurkat. Extending these methods, the authors study images of intersection matrices via Weyl modules and the Schur functor, obtaining a complete irreducible decomposition of images and a rank formula in terms of components. A key outcome is that the rank of any linear combination of intersection matrices is governed by a well-behaved irreducible decomposition, with the inclusion matrix achieving maximal rank as a special case. Overall, the work connects design-theoretic kernels with classical representation theory, generalizing prior rank results and providing structural insight into the interplay between combinatorics and representation theory.

Abstract

Trades are important objects in combinatorial design theory that may be realized as certain elements of kernels of inclusion matrices. Total trades were introduced recently by Ghorbani, Kamali and Khosravshahi, who showed that over a field of characteristic zero the vector space of trades decomposes into a direct sum of spaces of total trades. In this paper, we show that the vector space spanned by the permutations of a total trade is an irreducible representation of the symmetric group. As a corollary, the previous decomposition theorem is recovered. Also, a basis is obtained for the module of total trades in the spirit of Specht polynomials. More generally, in the second part of the paper we consider intersection matrices and determine the irreducible decompositions of their images. This generalizes previously known results concerning ranks of special cases.
Paper Structure (14 sections, 17 theorems, 50 equations)

This paper contains 14 sections, 17 theorems, 50 equations.

Table of Contents

  1. Introduction
  2. Background
  3. Boolean algebra
  4. Representations of the symmetric group
  5. Total trades
  6. An identity
  7. Main result
  8. Corollaries
  9. Representations of the general linear group
  10. Divided power algebra
  11. Weyl modules and Pieri's rule
  12. Straightening row semistandard tableaux
  13. Images of intersection matrices
  14. Acknowledgments

Key Result

Theorem 1.1

If $2k-1 \le n$, then the vector space of $t$-$(n,k)$ trades decomposes as the direct sum $\langle \mathfrak{T}_{t,k,n}\rangle \oplus \cdots \oplus \langle \mathfrak{T}_{k-1,k,n}\rangle$.

Theorems & Definitions (34)

  • Theorem 1.1: GKK
  • Theorem 1.2
  • Theorem 1.3
  • Definition 2.1
  • Theorem 2.2
  • proof
  • Theorem 2.3: Standard basis theorem
  • Remark 2.4
  • Definition 3.1
  • Lemma 3.2
  • ...and 24 more