13 resultados para projective plane
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006.
Resumo:
One of the most outstanding problems in combinatorial mathematics and geometry is the problem of existence of finite projective planes whose order is not a prime power.
Resumo:
The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakalo ff , Sofia, July, 2006.
Resumo:
We define Picard cycles on each smooth three-sheeted Galois cover C of the Riemann sphere. The moduli space of all these algebraic curves is a nice Shimura surface, namely a symmetric quotient of the projective plane uniformized by the complex two-dimensional unit ball. We show that all Picard cycles on C form a simple orbit of the Picard modular group of Eisenstein numbers. The proof uses a special surface classification in connection with the uniformization of a classical Picard-Fuchs system. It yields an explicit symplectic representation of the braid groups (coloured or not) of four strings.
Resumo:
ACM Computing Classification System (1998): E.4.
Resumo:
2000 Mathematics Subject Classification: 14N10, 14C17.
Resumo:
∗Research supported by the grant No. GAUK 186/96 of Charles University.
Resumo:
* The author was supported by NSF Grant No. DMS 9706883.
Resumo:
∗ Partially supported by Grant MM-428/94 of MESC.
Resumo:
* The research has been partially supported by Bulgarian Funding Organizations, sponsoring the Algebra Section of the Mathematics Institute, Bulgarian Academy of Sciences, a Contract between the Humboldt Univestit¨at and the University of Sofia, and Grant MM 412 / 94 from the Bulgarian Board of Education and Technology
Resumo:
We propose a method for image recognition on the base of projections. Radon transform gives an opportunity to map image into space of its projections. Projection properties allow constructing informative features on the base of moments that can be successfully used for invariant recognition. Offered approach gives about 91-97% of correct recognition.
Resumo:
2000 Mathematics Subject Classification: 14H50.
Resumo:
Румен Руменов Данговски, Калина Христова Петрова - Разглеждаме броя на несамопресичащите се разходки с фиксирана дължина върху целочислената решетка. Завършваме анализа върху случая за лента, с дължина едно. Чрез комбинаторни аргументи получаваме точна формула за броя на разходките върху лента, ограничена отляво и отдясно. Формулата я изследваме и асимптотично.