中文
相关论文

相关论文: On polynomials of least deviation from zero in sev…

200 篇论文

We consider finite dimensional representations of the dihedral group $D_{2p}$ over an algebraically closed field of characteristic two where $p$ is an odd integer and study the degrees of generating and separating polynomials in the…

交换代数 · 数学 2016-08-14 Martin Kohls , Müfit Sezer

We show that the problem of finding the measure supported on a compact subset K of the complex plane such that the variance of the least squares predictor by polynomials of degree at most n at a point exterior to K is a minimum, is…

经典分析与常微分方程 · 数学 2022-10-04 L. Bos , N. Levenberg , J. Ortega-Cerda

A polynomial of degree $\ge 2$ with coefficients in the ring of $p$-adic numbers $\mathbb{Z}_p$ is studied as a dynamical system on $\mathbb{Z}_p$. It is proved that the dynamical behavior of such a system is totally described by its…

动力系统 · 数学 2010-11-01 Fan Ai-Hua , Lingmin Liao

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

交换代数 · 数学 2019-02-20 Joachim von zur Gathen

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

计算复杂性 · 计算机科学 2018-01-16 Alexander A. Sherstov

Littlewood asked how small the ratio $||f||_4/||f||_2$ (where $||.||_\alpha$ denotes the $L^\alpha$ norm on the unit circle) can be for polynomials $f$ having all coefficients in $\{1,-1\}$, as the degree tends to infinity. Since 1988, the…

数论 · 数学 2013-09-19 Jonathan Jedwab , Daniel J. Katz , Kai-Uwe Schmidt

For a measure on a subset of the complex plane we consider $L^p$-optimal weighted polynomials, namely, monic polynomials of degree $n$ with a varying weight of the form $w^n = {\rm e}^{-n V}$ which minimize the $L^p$-norms, $1 \leq p \leq…

经典分析与常微分方程 · 数学 2009-10-23 F. Balogh , M. Bertola

In this paper, we prove several theorems on systems of polynomials with at least one positive real zero based on the theory of conceive polynomials. These theorems provide sufficient conditions for systems of multivariate polynomials…

代数几何 · 数学 2021-04-06 Jie Wang

For functions $f$ in Dirichlet-type spaces we study how to determine constructively optimal polynomials $p_n$ that minimize $\|p f-1\|_\alpha$ among all polynomials $p$ of degree at most $n$. Then we give upper and lower bounds for the rate…

经典分析与常微分方程 · 数学 2015-07-03 Catherine Bénéteau , Alberto Condori , Constanze Liaw , Daniel Seco , Alan Sola

We study the probabilistic degree over reals of the OR function on $n$ variables. For an error parameter $\epsilon$ in (0,1/3), the $\epsilon$-error probabilistic degree of any Boolean function $f$ over reals is the smallest non-negative…

计算复杂性 · 计算机科学 2022-11-24 Siddharth Bhandari , Prahladh Harsha , Tulasimohan Molli , Srikanth Srinivasan

A Littlewood polynomial is a polynomial of the form \[ f_n(x)=\sum_{k=0}^n \varepsilon_k x^k \] with $\varepsilon_k\in\{-1, 1\}$. Let $(\varepsilon_k)_{k \ge 0}$ be i.i.d. Rademacher coefficients. We show that the lower envelope of…

概率论 · 数学 2026-05-12 Brayden Letwin , Mehtaab Sawhney

For given integers $n$ and $d$, both at least 2, we consider a homogeneous multivariate polynomial $f_d$ of degree $d$ in variables indexed by the edges of the complete graph on $n$ vertices and coefficients depending on cardinalities of…

组合数学 · 数学 2022-05-09 Sven Polak

We prove that for any norm |*| in the d-dimensional real vector space V and for any odd n>0 there is a non-negative polynomial p(x), x in V of degree 2n such that p^{1/2n}(x) < |x| < c(n,d) p^{1/2n}(x), where c(n,d)={n+d-1 choose n}^{1/2n}.…

泛函分析 · 数学 2007-05-23 Alexander Barvinok

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

交换代数 · 数学 2019-08-08 John Abbott , Anna Maria Bigatti , Elisa Palezzato , Lorenzo Robbiano

Let $\{Z_t, t\geq 0\}$ be a strictly stable process on $\R$ with index $\alpha\in (0,2]$. We prove that for every $p > \alpha$, there exists $\gamma = \gamma (\alpha, p)$ and $\k = \k (\alpha, p)\in (0, +\infty)$ such that…

概率论 · 数学 2007-05-23 T. Simon

Let $E_n(f)_\mu$ be the error of best approximation by polynomials of degree at most $n$ in the space $L^2(\varpi_\mu, \mathbb{B}^d)$, where $\mathbb{B}^d$ is the unit ball in $\mathbb{R}^d$ and $\varpi_\mu(x) = (1-\|x\|^2)^\mu$ for $\mu >…

经典分析与常微分方程 · 数学 2017-05-03 Miguel Pinar , Yuan Xu

For a polynomial $f(x)\in\mathbb Z[x]$ without non-trivial linear relations among roots, we propose a conjecture on the distribution of the least root $r_p$ ($r_p\in\mathbb Z,\,0\le r_p<p)$ of $f(x)\equiv0\bmod p$ where $p$ runs over the…

数论 · 数学 2017-06-13 Yoshiyuki Kitaoka

For an odd prime $p$, we say $f(X) \in {\mathbb F}_p[X]$ computes square roots in $\mathbb F_p$ if, for all nonzero perfect squares $a \in \mathbb F_p$, we have $f(a)^2 = a$. When $p \equiv 3 \mod 4$, it is well known that $f(X) =…

数论 · 数学 2024-01-24 Kiran Kedlaya , Swastik Kopparty

Given a lower envelope in the form of an arbitrary sequence $u$, let $LSP(u, d)$ denote the maximum length of any subsequence of $u$ that can be realized as the lower envelope of a set of polynomials of degree at most $d$. Let $sp(m, d)$…

组合数学 · 数学 2016-06-07 Jesse Geneson

Polynomials whose zeros are symmetric either to the real line or to the unit circle are very important in mathematics and physics. We can classify them into three main classes: the self-conjugate polynomials, whose zeros are symmetric to…

复变函数 · 数学 2019-04-04 R. S. Vieira