On the number of representations of integers by some quadratic forms in ten variables

A method of finding the so-called Liouville's type formulas for the number of representations of integers by $$a_1 (x_1^2 + x_2^2 ) + a_2 (x_3^2 + x_4^2 ) + a_3 (x_5^2 + x_6^2 ) + a_4 (x_7^2 + x_8^2 ) + a_5 (x_9^2 + x_{10}^2 )$$ quadratic forms is developed.     

Additive representations of integers

In this paper we shall mainly study additive representations of integers prime to the first m primes as a sum of some integers having a peculiar property. The conjectures of Goldbach and twin primes are also observed in connection with these representations of integers. Received: 20 October 1997     

Multiplicative representations of integers

Lehh ≧ 2, and let ?=(B ₁, …,B _h ), whereB ₁ ? N={1, 2, 3, …} fori=1, …,h. Denote by g_?(n) the number of representations ofn in the formn=b ₁ …b _h , whereb _i ∈B _i . If v (n) > 0 for alln >n ₀, then ? is anasymptotic multiplicative system of order h. The setB is anasymptotic multiplicative basis of order h ifn=b ₁ …b _n is solvable withb _i ∈B for alln >n ₀. Denote byg(n) the number of such representations ofn. LetM(h) be the set of all pairs (s, t), wheres=lim g_? (n) andt=lim g_? (n) for some multiplicative system ? of orderh. It is proved that {fx129-1} In particular, it follows thats ≧ 2 impliest=∞. A corollary is a theorem of Erdös that ifB is a multiplicative basis of orderh ≧ 2, then lim g_? g(n)=∞. Similar results are obtained for asymptotic union bases of finite subsets of N and for asymptotic least common multiple bases of integers.     

Additive representations of integers

In this paper we shall mainly study additive representations of integers prime to the firstm primes as a sum of some integers having a peculiar property. The conjectures of Goldbach and twin primes are also observed in connection with these representations of integers.     

On the number of primitive representations of integers as sums of squares

Formulas for the number of primitive representations of any integer n as a sum of k squares are given, for 2 ≤ k ≤ 8, and for certain values of n, for 9 ≤ k ≤ 12. The formulas have a similar structure and are striking for their simplicity. Dedicated to Richard Askey on the occasion of his 70th birthday. 2000 Mathematics Subject Classification Primary—11E25; Secondary—05A15, 33E05.     

Asymptotic behavior of the number of representations of large integers by certain positive-definite ternary quadratic forms

Continuing the work in an earlier paper, the author uses an assumption concerning the location of zeros of Dirichlet L-series in order to derive an asymptotic formula for the number of representations of large integers by the ternary form f(x,y,z)=x²+2y²+Dz², where D is of the form x²+2y².Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 76, pp. 53–59, 1978.     

On the number of representations of certain integers as sums of 11 or 13 squares

Let r_k(n) denote the number of representations of an integer n as a sum of k squares. We prove that for odd primes p,

     

Hardy-Littlewood system and representations of integers by an invariant polynomial

Let f be an integral homogeneous polynomial of degree d, and let be the level set for each . For a compact subset in ), set

On binary signed digit representations of integers

Applications of signed digit representations of an integer include computer arithmetic, cryptography, and digital signal processing. An integer of length n bits can have several binary signed digit (BSD) representations and their number depends on its value and varies with its length. In this paper, we present an algorithm that calculates the exact number of BSDR of an integer of a certain length. We formulate the integer that has the maximum number of BSDR among all integers of the same length. We also present an algorithm to generate a random BSD representation for an integer starting from the most significant end and its modified version which generates all possible BSDR. We show how the number of BSD representations of k increases as we prepend 0s to its binary representation.     

Number of the representations of integers by certain ternary quadratic forms

Exact formulas are derived for the number of the representations of positive integers by certain positive ternary quadratic forms, belonging to multiclass genera. The Fourier coefficients of the corresponding cusp forms (on the basis of the known results of Waldspurger and Tunnell) are expressed in terms of the values of the Hasse-Weil L-functions of certain elliptic curves at the center of the critical strip.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 154, pp. 154–162, 1986.     

The number of large prime divisors of consecutive integers

Let ?(N) > 0 be a function of positive integers N and such that ?(N) → 0 and N^?(N) → ∞ as N → + ∞. Let Nν_N(n:…) be the number of positive integers n ≤ N for which the property stated in the dotted space holds. Finally, let g(n; N, ?, z) be the number of those prime divisors p of n which satisfy N^Z?(N) ? p ? N^?(N), 0 < z < 1 In the present note we show that for each k = 0, ±1, ±2,…, as N → ∞, limv_N(n : g(n; N, ?, z) ? g(n + 1; N, ?z) = k) exists and we determine its actual value. The case k = 0 induced the present investigation. Our solution for this value shows that the natural density of those integers n for which n and n + 1 have the same number of prime divisors in the range (1) exists and it is positive.     

Geometric families of 4-dimensional Galois representations with generically large images

We study compatible families of four-dimensional Galois representations constructed in the étale cohomology of a smooth projective variety. We prove a theorem asserting that the images will be generically large if certain conditions are satisfied. We only consider representations with coefficients in an imaginary quadratic field. We apply our result to an example constructed by Jasper Scholten (A non-selfdual 4-dimensional Galois representation, , 1999), obtaining a family of linear groups and one of unitary groups as Galois groups over . Research partially supported by MEC grant MTM2006-04895.     

Kolmogorov complexity and set theoretical representations of integers

We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations) in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivize in order to develop an associated Kolmogorov theory. Such effectivizations are particular instances of a general notion of “self‐enumerated system” that we introduce in this paper. Our main result asserts that, with such effectivizations, Kolmogorov theory allows to quantitatively distinguish the underlying semantics. We characterize the families obtained by such effectivizations and prove that the associated Kolmogorov complexities constitute a hierarchy which coincides with that of Kolmogorov complexities defined via jump oracles and/or infinite computations (cf. [6]). This contrasts with the well‐known fact that usual Kolmogorov complexity does not depend (up to a constant) on the chosen arithmetic representation of integers, let it be in any base n ≥ 2 or in unary. Also, in a conceptual point of view, our result can be seen as a mean to measure the degree of abstraction of these diverse semantics. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On optimal binary signed digit representations of integers

Binary signed digit representation （BSD-R） of an integer is widely used in computer arithmetic, cryptography and digital signal processing. This paper studies what the exact number of optimal BSD-R of an integer is and how to generate them entirely. We also show which kinds of integers have the maximum number of optimal BSD-Rs.     

The number ofℝℂ-singular points on a 4-dimensional real submanifold in a 5-dimensional complex manifold

This research was accomplished with the financial support of the Russian Foundation for Fundamental Research, Grant No. 93-01-00225.