中文
相关论文

相关论文: New extensions to the sumsets with polynomial rest…

200 篇论文

In this paper we extend the notion of Melham sum to the Pell and Pell-Lucas sequences. While the proofs of general statements rely on the binomial theorem, we prove some spacial cases by the known Pell identities. We also give extensions of…

组合数学 · 数学 2015-08-21 Ivica Martinjak , Iva Vrsaljko

We extend some methods of bounding exponential sums of the type $\displaystyle\sum_{n\le N}e^{2\pi iag^n/p}$ to deal with the case when $g$ is not necessarily a primitive root. We also show some recent results of Shkredov concerning…

数论 · 数学 2013-02-19 Bryce Kerr

This paper is a study of power series, where the coefficients are binomial expressions (iterated finite differences). Our results can be used for series summation, for series transformation, or for asymptotic expansions involving Stirling…

数论 · 数学 2016-10-10 Khristo N. Boyadzhiev

A short note on bounds on distance to variety of a point in terms of the Taylor coefficients at the point.

复变函数 · 数学 2017-01-31 Vikram Sharma

We prove several bounds on the number of incidences between two sets of multivariate polynomials of bounded degree over finite fields. From these results, we deduce bounds on incidences between points and multivariate polynomials, extending…

组合数学 · 数学 2025-09-23 Chong Shangguan , Yulin Yang , Tao Zhang

We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…

泛函分析 · 数学 2020-01-28 Pintu Bhunia , Santanu Bag , Raj Kumar Nayak , Kallol Paul

Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when applied to (non-)commutative polynomials. The running time of the algorithm is dependent on the size of the coefficients of the remainders.…

符号计算 · 计算机科学 2015-11-05 Maximilian Jaroschek

We study distribution of zeros of a complex polynomial whose coefficients has been modified. We give a new proof of the theorem of Rubinstein, and with similar method we prove a new theorem that is not generalization of the previous…

复变函数 · 数学 2020-03-10 Radosh Bakich

We give new identities for some symmetric polynomials. As applications of these identities, we obtain some formulas for a higher order analogue of Fibonacci and Lucas numbers.

经典分析与常微分方程 · 数学 2020-09-01 Genki Shibukawa

In this short note, we closely follow the approach of Green and Tao to extend the best known bound for recurrence modulo 1 from squares to the largest possible class of polynomials. The paper concludes with a brief discussion of a…

数论 · 数学 2014-04-22 Neil Lyall , Alex Rice

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

数论 · 数学 2015-10-30 Jakob Ablinger

The new method for obtaining a variety of extensions of Hermite polynomials is given. As a first example a family of orthogonal polynomial systems which includes the generalized Hermite polynomials is considered. Apparently, either these…

量子代数 · 数学 2007-05-23 Vadim V. Borzov

We study the distribution of the extended binomial coefficients by deriving a complete asymptotic expansion with uniform error terms. We obtain the expansion from a local central limit theorem and we state all coefficients explicitly as…

组合数学 · 数学 2014-07-29 Thorsten Neuschel

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

组合数学 · 数学 2022-03-01 Tristram Bogart , Juan Andrés Valero

We prove character sum estimates for additive Bohr subsets modulo a prime. These estimates are analogous to classical character sum bounds of Polya-Vinogradov and Burgess. These estimates are applied to obtain results on recurrence mod $p$…

数论 · 数学 2019-08-15 Brandon Hanson

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

数论 · 数学 2013-08-23 Omran Ahmadi , Igor E. Shparlinski

In this paper we give new identities involving q-Euler polynomials of higher order.

数论 · 数学 2015-05-14 Taekyun Kim , Y. H. Kim

We introduce a new type of means. It is new in two ways: its domain consists of sets and its values are sets too. We investigate the properties and behavior of such generalization. We also present many naturally arisen examples for such…

经典分析与常微分方程 · 数学 2018-08-22 Attila Losonczi

We continue the study of how one can define means of infinite sets. We introduce many new properties, investigate their relations to each other and how they can typify a mean. We collect the properties in property groups e.g. for…

经典分析与常微分方程 · 数学 2018-09-27 Attila Losonczi

We obtain a new bound in the uniform version of the Glasner property for matrices with polynomial entries, improving that of K. Bulinski and A. Fish (2021). This improvement is based on a more careful examination of complete rational…

数论 · 数学 2021-11-11 Igor E. Shparlinski