La multiplication dans le corps de Galois à 2^m éléments (i.e. GF(2^m)) est une opérations très importante pour les applications de la théorie des correcteurs et de la cryptographie. Dans ce mémoire, nous nous intéressons aux réalisations parallèles de multiplicateurs dans GF(2^m) lorsque ce dernier est généré par des trinômes irréductibles. Notre point de départ est le multiplicateur de Montgomery qui calcule A(x)B(x)x^(-u) efficacement, étant donné A(x), B(x) in GF(2^m) pour u choisi judicieusement. Nous étudions ensuite l'algorithme diviser pour régner PCHS qui permet de partitionner les multiplicandes d'un produit dans GF(2^m) lorsque m est impair. Nous l'appliquons pour la partitionnement de A(x) et de B(x) dans la multiplication de Montgomery A(x)B(x)x^(-u) pour GF(2^m) même si m est pair. Basé sur cette nouvelle approche, nous construisons un multiplicateur dans GF(2^m) généré par des trinôme irréductibles. Une nouvelle astuce de réutilisation des résultats intermédiaires nous permet d'éliminer plusieurs portes XOR redondantes. Les complexités de temps (i.e. le délais) et d'espace (i.e. le nombre de portes logiques) du nouveau multiplicateur sont ensuite analysées: 1. Le nouveau multiplicateur demande environ 25% moins de portes logiques que les multiplicateurs de Montgomery et de Mastrovito lorsque GF(2^m) est généré par des trinômes irréductible et m est suffisamment grand. Le nombre de portes du nouveau multiplicateur est presque identique à celui du multiplicateur de Karatsuba proposé par Elia. 2. Le délai de calcul du nouveau multiplicateur excède celui des meilleurs multiplicateurs d'au plus deux évaluations de portes XOR. 3. Nous determinons le délai et le nombre de portes logiques du nouveau multiplicateur sur les deux corps de Galois recommandés par le National Institute of Standards and Technology (NIST). Nous montrons que notre multiplicateurs contient 15% moins de portes logiques que les multiplicateurs de Montgomery et de Mastrovito au coût d'un délai d'au plus une porte XOR supplémentaire. De plus, notre multiplicateur a un délai d'une porte XOR moindre que celui du multiplicateur d'Elia au coût d'une augmentation de moins de 1% du nombre total de portes logiques. / The multiplication in a Galois field with 2^m elements (i.e. GF(2^m)) is an important arithmetic operation in coding theory and cryptography. In this thesis, we focus on the bit- parallel multipliers over the Galois fields generated by trinomials. We start by introducing the GF(2^m) Montgomery multiplication, which calculates A(x)B(x)x^{-u} in GF(2^m) with two polynomials A(x), B(x) in GF(2^m) and a properly chosen u. Then, we investigate the rule for multiplicand partition used by a divide-and-conquer algorithm PCHS originally proposed for the multiplication over GF(2^m) with odd m. By adopting similar rules for splitting A(x) and B(x) in A(x)B(x)x^{-u}, we develop new Montgomery multiplication formulae for GF(2^m) with m either odd or even. Based on this new approach, we develop the corresponding bit-parallel Montgomery multipliers for the Galois fields generated by trinomials. A new bit-reusing trick is applied to eliminate redundant XOR gates from the new multiplier. The time complexity (i.e. the delay) and the space complexity (i.e. the logic gate number) of the new multiplier are explicitly analysed: 1. This new multiplier is about 25% more efficient in the number of logic gates than the previous trinomial-based Montgomery multipliers or trinomial-based Mastrovito multipliers on GF(2^m) with m big enough. It has a number of logic gates very close to that of the Karatsuba multiplier proposed by Elia. 2. While having a significantly smaller number of logic gates, this new multiplier is at most two T_X larger in the total delay than the fastest bit-parallel multiplier on GF(2^m), where T_X is the XOR gate delay. 3. We determine the space and time complexities of our multiplier on the two fields recommended by the National Institute of Standards and Technology (NIST). Having at most one more T_X in the total delay, our multiplier has a more-than-15% reduced logic gate number compared with the other Montgomery or Mastrovito multipliers. Moreover, our multiplier is one T_X smaller in delay than the Elia's multiplier at the cost of a less-than-1% increase in the logic gate number.

