Dissertations / Theses on the topic 'Finite geometry; projective geometry'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Finite geometry; projective geometry.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Fleming, Patrick Scott. "Finite projective planes and related topics." Laramie, Wyo. : University of Wyoming, 2006. http://proquest.umi.com/pqdweb?did=1225126281&sid=1&Fmt=2&clientId=18949&RQT=309&VName=PQD.
Full textCook, Gary Russell. "Arcs in a finite projective plane." Thesis, University of Sussex, 2011. http://sro.sussex.ac.uk/id/eprint/7510/.
Full textHamed, Zainab Shehab. "Arcs of degree four in a finite projective plane." Thesis, University of Sussex, 2018. http://sro.sussex.ac.uk/id/eprint/77816/.
Full textPichanick, E. V. D. "Bounds for complete arcs in finite projective planes." Thesis, University of Sussex, 2016. http://sro.sussex.ac.uk/id/eprint/63459/.
Full textOxenham, Martin Glen. "On n-covers of PG (3,q) and related structures /." Title page, contents and introduction only, 1991. http://web4.library.adelaide.edu.au/theses/09PH/09pho98.pdf.
Full textGiuzzi, Luca. "Hermitian varieties over finite fields." Thesis, University of Sussex, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.326913.
Full textWhite, Clinton T. Wilson R. M. "Two cyclic arrangement problems in finite projective geometry : parallelisms and two-intersection sets /." Diss., Pasadena, Calif. : California Institute of Technology, 2002. http://resolver.caltech.edu/CaltechETD:etd-06052006-143933.
Full textCulbert, Craig W. "Spreads of three-dimensional and five-dimensional finite projective geometries." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 101 p, 2009. http://proquest.umi.com/pqdweb?did=1891555371&sid=3&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Full textVereecke, Sam K. J. "Some properties of arcs, caps and quadrics in projective spaces in finite order." Thesis, University of Sussex, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263915.
Full textGrout, Jason Nicholas. "The Minimum Rank Problem Over Finite Fields." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd1995.pdf.
Full textBraun, David. "Approche combinatoire pour l'automatisation en Coq des preuves formelles en géométrie d'incidence projective." Thesis, Strasbourg, 2019. http://www.theses.fr/2019STRAD020.
Full textThis thesis work is part of the general field of computer-assisted proof and is methodologically based. The primary objective of proof assistants is to verify that handwritten demonstration is correct; the question here is how within such a system, it is possible to help a user to make a formal proof of the result in which he is interested. These questions around the verification of proofs, in particular in software certification, and beyond their traceability and readability have indeed become significant with the importance that algorithms have taken on in our society. Obviously, answering the question of proof assistance in all its generality goes far beyond the scope of this thesis. This is why we focus our work on proof in mathematics in a particular framework that is well known in our team: geometry and its formalization in the Coq system. In this field, we first highlight the levels at which we can work, namely the scientific context through the formalization methods but also the methodological and technical context within the Coq proof assistant. In a second step, we try to show how our methods and ideas can be generalized to other disciplines. In this way, we are putting in place the first steps towards effective proof assistance in a simple but omnipresent geometric context. Through a classical approach based on synthetic geometry and a complementary combinatorial approach using the concept of rank from matroid theory, we provide the user with general principles and tools to facilitate the development of formal proof. In this sense, we compare the automation capabilities of these two approaches in the specific context of finite geometries before finally constructing an automatic prover of geometric configurations of incidence
Winroth, Harald. "Dynamic projective geometry." Doctoral thesis, Stockholm : Tekniska högsk, 1999. http://www.lib.kth.se/abs99/winr0324.pdf.
Full textWong, Tzu Yen. "Image transition techniques using projective geometry." University of Western Australia. School of Computer Science and Software Engineering, 2009. http://theses.library.uwa.edu.au/adt-WU2009.0149.
Full textRomano, Raquel Andrea. "Projective minimal analysis of camera geometry." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/29231.
Full textIncludes bibliographical references (p. 115-120).
This thesis addresses the general problem of how to find globally consistent and accurate estimates of multiple-view camera geometry from uncalibrated imagery of an extended scene. After decades of study, the classic problem of recovering camera motion from image correspondences remains an active area of research. This is due to the practical difficulties of estimating many interacting camera parameters under a variety of unknown imaging conditions. Projective geometry offers a useful framework for analyzing uncalibrated imagery. However, the associated multilinear models-the fundamental matrix and trifocal tensorare redundant in that they allow a camera configuration to vary along many more degrees of freedom than are geometrically admissible. This thesis presents a novel, minimal projective model of uncalibrated view triplets in terms of the dependent epipolar geometries among view pairs. By explicitly modeling the trifocal constraints among projective bifocal parameters-the epipoles and epipolar collineations-this model guarantees a solution that lies in the valid space of projective camera configurations. We present a nonlinear incremental algorithm for fitting the trifocally constrained epipolar geometries to observed image point matches. The minimal trifocal model is a practical alternative to the trifocal tensor for commonly found image sequences in which the availability of matched point pairs varies widely among different view pairs. Experimental results on synthetic and real image sequences with typical asymmetries in view overlap demonstrate the improved accuracy of the new trifocally constrained model.
(cont.) We provide an analysis of the objective function surface in the projective parameter space and examine cases in which the projective parameterization is sensitive to the Euclidean camera configuration. Finally, we present a new, numerically stable method for minimally parameterizing the epipolar geometry that gives improved estimates of minimal projective representations.
by Raquel A. Romano.
Ph.D.
Contatto, Felipe. "Vortices, Painlevé integrability and projective geometry." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/275099.
Full textMarino, Nicholas John. "Vector Bundles and Projective Varieties." Case Western Reserve University School of Graduate Studies / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=case1544457943307018.
Full textBeardsley, Paul Anthony. "Applications of projective geometry to robot vision." Thesis, University of Oxford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.316854.
Full textO'Keefe, Christine M. "Concerning t-spreads of PG ((s + 1) (t + 1)- 1, q)." Title page, contents and summary only, 1987. http://web4.library.adelaide.edu.au/theses/09PH/09pho41.pdf.
Full textEllis, Amanda. "Classification of conics in the tropical projective plane /." Diss., CLICK HERE for online access, 2005. http://contentdm.lib.byu.edu/ETD/image/etd1104.pdf.
Full textCaullery, Florian. "Polynomes sur les corps finis pour la cryptographie." Thesis, Aix-Marseille, 2014. http://www.theses.fr/2014AIXM4013/document.
Full textFunctions from F_q to itself are interesting objects arising in various domains such as cryptography, coding theory, finite geometry or algebraic geometry. It is well known that these functions admit a univariate polynomial representation. There exists many interesting classes of such polynomials with plenty of applications in pure or applied maths. We are interested in three of them: Almost Perfect Nonlinear (APN) polynomials, Planar (PN) polynomials and o-polynomials. APN polynomials are mostly used in cryptography to provide S-boxes with the best resistance to differential cryptanalysis and in coding theory to construct double error-correcting codes. PN polynomials and o-polynomials first appeared in finite geometry. They give rise respectively to projective planes and ovals in P^2(F_q). Also, their field of applications was recently extended to symmetric cryptography and error-correcting codes.A complete classification of APN, PN and o-polynomials is an interesting open problem that has been widely studied by many authors. A first approach toward the classification was to consider only power functions and the studies were recently extended to polynomial functions.One way to face the problem of the classification is to consider the polynomials that are APN, PN or o-polynomials over infinitely many extensions of F_q, namely, the exceptional APN, PN or o-polynomials.We improve the partial classification of exceptional APN and PN polynomials and give a full classification of exceptional o-polynomials. The proof technique is based on the Lang-Weil bound for the number of rational points in algebraic varieties together with elementary methods
McCallum, Rupert Gordon Mathematics & Statistics Faculty of Science UNSW. "Generalisations of the fundamental theorem of projective geometry." Publisher:University of New South Wales. Mathematics & Statistics, 2009. http://handle.unsw.edu.au/1959.4/43385.
Full textHerman, Ivan. "The use of projective geometry in computer graphics /." Berlin ;Heidelberg ;New York ;London ;Paris ;Tokyo ;Hong Kong ;Barcelona ;Budapest : Springer, 1992. http://www.loc.gov/catdir/enhancements/fy0815/91043253-d.html.
Full textGoetz, Peter D. "The noncommutative algebraic geometry of quantum projective spaces /." view abstract or download file of text, 2003. http://wwwlib.umi.com/cr/uoregon/fullcit?p3102165.
Full textTypescript. Includes vita and abstract. Includes bibliographical references (leaves 106-108). Also available for download via the World Wide Web; free to University of Oregon users.
Frost, George. "The projective parabolic geometry of Riemannian, Kähler and quaternion-Kähler metrics." Thesis, University of Bath, 2016. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.690742.
Full textNiall, Keith. "Projective invariance and visual perception." Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=75782.
Full textHeuel, Stephan. "[Uncertain projective geometry] [statistical reasoning for polyhedral object reconstruction]." [Berlin Heidelberg] [Springer], 2002. http://dx.doi.org/10.1007/b97201.
Full textHeuel, Stephan. "Uncertain projective geometry : statistical reasoning for polyhedral object reconstruction /." Berlin [u.a.] : Springer, 2004. http://www.loc.gov/catdir/enhancements/fy0813/2004104982-d.html.
Full textEskeland, II John T. "Searching for Constructed Form: A Station for Projective Geometry." Thesis, Virginia Tech, 2015. http://hdl.handle.net/10919/78192.
Full textMaster of Architecture
Strawn, Nathaniel Kirk. "Geometry and constructions of finite frames." [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-1335.
Full textRaineri, Emanuele. "Quantum Riemannian geometry of finite sets." Thesis, Queen Mary, University of London, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.414738.
Full textFlórez, Rigoberto. "Four studies in geometry of biased graphs." Online access via UMI:, 2005.
Find full textNeretin, Yurii A., and Andreas Cap@esi ac at. "Geometry of GL$_n$(C) on Infinity: Hinges, Projective Compactifications." ESI preprints, 2000. ftp://ftp.esi.ac.at/pub/Preprints/esi971.ps.
Full textGordon, Neil Andrew. "Finite geometry and computer algebra, with applications." Thesis, University of Hull, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.262412.
Full textHeuel, Stephan [Verfasser]. "[Uncertain projective geometry] : [statistical reasoning for polyhedral object reconstruction] / [Stephan Heuel]." [Berlin, 2004. http://d-nb.info/972277110/34.
Full textShabbir, Ghulam. "Curvature and projective symmetries in space-times." Thesis, University of Aberdeen, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.364690.
Full textYoon, Young-jin. "Characterizations of Some Combinatorial Geometries." Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc277894/.
Full textMcKinnon, David N. R. "The multiple view geometry of implicit curves and surfaces /." [St. Lucia, Qld.], 2006. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe19677.pdf.
Full textZeng, Rui. "Homography estimation: From geometry to deep learning." Thesis, Queensland University of Technology, 2019. https://eprints.qut.edu.au/134132/1/Rui_Zeng_Thesis.pdf.
Full textPun, Ying Anna, and 潘瑛. "On laguerre geometry and generalized quadrangles." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B46542280.
Full textBerardini, Elena. "Algebraic geometry codes from surfaces over finite fields." Thesis, Aix-Marseille, 2020. http://www.theses.fr/2020AIXM0170.
Full textIn this thesis we provide a theoretical study of algebraic geometry codes from surfaces defined over finite fields. We prove lower bounds for the minimum distance of codes over surfaces whose canonical divisor is either nef or anti-strictly nef and over surfaces without irreducible curves of small genus. We sharpen these lower bounds for surfaces whose arithmetic Picard number equals one, surfaces without curves with small self-intersection and fibered surfaces. Then we apply these bounds to surfaces embedded in P3. A special attention is given to codes constructed from abelian surfaces. In this context we give a general bound on the minimum distance and we prove that this estimation can be sharpened under the assumption that the abelian surface does not contain absolutely irreducible curves of small genus. In this perspective we characterize all abelian surfaces which do not contain absolutely irreducible curves of genus up to 2. This approach naturally leads us to consider Weil restrictions of elliptic curves and abelian surfaces which do not admit a principal polarization
Ellis, Amanda. "Classifcation of Conics in the Tropical Projective Plane." BYU ScholarsArchive, 2005. https://scholarsarchive.byu.edu/etd/697.
Full textHuang, Jen-Fa. "On finding generator polynomials and parity-check sums of binary projective geometry codes." Thesis, University of Ottawa (Canada), 1985. http://hdl.handle.net/10393/4800.
Full textPacker, S. "On sets of odd type and caps in Galois geometries of order four." Thesis, University of Sussex, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.262299.
Full textMajid, Shahn, and Andreas Cap@esi ac at. "Riemannian Geometry of Quantum Groups and Finite Groups with." ESI preprints, 2000. ftp://ftp.esi.ac.at/pub/Preprints/esi902.ps.
Full textWong, Vui-Hong, and n/a. "Finite Element Analysis and Improvement of Impeller Blade Geometry." Griffith University. School of Engineering, 2003. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20030825.150853.
Full textStrunk, Stefanie. "High performance adaptive finite elementmodeling of complex CAD geometry." Thesis, KTH, Numerisk analys, NA, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-127543.
Full textCAD (Computer Aided Design)och finita-element-analys är grundläggande för numerisk simulering. Mankonstruerar en modell med CAD-program, skapar ett beräkningsnät på en domän sominnehåller modellen, och använder finita-elementanalys för beräkningar pånätet. I mer avancerade simuleringar, som för adaptiva finita-element-metoder,är det önskvärt att använda CAD information inte bara för att skapa det förstanätet utan under nätförfiningarna i adaptionen under simuleringen. I dettaarbete presenteras ett sätt att använda CAD-data för adaptiv nätförfining i enfinita-element-simulering. En fel-indikator ges för att hitta de element somska förfinas för att förbättra geometrisk approximation och vi beskriver hur deolika angreppssätten kan integreras i ett finita-element programpaket för högpresterandedatorer
Ratcliffe, Diana. "On the classification and geometry of finite map-germs." Thesis, University of Warwick, 1990. http://wrap.warwick.ac.uk/2827/.
Full textHønsen, Morten. "Compactifying locally Cohen-Macaulay projective curves." Doctoral thesis, Stockholm, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-470.
Full textTuncer, Necibe Meir Amnon J. "A novel finite element discretization of domains with spheroidal geometry." Auburn, Ala., 2007. http://repo.lib.auburn.edu/Send%2011-10-07/TUNCER_NECIBE_24.pdf.
Full textDarling, Brian. "A finite element geometry method for Monte Carlo transport calculations." Thesis, Imperial College London, 1988. http://hdl.handle.net/10044/1/47016.
Full text