Related papers: Strong divisibility sequences and sieve methods
We establish strong invariance principles for sums of stationary and ergodic processes with nearly optimal bounds. Applications to linear and some nonlinear processes are discussed. Strong laws of large numbers and laws of the iterated…
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…
In this paper we investigate some strong convergence theorems for partial sums with respect to Vilenkin system.
The law of large numbers for the empirical density for the pairs of uniformly distributed integers with a given greatest common divisor is a classic result in number theory. In this paper, we study the large deviations of the empirical…
The paper first covers several properties of the extension of the divisibility relation to a set ${}^*\hspace{-0.5mm}N$ of nonstandard integers. After that, a connection is established with the divisibility in the Stone-\v{C}ech…
We establish new upper bounds for the length of runs of consecutive positive integers each with exactly $k$ divisors, where $k$ is a given positive integer of some special forms. Also we have found exact values of the maximum possible runs…
The aim of this paper is to use non asymptotic bounds for the probability of rare events in the Sanov theorem, in order to study the asymptotics in conditional limit theorems (Gibbs conditioning principle for thin sets). Applications to…
We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…
In this paper we show the distributions of sliding block patterns for Bernoulli processes with finite alphabet, which is not based on the induction on sample size. We show a new inclusion-exclusion formula in multivariate generating…
The following magic trick is at the center of this paper. While the audience writes the first ten terms of a Fibonacci-like sequence (the sequence following the same recursion as the Fibonacci sequence), the magician calculates the sum of…
We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we…
We describe the set of prime numbers splitting completely in the non-abelian splitting field of certain monic irreducible polynomials of degree three. As an application we establish some divisibility properties of the associated ternary…
We investigate binary voting systems with two types of voters and a hierarchy among the members in each type, so that members in one class have more influence or importance than members in the other class. The purpose of this paper is to…
The purpose of this paper is to introduce the space of geometric sequences that are strongly summable with respect to an Orlicz function and the Fibonacci difference sequences.Also some topological properties and inclusion relations between…
Motivated by recent interests in predictive inference under distribution shift, we study the problem of approximating finite weighted exchangeable sequences by a mixture of finite sequences with independent terms. Various bounds are derived…
In this article we study asymptotic slopes of strongly semistable vector bundles on a smooth projective surface. A connection between asymptotic slopes and strong restriction theorem of a strongly semistable vector bundle is shown. We also…
In this paper, we consider a certain variation of the "isoperimetric problem" adopted for subsets of nonnegative integers. More specifically, we explore the sequence P(n) as described in OEIS A186053. We provide the first exact formulas for…
We consider a certain variation of the 'isoperimetric problem' adopted for subsets of nonnegative integers. More specifically, we explore the sequence P(n) as described in OEIS A186053. We provide the first exact formulas for P(n) including…
Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…
For a prime $p$, let $Z(p)$ be the smallest positive integer $n$ so that $p$ divides $F_{n}$, the $n$th term in the Fibonacci sequence. Paul Bruckman and Peter Anderson conjectured a formula for $\zeta(m)$, the density of primes $p$ for…