Metraipolis › archive › dc_bc9dd0748b49
Difference set — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Difference_set
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T16:44:29.948Z
- SHA-256 of the archived text
f86e4b100789b9c06bbd78491301f02dc426c265c4ada8ae61b7734a2c4c6609- Stable URL of this page
https://metraipolis.com/documento/dc_bc9dd0748b49
How to cite
Difference set — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Difference_set (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_bc9dd0748b49 (Metraipolis archive dc_bc9dd0748b49, sha256 f86e4b100789b9c06bbd78491301f02dc426c265c4ada8ae61b7734a2c4c6609)
BibTeX
@misc{dcbc9dd0748b49,
title = {Difference set — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Difference_set},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_bc9dd0748b49; sha256 f86e4b100789b9c06bbd78491301f02dc426c265c4ada8ae61b7734a2c4c6609},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Difference_set. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In combinatorics, a ( v , k , λ ) {\displaystyle (v,k,\lambda )} difference set is a subset D {\displaystyle D} of size k {\displaystyle k} of a group G {\displaystyle G} of order v {\displaystyle v} such that every non-identity element of G {\displaystyle G} can be expressed as a product d 1 d 2 − 1 {\displaystyle d_{1}d_{2}^{-1}} of elements of D {\displaystyle D} in exactly λ {\displaystyle \lambda } ways. A difference set D {\displaystyle D} is said to be cyclic, abelian, non-abelian, etc., if the group G {\displaystyle G} has the corresponding property. A difference set with λ = 1 {\displaystyle \lambda =1} is sometimes called planar or simple. If G {\displaystyle G} is an abelian group written in additive notation, the defining condition is that every non-zero element of G {\displaystyle G} can be written as a difference of elements of D {\displaystyle D} in exactly λ {\displaystyle \lambda } ways. The term "difference set" arises in this way.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Combinatorics»).
Fonte: Wikipedia in inglese, voce «Difference set» — https://en.wikipedia.org/wiki/Difference_set
Wikidata Q5275281 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5275281
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Difference_set?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1376475241, consultata il 2026-10-06T15:18:47.049Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 4932786a456ff8ae8de7ecbe1e3c60d10eb70b33e7f229746170721c6645e36f