We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure [email protected]
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We obtain a nontrivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to the growth of conjugates classes, estimates of exponential sums, and restriction phenomenon.
Motivated by a question of Per Enflo, we develop a hypercube criterion for locating linear isometric copies of $\ell _{1}^{\left( n \right)}$ in an arbitrary real normed space $X$.
The said criterion involves finding ${{2}^{n}}$ points in $X$ that satisfy one metric equality. This contrasts nicely to the standard classical criterion wherein one seeks $n$ points that satisfy ${{2}^{n-1}}$ metric equalities.
Consider a collection of topological spheres in Euclidean space whose intersections are essentially topological spheres. We find a bound for the number of components of the complement of their union and discuss conditions for the bound to be achieved. This is used to give a necessary condition for independence of these sets. A related conjecture of Griinbaum on compact convex sets is discussed.
Hidden behind a sums of squares formula are other such formulae not obtainable by restriction. This drastically simplifies the combinatorics involved in the existence problem of sums of squares formulae, and leads to a proof that the product of two sums of 16 squares cannot be rewritten as a sum of 28 squares, if only integer coefficients are permitted. We also construct all [10, 10, 16] formulae.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.