Log in

Relevant bibliographies by topics / Galois Fields / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Galois Fields.

Dissertations / Theses on the topic 'Galois Fields'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Galois Fields.'

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.

1

McGown, Kevin Joseph. "Norm-Euclidean Galois fields." Diss., [La Jolla] : University of California, San Diego, 2010. http://wwwlib.umi.com/cr/fullcit?p3407998.

Full text

Abstract:

Thesis (Ph. D.)--University of California, San Diego, 2010.<br>Title from first page of PDF file (viewed June 23, 2010). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (leaves 86-90).

APA, Harvard, Vancouver, ISO, and other styles

2

Heiderich, Florian. "Galois Theory of Module Fields." Doctoral thesis, Universitat de Barcelona, 2010. http://hdl.handle.net/10803/674.

Full text

Abstract:

This thesis is about Galois theory.<br/><br/>The development of a Galois theory for differential equations analogous to the classical Galois theory for polynomial equations was already an aim of S. Lie in the 19th century. The first step in this direction was the development of a Galois theory for linear differential equations due to E. Picard and E. Vessiot. Later, B.H. Matzat and M. van der Put created a theory for iterative differential equations in positive characteristic. H. Umemura constructed a Galois theory for algebraic differential equations in characteristic zero.<br/><br/>There als

APA, Harvard, Vancouver, ISO, and other styles

3

Alabdali, Ali Abdulqader Bilal. "Hopf-Galois structures on Galois extensions of fields of squarefree degree." Thesis, University of Exeter, 2018. http://hdl.handle.net/10871/33782.

Full text

Abstract:

Hopf-Galois extensions were introduced by Chase and Sweedler [CS69] in 1969, motivated by the problem of formulating an analogue of Galois theory for inseparable extensions. Their approach shed a new light on separable extensions. Later in 1987, the concept of Hopf-Galois theory was further developed by Greither and Pareigis [GP87]. So, as a problem in the theory of groups, they explained the problem of finding all Hopf-Galois structures on a finite separable extension of fields. After that, many results on Hopf-Galois structures were obtained by N. Byott, T. Crespo, S. Carnahan, L. Childs, an

APA, Harvard, Vancouver, ISO, and other styles

4

Huczynska, Sophie. "Primitive free elements of Galois fields." Thesis, University of Glasgow, 2002. http://theses.gla.ac.uk/5533/.

Full text

Abstract:

The key result linking the additive and multiplicative structure of a finite field is the Primitive Normal Basis Theorem; this was established by Lenstra and Schoof in 1987 in a proof which was heavily computational in nature. In this thesis, a new, theoretical proof of the theorem is given, and new estimates (in some cases, exact values) are given for the number of primitive free elements. A natural extension of the Primitive Normal Basis Theorem is to impose additional conditions on the primitive free elements; in particular, we may wish to specify the norm and trace of a primitive free elem

APA, Harvard, Vancouver, ISO, and other styles

5

Morita, Kazuma. "On Galois representations of local fields with imperfect residue fields." 京都大学 (Kyoto University), 2009. http://hdl.handle.net/2433/124384.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bailey, Daniel V. "Computation in optimal extension fields." Link to electronic version, 2000. http://www.wpi.edu/Pubs/ETD/Available/etd-0428100-133037/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mattman, Thomas W. "The computation of Galois groups over function fields /." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=56944.

Full text

Abstract:

Practical computational techniques are described to determine the Galois group of a degree 8 polynomial over a function field of the form Q($t sb1$, ...,$t sb{r}$). Each transitive permutation group of degree 8 is realized as a Galois group over the rationals. The techniques of Soicher and McKay (SM) for rational polynomials of degree less than 8 are also extended to function fields. Timing and efficiency of a MAPLE V implementation are discussed.

APA, Harvard, Vancouver, ISO, and other styles

8