La thèse comporte six chapitres. Dans le premier chapitre, on rappelle les bases de la théorie et on étudie la structure des algèbres Hom-associatives ainsi que les différentes constructions comme la composition avec des endomorphismes qui nous permet de construire de nouveaux objets et d’établir certaines nouvelles propriétés. Parmi les résultats originaux, on peut signaler l’étude des algèbres Hom-associatives simples ainsi que leurs constructions. On a montré que toutes les algèbres Hom-associatives multiplicatives simples s’obtiennent par composition d’algèbres simples et d’automorphismes. Dans le deuxième chapitre, on commence par étudier les propriétés des changements de base dans ces structures algébriques. On a calculé la base de Gröbner de l’idéal engendrant la variété algébrique des algèbres Hom-associatives de dimension 2 où la multiplication µ et l’application linéaire α sont identifiées à leurs constantes de structure relativement à une base donnée. La classification, à isomorphisme près, des algèbres Hom-associatives unitaires et non unitaires est établie en dimension 2 et 3. On a aussi décrit les algèbres de type associatif en se basant sur le théorème de twist de Yau. Dans le troisième chapitre, on étudie certaines propriétés et invariants comme les dérivations, αk-dérivations où k est un entier positif. Dans le quatrième chapitre, on établit la cohomologie de ces algèbres. On a pu lister les algèbres rigides grâce à leur classe de cohomologie puis on s'est 'intéressé aux déformations infinitésimales et dégénérations. D’une part, la cohomologie et déformation de ces algèbres nous a permis d’identifier les algèbres rigides dont le deuxième groupe de cohomologie est nulle, et d’autre part de caractérisation de composante irréductible. Dans le cinquième chapitre, on s’intéresse aux structures Rota-Baxter de poids λ ϵK de ces algèbres. Enfin, dans le dernier chapitre, on a travaillé sur les structures Hom-bialgèbres et leurs invariants. / The purpose of this thesis is to study the structure of Hom-associative algebras and provide classifications. Among the results obtained in this thesis, we provide 2-dimensional and 3-dimensional Hom-associative algebras and give a characterization of multiplicative simple Hom-associative algebras. Moreover we compute some invariants and discuss irreducible components of the corresponding algebraic varieties. The thesis is organized as follows. In the first chapter we give the basics about Hom-associative algebras and provide some new properties. Moreover, we discuss unital Hom-associative algebras. Chapter 2 deals with simple multiplicative Hom-associative algebras. We present one of the main results of this paper, that is a characterization of simple multiplicative Hom-associative algebras. Indeed, we show that they are all obtained by twistings of simple associative algebras. Chapter 3 is dedicated to describe algebraic varieties of Hom-associative algebras and provide classifications, up to isomorphism, of 2-dimensional and 3-dimensional Hom-associative algebras. In chapter 4, we compute their derivations and twisted derivations, whereas in chapter 5, we compute their Hom-Type Hochschild cohomology. In the last section of this chapter, we consider the geometric classification problem using one-parameter formel deformations, and describe the irreducible components. In chapter 6, we compute Rota-Baxter structures of weight k of Hom-associative algebras appearing in our classification. In chapter 7, We work out Hom-bialgebras structures as well as their invariants. Properties and classifications, as well as the calculation of certain invariants such as the first and second cohomology groups, were studied.

