1985
DOI: 10.1070/im1985v025n03abeh001295
|View full text |Cite
|
Sign up to set email alerts
|

On Waring's Problem With Nonintegral Exponent

Abstract: Thin films of collodion and Canada balsam have been prepared on water surfaces. Their thickness has been evaluated interferometrically over the range 4-s~ h and the relation between concentration and thickness studied. The effect of temperature on film thickness has been evaluated at 25, 100 and 150" c.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
19
0

Year Published

2007
2007
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(19 citation statements)
references
References 9 publications
0
19
0
Order By: Relevance
“…of integer parts of c th powers is an asymptotic basis. This question has been studied further by Deshouillers [4] and by Arkhipov and Zhitkov [1], among others. Whereas those authors focused on the order of the basis (i.e., the number of unknowns in an equation analogous to (1.1) that ensure solvability), in this work we ask the general question if the sequence [n c ] can be replaced by other sequences.…”
Section: Introductionmentioning
confidence: 96%
“…of integer parts of c th powers is an asymptotic basis. This question has been studied further by Deshouillers [4] and by Arkhipov and Zhitkov [1], among others. Whereas those authors focused on the order of the basis (i.e., the number of unknowns in an equation analogous to (1.1) that ensure solvability), in this work we ask the general question if the sequence [n c ] can be replaced by other sequences.…”
Section: Introductionmentioning
confidence: 96%
“…It follows from the work of B. I. Segal [17] that G(c) is finite, and in fact, Segal obtained an upper bound for G(c). For further developments and improvements, see [1,2,7].…”
Section: Introductionmentioning
confidence: 98%
“…for a fixed k 2 and c > 1. In this setting it is natural to ask for the smallest number of summands s = G k (c) that would be needed for a given c. Indeed, for k = 1, this has been done by several authors (see [1,3,8,10,11]). Unfortunately, for k 2, we cannot adapt the methods used therein for an arbitrary c > 1.…”
mentioning
confidence: 99%
“…In the theorem below, instead of all sufficiently large integers, we require that almost all integers be represented by (1). THEOREM 3.…”
mentioning
confidence: 99%
See 1 more Smart Citation