Gill, Philip Geoffrey. "Galois isomorphisms between ideals in P-acidic fields." Thesis, University of Exeter, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.264602.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sutherland, Nicole. "Algorithms for Galois extensions of global function fields." Thesis, The University of Sydney, 2014. http://hdl.handle.net/2123/13364.

Full text

Abstract:

In this thesis we consider the computation of integral closures in cyclic Galois extensions of global function fields and the determination of Galois groups of polynomials over global function fields. The development of methods to efficiently compute integral closures and Galois groups are listed as two of the four most important tasks of number theory considered by Zassenhaus. We describe an algorithm each for computing integral closures specifically for Kummer, Artin--Schreier and Artin--Schreier--Witt extensions. These algorithms are more efficient than previous algorithms because they com

APA, Harvard, Vancouver, ISO, and other styles

10

Nöcker, Michael. "Data structures for parallel exponentiation in finite fields." [S.l. : s.n.], 2001. http://deposit.ddb.de/cgi-bin/dokserv?idn=962689777.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Breuning, Manuel. "Equivariant epsilon constants for Galois extensions of number fields and P-adic fields." Thesis, King's College London (University of London), 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.409402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Vogel, Denis. "Massey products in the Galois cohomology of number fields." [S.l.] : [s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=970188277.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Rezaee, Sayed Majid. "A study on independent component analysis over galois fields." reponame:Repositório Institucional da UnB, 2015. http://dx.doi.org/10.26512/2015.12.D.20421.

Full text

Abstract:

Dissertação (mestrado)—Universidade de Brasília, Faculdade de Tecnologia, Departamento de Engenharia Elétrica, 2015.<br>Submitted by Fernanda Percia França (fernandafranca@bce.unb.br) on 2016-02-22T20:16:00Z No. of bitstreams: 1 2015_SayedMajidRezaee.pdf: 1299294 bytes, checksum: 5ae8992f8de2423bc23cf06bdeaeeb09 (MD5)<br>Approved for entry into archive by Marília Freitas(marilia@bce.unb.br) on 2016-05-26T16:32:15Z (GMT) No. of bitstreams: 1 2015_SayedMajidRezaee.pdf: 1299294 bytes, checksum: 5ae8992f8de2423bc23cf06bdeaeeb09 (MD5)<br>Made available in DSpace on 2016-05-26T16:32:15Z (GMT). N

APA, Harvard, Vancouver, ISO, and other styles

14

White, Gareth. "Algorithms for Galois group computations over multivariate function fields." Thesis, The University of Sydney, 2014. http://hdl.handle.net/2123/12889.

Full text

Abstract:

In this thesis, two separate algorithms are described to determine the Galois group of a polynomial f defined over a function field of the form Q(w1,...,wa), both of which use Stauduhar’s method for polynomials over Q, with various techniques used to make them compatible for function fields as the base field. In particular, both algorithms construct the resolvent of f. The first algorithm uses a special form of Hensel lifting to express the roots as a multivariate power series of sufficient precision to determine the resolvent exactly. This precision is derived through the use of Newton polygo

APA, Harvard, Vancouver, ISO, and other styles

15

Johansson, David. "Construction of Superimposed Codes Using Graphs and Galois Fields." Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-62862.

Full text

Abstract:

In this thesis some constructions of superimposed codes are presented. Many of the known nontrivial constructions arise from t−designs, and the constructions discussed in this thesis is also based on a block design idea. Superimposed codes are rather combinatorial in nature, so the connection to t−designs is not too surprising. What may be a little surprise, however, is the connection between superimposed codes and linear codes and Galois elds. Linear codes are quite intuitive and have nice properties, as is the case for Galois elds; combinatorial structures are quite often the contrary, not i

APA, Harvard, Vancouver, ISO, and other styles

16

Kim, Nguyen. "Explicit arithmetic of Brauer groups ray class fields and index calculus /." [S.l.] : [s.n.], 2001. http://deposit.ddb.de/cgi-bin/dokserv?idn=963601687.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Cobbe, Alessandro. "Steinitz classes of tamely rami ed Galois extensions of algebraic number fields." Doctoral thesis, Scuola Normale Superiore, 2009. http://hdl.handle.net/11384/85661.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Chetcharungkit, Chinnawat. "Scaffolds in non-classical Hopf-Galois structures." Thesis, University of Exeter, 2018. http://hdl.handle.net/10871/34156.