Cette thèse a pour contexte la combinatoire énumérative et décrit la construction de plusieurs bijections entre modèles combinatoires connus ou nouveaux de suites d'entiers et polynômes, plus particulièrement celle des nombres de Genocchi (et de leurs extensions, les polynômes de Gandhi) qui interviennent dans diverses branches des mathématiques et dont les propriétés combinatoires sont de ce fait activement étudiées, et celles de polynômes q-eulériens associés aux quatre statistiques fondamentales de MacMahon sur les permutations ainsi qu'à des statistiques analogues. On commence par définir les permutations de Dumont normalisées, un modèle combinatoire des nombres de Genocchi médians normalisés q-étendus, notés ¯cn(q) et définis par Han et Zeng, puis l'on construit une première bijection entre ce modèle et l'ensemble des configurations de Dellac, autre interprétation combinatoire de ¯cn(q) mise en évidence par Feigin dans le contexte de la géométrie des grassmanniennes de carquois. En s'appuyant sur la théorie des fractions continues de Flajolet, on en construit finalement un troisième modèle combinatoire à travers les histoires de Dellac, que l'on relie aux premiers modèles sus-cités au moyen d'une seconde bijection. On s'intéresse ensuite à la classe combinatoire des k-formes irréductibles définies par Hivert et Mallet dans l'étude des k-fonctions de Schur, et qui faisaient l'objet d'une conjecture supposant que les polynômes de Gandhi sont générés par les k-formes irréductibles selon la statistique des k-sites libres. On construit une bijection entre les k-formes irréductibles et les pistolets surjectifs de hauteur k − 1 (connus pour générer les polynômes de Gandhi selon la statistique des points fixes) envoyant les k-sites libres des premières sur les points fixes des seconds, démontrant de ce fait la conjecture. Enfin, on établit une nouvelle identité combinatoire entre deux polynômes q-eulériens définis par des statistiques eulériennes et mahoniennes sur l'ensemble des permutations d'un ensemble fini, au moyen d'une dernière bijection sur les permutations, qui envoie une suite finie de statistiques sur une autre / This work is set in the context of enumerative combinatorics and constructs several statistic-preserving bijections between known or new combinatorial models of sequences of integers or polynomials, espacially the sequence of Genocchi numbers (and their extensions, the Gandhi polynomials) which appear in numerous mathematical theories and whose combinatorial properties are consequently intensively studied, and two sequences of q-Eulerian polynomials associated with the four fundamental statistics on permutations studied by MacMahon, and with analog statistics. First of all, we define normalized Dumont permutations, a combinatorial model of the q-extended normalized median Genocchi numbers ¯cn(q) introduced by Han and Zeng, and we build a bijection between the latter model and the set of Dellac configurations, which have been proved by Feigin to generate ¯cn(q) by using the geometry of quiver Grassmannians. Then, in order to answer a question raised by the theory of continued fractions of Flajolet, we define a new combinatorial model of ¯cn(q), the set of Dellac histories, and we relate them with the previous combinatorial models through a second statistic-preserving bijection. Afterwards, we study the set of irreducible k-shapes defined by Hivert and Mallet in the topic of k-Schur functions, which have been conjectured to generate the Gandhi polynomials with respect to the statistic of free ksites. We construct a statistic-preserving bijection between the irreducible k-shapes and the surjective pistols of height k−1 (well-known combinatorial interpretation of the Gandhi polynomials with respect to the fixed points statistic) mapping the free k-sites to the fixed points, thence proving the conjecture. Finally, we prove a new combinatorial identity between two eulerian polynomials defined on the set of permutations thanks to Eulerian and Mahonian statistics, by constructing a bijection on the permutations, which maps a finite sequence of statistics on another

Seja S(gl_n) a álgebra simétrica da álgebra de Lie das matrizes de tamanho nxn sobre o corpo C dos números complexos. Para \\xi em gl_n*=gl_n, seja F_{\\xi}(gl_n) a asubálgebra de Mishchenko-Fomenko de S(gl_n) construída pelo método de deslocamento de argumento associada ao parâmetro \\xi. É conhecido que se \\xi é um elemento semisimples regular ou nilpotente regular então a subálgebra F_{\\xi}(gl_n) é gerada por uma sequência regular em S(gl_n). Nesta tese é provado que em gl_3 o resultado estende para todo \\xi em gl_3, isto é, as subálgebras de Mishchenco-Fomenko F_{\\xi}(gl_3) são geradas por uma sequência regular em S(gl_3), uma consequência deste fato é que os módulo irredutíveis sobre certas subálgebras comutativas da álgebra envolvente universal U(gl_3) podem ser levantados a módulos irredutiveis sobre U(gl_3). Além disso, é provado que em gl_4 esse resultado é válido para todo elemento nilpotente \\xi em gl_4. O caso geral, que é determinar quando as subálgebras de Mishchenko-Fomenko F_{\\xi}(gl_n) , com \\xi em gl_n, são geradas por uma sequência regular em S(gl_n), é ainda um problema aberto. / Let S(gl_n) be the symmetric algebra of the Lie algebra of the matrices of size nxn over the field C of complex numbers. For \\xi in gl_n*=gl_n, let F_{\\xi}(gl_n) be the Mishchenko-Fomenko subalgebra of S(gl_n) constructed by the argument shift method associated with the parameter \\xi. It is known that if \\xi is a semisimple regular element or nilpotent regular element then the subalgebra F_(g_ln) is generated by a regular sequence in S(gl_n). In this thesis we prove that in gl_3 the result is extended to all \\xi in gl_3, this is, the Mishchenco-Fomenko subalgebras F_{\\xi}(gl3) are generated by a regular sequence in S(gl_3), A consequence of this fact is that the irreducible modules over certain commutative subalgebras of the universal enveloping algebra U(gl_3) can it be lifted to irreducible modules over U(gl_3). Furthermore, is proved that this result is true for all elements nilpotente \\xi in gl_4. The general case, which is determined when the Mishchenko-Fomenko subalgebras F_{\\xi}(gl_n), with \\xi in gl_n, are generated by a regular sequence in S(gl_n), it is still an open problem.

