Related papers: Smooth numbers with few non-zero binary digits

The paper is an extensive and systematic study of cardinal invariants we call slalom numbers, describing the combinatorics of sequences of sets of natural numbers. Our general approach, based on relational systems, covers many such cardinal…

Using the subdivision schemes theory, we develop a criterion to check if any natural number has at most one representation in the $n$-ary number system with a set of non-negative integer digits $A=\{a_1, a_2,\ldots, a_n\}$ that contains…

We settle the existence of certain "anti-magic" cubes using combinatorial block designs and graph decompositions to align a handful of small examples.

In this paper, we introduce the notion of fuzzy soft numbers. Here defined fuzzy soft number and four arithmetic operations $ \tilde{+}, \tilde{-}, \tilde{\times}, \tilde{\div} $ and related properties. Also introduce Hausdorff distance,…

In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…

The problem of monotone smoothing splines with bounds is formulated as a constrained minimization problem of the calculus of variations. Existence and uniqueness of solutions of this problem is proved, as well as the equivalence of it to a…

In this paper, we find an elementary approach for double sums where the inner sum is binomial but incomplete. We apply our core identity and its relatives to double sums involving famous numbers such as harmonic numbers, Fibonacci numbers,…

We show that a zero-sum-free sequence of length $n$ over an abelian group spans at least $2n$ distinct subsequence sums, unless it possesses a rigid, easily-described structure.

We show a Condition Number Theorem for the condition number of zero counting for real polynomial systems. That is, we show that this condition number equals the inverse of the normalized distance to the set of ill-posed systems (i.e., those…

Let $s(n)$ denote the sum of digits in the binary expansion of the integer $n$. Hare, Laishram and Stoll (2011) studied the number of odd integers such that $s(n)=s(n^2)=k$, for a given integer $k\geq 1$. The remaining cases that could not…

We investigate sumset decompositions of quite general sets with restricted prime factors. We manage to handle certain sets, such as the smooth numbers, even though they have little sieve amenability, and conclude that these sets cannot be…

Conceptually, a rough number is a positive integer with no small prime factors. Formally, for real numbers $x$ and $y$, let $\Phi(x,y)$ denote the number of positive integers at most $x$ with no prime factors less than $y$. In this paper we…

We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992).…

Let $q$ be a sufficiently large integer, and $a_0\in\{0,\dots,q-1\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their base $q$ expansion. Similar results are obtained for values of a polynomial…

In a multi-base representation of an integer (in contrast to, for example, the binary or decimal representation) the base (or radix) is replaced by products of powers of single bases. The resulting numeral system has desirable properties…

Mixture models are regularly used in density estimation applications, but the problem of estimating the mixing distribution remains a challenge. Nonparametric maximum likelihood produce estimates of the mixing distribution that are…

We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.

The motivation for this paper are computer calculations of complete lists of weight systems of quasihomogeneous polynomials with isolated singularity at 0 up to rather large Milnor numbers. We review combinatorial characterizations of such…

Let $F$ be a non-degenerate quadratic form on an $n$-dimensional vector space $V$ over the rational numbers. One is interested in counting the number of zeros of the quadratic form whose coordinates are restricted in a smoothed box of size…

In the classical probability in continuous random variables there is no distinguishing between the probability involving strict inequality and non strict inequality. Moreover a probability involves equality collapse to zero without…