Skip to main content

Counterexamples in the Theory of \(\alpha \)-Sets

  • Conference paper
  • First Online:
Mathematical Optimization Theory and Operations Research (MOTOR 2019)

Abstract

The paper considers \(\alpha \)-sets that are the generalization of convex sets. This concept was introduced by V.N. Ushakov in the 2000s to classify the reachable sets of controlled systems according to the degree of their nonconvexity. Since then a lot of properties of such sets have been discovered and proven. However, not all the “natural” properties are fulfilled. We have proved two “unnatural” properties for such sets in the paper. Firstly, we provide an example of a non-self-intersecting curve, a connected segment of which is “less convex” than the entire curve in terms of \(\alpha \)-sets. Secondly, we show that there is an \(\alpha \)-curve which is not representable as a graph of the function for all \(\alpha >0\).

The reported study was funded by RFBR according to the research project no. 18-01-00018 mol_a. The work was supported by Act 211 Government of the Russian Federation, contract no. 02.A03.21.0006.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Michael, E.: Paraconvex sets. Mathematica Scandinavica 7(2), 312–315 (1959)

    MathSciNet  Google Scholar 

  2. Ivanov, G.E.: Weakly Convex Sets and Functions: Theory and Applications. Fizmatlit, Moscow (2006)

    MATH  Google Scholar 

  3. Ershov, A.A., Pershakov, M.V.: On the relation of alpha-sets with other generalizations of convex sets. In: Treskova, P.P., Kirsanova, A.I. (eds.) VI Information School for Young Scientists, Yekaterinburg, pp. 143–150 (2018). https://doi.org/10.32460/ishmu-2018-6-0017

  4. Polovinkin, E.S., Balashov, M.V.: Elements of Convex and Strongly Convex Analysis. Fizmatlit, Moscow (2007)

    MATH  Google Scholar 

  5. Ushakov, V.N., Uspenskii, A.A., Ershov, A.A.: Alpha sets in finite-dimensional euclidean spaces and their applications in control theory. Vestn. Saint Petersburg Univ. Appl. Math. Comput. Sci. Control Process. 14(3), 261–272 (2018). https://doi.org/10.21638/11702/spbu10.2018.307

    Article  MathSciNet  Google Scholar 

  6. Ushakov, V.N., Uspenskii, A.A.: Theorems on the separability of \(\alpha \)-sets in Euclidean space. Proc. Steklov Inst. Math. 299(suppl. 1), 277–291 (2017). https://doi.org/10.1134/S0081543817090255

    Article  MathSciNet  MATH  Google Scholar 

  7. Ushakov, V.N., Uspenskii, A.A.: \(\alpha \)-sets in finite-dimensional Euclidean spaces and their properties. Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp’yuternue Nauki 26(1), 95–120 (2016). https://doi.org/10.20537/vm160109. (in Russian)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aleksandr Ershov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ushakov, V., Ershov, A., Pershakov, M. (2019). Counterexamples in the Theory of \(\alpha \)-Sets. In: Bykadorov, I., Strusevich, V., Tchemisova, T. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2019. Communications in Computer and Information Science, vol 1090. Springer, Cham. https://doi.org/10.1007/978-3-030-33394-2_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-33394-2_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-33393-5

  • Online ISBN: 978-3-030-33394-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics