Article
Licensed
Unlicensed
Requires Authentication
Universally Polygonally Approximable Functions
-
M. J. Evans
Published/Copyright:
June 4, 2010
Abstract
It has recently been established that any Baire class one function ƒ : [0, 1] → ℝ can be represented as the pointwise limit of a sequence of polygonal functions whose vertices lie on the graph of ƒ. Here we investigate the subclass of Baire class one functions having the additional property that for every dense subset D of [0, 1], the first coordinates of the vertices of the polygonal functions can be chosen from D.
Received: 1999-02-08
Revised: 1999-07-04
Published Online: 2010-06-04
Published in Print: 2000-June
© Heldermann Verlag
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Feynman's Path Integrals and Henstock's Non-Absolute Integration
- Universally Polygonally Approximable Functions
- Differential Calculus for Complex-Valued Multifunctions
- On Analogues of Some Classical Subsets of the Real Line
- Oscillation Criteria of Comparison Type for Second Order Difference Equations
- On the Convergence of the Method of Lines for Quasi–Nonlinear Functional Evolutions in Banach Spaces
- Bounded Solutions for Nonlinear Elliptic Equations in Unbounded Domains
- A Characterization of Strict Local Minimizers of Order One for Static Minmax Problems in the Parametric Constraint Case
- On Linear Dependence of Iterates
Articles in the same Issue
- Feynman's Path Integrals and Henstock's Non-Absolute Integration
- Universally Polygonally Approximable Functions
- Differential Calculus for Complex-Valued Multifunctions
- On Analogues of Some Classical Subsets of the Real Line
- Oscillation Criteria of Comparison Type for Second Order Difference Equations
- On the Convergence of the Method of Lines for Quasi–Nonlinear Functional Evolutions in Banach Spaces
- Bounded Solutions for Nonlinear Elliptic Equations in Unbounded Domains
- A Characterization of Strict Local Minimizers of Order One for Static Minmax Problems in the Parametric Constraint Case
- On Linear Dependence of Iterates