Submitted by JÚLIO HEBER SILVA (julioheber@yahoo.com.br) on 2017-07-05T20:29:06Z No. of bitstreams: 2 Dissertação - Emile Raymond Ferreira Taillebois - 2013.pdf: 1511356 bytes, checksum: 65cfae075ab1d008ea3249e5ffc19da9 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Cláudia Bueno (claudiamoura18@gmail.com) on 2017-07-07T19:11:05Z (GMT) No. of bitstreams: 2 Dissertação - Emile Raymond Ferreira Taillebois - 2013.pdf: 1511356 bytes, checksum: 65cfae075ab1d008ea3249e5ffc19da9 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2017-07-07T19:11:05Z (GMT). No. of bitstreams: 2 Dissertação - Emile Raymond Ferreira Taillebois - 2013.pdf: 1511356 bytes, checksum: 65cfae075ab1d008ea3249e5ffc19da9 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2013-11-08 / Conselho Nacional de Pesquisa e Desenvolvimento Científico e Tecnológico - CNPq / In this dissertation, the use of the partial trace of momentum degrees of freedom in the construction of spin reduced density matrices for relativistic massive systems is analyzed. In the regime considered here, massive particles can be described by irreducible unitary representations of the Poincar e group, and the base states are labeled by the dynamical variables of momentum and spin. The reduced density matrices obtained by the partial trace of momenta have unusual properties, since they are not covariant under the action of restricted Lorentz transformations. That behavior produces some important consequences in the study of quantum information in relativistic systems. However, recent arguments have been presented against the use of those matrices in the description of processes involving the transfer of information stored in spin degrees of freedom of relativistic massive particles. Those criticisms are discussed in this dissertation and a connection with the structure of the space of states associated with a given unitary representation is established through a detailed study of the induced representation method applied to the Poincar e group. This allows rewriting the criticisms in literature without the need of a speci c model of interaction for the spin measurement. Besides that, the analysis performed here allows to establish a new method to construct e ective spin reduced density matrices. The presented approach allows recovering the results in the literature and, at the same time, to incorporate the criticisms in a consistent way. However, it is necessary to abandon the usual partial trace of the momentum degrees of freedom and the interpretation in the literature for the spin reduced density matrices. The examples presented in the arguments against the usual spin reduced density matrices are studied using the approach proposed in this dissertation. / Nesta dissertação, a utilização do traço parcial dos momentos na construção de matrizes densidade reduzidas de spin para partículas massivas relativisticas é analisada. No regime considerado, as partículas massivas podem ser descritas por representações unitárias do grupo de Poincaré, e os estados de base são rotulados pelas variáveis dinâmicas de momento e spin. As matrizes reduzidas obtidas por meio do traço parcial dos momentos possuem propriedades inusitadas, pois não são covariantes sob a ação de transformações de Lorentz restritas. Essa característica traz consequências importantes para o estudo da teoria da informação quântica em sistemas relativísticos. No entanto, argumentos recentes têm sido apresentados contra o uso dessas matrizes nos processos de transmissões de informação envolvendo os graus de spin de partículas massivas. Essas críticas são discutidas neste trabalho e uma conexão com a estrutura do espaço de estados associado a representação unitária em questão é estabelecida por meio de um estudo detalhado do método das representações induzidas aplicado ao grupo de Poincaré. Isso permite reescrever as críticas presentes na literatura sem a necessidade de se introduzir um modelo específico de interação associado à medida do spin das partículas. Alem disso, a análise realizada nesta dissertação permite estabelecer um novo método para a construção de matrizes densidade reduzidas efetivas de spin. A proposta apresentada permite recuperar os resultados presentes na literatura e, ao mesmo tempo, incorporar as críticas de maneira consistente. No entanto, para isso é necessário abandonar o traço parcial usual dos graus de liberdade de momento e a interpretação dada na literatura para as matrizes densidade reduzidas de spin. Os exemplos apresentados nas argumentações contra as matrizes densidade reduzidas de spin usuais são estudados utilizando o método proposto neste trabalho.

