@@ -1660,15 +1660,15 @@ def is_supplementary_difference_set(Ks, v=None, lmbda=None, G=None, verbose=Fals
1660
1660
sage: is_supplementary_difference_set([S1, S2, S3, S4], lmbda=16)
1661
1661
Traceback (most recent call last):
1662
1662
...
1663
- ValueError: One of G or v must be specified.
1663
+ ValueError: one of G or v must be specified
1664
1664
1665
1665
.. SEEALSO::
1666
1666
1667
1667
:func:`supplementary_difference_set_from_rel_diff_set`
1668
1668
"""
1669
1669
1670
1670
if G is None and v is None :
1671
- raise ValueError ('One of G or v must be specified. ' )
1671
+ raise ValueError ('one of G or v must be specified' )
1672
1672
1673
1673
if G is None :
1674
1674
from sage .groups .additive_abelian .additive_abelian_group import AdditiveAbelianGroup
@@ -2038,7 +2038,7 @@ def skew_supplementary_difference_set_over_polynomial_ring(n, existence=False, c
2038
2038
sage: skew_supplementary_difference_set_over_polynomial_ring(7)
2039
2039
Traceback (most recent call last):
2040
2040
...
2041
- ValueError: Skew SDS of order 7 not yet implemented.
2041
+ NotImplementedError: skew SDS of order 7 not yet implemented
2042
2042
"""
2043
2043
from sage .symbolic .ring import SymbolicRing
2044
2044
from sage .rings .finite_rings .integer_mod_ring import Zmod
@@ -2056,7 +2056,7 @@ def skew_supplementary_difference_set_over_polynomial_ring(n, existence=False, c
2056
2056
return n in data
2057
2057
2058
2058
if n not in data :
2059
- raise ValueError (f'Skew SDS of order { n } not yet implemented. ' )
2059
+ raise NotImplementedError (f'skew SDS of order { n } not yet implemented' )
2060
2060
2061
2061
mod , poly , exp , order , ind1 , ind2 , ind3 , ind4 = data [n ]
2062
2062
@@ -2137,7 +2137,7 @@ def skew_supplementary_difference_set_with_paley_todd(n, existence=False, check=
2137
2137
sage: skew_supplementary_difference_set_with_paley_todd(7)
2138
2138
Traceback (most recent call last):
2139
2139
...
2140
- ValueError: Data for skew SDS of order 7 not yet implemented.
2140
+ NotImplementedError: data for skew SDS of order 7 not yet implemented
2141
2141
"""
2142
2142
H_db = {
2143
2143
239 : [1 , 10 , 24 , 44 , 98 , 100 , 201 ],
@@ -2153,7 +2153,7 @@ def skew_supplementary_difference_set_with_paley_todd(n, existence=False, check=
2153
2153
return n in H_db
2154
2154
2155
2155
if n not in H_db :
2156
- raise ValueError (f'Data for skew SDS of order { n } not yet implemented. ' )
2156
+ raise NotImplementedError (f'data for skew SDS of order { n } not yet implemented' )
2157
2157
2158
2158
G = Zmod (n )
2159
2159
H = {G (el ) for el in H_db [n ]}
@@ -2823,19 +2823,19 @@ def complementary_difference_setsI(n, check=True):
2823
2823
sage: complementary_difference_setsI(17)
2824
2824
Traceback (most recent call last):
2825
2825
...
2826
- ValueError: The parameter 17 is not valid
2826
+ ValueError: the parameter 17 is not valid
2827
2827
sage: complementary_difference_setsI(15)
2828
2828
Traceback (most recent call last):
2829
2829
...
2830
- ValueError: The parameter 15 is not valid
2830
+ ValueError: the parameter 15 is not valid
2831
2831
2832
2832
.. SEEALSO::
2833
2833
2834
2834
:func:`are_complementary_difference_sets`
2835
2835
:func:`complementary_difference_sets`
2836
2836
"""
2837
2837
if not (n % 4 == 3 and is_prime_power (n )):
2838
- raise ValueError (f'The parameter { n } is not valid' )
2838
+ raise ValueError (f'the parameter { n } is not valid' )
2839
2839
2840
2840
from sage .rings .finite_rings .finite_field_constructor import GF
2841
2841
@@ -2896,11 +2896,11 @@ def complementary_difference_setsII(n, check=True):
2896
2896
sage: complementary_difference_setsII(49)
2897
2897
Traceback (most recent call last):
2898
2898
...
2899
- ValueError: The parameter 49 is not valid
2899
+ ValueError: the parameter 49 is not valid
2900
2900
sage: complementary_difference_setsII(15)
2901
2901
Traceback (most recent call last):
2902
2902
...
2903
- ValueError: The parameter 15 is not valid
2903
+ ValueError: the parameter 15 is not valid
2904
2904
2905
2905
.. SEEALSO::
2906
2906
@@ -2909,7 +2909,7 @@ def complementary_difference_setsII(n, check=True):
2909
2909
"""
2910
2910
p , t = is_prime_power (n , get_data = True )
2911
2911
if not (p % 8 == 5 and t > 0 and t % 4 in [1 , 2 , 3 ]):
2912
- raise ValueError (f'The parameter { n } is not valid' )
2912
+ raise ValueError (f'the parameter { n } is not valid' )
2913
2913
2914
2914
from sage .rings .finite_rings .finite_field_constructor import GF
2915
2915
G = GF (n , 'a' )
@@ -2975,11 +2975,11 @@ def complementary_difference_setsIII(n, check=True):
2975
2975
sage: complementary_difference_setsIII(10)
2976
2976
Traceback (most recent call last):
2977
2977
...
2978
- ValueError: The parameter 10 is not valid
2978
+ ValueError: the parameter 10 is not valid
2979
2979
sage: complementary_difference_setsIII(17)
2980
2980
Traceback (most recent call last):
2981
2981
...
2982
- ValueError: The parameter 17 is not valid
2982
+ ValueError: the parameter 17 is not valid
2983
2983
2984
2984
.. SEEALSO::
2985
2985
@@ -2989,7 +2989,7 @@ def complementary_difference_setsIII(n, check=True):
2989
2989
m = (n - 1 ) // 2
2990
2990
q = 4 * m + 3
2991
2991
if n % 2 != 1 or not is_prime_power (q ):
2992
- raise ValueError (f'The parameter { n } is not valid' )
2992
+ raise ValueError (f'the parameter { n } is not valid' )
2993
2993
2994
2994
from sage .rings .finite_rings .finite_field_constructor import GF
2995
2995
G = Zmod (n )
@@ -3062,11 +3062,11 @@ def complementary_difference_sets(n, existence=False, check=True):
3062
3062
sage: complementary_difference_sets(10)
3063
3063
Traceback (most recent call last):
3064
3064
...
3065
- ValueError: The parameter n must be odd.
3065
+ ValueError: the parameter n must be odd
3066
3066
sage: complementary_difference_sets(17)
3067
3067
Traceback (most recent call last):
3068
3068
...
3069
- ValueError: Complementary difference sets of order 17 are not implemented yet.
3069
+ NotImplementedError: complementary difference sets of order 17 are not implemented yet
3070
3070
3071
3071
.. SEEALSO::
3072
3072
@@ -3075,7 +3075,7 @@ def complementary_difference_sets(n, existence=False, check=True):
3075
3075
if n % 2 == 0 :
3076
3076
if existence :
3077
3077
return False
3078
- raise ValueError ('The parameter n must be odd. ' )
3078
+ raise ValueError ('the parameter n must be odd' )
3079
3079
3080
3080
p , t = is_prime_power (n , get_data = True )
3081
3081
G , A , B = None , None , None
@@ -3097,7 +3097,7 @@ def complementary_difference_sets(n, existence=False, check=True):
3097
3097
return False
3098
3098
3099
3099
if G is None :
3100
- raise ValueError (f'Complementary difference sets of order { n } are not implemented yet. ' )
3100
+ raise NotImplementedError (f'complementary difference sets of order { n } are not implemented yet' )
3101
3101
3102
3102
if check :
3103
3103
assert are_complementary_difference_sets (G , A , B )
0 commit comments