A dictionary is a set of finite words over some finite alphabet X. The Ο-power of a dictionary V is the set of infinite words obtained by infinite concatenation of words in V . Lecomte studied in [10] the complexity of the set of dictionaries whose associated Ο-powers have a given complexity. In par
β¦ LIBER β¦
On sets of integers whose shifted products are powers
β Scribed by C.L. Stewart
- Book ID
- 108167229
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 139 KB
- Volume
- 115
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On some sets of dictionaries whose Ο -po
β
Olivier Finkel
π
Article
π
2010
π
John Wiley and Sons
π
English
β 147 KB
Circulant weighing matrices whose order
β
Schmidt, Bernhard; Smith, Ken W.
π
Article
π
2013
π
Elsevier Science
π
English
β 228 KB
Distance sets that are a shift of the in
β
A. Iosevich; P. Jaming
π
Article
π
2008
π
Akadmiai Kiad
π
English
β 787 KB
Subnormality for arbitrary powers of 2-v
β
RaΓΊl E. Curto; Sang Hoon Lee; Jasang Yoon
π
Article
π
2012
π
Elsevier Science
π
English
β 294 KB
On separating systems whose elements are
β
Ingo Wegener
π
Article
π
1979
π
Elsevier Science
π
English
β 423 KB
A system A,, . . . , A,,, of subsets of X := (1,. . . , n} is called a separating system if for any two distinct elements of X there is a set Ai (1 G i em) that contains exactly one of the two elements. We investigate separating systems where each set Ai has at most k elements and we are looking for
On the Construction of Sets of Integers
β
M. Jacroux
π
Article
π
1995
π
Elsevier Science
π
English
β 216 KB
In this paper we give a new method for constructing sets of integers having equal th power sums. Using the method, some new results are derived concerning the Tarry-Escott Problem. i' 1995 Academic Press. Inc.