Related papers: Smooth numbers with few non-zero binary digits
Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…
Norm forms, examples of which include $x^2 + y^2$, $x^2 + x y - 57 y^2$, and $x^3 + 2 y^3 + 4 z^3 - 6 x y z$, are integral forms arising from norms on number fields. We prove that the natural density of the set of integers represented by a…
We make a very detailed analysis of the numerical properties of effective divisors whose support is contained in the exceptional locus of a birational morphism of smooth projective surfaces. As an application we extend Miyaoka's inequality…
This paper is a survey of methods for solving smooth (strongly) monotone stochastic variational inequalities. To begin with, we give the deterministic foundation from which the stochastic methods eventually evolved. Then we review methods…
We derive a lower and an upper bound for the number of binary cyclotomic polynomials $\Phi_m$ with at most $m^{1/2+\epsilon}$ nonzero terms.
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n.
We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…
In this short note, we show a simple characterization of integers that reach records for a sequence described by adding binary strings to runs of 1's and 0's in a binary representation. In particular, we show that this set does not depend…
We study three classes of combinatorial sums involving central binomial coefficients and harmonic numbers, odd harmonic numbers, and even indexed harmonic numbers, respectively. In each case we use summation by parts to derive recursive…
This thesis describes a numerical study of binary boson stars within the context of an approximation to general relativity. The approximation we adopt places certain restrictions on the dynamical variables of general relativity (conformal…
Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…
We suggest a combinatorial criterion for the smoothness of an arbitrary spherical variety using the classification of multiplicity-free spaces, generalizing an earlier result of Camus for spherical varieties of type $A$.
Starting from a small number of well-motivated axioms, we derive a unique definition of sums with a noninteger number of addends. These "fractional sums" have properties that generalize well-known classical sum identities in a natural way.…
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 determine, up to multiplicative constants, the number of integers $n\le x$ that have no prime factor $\le w$ and a divisor in $(y,2y]$. Our estimate is uniform in $x,y,w$. We apply this to determine the order of the number of distinct…
We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…
A new family of sequences is proposed. An example of sequence of this family is more accurately studied. This sequence is composed by the integers $n$ for which the sum of binary digits is equal to the sum of binary digits of $n^2$. Some…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
We consider the sum-of-digits functions $s_2$ and $s_3$ in bases $2$ and $3$. These functions just return the minimal numbers of powers of two (resp. three) needed in order to represent a nonnegative integer as their sum. A result of the…