Joseph E. Borzellino, Morgan Sherman
As an application of Bézout's theorem from algebraic geometry, we show that the standard notion of a trigonometric polynomial does not agree with a more naive, but reasonable notion of trigonometric polynomial.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In this paper, we extend the large sieve type estimates to sums involving pth powers of trigonometric polynomials. An approach to such estimates that does not rely on the usual L^2-technique is given. Our method is based on comparing the norm and the spectral radius of convolution operators on a normed space of trigonometric polynomials.
An example of trigonometric polynomials with extremely small uniform norm is given. This example demonstrates the potential limits for extension of Sidon's inequality for lacunary polynomials in a certain direction.
In this article the solution of the special problem of the conditional extremum for the conjugate trigonometric polynomials is given. A possibility to apply this result to the problems of optimal stabilization of quasidynamic chaos in discrete systems is mentioned.
Sharp Estimates for Conjugate Functions with Applications to Trigonometric Polynomials
本文通过半带状区域内的调和上界，对共轭函数进行精确估计，并应用于去除Papadopoulos关于三角多项式极小值定理中的对数损失，获得相应不等式的最优阶。
In an earlier article [3], we presented an algorithm that can be used to rigorously check whether a specific cosine or sine polynomial is nonnegative in a given interval or not. The algorithm proves to be an indispensable tool in establishing some recent results on nonnegative trigonometric polynomials. See, for example, [2], [4] and [5]. It continues to play an essential role in several ongoing projects. The algorithm, however, cannot handle general trigonometric polynomials that involve both cosine and sine terms. Some ad hoc methods to deal with such polynomials have been suggested in [3], …
The trigonometric moment problem arises from the study of one-parameter families of centers in polynomial vector fields. It asks for the classification of the trigonometric polynomials $Q$ which are orthogonal to all powers of a trigonometric polynomial $P$. We show that this problem has a simple and natural solution under certain conditions on the monodromy group of the Laurent polynomial associated to $P$. In the case of real trigonometric polynomials, which is the primary motivation of the problem, our conditions are shown to hold for all trigonometric polynomials of degree 15 or less. In t…
We study the problem of reconstructing a multivariate trigonometric polynomial having only few non-zero coefficients from few random samples. Inspired by recent work of Candes, Romberg and Tao we propose to recover the polynomial by Basis Pursuit, i.e., by $\ell^1$-minimization. Numerical experiments show that in many cases the trigonometric polynomial can be recovered exactly provided the number $N$ of samples is high enough compared to the ``sparsity'' -- the number of non-vanishing coefficients. However, $N$ can be chosen small compared to the assumed maximal degree of the trigonometric pol…
We show that for every finite symetric set S of integer vectors, every real trigonometric polynomial on the d dimensional torus with spectrum in S has a zero in every closed ball of diameter D, where D is the sum over S of 1 over 4 times the L2 norm of the vector. We investigate tightness in some special cases.
Using the multilinear theory of oscillatory integral operators, we establish a square function inequality with implications to moment inequalities for discrete exponential sums which frequencies lie on curved hyper-surfaces. In particular a new distributional estimate for toral eigenfunctions is established.
We give a solution of the problem on trigonometric polynomials $f_n$ with the given leading harmonic $y\cos nt$ that deviate the least from zero in measure, more precisely, with respect to the functional $μ(f_n)=mes\{t\in[0,2π]: |f_n(t)|\ge 1\}$. For trigonometric polynomials with a fixed leading harmonic, we consider the least uniform deviation from zero on a compact set and find the minimal value of the deviation over compact subsets of the torus that have a given measure. We give a solution of a similar problem on the unit circle for algebraic polynomials with zeros on the circle.
Rational solutions and limit cycles of polynomial and trigonometric Abel equations
本文研究多项式与三角Abel方程的有理解和极限环问题，探讨了多项式和三角多项式条件下解的数量界。
Sharp sign uncertainty for trigonometric polynomials
研究单位圆上关于对称Borel测度的三角多项式的符号不确定性，确定了具有非正μ积分的三角多项式最后符号变化的最小半径，并推广到高维球面上的极测度及[0,1]上的多项式模拟。
We obtain optimal trigonometric polynomials of a given degree $N$ that majorize, minorize and approximate in $L^1(\mathbb{R}/\mathbb{Z})$ the Bernoulli periodic functions. These are the periodic analogues of two works of F. Littmann that generalize a paper of J. Vaaler. As applications we provide the corresponding Erdös-Turán-type inequalities, approximations to other periodic functions and bounds for certain Hermitian forms.
Extraction of harmonics of a given order from real trigonometric polynomials (signals) is one of the main problems in harmonic analysis. It has many applications in physics, radio and electrical engineering, in particular, in filtration of harmonic signals of different nature. There exist many methods (mainly, approximative) for solution of this problem. The most common ones are spectral methods based on Fourier transform and other resonance principles. In this paper we propose a new method for extracting harmonics by amplitude and phase transformation of trigonometric polynomials. These trans…
In this article we consider a method of proving a class of inequalities of the form (1). The method is based on the precise approximations of the sine and cosine functions by Maclaurin polynomials of given order. By using this method we present new proofs of some inequalities from the articles C.-P. Chen, W.-S. Cheung [J. Inequal. Appl. 2012:72 (2012)] and Z.-J. Sun, L. Zhu [ISRN Math. Anal. (2011)].
We obtain the estimates for the best approximation in the uniform metric of the classes of $2π$-periodic functions whose $(ψ,β)$-derivatives have a given majorant $ω$ of the modulus of continuity. It is shown that the estimates obtained here are asymptotically exact under some natural conditions on the parameters $ψ,$ $ω$ and $β$ defining the classes
Localization of trigonometric polynomials and the Lev-Tselishchev lemma
本文证明Lev-Tselishchev引理在$p$小于黄金比例相关阈值时不成立，从而否定了该引理对较小$p$的推广。
The paper is related to the following question of P.~L.~Ul'yanov: is it true that for any $2π$-periodic continuous function $f$ there is a uniformly convergent rearrangement of its trigonometric Fourier series? In particular, we give an affirmative answer if the absolute values of Fourier coefficients of $f$ decrease. Also, we study a problem how to choose $m$ terms of a trigonometric polynomial of degree $n$ to make the uniform norm of their sum as small as possible.
In this paper we study the asymptotic analysis of the orthogonal trigonometric polynomials by the Riemann-Hilbert problem for the periodic analytic functions.
Average Nikolskii factors for random trigonometric polynomials
该研究针对系数为独立正态分布的随机三角多项式，推导其平均Nikolskii因子的精确阶，发现其阶远低于最坏情况界，并将结论推广到多元情形。
Trigonometric polynomials with frequencies in the set of cubes
该研究针对频率取自立方数集合的三角多项式，证明了其4范数与2范数的一个带绝对隐含常数的不等式，并证明特定区间内的立方数集合是Sidon集。
We obtain the asymptotic equalities for the least upper bounds of approximations by interpolation trigonometric polynomials with the equidistant nodes $x_k^{(n-1)}=\frac{2kπ}{2n-1},\ k\in\mathbb{Z},$ in metrics of the spaces $L_p$ on classes of $2π$-periodic functions, representable as convolutions of functions $φ, \ φ\perp1,$ which belongs to the unit ball of the space $L_1$, and fixed generating kernels in the case where modules of their Fourier coefficients $ψ(k)$ satisfy the condition $\lim\limits_{k\rightarrow\infty} ψ(k+1)/ψ(k)=0.$ We obtain similar estimates on the classes of $r$-differ…
This note is a continuation of our papers [1,2], devoted to $L$-approximation of characteristic function of $(-h, h)$ by trigonometric polynomials. In the paper [1] the sharp values of the best approximation for the special values of $h$ were found. In [2] we gave the complete solution of the problem for arbitrary values of $h$. In general case [2] the situation is more deep and results are not so simple as in [1]. For applications to the problem of optimal constants in the Jackson-type inequalities we need, however, results on $L$-approximation of $B$-splines and linear combinations of $B$-sp…
Approximation of generalized Poisson integrals by interpolation trigonometric polynomials
该研究针对可表示为$L_p$空间函数广义泊松积分的$2π$周期函数，建立了渐近最优的插值勒贝格型不等式，并得到对应函数类上插值三角多项式点态逼近精确上界的渐近等式。
We prove that $$\max_{t \in [-π,π]}{|Q(t)|} \leq T_{2n}(\sec(s/4)) = \frac 12 ((\sec(s/4) + \tan(s/4))^{2n} + (\sec(s/4) - \tan(s/4))^{2n})$$ for every even trigonometric polynomial $Q$ of degree at most $n$ with complex coefficients satisfying $$m(\{t \in [-π,π]: |Q(t)| \leq 1\}) \geq 2π-s\,, \qquad s \in (0,2π)\,,$$ where $m(A)$ denotes the Lebesgue measure of a measurable set $A \subset {\Bbb R}$ and $T_{2n}$ is the Chebysev polynomial of degree $2n$ on $[-1,1]$ defined by $T_{2n}(\cos t) = \cos(2nt)$ for $t \in {\Bbb R}$. This inequality is sharp. We also prove that $$\max_{t \in [-π,π]}{|…
We prove that for all p>1/2 there exists a constant $γ_p>0$ such that, for any symmetric measurable set of positive measure $E\subset \TT$ and for any $γ<γ_p$, there is an idempotent trigonometrical polynomial f satisfying $\int_E |f|^p > γ\int_{\TT} |f|^p$. This disproves a conjecture of Anderson, Ash, Jones, Rider and Saffari, who proved the existence of $γ_p>0$ for p>1 and conjectured that it does not exists for p=1. Furthermore, we prove that one can take $γ_p=1$ when p>1 is not an even integer, and that polynomials f can be chosen with arbitrarily large gaps when $p\neq 2$. This shows str…
We give new lower asymptotical estimate of constant \[ C_n=\sup\biggl\{\frac{\|t_n\|_{C(\mathbb T)}}{\|t_n\|_{L(\mathbb T)}}:t_n\text{are real trigonometric polynomials}, \operatorname{deg}t_n<n\biggr\} \] as $n\to\infty$. This estimate improves known bound of L.V.Taykov (1965).
In this paper, we give a characterization of Nikol'ski\uı-Besov type classes of functions, given by integral representations of moduli of smoothness, in terms of series over the moduli of smoothness. Also, necessary and sufficient conditions in terms of monotone or lacunary Fourier coefficients for a function to belong to a such a class are given. In order to prove our results, we make use of certain recent reverse Copson- and Leindler-type inequalities.
The best approximation by trigonometric polynomials of classes of convolutions generated by some linear combinations of periodic kernels
本文研究由周期核线性组合生成的卷积类的三角多项式最佳逼近问题，证明了泊松核非平凡线性组合最终满足 Nagy 条件，并构造出满足 Nikolsky 条件但不满足 Nagy 条件的伯努利核与共轭泊松核线性组合。
Consistent rational approximations of power series, trigonometric series and series of Chebyshev polynomials
本文研究三角级数与切比雪夫多项式级数的一致有理逼近，建立三角 Hermite-Padé 多项式的存在唯一性准则并给出显式形式，同时构造例子说明 Hermite-Jacobi 逼近与 Hermite-Padé 逼近可以不同。
Ramanujan's trigonometric sum $c_q(n)$ can be interpreted as a set of trigonometric moments of a finite measure concentrated at primitive $q$-th roots of unity with equal masses. This gives rise to sets of corresponding polynomials orthogonal on the unit circle. We present explicit expressions of these polynomials for special values of $q$, e.g. when $q=p$ or $q=2p$ or $q=p^k$, where $p$ is a prime number. We generalize this procedure taking the Kronecker polynomial instead of cyclotomic one. In this case the moments are expressed as finite sums of $c_q(n)$ with different $q$.
On the weighted trigonometric Bojanov-Chebyshev extremal problem
本文研究了三角多项式的加权 Bojanov-Chebyshev 极值问题，通过 Fenton 平移求和法求解，并将结果推广至广义三角多项式。
Four Jacobi settings are considered in the context of Hardy's inequality: the trigonometric polynomials and functions, and the corresponding symmetrized systems. In the polynomial cases sharp Hardy's inequality is proved for the type parameters $α,β\in(-1,\infty)^d$, whereas in the function systems for $α,β\in[-1/2,\infty)^d$. The ranges of these parameters are the widest in which the corresponding orthonormal bases are composed of bounded functions. Moreover, the sharp $L^1$-analogues of Hardy's inequality are obtained with the same restrictions on the parameters $α$ and $β$.
Lower bounds on the measure of the support of positive and negative parts of trigonometric polynomials
本文证明三角多项式正负部分支撑测度的最小值有下界，该下界由频率集合的组合特征决定，并可推广至多类函数。
In this paper we construct an injection from the linear space of trigonometric polynomials defined on $\mathbb{T}^d$ with bounded degrees with respect to each variable to a suitable linear subspace $L^1_E\subset L^1(\mathbb{T})$. We give such a quantitative condition on $L^1_E$ that this injection is a isomorphism of a Banach spaces equipped with $L^1$ norm and the norm of the isomorphism is independent on the dimension $d$.
In this work, some theorems are established for orthogonal trigonometric polynomials (OTP) including Favard, Baxter, Geronimus, Rakhmanov, Szegö and the strong Szegö theorems which are important in the theory of orthogonal polynomials on the unit circle (OPUC). All these results are based on the mutual representation theorem of OPUC and OTP which deduced by a Riemann-Hilbert problem simultaneously characterizing them. In addition, Szegö recursions, four-term recurrences and some new identities for OPUC and OTP are also obtained by using their Riemann-Hilbert characterizations respectively.
In this work, a Vietoris type theorem for the positivity of sine and cosine sum for a particular sequence of real numbers is provided. In this connection, the positivity of a particular type of sine sum involving ratio of some parameters is given, which is new in the literature. Various new results that follow from the Vietoris type theorem include improved estimates for the location of the zeros of a class of trigonometric polynomials and new positive sums for orthogonal polynomials. An open problem is also provided for the partial sums of the generalized polylogarithm.
We say that a function $f\in C[a,b]$ is $q$-monotone, $q\ge3$, if $f\in C^{q-2}(a,b)$ and $f^{(q-2)}$ is convex in $(a,b)$. Let $f$ be continuous and $2π$-periodic, and change its $q$-monotonicity finitely many times in $[-π,π]$. We are interested in estimating the degree of approximation of $f$ by trigonometric polynomials which are co-$q$-monotone with it, namely, trigonometric polynomials that change their $q$-monotonicity exactly at the points where $f$ does. Such Jackson type estimates are valid for piecewise monotone ($q=1$) and piecewise convex (q=2) approximations. However, we prove, t…
The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities by reducing to polynomial inequalities. Finally, we show the great applicability of this algorithm and as examples, we use it to analyze some new rational (Pade) approximations of the function $\cos^2(x)$, and to improve a class of inequalities by Z.-H. Yang. The results of our analysis could be implemented by means of an automated proof assistant, so our work is a contribution to the library of automatic support tools for proving various analytic inequalities.
Here we introduce a way to construct generalized trigonometric functions associated with any complex polynomials, and the well known trigonometric functions can be seen to associate with polynomial $x^2-1$. We will show that those generalized trigonometric functions have algebraic identities which generalizes the well known $\sin^2(x)+\cos^2(x)=1$. One application of the generalized trigonometric functions is evaluating infinite series of rational functions.
We give several descriptions of positive quadrature formulas which are exact for trigonometric -, respectively, Laurent polynomials of degree less or equal $n-1-m$, $0\leq m\leq n-1$. A complete and simple description is obtained with the help of orthogonal polynomials on the unit circle. In particular it is shown that the nodes polynomial can be generated by a simple recurrence relation. As a byproduct interlacing properties of zeros of para-orthogonal polynomials are obtained. Finally, asymptotics for the quadrature weights are presented.
From Ingham to Nazarov's inequality: a survey on some trigonometric inequalities
本文综述了调和与非调和三角多项式在 L^1 和 L^2 范数下的若干不等式，重点介绍 Ingham 不等式、Littlewood 猜想的证明及 Nazarov 的非调和对应结果，并补充了小区间上的定量估计与更强条件下的下界。
For the Hahn and Krawtchouk polynomials orthogonal on the set $\{0, \ldots,N\}$ new identities for the sum of squares are derived which generalize the trigonometric identity for the Chebyshev polynomials of the first and second kind. These results are applied in order to obtain conditions (on the degree of the polynomials) such that the polynomials are bounded (on the interval $[0,N]$) by their values at the points $0$ and $N$. As special cases we obtain a discrete analogue of the trigonometric identity and bounds for the discrete Chebyshev polynomials of the first and second kind.
Poisson Kernels and Hilbert Transforms for Trigonometric Heckman-Opdam Polynomials of type $A_1$
本文研究了类型$A_1$的三角Heckman-Opdam多项式，推导了Poisson核的显式表达式，并发展了与这些多项式相关的分数积分理论，同时定义了广义Hilbert变换并证明其在$L^p$空间上的有界性。
Consider real or complex polynomial Riccati differential equations $a(x) \dot y=b_0(x)+b_1(x)y+b_2(x)y^2$ with all the involved functions being polynomials of degree at most $η$. We prove that the maximum number of polynomial solutions is $η+1$ (resp. 2) when $η\ge 1$ (resp. $η=0$) and that these bounds are sharp. For real trigonometric polynomial Riccati differential equations with all the functions being trigonometric polynomials of degree at most $η\ge 1$ we prove a similar result. In this case, the maximum number of trigonometric polynomial solutions is $2η$ (resp. $3$) when $η\ge 2$ (resp…
The generalized complex numbers can be realized in terms of $2\times2$ or higher-order matrices and can be exploited to get different ways of looking at the trigonometric functions. Since Chebyshev polynomials are linked to the power of matrices and to trigonometric functions, we take the quite natural step to discuss them in the context of the theory of generalized complex numbers. We also briefly discuss the two-variable Chebyshev polynomials and their link with the third-order Hermite polynomials.
Estimates of approximations by interpolation trigonometric polynomials on the classes of convolutions of high smoothness
该研究在高光滑周期卷积函数类上建立插值Lebesgue型不等式，用卷积核函数的最佳逼近估计插值三角多项式偏差，证明核序列快速衰减时不等式渐近精确并得到逐点逼近精确上界的渐近等式。
In this paper, we explain a procedure based on a classical result of Sturm that can be used to determine rigorously whether a given trigonometric polynomial is nonnegative in a certain interval or not. Many examples are given. This technique has been employed by the author in several recent works. The procedure often involves tedious computations that are time-consuming and error-prone. Fortunately, symbolic computation software is available to automate the procedure. In this paper, we give the details of its implementation in MAPLE 13. Some who are strongly attached to a more traditional theo…
We prove, informally put, that it is not a coincidence that $\cos{(n θ)} + 1 \geq 0$ and that the roots of $z^n + 1 =0$ are uniformly distributed in angle -- a version of the statement holds for all trigonometric polynomials with `few' real roots. The Erdős-Turán theorem states that if $p(z) =\sum_{k=0}^{n}{a_k z^k}$ is suitably normalized and not too large for $|z|=1$, then its roots are clustered around $|z| = 1$ and equidistribute in angle at scale $\sim n^{-1/2}$. We establish a connection between the rate of equidistribution of roots in angle and the number of sign changes of the correspo…
In the paper we obtain sufficient conditions for a trigonometric polynomial to be a refinement mask corresponding to a tight wavelet frame. The condition is formulated in terms of the roots of a mask. In particular, it is proved that any trigonometric polynomial can serve as a mask if its associated algebraic polynomial has only negative roots (at least one of them, of course, equals $-1$).
Norm bounds on Fourier series with polynomial spectra and constrained coefficients
本文针对谱为多项式的三角多项式，通过系数约束建立了L⁴范数上界，补充了前人成果并解决了特定猜想，确定了对应范数增长的精确阶。
Let $2s$ points $y_i=-π\le y_{2s}<\ldots<y_1<π$ be given. Using these points, we define the points $y_i$ for all integer indices $i$ by the equality $y_i=y_{i+2s}+2π$. We shall write $f\in\bigtriangleup^{(1)}(Y)$ if $f$ is a $2π$-periodic function and $f$ does not decrease on $[y_i, y_{i-1}]$ if $i$ is odd; and $f$ does not increase on $[y_i, y_{i-1}]$ if $i$ is even. We denote $E_n^{(1)}(f;Y)$ the value of the best uniform comonotone approximation. In this article the following counterexample of comonotone approximation is proved. Example. For each $k\in\Bbb N$, $k>3$, and $n\in\Bbb N$ there …
We study the asymptotic distribution of the number $Z_{N}$ of zeros of random trigonometric polynomials of degree $N$ as $N\to\infty$. It is known that as $N$ grows to infinity, the expected number of the zeros is asymptotic to $\frac{2}{\sqrt{3}}\cdot N$. The asymptotic form of the variance was predicted by Bogomolny, Bohigas and Leboeuf to be $cN$ for some $c>0$. We prove that $\frac{Z_{N}-\E Z_{N}}{\sqrt{cN}}$ converges to the standard Gaussian. In addition, we find that the analogous result is applicable for the number of zeros in short intervals.
Random Sampling of Sparse Trigonometric Polynomials II - Orthogonal Matching Pursuit versus Basis Pursuit
研究通过基追踪和贪婪算法（如正交匹配追踪和阈值法）从少量随机采样中重建稀疏多元三角多项式的问题，理论分析阈值法和OMP的重建成功概率，数值实验表明基追踪速度明显慢于贪婪算法但重建率相似。
It is well known that the expected number of real zeros of a random cosine polynomial $ V_n(x) = \sum_ {j=0} ^{n} a_j \cos (j x) , \ x \in (0,2π) $, with the $ a_j $ being standard Gaussian i.i.d. random variables is asymptotically $ 2n / \sqrt{3} $. On the other hand, some of the previous works on the random cosine polynomials with dependent coefficients show that such polynomials have at least $ 2n / \sqrt{3} $ expected real zeros lying in one period. In this paper we investigate two classes of random cosine polynomials with pairwise equal blocks of coefficients. First, we prove that a rando…
Let $\mathbb R_t[θ]$ be the ring generated over $\mathbb R$ by $\cosθ$ and $\sinθ$, and $\mathbb R_t(θ)$ be its quotient field. In this paper we study the ways in which an element p of $\mathbb R_t[θ]$ can be decomposed into a composition of functions of the form $p=R(q),$ where $\mathbb R\in \mathbb R(x)$ and $q\in \mathbb R_t(θ)$. In particular, we describe all possible solutions of the functional equation $R_1(q_1)=R_2(q_2)$, where $R_1, R_2 \in \mathbb R[x]$ and $q_1,q_2\in \mathbb R_t[θ].$
Trigonometric polynomials with frequencies in the set of squares
本文研究频率限制在平方数集合中的三角多项式，证明了当频率范围长度为 N^{γ0-ε} 时其 L4 范数可由 L2 范数控制，推进了 Cilleruelo-Cordoba 猜想，并揭示了该猜想与 Ruzsa 因数分布猜想之间的联系。
On Gegenbauer polynomials and Wronskian determinants of trigonometric functions
本文推广Larsen关于正弦函数Wronskian行列式的结果，证明其可用Gegenbauer正交多项式表示，并给出基于递推关系和Darboux-Crum变换的两种证明。
A complex polynomial $P(z) = c_0 + c_1 z +...+ c_n z^n$ is called unimodular if $|c_j| = 1$, $j = 0,...,n$. Littlewood asked the question (1966) on how close a unimodular polynomial come to satisfying $|P(z)| \approx \sqrt{n+1}$ if $n \ge 1$? In this paper we show that for a given $0 < a < b$ and $\eps > 0$ there exist trigonometric sums $\cP(t) = n^{-1/2} \sum_{j=0}^{n-1} \exp(2πi tω(j))$ with a real frequency function $ω(j)$ which are $\eps$-flat on segment $[a,b]$ acording to the norm in $L^1([a,b])$ (as well as in $L^2([a,b])$). We apply this method to construct a dynamical system having s…
Sampling discretization of the uniform norm for hyperbolic-cross trigonometric polynomials
研究双曲交叉三角多项式一致范数的采样离散化，构造显式赋范集并证明随机采样达到最优指数，同时给出赋范集大小的下界，排除二次界。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。