Related papers: Strong divisibility sequences and sieve methods
We study strong existence and pathwise uniqueness for stochastic differential equations in $\RR^d$ with rough coefficients, and without assuming uniform ellipticity for the diffusion matrix. Our approach relies on direct quantitative…
If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…
We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve…
We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…
Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of…
It's the age-old recurrence with a twist: sum the last two terms and if the result is composite, divide by its smallest prime divisor to get the next term (e.g., 0, 1, 1, 2, 3, 5, 4, 3, 7, ...). These sequences exhibit pseudo-random…
We study the exponential map of connected symmetric spaces and characterize, in terms of midpoints and of infinitesimal conditions, when it is a diffeomorphism, generalizing the Dixmier-Saito theorem for solvable Lie groups. We then give a…
Here we demonstrate a sieve for analysing primes and their composites, using equivalence classes based on the modulo 6 return value as applied to the Natural numbers. Five features of this 'Hexile' sieve are reviewed. The first aspect, is…
Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…
In this work, we treat subshifts, defined in terms of an alphabet $A$ and (usually infinite) forbidden list $F$, where the number of $n$-letter words in $F$ has "slow growth rate" in $n$. We show that such subshifts are well-behaved in…
The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…
A closed convex subset of a normed linear space is said to have the strong separation property if it can be strongly separated from every other disjoint closed and convex set by a closed hyperplane. In this paper we give some results on the…
In this paper we study the sets of integers which are $n$-th terms of Lucas sequences. We establish lower- and upper bounds for the size of these sets. These bounds are sharp for $n$ sufficiently large. We also develop bounds on the growth…
We show that discrete synaptic weights can be efficiently used for learning in large scale neural systems, and lead to unanticipated computational performance. We focus on the representative case of learning random patterns with binary…
In this note we compute a constant $N$ that bounds the number of non--primitive divisors in elliptic divisibility sequences over function fields of any characteristic. We improve a result of Ingram--Mah{\'e}--Silverman--Stange--Streng,…
In this paper we consider the sequence whose n^{th} term is the number of h-vectors of length n. We show that the n^{th} term of this sequence is bounded above by the n^{th} Fibonacci number and bounded below by the number if integer…
We study the asymptotic density of the set of subscripts of the Bernoulli numbers having a given denominator. We also study the distribution of distinct Bernoulli denominators and some related problems.
We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…
This note examines the infinite divisibility of density-based transformations of normal random variables. We characterize a class of density-based transformations of normal variables which produces non-infinitely divisible distributions. We…
The Bernoulli sieve is a random allocation scheme obtained by placing independent points with the uniform [0,1] law into the intervals made up by successive positions of a multiplicative random walk with factors taking values in the…