1172 search results - page 1 / 235 » Constructions of generalized Sidon sets |
75
Voted
JCT
2006
14 years 10 months ago
2006
We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k = s1 + s2, si S; such sets are called Sidon sets if g = 2 a...
61
Voted
COMBINATORICA
2008
14 years 10 months ago
2008
71
Voted
SIAMDM
2010
14 years 8 months ago
2010
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...
ISMIS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Subsystem based generalizations of rough set approximations are investigated. Instead of using an equivalence relation, an arbitrary binary relation is used to construct ...
86
Voted
CORR
2012
Springer
13 years 6 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...