Full text

Abstract:

For an extension of local fields, a scaffold is shown to be a powerful tool for dealing with the problem of the freeness of fractional ideals over their associated orders (Byott, Childs and Elder: \textit{Scaffolds and Generalized Integral Galois Module Structure}, Ann. Inst. Fourier, 2018). The first class of field extensions admitting scaffolds is \enquote*{near one-dimensional elementary abelian extension}, introduced by Elder (\textit{Galois Scaffolding in One-dimensional Elementary Abelian Extensions}, Proc. Amer. Math. Soc. 2009). However, the scaffolds constructed in Elder's paper arise

APA, Harvard, Vancouver, ISO, and other styles

19

Joubert, Paul. "Geometric actions of the absolute Galois group." Thesis, Stellenbosch : University of Stellenbosch, 2006. http://hdl.handle.net/10019.1/2508.

Full text

Abstract:

Thesis (MSc (Mathematics))--University of Stellenbosch, 2006.<br>This thesis gives an introduction to some of the ideas originating from A. Grothendieck's 1984 manuscript Esquisse d'un programme. Most of these ideas are related to a new geometric approach to studying the absolute Galois group over the rationals by considering its action on certain geometric objects such as dessins d'enfants (called stick figures in this thesis) and the fundamental groups of certain moduli spaces of curves. I start by defining stick figures and explaining the connection between these innocent combinatoria

APA, Harvard, Vancouver, ISO, and other styles

20

Steurer, Aliza Anne. "On the galois groups of the 2-Class field towers of some imaginary quadratic fields." College Park, Md. : University of Maryland, 2006. http://hdl.handle.net/1903/3740.

Full text

Abstract:

Thesis (Ph. D.) -- University of Maryland, College Park, 2006.<br>Thesis research directed by: Mathematics. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

21

Angelakis, Athanasios. "Universal Adelic Groups for Imaginary Quadratic Number Fields and Elliptic Curves." Thesis, Bordeaux, 2015. http://www.theses.fr/2015BORD0180/document.

Full text

Abstract:

Cette thèse traite de deux problèmes dont le lien n’est pas apparent (1) A` quoi ressemble l’abélianisé AK du groupe de Galois absolu d’un corps quadratique imaginaire K, comme groupe topologique? (2) A` quoi ressemble le groupe des points adéliques d’une courbe elliptique sur Q, comme groupe topologique? Pour la première question, la restriction au groupe de Galois abélianisé nous permet d’utiliser la théorie du corps de classes pour analyser AK . Les travaux précédents dans ce domaine, qui remontent à Kubota et Onabe, décrivent le dual de Pontryagin de AK en termes de familles in- finies d’i

APA, Harvard, Vancouver, ISO, and other styles

22

Parker, Matthew. "Algorithms and architectures for the VLSI implementation of number theoretic transformations, residue and polynomial residue number systems." Thesis, University of Huddersfield, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.281799.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Jahnke, Franziska Maxie. "Definable henselian valuations and absolute Galois groups." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:95b8f301-bb8b-42d9-9b63-46580424e515.

Full text

Abstract:

This thesis investigates the connections between henselian valuations and absolute Galois groups. There are fundamental links between these: On one hand, the absolute Galois group of a field often encodes information about (henselian) valuations on that field. On the other, in many cases a henselian valuation imposes a certain structure on an absolute Galois group which makes it easier to study. We are particularly interested in the question of when a field admits a non-trivial parameter-free definable henselian valuation. By a result of Prestel and Ziegler, this does not hold for every hensel

APA, Harvard, Vancouver, ISO, and other styles

24

Wozny, Peter. "Elliptic curve cryptography: generation and validation of domain parameters in binary Galois Fields /." Online version of thesis, 2008. http://hdl.handle.net/1850/9695.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Blackhurst, Jonathan H. "Proven Cases of a Generalization of Serre's Conjecture." Diss., CLICK HERE for online access, 2006. http://contentdm.lib.byu.edu/ETD/image/etd1386.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Childers, Kevin Ronald. "Octahedral Extensions and Proofs of Two Conjectures of Wong." BYU ScholarsArchive, 2015. https://scholarsarchive.byu.edu/etd/5314.

Full text

Abstract:

Consider a non-Galois cubic extension K/Q ramified at a single prime p > 3. We show that if K is a subfield of an S_4-extension L/Q ramified only at p, we can determine the Artin conductor of the projective representation associated to L/Q, which is based on whether or not K/Q is totally real. We also show that the number of S_4-extensions of this type with K as a subfield is of the form 2^n - 1 for some n >= 0. If K/Q is totally real, n > 1. This proves two conjectures of Siman Wong.

APA, Harvard, Vancouver, ISO, and other styles

27

Simons, Lloyd D. "The structure of the Hilbert symbol for unramified extensions of 2-adic number fields /." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Rzedowski-Calderon, Martha. "Galois module structure of rings of integers and automorphism groups of congruence function fields /." The Ohio State University, 1988. http://rave.ohiolink.edu/etdc/view?acc_num=osu148759571215722.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Chu, Junfeng. "A study of polynomial residue number systems over binary Galois fields GF(2m) for cryptography." Thesis, University of Sheffield, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575415.

Full text

Abstract:

This thesis is concerned with GF(2m) Polynomial Residue Number Systems (PRNS) and their application in cryptography to provide resistance against side-channel- analysis and protection against fault attacks. PRNS operations over GF(2m) required in a number of cryptography primitives are investigated. A partial-conversion method is introduced to simplify the costly conversion operation and this is then combined with a partial modular reduction technique and applied to design and implement a PRNS based GF(2m) multiplier with improved performance. The Advanced Encryption Standard (AES) is used as

APA, Harvard, Vancouver, ISO, and other styles

30

Gil-Muñoz, Daniel. "An effective method to study the Hopf-Galois module structure of certain extensions of fields." Doctoral thesis, Universitat Politècnica de Catalunya, 2021. http://hdl.handle.net/10803/672317.

Full text

Abstract:

We develop a method to compute a basis of the associated order in a Hopf Galois structure H of the ring of integers O_L of an extension of number or p-adic fields L/K. We state and prove a necessary and sufficient condition for a given element in O_L to be a free generator of O_L as module over its associated order in H. Whenever it exists, one can use such a free generator and a basis of this associated order to build a basis which can be seen as an analog of the normal integral basis in the Galois case. We use this method to determine the associated order and the existence of those normal in

APA, Harvard, Vancouver, ISO, and other styles

31

Sircana, Carlo [Verfasser], and Claus [Akademischer Betreuer] Fieker. "On the construction of number fields with solvable Galois group / Carlo Sircana ; Betreuer: Claus Fieker." Kaiserslautern : Technische Universität Kaiserslautern, 2021. http://d-nb.info/1236571916/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Sommaro, Silvia. "Groups of principal homogeneous spaces for some Hopf orders arising from formal groups." Thesis, University of Exeter, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.368366.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Matsumoto, Kohji. "On the speed of convergence to limit distributions for Dedekind zeta-functions of non-Galois number fields." Mathematical Society of Japan, 2007. http://hdl.handle.net/2237/13844.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Guajardo, Jorge. "Efficient Algorithms for Elliptic Curve Cryptosystems." Digital WPI, 2000. https://digitalcommons.wpi.edu/etd-theses/185.

Full text

Abstract:

Elliptic curves are the basis for a relative new class of public-key schemes. It is predicted that elliptic curves will replace many existing schemes in the near future. It is thus of great interest to develop algorithms which allow efficient implementations of elliptic curve crypto systems. This thesis deals with such algorithms. Efficient algorithms for elliptic curves can be classified into low-level algorithms, which deal with arithmetic in the underlying finite field and high-level algorithms, which operate with the group operation. This thesis describes three new algorithms for efficien

APA, Harvard, Vancouver, ISO, and other styles

35

Beyronneau, Robert Lewis. "The solvability of polynomials by radicals: A search for unsolvable and solvable quintic examples." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2700.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Monteza, David Alberto Saldaña. "Fecho Galoisiano de sub-extensões quárticas do corpo de funções racionais sobre corpos finitos." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-12092017-141837/.

Full text

Abstract:

Seja p um primo, considere q = pe com e ≥ 1 inteiro. Dado o polinômio f (x) = x4+ax3+bx2+ cx+d ∈ Fq[x], consideremos o polinômio F(T) = T4 +aT3 +bT2 +cT + d - y ∈ Fq(y)[T], com y = f (x) sobre Fq(y). O objetivo desse trabalho é determinar o número de polinômios f (x) que tem seu grupo de galois associado GF isomorfo a cada subgrupo transitivo (prefixado) de S4. O trabalho foi baseado no artigo: Galois closures of quartic sub-fields of rational function fields, usando equações auxiliares associadas ao polinômio minimal F(T) de graus 3 e 2 (DUMMIT, 1994); bem como uma caraterização

APA, Harvard, Vancouver, ISO, and other styles

37

El-Gebaly, Mohamed. "Finite Field Multiplier Architectures for Cryptographic Applications." Thesis, University of Waterloo, 2000. http://hdl.handle.net/10012/891.

Full text

Abstract:

Security issues have started to play an important role in the wireless communication and computer networks due to the migration of commerce practices to the electronic medium. The deployment of security procedures requires the implementation of cryptographic algorithms. Performance has always been one of the most critical issues of a cryptographic function, which determines its effectiveness. Among those cryptographic algorithms are the elliptic curve cryptosystems which use the arithmetic of finite fields. Furthermore, fields of characteristic two are preferred since they provide carr

APA, Harvard, Vancouver, ISO, and other styles

38

Coutinho, Sávio da Silva. "Sobre a existência ou não de bases normais auto-duais para extensões galoisianas de corpos." Universidade de São Paulo, 2009. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-18052009-150619/.

Full text

Abstract:

Neste trabalho, apresentamos um estudo sobre a existência ou não de bases normais auto-duais para extensões galoisianas finitas de corpos, mostrando que toda extensão galoisiana finita de grau ímpar posui uma base normal auto-dual, enquanto que para extensões galoisianas de grau par, apresentamos algumas condições suficientes que garantem a não existência de bases normais auto-duais<br>In this work, we present a study about the existence or not of self-dual normal bases for finite galoisian extensions of fields, showing that all the odd degree finite galoisian extension has a self-dual normal

APA, Harvard, Vancouver, ISO, and other styles

39

Schneider, Franziska [Verfasser], and Uwe [Akademischer Betreuer] Jannsen. "On the structure of the absolute Galois group of local fields with residue characteristic 2 / Franziska Schneider ; Betreuer: Uwe Jannsen." Regensburg : Universitätsbibliothek Regensburg, 2016. http://d-nb.info/112235570X/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Amorós, Carafí Laia. "Images of Galois representations and p-adic models of Shimura curves." Doctoral thesis, Universitat de Barcelona, 2016. http://hdl.handle.net/10803/471452.

Full text

Abstract:

The Langlands program is a vast and unifying network of conjectures that connect the world of automorphic representations of reductive algebraic groups and the world of Galois representations. These conjectures associate an automorphic representation of a reductive algebraic group to every n-dimensional representation of a Galois group, and the other way around: they attach a Galois representation to any automorphic representation of a reductive algebraic group. Moreover, these correspondences are done in such a way that the automorphic L-functions attached to the two objects coincide. T

APA, Harvard, Vancouver, ISO, and other styles

