相关论文: Greatest common divisors for polynomials in almost…

This paper addresses the topic of equidistribution and recurrence for polynomial sequences over function fields. The main focus is to note and correct two small errors in [V. Bergelson and A. Leibman, A Weyl-type equidistribution theorem in…

Ramanujan sums have attracted significant attention in both mathematical and engineering disciplines due to their diverse applications. In this paper, we introduce an algebraic generalization of Ramanujan sums, derived through polynomial…

Huayi Chen introduces the notion of an approximable graded algebra, which he uses to prove a Fujita-type theorem in the arithmetic setting, and asked if any such algebra is the graded ring of a big line bundle on a projective variety. This…

Motivated by a question in Schubert calculus, we study the interplay of quasisymmetric polynomials with the divided symmetrization operator, which was introduced by Postnikov in the context of volume polynomials of permutahedra. Divided…

We investigate semi-classical generalizations of the Charlier and Meixner polynomials, which are discrete orthogonal polynomials that satisfy three-term recurrence relations. It is shown that the coefficients in these recurrence relations…

We consider the primes which divide the denominator of the x-coordinate of a sequence of rational points on an elliptic curve. It is expected that for every sufficiently large value of the index, each term should be divisible by a primitive…

Counterparts of several classical results of number theory are proven for the ring of polynomials with coefficients in a number field. A theorem of Milnor that determines the Witt ring of a function field is applied to prove an analogue of…

Recently, Li obtained an asymptotic formula for a certain partial sum involving coefficients for the polynomial in the First Borwein conjecture. As a consequence, he showed the positivity of this sum. His result was based on a sieving…

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main…

Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…

We prove quasipolynomial bounds on the inverse theorem for the Gowers $U^{s+1}[N]$-norm. The proof is modeled after work of Green, Tao, and Ziegler and uses as a crucial input recent work of the first author regarding the equidistribution…

We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are…

We make progress on a conjecture of Cilleruelo on the growth of the least common multiple of consecutive values of an irreducible polynomial $f$ on the additional hypothesis that the polynomial be even. This strengthens earlier work of…

In this paper we prove the Gromov--Milman conjecture (the Dvoretzky type theorem) for homogeneous polynomials on $\mathbb R^n$, and improve bounds on the number $n(d,k)$ in the analogous conjecture for odd degrees $d$ (this case is known as…

We study properties of coefficients of a linear form, originating from a multiple integral. As a corollary, we prove Vasilyev's conjecture, connected with the problem of irrationality of the Riemann zeta function at odd integers.

In this paper, we consider certain finite sums related to the "largest odd divisor", and we obtain, using simple ideas and recurrence relations, sharp upper and lower bounds for these sums.

In this short note we have proved an enhanced version of a theorem of Lorentz [1] and its generalization to the multivariate case which gives a non- uniform estimate of degree of approximation by a polynomial with positive coefficients. The…

We investigate a fifty-year-old conjecture of Erd\H{o}s and Graham concerning whether the binomial coefficient ${n \choose k}$ with $1 \leq k \leq \frac{n}{2}$ must always have a divisor $\leq n$ that is ``close'' to $n$: that is, bigger…

We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," and investigate their properties. In calculating PRS, if there exists the GCD (greatest common divisor) of initial polynomials, we…

We introduce the weighted greatest common divisor of a tuple of integers and explore some of it basic properties. Furthermore, for a set of heights $\mathfrak w=(q_0, \ldots , q_n)$, we use the concept of the weighted greatest common…