Twelve open problems on the exact value of the Hausdorff measure and on topological entropy: a brief survey of recent results

Nonlinearity ◽  
2003 ◽  
Vol 17 (2) ◽  
pp. 493-502 ◽  
Author(s):  
Zuoling Zhou ◽  
Li Feng
Author(s):  
Sebastian van Strien

This chapter discusses Milnor's conjecture on monotonicity of entropy and gives a short exposition of the ideas used in its proof. It discusses the history of this conjecture, gives an outline of the proof in the general case, and describes the state of the art in the subject. The proof makes use of an important result by Kozlovski, Shen, and van Strien on the density of hyperbolicity in the space of real polynomial maps, which is a far-reaching generalization of the Thurston Rigidity Theorem. (In the quadratic case, density of hyperbolicity had been proved in studies done by M. Lyubich and J. Graczyk and G. Swiatek.) The chapter concludes with a list of open problems.


1998 ◽  
Vol 18 (2) ◽  
pp. 303-319 ◽  
Author(s):  
D. BURAGO ◽  
S. FERLEGER ◽  
A. KONONENKO

We summarize the results of several recent papers, together with a few new results, which rely on a connection between semi-dispersing billiards and non-regular Riemannian geometry. We use this connection to solve several open problems about the existence of uniform estimates on the number of collisions, topological entropy and periodic trajectories of such billiards.


2000 ◽  
Vol 10 (05) ◽  
pp. 1067-1073 ◽  
Author(s):  
XIN-CHU FU ◽  
YIBIN FU ◽  
JINQIAO DUAN ◽  
ROBERT S. MACKAY

The chaotic properties of some subshift maps are investigated. These subshifts are the orbit closures of certain nonperiodic recurrent points of a shift map. We first provide a review of basic concepts for dynamics of continuous maps in metric spaces. These concepts include nonwandering point, recurrent point, eventually periodic point, scrambled set, sensitive dependence on initial conditions, Robinson chaos, and topological entropy. Next we review the notion of shift maps and subshifts. Then we show that the one-sided subshifts generated by a nonperiodic recurrent point are chaotic in the sense of Robinson. Moreover, we show that such a subshift has an infinite scrambled set if it has a periodic point. Finally, we give some examples and discuss the topological entropy of these subshifts, and present two open problems on the dynamics of subshifts.


2021 ◽  
Vol 31 (07) ◽  
pp. 2150100
Author(s):  
Zdeněk Kočan ◽  
Veronika Kurková ◽  
Michal Málek

Dynamical systems generated by continuous maps on compact metric spaces can have various properties, e.g. the existence of an arc horseshoe, the positivity of topological entropy, the existence of a homoclinic trajectory, the existence of an omega-limit set containing two minimal sets and other. In [Kočan et al., 2014] we consider six such properties and survey the relations among them for the cases of graph maps, dendrite maps and maps on compact metric spaces. In this paper, we consider fourteen such properties, provide new results and survey all the relations among the properties for the case of graph maps and all known relations for the case of dendrite maps. We formulate some open problems at the end of the paper.


2015 ◽  
Vol 3 (1) ◽  
Author(s):  
Anna Giordano Bruno ◽  
Simone Virili

AbstractThe Algebraic Yuzvinski Formula expresses the algebraic entropy of an endomorphism of a finitedimensional rational vector space as the Mahler measure of its characteristic polynomial. In a recent paper, we have proved this formula, independently fromits counterpart – the Yuzvinski Formula – for the topological entropy proved by Yuzvinski in 1968. In this paper we first compare the proof of the Algebraic Yuzvinski Formula with a proof of the Yuzvinski Formula given by Lind and Ward in 1988, underlying the common ideas and the differences in the main steps. Then we describe several known applications of the Algebraic Yuzvinski Formula, and some related open problems are discussed. Finally,we give a new and purely algebraic proof of the Algebraic Yuzvinski Formula for the intrinsic algebraic entropy.


Author(s):  
Leiba Rodman

Quaternions are a number system that has become increasingly useful for representing the rotations of objects in three-dimensional space and has important applications in theoretical and applied mathematics, physics, computer science, and engineering. This is the first book to provide a systematic, accessible, and self-contained exposition of quaternion linear algebra. It features previously unpublished research results with complete proofs and many open problems at various levels, as well as more than 200 exercises to facilitate use by students and instructors. Applications presented in the book include numerical ranges, invariant semidefinite subspaces, differential equations with symmetries, and matrix equations. Designed for researchers and students across a variety of disciplines, the book can be read by anyone with a background in linear algebra, rudimentary complex analysis, and some multivariable calculus. Instructors will find it useful as a complementary text for undergraduate linear algebra courses or as a basis for a graduate course in linear algebra. The open problems can serve as research projects for undergraduates, topics for graduate students, or problems to be tackled by professional research mathematicians. The book is also an invaluable reference tool for researchers in fields where techniques based on quaternion analysis are used.


2008 ◽  
Vol 4 (3) ◽  
pp. 181-192 ◽  
Author(s):  
Giovanni Sparacino ◽  
Andrea Facchinetti ◽  
Alberto Maran ◽  
Claudio Cobelli

Impact ◽  
2019 ◽  
Vol 2019 (10) ◽  
pp. 30-32
Author(s):  
Tomoyuki Morimae

In cloud quantum computing, a classical client delegate quantum computing to a remote quantum server. An important property of cloud quantum computing is the verifiability: the client can check the integrity of the server. Whether such a classical verification of quantum computing is possible or not is one of the most important open problems in quantum computing. We tackle this problem from the view point of quantum interactive proof systems. Dr Tomoyuki Morimae is part of the Quantum Information Group at the Yukawa Institute for Theoretical Physics at Kyoto University, Japan. He leads a team which is concerned with two main research subjects: quantum supremacy and the verification of quantum computing.


2017 ◽  
Vol 2 (3) ◽  
pp. 1
Author(s):  
Hanane Bennasar ◽  
Mohammad Essaaidi ◽  
Ahmed Bendahmane ◽  
Jalel Benothmane

Cloud computing cyber security is a subject that has been in top flight for a long period and even in near future. However, cloud computing permit to stock up a huge number of data in the cloud stockage, and allow the user to pay per utilization from anywhere via any terminal equipment. Among the major issues related to Cloud Computing security, we can mention data security, denial of service attacks, confidentiality, availability, and data integrity. This paper is dedicated to a taxonomic classification study of cloud computing cyber-security. With the main objective to identify the main challenges and issues in this field, the different approaches and solutions proposed to address them and the open problems that need to be addressed.


1986 ◽  
Vol 12 (1) ◽  
pp. 118
Author(s):  
Meinershagen
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document