Cette thèse comporte deux parties. Dans la première partie on étudie le motif de Chow d’un fibré en quadriques de dimension relative impaire sur une surface. On montre que ce motif admet une décomposition qui fait intervenir le motif de Prym du revêtement double de la courbe discriminante. Dans la deuxième partie on s’intéresse à des fibrations lagrangiennes, obtenues comme jacobiennes intermédiaires relatives des familles de variétés de Fano de dimension trois contenant une surface K3 fixée, et à l’existence d’une compactification symplectique. Dans un cas particulier, on étudie une compactification partielle en utilisant des calculs avec le logiciel Macaulay2. / This thesis consists of two parts. In the first part we study the Chow motive of a quadric bundle of odd relative dimension over a surface. We show that this motive admits a decomposition which involves the Prym motive of the double covering of the discriminant curve.In the second part, we consider Lagrangian fibrations, obtained as relative intermediate Jacobians of families of Fano threefolds containing a fixed K3 surface, and the existence of a symplectic compactification. In a particular case, we study a partial compactification using calculations with the software system Macaulay2.

In this master thesis we investigate completeness theorems in the framework of abstract algebraic logic. Our main interest lies in the completeness with respect to the so called relatively (finitely) subdirectly irreducible models. Notable part of the presented theory concerns the difference between finitary and infinitary logical systems. We focus on the well-known fact that the completeness theorem with respect to relatively (finitely) subdirectly irreducible models can be proven in general for all finitary logics and we discuss the possible of generalizing this theorem even to infinitary logics. We show that there are two interesting inter- mediate properties between this completeness and finitarity, namely (completely) intersection-prime extension properties. Based on these notions we define five classes of logics and propose a new hierarchy of finitary and infinitary logics. As a main contribution of this dissertation we present an example of a logic separat- ing some of these classes. Keywords: Abstract algebraic logic, completeness, relatively (finitely) sub- directly irreducible models, RSI-completeness, RFSI-completeness, (completely) intersection-prime extension property, IPEP, CIPEP.

In this work a numerical approach for the determination of the energy spectra and the calculation of thermodynamic properties of magnetic molecules is presented. The work is focused on the treatment of spin systems which exhibit point-group symmetries. Ring-like and archimedean-type structures are discussed as prominent examples. In each case the underlying spin quantum system is modeled by an isotropic Heisenberg Hamiltonian. Its energy spectrum is calculated either by numerical exact diagonalization or by an approximate diagonalization method introduced here. In order to implement full spin-rotational symmetry the numerical approach at hand is based on the use of irreducible tensor operators. Furthermore, it is shown how an unrestricted use of point-group symmetries in combination with the use of irreducible tensor operators leads to a reduction of the dimensionalities as well as to additional information about the physics of the systems. By exemplarily demonstrating how the theoretical foundations of the irreducible tensor operator technique can be realized within small spin systems the technical aspect of this work is covered. These considerations form the basis of the computational realization that was implemented and used in order to get insight into the investigated systems.

