相关论文: On $k$-free numbers over Beatty sequences

This note presents new results for the squarefree value sets of quartic polynomials over the integers.

In previous papers the authors established the prime avoidance property of $k$-th powers of prime numbers and of prime numbers within Beatty sequences. In this paper the authors consider $k$-th powers of Piatetski-Shapiro primes.

In this paper, we study the gaps between primes in Beatty sequences following the methods in the recent breakthrough of J. Maynard.

We survey recent results on bounds for Betti numbers of modules over polynomial rings, with an emphasis on lower bounds. Along the way, we give a gentle introduction to free resolutions and Betti numbers, and discuss some of the reasons why…

We study sums with multiplicative functions that take values over a non-homogenous Beatty sequence. We then apply our result in a few special cases to obtain asymptotic formulas such as the number of integers in a Beatty sequence…

We prove an upper bound for the least prime in an irrational Beatty sequence. This result may be compared with Linnik's theorem on the least prime in an arithmetic progression.

In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.

In this paper, we give a new upper bound of Barban-Davenport-Halberstam type for twins of $k-$free numbers in arithmetic progressions.

This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…

Fix irrational numbers $\alpha,\hat\alpha>1$ of finite type and real numbers $\beta,\hat\beta\ge 0$, and let $B$ and $\hat B$ be the Beatty sequences $$ B:=(\lfloor\alpha m+\beta\rfloor)_{m\ge 1}\quad\text{and}\quad\hat…

In this paper, we investigate the distribution of $k$-free numbers in a class of $\alpha$-random walks on the integer lattice $\mathbb{Z}$. In these walks, the walker starts from a non-negative integer $r$ and moves to the right by $a$…

We classify the possible shapes of minimal free resolutions over a regular local ring. This illustrates the existence of free resolutions whose Betti numbers behave in surprisingly pathological ways. We also give an asymptotic…

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new estimation for the upper bound of B_k sequences.

The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.

We consider the following counting problem related to the card game SET: How many $k$-element SET-free sets are there in an $n$-dimensional SET deck? Through a series of algebraic reformulations and reinterpretations, we show the answer to…

An asymptotic formula is given for the number of y-smooth numbers up to x in a Beatty sequence corresponding to an irrational number of finite type.

An improved upper bound is obtained for the density of sequences of positive integers that contain no k-term geometric progression.

Let $f(x)\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\ge 1$. Let $k\ge2$ be an integer. The number of integers $n$ such that $f(n)$ is $k$-free is widely studied in the literature. In principle, one expects that $f(n)$ is…

A survey of recent results in elementary number theory is presented in this paper. Special attention is given to structure and asymptotic properties of certain families of positive integers.

We study the problem of representing integers as sums of prime numbers from a fixed Beatty sequence $B_{\alpha,\beta}$, where $\alpha>1$ is irrational and of finite type.