Skip to content
This repository was archived by the owner on Jan 30, 2023. It is now read-only.

Commit a86b08e

Browse files
committed
trac #15431: Mention that we assume \lambda=1
1 parent 2d345f1 commit a86b08e

File tree

2 files changed

+19
-5
lines changed

2 files changed

+19
-5
lines changed

src/sage/combinat/designs/bibd.py

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -47,6 +47,9 @@ def BalancedIncompleteBlockDesign(v,k,use_LJCR=False):
4747
distinct elements `x,y\in V` there is a unique element `S\in \mathcal C`
4848
such that `x,y\in S`.
4949
50+
More general definitions sometimes involve a `\lambda` parameter, and we
51+
assume here that `\lambda=1`.
52+
5053
For more information on BIBD, see the
5154
:wikipedia:`corresponding Wikipedia entry <Block_design#Definition_of_a_BIBD_.28or_2-design.29>`.
5255

src/sage/combinat/designs/orthogonal_arrays.py

Lines changed: 16 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -12,16 +12,19 @@ def transversal_design(k,n,check=True):
1212
r"""
1313
Return a transversal design of parameters `k,n`.
1414
15-
A transversal design of parameters `k, n` is a collection `\mathcal{S}`
16-
of subsets of `V = V_1 \sqcup \cdots \sqcup V_k` (where each *group* `V_i`
17-
has cardinality `n`) such that:
15+
A transversal design of parameters `k, n` is a collection `\mathcal{S}` of
16+
subsets of `V = V_1 \cup \cdots \cup V_k` (where the *groups* `V_i` are
17+
disjoint and have cardinality `n`) such that:
1818
1919
* Any `S \in \mathcal{S}` has cardinality `k` and intersects each group on
2020
exactly one element.
2121
2222
* Any two elements from distincts groups are contained in exactly one
2323
element of `\mathcal{S}`.
2424
25+
More general definitions sometimes involve a `\lambda` parameter, and we
26+
assume here that `\lambda=1`.
27+
2528
For more information on transversal designs, see
2629
`<http://mathworld.wolfram.com/TransversalDesign.html>`_.
2730
@@ -34,6 +37,11 @@ def transversal_design(k,n,check=True):
3437
guys), you may want to disable it whenever you want speed. Set to
3538
``True`` by default.
3639
40+
.. NOTE::
41+
42+
This function returns transversal designs with
43+
`V_1=\{0,\dots,n-1\},\dots,V_k=\{(k-1)n,\dots,kn-1\}`.
44+
3745
.. SEEALSO::
3846
3947
:func:`orthogonal_array` -- a tranversal design is an orthogonal array
@@ -150,8 +158,11 @@ def orthogonal_array(k,n,t=2,check=True):
150158
151159
An orthogonal array of parameters `k,n,t` is a matrix with `k` columns
152160
filled with integers from `[n]` in such a way that for any `t` columns, each
153-
of the `n^t` possible rows occurs exactly once. In particular, the matrix
154-
has `n^t` rows.
161+
of the `n^t` possible rows occurs exactly once. In
162+
particular, the matrix has `n^t` rows.
163+
164+
More general definitions sometimes involve a `\lambda` parameter, and we
165+
assume here that `\lambda=1`.
155166
156167
For more information on orthogonal arrays, see
157168
:wikipedia:`Orthogonal_array`.

0 commit comments

Comments
 (0)