RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2012, Issue 4, Pages 108–124 (Mi vuu353)  

This article is cited in 2 scientific papers (total in 2 papers)

MATHEMATICS

About an example of the attraction set construction with employment of Stone space

A. G. Chentsov

Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Yekaterinburg, Russia

Abstract: The extension construction of the abstract problem of attainability realized with employment of the Stone compactum (the space of ultrafilters in the traditional equipment) is considered. The questions connected with the structure of attraction sets are investigated; these attraction sets define possibilities for attainability of desired states in topological space under employment of asymptotic analogs of usual solutions. Constraints of asymptotic character are given. This constraints can be arising under the weakening of standard constraints used in control theory (the natural prototype of the investigated abstract problem is the problem about the construction of the asymptotic analog of the attainability domain for the control system under vanishingly small weakening of some constraints on the choice of the programmed control). Using the natural modification of Warga approach, we can introduce (along with precise solutions) so-called approximate solutions in the form of sequences of usual solutions satisfying the conditions (realizing in the totality “asymptotic constraints”) “with reinforcing exactness”. Sometimes, the employment of only such (sequential) approximate solutions can be insufficient. Nets or filters are required. The last objects are used as the basic type of (asymptotic in essence) solutions in this investigation under construction of attraction sets in the attainability problem with constraints of asymptotic character. And what is more, in these constructions, we can confine ourselves to the employment of ultrafilters. For a particular case, on this basis, the concrete structure of attraction set is established.

Keywords: attraction set, constraints of asymptotic character, ultrafilter.

Full text: PDF file (249 kB)
References: PDF file   HTML file

Document Type: Article
UDC: 517.972.8
MSC: 28A33
Received: 10.11.2011

Citation: A. G. Chentsov, “About an example of the attraction set construction with employment of Stone space”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2012, no. 4, 108–124

Citation in format AMSBIB
\Bibitem{Che12}
\by A.~G.~Chentsov
\paper About an example of the attraction set construction with employment of Stone space
\jour Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki
\yr 2012
\issue 4
\pages 108--124
\mathnet{http://mi.mathnet.ru/vuu353}


Linking options:
  • http://mi.mathnet.ru/eng/vuu353
  • http://mi.mathnet.ru/eng/vuu/y2012/i4/p108

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. G. Chentsov, “Ultrafiltry izmerimykh prostranstv i ikh primenenie v konstruktsiyakh rasshirenii”, Tr. IMM UrO RAN, 20, no. 1, 2014, 285–304  mathnet  mathscinet  elib
    2. E. G. Pytkeev, A. G. Chentsov, “On the structure of ultrafilters and properties related to convergence in topological spaces”, Proc. Steklov Inst. Math. (Suppl.), 289, suppl. 1 (2015), 164–181  mathnet  crossref  mathscinet  isi  elib
  • Number of views:
    This page:123
    Full text:31
    References:46
    First page:1

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019