中文
相关论文

相关论文: The Large Sieve Inequality for Integer Polynomial …

200 篇论文

The height of a polynomial with integer coefficients is the largest coefficient in absolute value. Many papers have been written on the subject of bounding heights of cyclotomic polynomials. One result, due to H. Maier, gives a best…

数论 · 数学 2011-11-24 Lola Thompson

We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…

复变函数 · 数学 2024-03-22 Marko Slapar

In this paper we prove that the Haagerup inequality for non-homogeneous polynomials in free semicircular variables of degree $n$ is optimal with a constant of order $n^{3/2}$. We also show an operator valued Haagerup inequality which…

算子代数 · 数学 2025-10-21 Félix Parraud

In this article, we continue our recent investigations on bilinear sums and additive energies with modular square roots. Here we improve our recent results for the case when the ranges of variables are large. We use these results to make…

数论 · 数学 2026-03-24 Stephan Baier

We compute the spectra of the adjacency matrices of the semi-regular polytopes. A few different techniques are employed: the most sophisticated, which relates the 1-skeleton of the polytope to a Cayley graph, is based on methods akin to…

组合数学 · 数学 2007-05-23 Nicolau C. Saldanha , Carlos Tomei

We study here a sequence of secondary measures, so called because the set of secondary polynomials on a given term become orthogonal for the next measure. The main result is a formula making explicit the density of any term of the sequence,…

经典分析与常微分方程 · 数学 2011-04-26 Roland Groux

We develop a version of Ekedahl's geometric sieve for integral quadratic forms of rank at least five. As one ranges over the zeros of such quadratic forms, we use the sieve to compute the density of coprime values of polynomials, and…

数论 · 数学 2020-03-24 Tim Browning , Roger Heath-Brown

Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers.…

符号计算 · 计算机科学 2024-01-01 Joris van der Hoeven , Grégoire Lecerf

Systems of orthogonal polynomials whose recurrence coefficients tend to infinity are considered. A summability condition is imposed on the coefficients and the consequences for the measure of orthogonality are discussed. Also discussed are…

经典分析与常微分方程 · 数学 2014-08-28 A. I. Aptekarev , J. S. Geronimo

In this article, we establish a Liouville-type inequality for polynomials evaluated at the values of arbitrary Siegel E-functions at non-zero algebraic points. Additionally, we provide a comparable result within the framework of Mahler M…

数论 · 数学 2025-02-17 Colin Faverjon , Boris Adamczewski

A survey of results for Mahler measure of algebraic numbers, and one-variable polynomials with integer coefficients is presented. Related results on the maximum modulus of the conjugates (`house') of an algebraic integer are also discussed.…

数论 · 数学 2009-07-02 Chris Smyth

We prove some sufficient conditions implying $l^p$ inequalities of the form $||x||_p \leq ||y||_p$ for vectors $ x, y \in [0,\infty)^n$ and for $p$ in certain positive real intervals. Our sufficient conditions are strictly weaker than the…

经典分析与常微分方程 · 数学 2011-01-11 Ivo Klemes

We discuss the inequalities for $q$-integrals because of the fact that the inequalities can be very useful in the future mathematical research. Since $q$-integral of a function over an interval $[a,b]$ is defined by the difference of two…

经典分析与常微分方程 · 数学 2007-05-23 Predrag M. Rajkovic , Sladjana D. Marinkovic , Miomir S. Stankovic

Let $f\in\mathbb{Z}[X]$ be quadratic or cubic polynomial. We prove that there exists an integer $G_f\geq 2$ such that for every integer $k\geq G_f$ one can find infinitely many integers $n\geq 0$ with the property that none of…

数论 · 数学 2017-08-24 Carlo Sanna , Márton Szikszai

The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…

动力系统 · 数学 2016-03-04 Laura Menini , Corrado Possieri , Antonio Tornambè

The p-adic valuation of a polynomial can be given by its valuation tree. This work describes the 2-adic valuation tree of the general degree 2 polynomial in 2 variables.

数论 · 数学 2024-12-24 Shubham

We prove a large sieve inequality for square norm moduli in Z[i].

数论 · 数学 2016-06-08 Stephan Baier

In this paper, we gave some properties of binomial coefficient.

组合数学 · 数学 2017-01-24 Daniel Yaqubi , Madjid Mirzavaziri

The classical Remez inequality bounds the maximum of the absolute value of a polynomial $P(x)$ of degree $d$ on $[-1,1]$ through the maximum of its absolute value on any subset $Z$ of positive measure in $[-1,1]$. Similarly, in several…

经典分析与常微分方程 · 数学 2009-11-11 Y. Yomdin

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

数论 · 数学 2022-10-04 Artūras Dubickas , Min Sha
‹ 上一页 1 8 9 10 下一页 ›