41

Ferreira, Luan Alberto. "Teoria de corpos de classe e aplicações." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-05122012-102820/.

Full text

Abstract:

Neste projeto, propomos estudar a chamada \"Teoria de Corpos de Classe,\" que oferece uma descrição simples das extensões abelianas de corpos locais e globais, bem como algumas de suas aplicações, como os teoremas de Kronecker-Weber e Scholz-Reichardt<br>In this work, we study the so called \"Class Field Theory\", which give us a simple description of the abelian extension of local and global elds. We also study some applications, like the Kronecker-Weber and Scholz-Reichardt theorems

APA, Harvard, Vancouver, ISO, and other styles

42

Klaimi, Rami. "Etude de turbocodes non binaires pour les futurs systèmes de communication et de diffusion." Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2019. http://www.theses.fr/2019IMTA0141.

Full text

Abstract:

Les systèmes de téléphonie mobile de 4ème et 5ème générations ont adopté comme techniques de codage de canal les turbocodes, les codes LDPC et les codes polaires binaires. Cependant, ces codes ne permettent pas de répondre aux exigences, en termes d’efficacité spectrale et de fiabilité, pour les réseaux de communications futurs (2030 et au-delà), qui devront supporter de nouvelles applications telles que les communications holographiques, les véhicules autonomes, l’internet tactile … Un premier pas a été fait il y a quelques années vers la définition de codes correcteurs d’erreurs plus puissan

APA, Harvard, Vancouver, ISO, and other styles

43

Baboin, Anne-Céline. "Calcul quantique : algèbre et géométrie projective." Electronic Thesis or Diss., Besançon, 2011. http://www.theses.fr/2011BESA2028.

Full text

Abstract:

Cette thèse a pour première vocation d’être un état de l’art sur le calcul quantique, sinon exhaustif, simple d’accès (chapitres 1, 2 et 3). La partie originale de cet essai consiste en deux approches mathématiques du calcul quantique concernant quelques systèmes quantiques : la première est de nature algébrique et fait intervenir des structures particulières : les corps et les anneaux de Galois (chapitre 4), la deuxième fait appel à la géométrie dite projective (chapitre 5). Cette étude a été motivée par le théorème de Kochen et Specker et par les travaux de Peres et Mermin qui en ont découlé

APA, Harvard, Vancouver, ISO, and other styles

44

Nguyen, Manh-Linh. "Cohomological studies of rational points over fields of arithmetico-geometric nature." Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASM010.

Full text

Abstract:

Dans cette thèse, nous étudions de divers problèmes arithmétiques, notamment l'existence de points rationnels et l'approximation faible sur certaines variétés sur des corps de nombres et leurs analogues géométriques.Après le premier chapitre d'introduction, nous présentons dans le deuxième chapitre quelques résultats obtenus par des calculs cocycliques en cohomologie galoisienne (abélienne ou non abélienne). Nous considérons d'abord une formule de Borovoi-Demarche-Harari pour le groupe de Brauer algébrique non ramifié d'espaces homogènes. Nous établissons ensuite le principe de Hasse et l'appr

APA, Harvard, Vancouver, ISO, and other styles

45

Baboin, Anne-Céline. "Calcul quantique : algèbre et géométrie projective." Phd thesis, Université de Franche-Comté, 2011. http://tel.archives-ouvertes.fr/tel-00600387.

Full text

Abstract:

Cette thèse a pour première vocation d'être un état de l'art sur le calcul quantique, sinon exhaustif, simple d'accès (chapitres 1, 2 et 3). La partie originale de cet essai consiste en deux approches mathématiques du calcul quantique concernant quelques systèmes quantiques : la première est de nature algébrique et fait intervenir des structures particulières : les corps et les anneaux de Galois (chapitre 4), la deuxième fait appel à la géométrie dite projective (chapitre 5). Cette étude a été motivée par le théorème de Kochen et Specker et par les travaux de Peres et Mermin qui en ont découlé

