Abstract
Given a totally ordered setT containing at leastn+1 elements (say a subset ofR 1), the graph of the functiona:T→R n is called a Chebyshev curve (inR n) if the determinant of the matrix (a(t 1),a(t 2), ...,a(t n)) is either positive whenevert 1<t 2<...<t n or negative whenevert 1<t 2<...<t n. For finiteT a characterization of these curves (sequences) has been given by the author. In this paper the result is extended to non-finiteT. The characterization proved here is an improved (reformulated) version of that given by the author for infiniteT.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
