$$AC(\sigma)$$ spaces for polygonally inscribed curves

نویسندگان

چکیده

For certain families of compact subsets the plane, isomorphism class algebra absolutely continuous functions on a set is completely determined by homeomorphism set. This analogous to Gelfand–Kolmogorov theorem for C(K) spaces. In this paper, we define family sets comprising finite unions convex curves and show that has ‘Gelfand–Kolmogorov’ property.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Curves of constant diameter and inscribed polygons

If one drops the unicity assumption, (C(D)) is the property of having constant diameter, which is in fact equivalent (for closed curves in the plane) to having constant width or constant breadth (for the definitions and the proof of the equivalence, see [8, chap. 25]). It is a surprise to many (including me !) that curves of constant diameter other that the circle do exist. The simplest example...

متن کامل

Exceptional Sets for Universally Polygonally Approximable Functions

In [9], the present authors and Richard O’Malley showed that in order for a function be universally polygonally approximable it is necessary that for each ε > 0, the set of points of non-quasicontinuity be σ − (1− ε) symmetrically porous. The question as to whether that condition is sufficient or not was left open. Here we prove that if a set, E = S∞ n=1 En, such that each Ei is closed and 1-sy...

متن کامل

Curves and Symmetric Spaces, II

We describe the canonical model of an algebraic curve of genus 9 over a perfect field when the Clifford index is maximal (=3) by means of linear systems of higher rank. Let SpG(n, 2n) be the symplectic Grassmannian, that is, the Grassmannian of Lagrangian subspaces of a 2n-dimensional symplectic vector space, over a field k. In the case n = 3, SpG(3, 6) is a 6-dimensional homogeneous variety an...

متن کامل

Algorithm for finding the largest inscribed rectangle in polygon

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...

متن کامل

Containment and Inscribed Simplices

Let K and L be compact convex sets in Rn. The following two statements are shown to be equivalent: (i) For every polytope Q ⊆ K having at most n+ 1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 ≤ d ≤ n − 1. It is also shown that the following two statements are equivalent: (i) For every polytope Q ⊆ K having at most d+ 1 vertices, L contains a translate of Q. (i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Banach Journal of Mathematical Analysis

سال: 2021

ISSN: ['1735-8787', '2662-2033']

DOI: https://doi.org/10.1007/s43037-020-00110-w