APA, Harvard, Vancouver, ISO, and other styles

46

Grimnell, Mikael, and Mats Tjäder. "Efficient Message Passing Decoding Using Vector-based Messages." Thesis, Linköping University, Department of Electrical Engineering, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5205.

Full text

Abstract:

<p>The family of Low Density Parity Check (LDPC) codes is a strong candidate to be used as Forward Error Correction (FEC) in future communication systems due to its strong error correction capability. Most LDPC decoders use the Message Passing algorithm for decoding, which is an iterative algorithm that passes messages between its variable nodes and check nodes. It is not until recently that computation power has become strong enough to make Message Passing on LDPC codes feasible. Although locally simple, the LDPC codes are usually large, which increases the required computation power. Earlier

APA, Harvard, Vancouver, ISO, and other styles

47

Sarr, Ndeye Coumba. "Théorie de Bass-Serre profinie." Thesis, Normandie, 2020. http://www.theses.fr/2020NORMC216.

Full text

Abstract:

La théorie de Bass-Serre a été développée en 1970 par Jean-Pierre Serre, dans [Ser77]. Elle a pour motivation principale d'étudier la structure des sous-groupes discrets et sans torsion de SL2(Qp), plus précisément le théorème d'Ihara suivant lequel ces sous-groupes sont libres. S'inspirant de la topologie notamment de la théorie des revêtements, il devient alors plus naturel, explique J-P Serre de montrer la liberté d'un groupe en le faisant agir librement sur un arbre. Il en déduit ainsi une preuve simple et élégante de ce théorème jugé mystérieux et permet de généraliser plusieurs résultats

APA, Harvard, Vancouver, ISO, and other styles

48

Santos, Duilio Ferreira. "Elementos da teoria algébrica das formas quadráticas e de seus anéis graduados." Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-22062016-104927/.

Full text

Abstract:

Neste trabalho procuramos realizar uma apresentação autocontida sobre os conceitos da teoria algébrica de formas quadráticas e sobre os anéis graduados que surgiram no desenvolvimento desta teoria. Iniciamos procurando esclarecer o sentido da equivalência entre as várias acepções do conceito de forma quadrática. Após a apresentação de ingredientes e resultados geométricos, fazemos um extrato da teoria dos anéis de Witt, conceito que originou a moderna teoria algébrica de formas quadráticas. Disponibilizamos os elementos fundamentais para a formulação das teorias de cohomologia, nos concentrado

APA, Harvard, Vancouver, ISO, and other styles

49

BOLLO, MATTEO. "Architectures and Design Methodologies for Micro and Nanocomputing." Doctoral thesis, Politecnico di Torino, 2017. http://hdl.handle.net/11583/2679368.

Full text

Abstract:

For many years, the transistors placement was not limited by interconnections thanks to the Digital Integrated Circuits market that is changing from a situation where CMOS technology was the reference (microelectronics era) to a plurality of emerging technologies (nanoelectronics era). The costs of optics photolithography needed to produce the recent CMOS technologies are increasing to such an extent as to make interesting the exploration of nanoelectronics alternative solutions. These technologies are called beyond CMOS technologies. Among the application fields, Information Security is one

APA, Harvard, Vancouver, ISO, and other styles

50

Izquierdo, Diego. "Dualité et principe local-global sur les corps de fonctions." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS345/document.

Full text

Abstract:

Dans cette thèse, nous nous intéressons à l'arithmétique de certains corps de fonctions. Nous cherchons à établir dans un premier temps des théorèmes de dualité arithmétique sur ces corps, pour les appliquer ensuite à l'étude des points rationnels sur certaines variétés algébriques. Dans les trois premiers chapitres, nous travaillons sur le corps des fonctions d'une courbe sur un corps local supérieur (comme Qp, Qp((t)), C((t)) ou C((t))((u))). Dans le premier chapitre, nous établissons sur un tel corps des théorèmes de dualité arithmétique « à la Poitou-Tate » pour les modules finis, les tore

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!