This dissertation explores an analogue of the prime number theorem for polynomials over finite fields as well as its connection to the necklace factorization algorithm T-transform and the string complexity measure T-complexity. Specifically, a precise asymptotic expansion for the prime polynomial counting function is derived. The approximation given is more accurate than previous results in the literature while requiring very little computational effort. In this context asymptotic series expansions for Lerch transcendent, Eulerian polynomials, truncated polylogarithm, and polylogarithms of negative integer order are also provided. The expansion formulas developed are general and have applications in numerous areas other than the enumeration of prime polynomials. A bijection between the equivalence classes of aperiodic necklaces and monic prime polynomials is utilized to derive an asymptotic bound on the maximal T-complexity value of a string. Furthermore, the statistical behaviour of uniform random sequences that are factored via the T-transform are investigated, and an accurate probabilistic model for short necklace factors is presented. Finally, a T-complexity based conditional string complexity measure is proposed and used to define the normalized T-complexity distance that measures similarity between strings. The T-complexity distance is proven to not be a metric. However, the measure can be computed in linear time and space making it a suitable choice for large data sets. / Graduate / 0544 0984 0405 / nrebenich@gmail.com

Cette thèse se compose de deux parties. Partie 1 étudie la décomposition des groupes de cohomologie pour une famille de courbes non hyperelliptiques de genre 3 avec une involution, et le bénéfice d'une telle décomposition dans le calcul de Frobenius utilisant l'algorithme de Kedlaya. L'involution d'une telle courbe C induit un morphisme de degré 2 vers une courbe elliptique E, ce qui donne une décomposition de Jac(C) en E et en une surface abélienne A, à partir desquelles le Frobenius sur C peut être récupérée. En E, le polynôme caractéristique du Frobenius peut être calculé en utilisant un algorithme efficace et rapide en pratique. En travaillant avec le sous-groupe V de $H^1_{MW}(C)$, on obtient une meilleure constante que l'application directe de la méthode de Kedlaya à C. À ma connaissance, ceci est la première utilisation de la décomposition de la cohomologie induite par une décomposition (à isogénie près) de la jacobienne en l'algorithme de Kedlaya. Dans partie 2, je propose une nouvelle approche aux distributions de Frobenius et aux groupes de Sato-Tate, qui utilise les relations d'orthogonalité des caractères irréductibles du groupe de Lie USp(2g) et ses sous-groupes. Dans ce but, je présente d'abord une méthode simple pour calculer les caractères irréductibles de USp(2g), et puis je développe un algorithme basé sur la formule de Brauer-Klimyk. Les avantages de cette nouvelle approche sont examinés en détail. J'utilise aussi la famille de courbes dans partie 1 comme une étude de cas. Les analyses et les comparaisons montrent que l'approche par la théorie des caractères est un outil plus intrinsèque et très prometteur pour l'étude des groupes de Sato-Tate. / This thesis consists of two parts. Part 1 studies the decomposition of cohomology groups induced by automorphisms for a family of non-hyperelliptic genus 3 curves with involution, and I investigate the benefit of such decomposition in the computation of Frobenius using Kedlaya's algorithm. The involution of a curve C in this family induces a degree 2 map to an elliptic curve E, which gives a decomposition of the Jacobian of C into E and an abelian surface A, from which the Frobenius on C can be recovered. On E, the characteristic polynomial of the Frobenius can be computed using an efficient and fast algorithm. By working with the cohomology subgroup V of $H^1_{MW}(C)$, we get a constant speed-up over a straightforward application of Kedlaya's method to C. To my knowledge, this is the first use of decomposition of the cohomology induced by an isogeny decomposition of the Jacobian in Kedlaya's algorithm. In Part 2, I propose a new approach to Frobenius distributions and Sato-Tate groups, which uses the orthogonality relations of the irreducible characters of the compact Lie group USp(2g) and its subgroups. To this purpose, I first present a simple method to compute the irreducible characters of USp(2g), then I develop an algorithm based on the Brauer-Klimyk formula. The advantages of this new approach to Sato-Tate groups are examined in detail. The results show that the error grows slowly. I also use the family of genus 3 curves studied in Part 1 as a case study. The analyses and comparisons show that the character theory approach is a more intrinsic and very promising tool for studying Sato-Tate groups.