Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2501.02358

Help | Advanced Search

Mathematics > Classical Analysis and ODEs

arXiv:2501.02358 (math)
[Submitted on 4 Jan 2025 ]

Title: Chebyshev systems and Sturm oscillation theory for discrete polynomials

Title: 切比雪夫系统和离散多项式的斯特姆振动理论

Authors:D. V. Gorbachev, V. I. Ivanov, S. Yu. Tikhonov
Abstract: We prove an analogue of Chebyshev's alternation theorem for linearly independent discrete functions $\Phi_n=\{\varphi_k\}_{k=1}^n$ on the interval $[0,q]_{\mathbb{Z}}=[0,q]\cap \mathbb{Z}$. In particular, we establish that the polynomial of best uniform approximation of a discrete function $f$ admits a Chebyshev alternance set of length $n+1$ if and only if $\Phi_n$ is a Chebyshev $T_{\mathbb{Z}}$-system. Also, we obtain a discrete version of Sturm's oscillation theorem, according to which the number of discrete zeros of the polynomial $\sum_{k=m}^{n}a_k\varphi_k$ is no less than $m-1$ and no more than $n-1$. This implies that $\Phi_n$ is a $T_{\mathbb{Z}}$-system and a discrete Sturm-Hurwitz spectral gap theorem is valid. As applications, we study the orthogonal polynomials with removed largest zeros. We establish the monotonicity property of coefficients in the Fourier expansions of such polynomials, thereby strengthening the results of H. Cohn and A. Kumar. We apply this to solve a Yudin-type extremal problem for polynomials with spectral gap.
Abstract: 我们证明了Chebyshev交替定理在区间$[0,q]_{\mathbb{Z}}=[0,q]\cap \mathbb{Z}$上线性无关离散函数$\Phi_n=\{\varphi_k\}_{k=1}^n$的类似情况。特别地,我们建立了一个离散函数$f$的最佳一致逼近多项式当且仅当$\Phi_n$是一个Chebyshev$T_{\mathbb{Z}}$-系统时,其具有长度为$n+1$的Chebyshev交替集。 此外,我们得到了斯特姆振动定理的离散版本,根据该定理,多项式$\sum_{k=m}^{n}a_k\varphi_k$的离散零点个数不少于$m-1$且不超过$n-1$。 这表明$\Phi_n$是一个$T_{\mathbb{Z}}$-系统,并且有效的离散斯特姆-赫尔维茨谱间隙定理。 作为应用,我们研究了去除最大零点的正交多项式。 我们建立了此类多项式傅里叶展开系数的单调性性质,从而加强了 H. Cohn 和 A. Kumar 的结果。 我们将此应用于解决具有谱间隙的多项式的尤丁型极值问题。
Comments: 31 pages
Subjects: Classical Analysis and ODEs (math.CA)
MSC classes: 41A50, 39A21, 52A40
Cite as: arXiv:2501.02358 [math.CA]
  (or arXiv:2501.02358v1 [math.CA] for this version)
  https://doi.org/10.48550/arXiv.2501.02358
arXiv-issued DOI via DataCite

Submission history

From: Dmitry Gorbachev [view email]
[v1] Sat, 4 Jan 2025 18:55:11 UTC (55 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.CA
< prev   |   next >
new | recent | 2025-01
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号