Additive Latin transversals.
From MaRDI portal
Publication:1567340
DOI10.1007/BF02773567zbMath1047.11019OpenAlexW2017299661MaRDI QIDQ1567340
Publication date: 2000
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02773567
Related Items (23)
Additive Latin transversals and group rings. ⋮ Partitions of nonzero elements of a finite field into pairs ⋮ On the modular sumset partition problem ⋮ On Snevily's conjecture and restricted sumsets. ⋮ On some batch code properties of the simplex code ⋮ Decomposing almost complete graphs by random trees ⋮ Decomposing almost complete graphs by random trees ⋮ Approximate results for rainbow labelings ⋮ Almost Every Tree With m Edges Decomposes K2m,2m ⋮ Existence of partial transversals ⋮ Exterior algebras and two conjectures on finite Abelian groups. ⋮ A proof of Snevily's conjecture. ⋮ Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) ⋮ Unnamed Item ⋮ Permutations, hyperplanes and polynomials over finite fields ⋮ Transversals of additive Latin squares ⋮ A Snevily-type inequality for multisets ⋮ Permutations over cyclic groups ⋮ Group algebras of finite abelian groups and their applications to combinatorial problems ⋮ On a conjecture of Graham and Häggkvist with the polynomial method ⋮ On various restricted sumsets ⋮ A compactness argument in the additive theory and the polynomial method. ⋮ Sums of subsets with polynomial restrictions.
Cites Work
- A combinatorial proof of Dyson's conjecture
- Additive bases of vector spaces over prime fields
- Sumsets in vector spaces over finite fields
- The polynomial method and restricted sums of congruence classes
- Has Every Latin Square of Order n a Partial Latin Transversal of Size n - 1?
- Proof of a Conjecture by Dyson in the Statistical Theory of Energy Levels
- Combinatorial Nullstellensatz
- Proof of a Conjecture by Dyson
This page was built for publication: Additive Latin transversals.
