|
|
Famous unsolvable problems.
Kesely, Michal ; Pražák, Dalibor (advisor) ; Pick, Luboš (referee)
Title: Famous nnsolvable problems Author: Michal Kesely Department,: Deportment of Mathematical Analysis Supervisor: RNDr. Dalibor Prazak, Ph.D. Supervisor's e-mail address; prazak^karlin.inff.cuni.cz Abst.ra.ct: In the present work we study three famous problems of antiquity (the Delian problem, the trisect,ion of an angle and the squaring of a. cir- cle), which turned to be nnsolvable much later. In the first chapter we will formalize the concept of Euclidean construction, prove few theorems about algebraic numbers and show an interesting connection between con- structible numbers and algebraic numbers. In the next, two chapters we will prove the insolvability of the Delia.ii problem and the trisection of an an- gle using the properties of constructible numbers. Furthermore in (.he third chapter we will mention some incorrect solutions of the trisection problem, In the last, chapter we will prove the existence of transcendental numbers, build an appropriate apparatus and finally we will prove the transcendence of two famous const.nnts - c and TV. The insolvabilityof the squaring problem is a direct, consequence of the transcendence of T\. Keywords: unsolvable problem, constrnctible. transcendental
|
|
|
MDS codes conjecture
Kesely, Michal ; Drápal, Aleš (advisor) ; Lisoněk, Petr (referee)
In this thesis, we study some properties of MDS codes and we mainly focus on the MDS codes conjecture. In the first chapter we define MDS codes, show some examples and basic properties of MDS codes, for example a link between MDS codes and Latin squares or rectangles. Afterwards we state the MDS codes conjecture and prove it in several cases. In the third chapter we can observe the relationship between MDS codes and narcs in projective geometries. Finally we present those known cases, for which the MDS conjecture holds.
|
|
|
Famous unsolvable problems.
Kesely, Michal ; Pick, Luboš (referee) ; Pražák, Dalibor (advisor)
Title: Famous nnsolvable problems Author: Michal Kesely Department,: Deportment of Mathematical Analysis Supervisor: RNDr. Dalibor Prazak, Ph.D. Supervisor's e-mail address; prazak^karlin.inff.cuni.cz Abst.ra.ct: In the present work we study three famous problems of antiquity (the Delian problem, the trisect,ion of an angle and the squaring of a. cir- cle), which turned to be nnsolvable much later. In the first chapter we will formalize the concept of Euclidean construction, prove few theorems about algebraic numbers and show an interesting connection between con- structible numbers and algebraic numbers. In the next, two chapters we will prove the insolvability of the Delia.ii problem and the trisection of an an- gle using the properties of constructible numbers. Furthermore in (.he third chapter we will mention some incorrect solutions of the trisection problem, In the last, chapter we will prove the existence of transcendental numbers, build an appropriate apparatus and finally we will prove the transcendence of two famous const.nnts - c and TV. The insolvabilityof the squaring problem is a direct, consequence of the transcendence of T\. Keywords: unsolvable problem, constrnctible. transcendental
|
guest ::
RSS feed.