Related papers: Binary linear forms as sums of two squares

The Binary Two-Up Sequence is the lexicographically earliest sequence of distinct nonnegative integers with the property that the binary expansion of the n-th term has no 1-bits in common with any of the previous floor(n/2) terms. We show…

In this work we show that based on a conjecture for the pair correlation of integers representable as sums of two squares, which was first suggested by Connors and Keating and reformulated here, the second moment of the distribution of the…

Let $u_1,\ldots,u_n$ be unitary operators on a Hilbert space $H$. We study the norm $$\left\|\sum^{i=n}_{i=1} u_i \otimes \bar u_i\right\|\leqno (1)$$ of the operator $\sum u_i \otimes \bar u_i$ acting on the Hilbertian tensor product…

The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…

We develop a systematic derivation for the Limber approximation to the angular cross-power spectrum of two random fields, as a series expansion in 1/(\ell+1/2). This extended Limber approximation can be used to test the accuracy of the…

Let A,B denote binary forms of order d, and let C_{2r-1} = (A,B)_{2r-1} be the sequence of their linear combinants for r between 1 and (d+1)/2. It is known that C_1 and C_3 together determine the pencil generated by A and B, and hence…

The partial sums of integer sequences that count the occurrences of a specific pattern in the binary expansion of positive integers have been investigated by different authors since the 1950s. In this note, we introduce generalized pattern…

Let c > 0.55. Every large n can be written in the form p +ab, where p is prime, a and b are significantly smaller than x^1/2 and ab is less than n^c. This strengthens a result of Heath-Brown, which has the requirement c>3/4. We introduce…

In this paper we consider a variety of mixed character sums. In particular we extend a bound of Heath-Brown and Pierce to the case of squarefree modulus, improve on a result of Chang for mixed sums in finite fields, we show in certain…

We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.

We show how to prove theorems in additive number theory using a decision procedure based on finite automata. Among other things, we obtain the following analogue of Lagrange's theorem: every natural number > 686 is the sum of at most 4…

Counting integral binary quadratic forms with certain restrictions is a classical problem. In this paper, we count binary quadratic forms of fixed discriminant given restrictions on the size of their coefficients. We accomplish this by…

We improve some results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$ and $n=p^{\ell_1} + m^{\ell_2}$, where $\ell_1, \ell_2\ge 2$ are…

We obtain quantitative estimates for the asymptotic density of subsets of the two-dimensional integer lattice which contain only trivial solutions to an additive equation involving binary forms. In the process we develop an analogue of…

Let $Q$ be a nondegenerate quadratic form on a vector space $V$ of even dimension $n$ over a number field $F$. Via the circle method or automorphic methods one can give good estimates for smoothed sums over the number of zeros of the…

This paper is concerned with finite sequences of integers that may be written as sums of squares of two nonzero integers. We first find infinitely many integers $n$ such that $n, n+h$ and $n+k$ are all sums of two squares where $h$ and $k$…

We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in the…

Recently, Chang and Hyun obtained some classes of binary optimal codes via simplicial complexes. In this letter, we utilize posets of the disjoint union of two chains to construct binary optimal linear codes.

We give explicit evaluations of the linear and non-linear Euler sums of hyperharmonic numbers $h_{n}^{\left( r\right) }$ with reciprocal binomial coefficients. These evaluations enable us to extend closed form formula of Euler sums of…

We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…