• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 55
  • 12
  • 8
  • 6
  • 3
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 99
  • 99
  • 38
  • 27
  • 22
  • 21
  • 17
  • 15
  • 15
  • 15
  • 15
  • 14
  • 14
  • 12
  • 12
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

Reducibility of Polynomials over Finite Fields

Imran, Muhammad January 2012 (has links)
Reducibility of certain class of polynomials over Fp, whose degree depends on p, can be deduced by checking the reducibility of a quadratic and cubic polynomial. This thesis explains how can we speeds up the reducibility procedure.
12

Hypergeometric functions over finite fields and their relations to algebraic curves.

Vega Veglio, Maria V. 2009 May 1900 (has links)
Classical hypergeometric functions and their relations to counting points on curves over finite fields have been investigated by mathematicians since the beginnings of 1900. In the mid 1980s, John Greene developed the theory of hypergeometric functions over finite fi elds. He explored the properties of these functions and found that they satisfy many summation and transformation formulas analogous to those satisfi ed by the classical functions. These similarities generated interest in finding connections that hypergeometric functions over finite fields may have with other objects. In recent years, connections between these functions and elliptic curves and other Calabi-Yau varieties have been investigated by mathematicians such as Ahlgren, Frechette, Fuselier, Koike, Ono and Papanikolas. A survey of these results is given at the beginning of this dissertation. We then introduce hypergeometric functions over finite fi elds and some of their properties. Next, we focus our attention on a particular family of curves and give an explicit relationship between the number of points on this family over Fq and sums of values of certain hypergeometric functions over Fq. Moreover, we show that these hypergeometric functions can be explicitly related to the roots of the zeta function of the curve over Fq in some particular cases. Based on numerical computations, we are able to state a conjecture relating these values in a more general setting, and advances toward the proof of this result are shown in the last chapter of this dissertation. We nish by giving various avenues for future study.
13

Efficient algorithms for finite fields, with applications in elliptic curve cryptography

Baktir, Selcuk. January 2003 (has links)
Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: multiplication; OTF; optimal extension fields; finite fields; optimal tower fields; cryptography; OEF; inversion; finite field arithmetic; elliptic curve cryptography. Includes bibliographical references (p. 50-52).
14

On the undecidability of certain finite theories

Garfunkel, Solomon A., January 1967 (has links)
Thesis (Ph. D.)--University of Wisconsin, 1967. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.
15

Low complexity normal bases /

Thomson, David January 1900 (has links)
Thesis (M.SC.) - Carleton University, 2007. / Includes bibliographical references (p. 108-109). Also available in electronic format on the Internet.
16

An examination of the structure of extension families of irreducible polynomials over finite fields /

Psioda, Matthew January 2006 (has links) (PDF)
Thesis (M.S.)--University of North Carolina at Wilmington, 2006. / Includes bibliographical references (leaf: [42])
17

An algebraic approach to modelling the regulation of gene expression

Aleem, Hosam Abdel January 2011 (has links)
Biotechnology is witnessing a remarkable growth evident both in the types of new products and in the innovative new processes developed. More efficient process design, optimisation and troubleshooting can be achieved through a better understanding of the underlying biological processes inside the cell; a key one of which is the regulation of gene expression. For engineers such understanding is attained through mathematical modelling, and the most commonly used models of gene expression regulation are those based on differential equations, as they give quantitative results. However, those results are undermined by several difficulties including the large number of parameters some of which, such as kinetic constants, are difficult to determine. This prompted the development of qualitative models, most notably Boolean models, based on the assumption that biological variables are binary in nature, e.g. a gene can be on or off and a chemical species present or absent. There are situations however, where different actions take place in the cell at different threshold values of the biological variables, and hence the binary assumption no longer holds.The purpose of this study was to develop a method for modelling gene regulatory functions where the variables can be thought of as taking more than two discrete values. A method was developed, where, with the appropriate assumptions the biological variables can be regarded as elements of an algebraic structure known as a finite field, in which case the regulatory function can be considered as a function on such a field.The formulation was adopted from electronic engineering, and leads to a polynomial known as the Reed-Muller expansion of the discrete function.The model was first developed for the more familiar binary case. It was given three different algebraic interpretations each enabling the study of a different biological problem, albeit related to gene regulation. The first interpretation is as a function on a Boolean algebra, but using the Exclusive OR (XOR) operation instead of the OR operation. The discriminating superiority of the XOR allows a more efficient determination of the gene regulatory function from the data, a problem known as reverse engineering.The second interpretation is as a polynomial on a finite field, where analogy with the Taylor series expansion of a real valued function allowed the coefficients of the expansion to be thought of as conveying sensitivity information. Furthermore a method was devised to detect mutation in the cell by regarding the problem as detecting a fault in a digital circuit.The third interpretation is as a transform on a discrete function space, which was demonstrated to be useful in synthetic biology design. The method was then extended to the multiple-valued case and demonstrated with modelling the gene regulation of a well known example system, the bacteriophage lambda.
18

Algebraic aspects of integrability and reversibility in maps

Jogia, Danesh Michael, Mathematics & Statistics, Faculty of Science, UNSW January 2008 (has links)
We study the cause of the signature over finite fields of integrability in two dimensional discrete dynamical systems by using theory from algebraic geometry. In particular the theory of elliptic curves is used to prove the major result of the thesis: that all birational maps that preserve an elliptic curve necessarily act on that elliptic curve as addition under the associated group law. Our result generalises special cases previously given in the literature. We apply this theorem to the specific cases when the ground fields are finite fields of prime order and the function field $mathbb{C}(t)$. In the former case, this yields an explanation of the aforementioned signature over finite fields of integrability. In the latter case we arrive at an analogue of the Arnol'd-Liouville theorem. Other results that are related to this approach to integrability are also proven and their consequences considered in examples. Of particular importance are two separate items: (i) we define a generalization of integrability called mixing and examine its relation to integrability; and (ii) we use the concept of rotation number to study differences and similarities between birational integrable maps that preserve the same foliation. The final chapter is given over to considering the existence of the signature of reversibility in higher (three and four) dimensional maps. A conjecture regarding the distribution of periodic orbits generated by such maps when considered over finite fields is given along with numerical evidence to support the conjecture.
19

Algebraic aspects of integrability and reversibility in maps

Jogia, Danesh Michael, Mathematics & Statistics, Faculty of Science, UNSW January 2008 (has links)
We study the cause of the signature over finite fields of integrability in two dimensional discrete dynamical systems by using theory from algebraic geometry. In particular the theory of elliptic curves is used to prove the major result of the thesis: that all birational maps that preserve an elliptic curve necessarily act on that elliptic curve as addition under the associated group law. Our result generalises special cases previously given in the literature. We apply this theorem to the specific cases when the ground fields are finite fields of prime order and the function field $mathbb{C}(t)$. In the former case, this yields an explanation of the aforementioned signature over finite fields of integrability. In the latter case we arrive at an analogue of the Arnol'd-Liouville theorem. Other results that are related to this approach to integrability are also proven and their consequences considered in examples. Of particular importance are two separate items: (i) we define a generalization of integrability called mixing and examine its relation to integrability; and (ii) we use the concept of rotation number to study differences and similarities between birational integrable maps that preserve the same foliation. The final chapter is given over to considering the existence of the signature of reversibility in higher (three and four) dimensional maps. A conjecture regarding the distribution of periodic orbits generated by such maps when considered over finite fields is given along with numerical evidence to support the conjecture.
20

Coset intersection problem and application to 3-nets

Unknown Date (has links)
In a projective plane (PG(2, K) defined over an algebraically closed field K of characteristic p = 0, we give a complete classification of 3-nets realizing a finite group. The known infinite family, due to Yuzvinsky, arised from plane cubics and comprises 3-nets realizing cyclic and direct products of two cyclic groups. Another known infinite family, due to Pereira and Yuzvinsky, comprises 3-nets realizing dihedral groups. We prove that there is no further infinite family and list all possible sporadic examples. If p is larger than the order of the group, the same classification holds true apart from three possible exceptions: Alt4, Sym4 and Alt5. / by Nicola Pace. / Thesis (Ph.D.)--Florida Atlantic University, 2012. / Includes bibliography. / System requirements: Adobe Reader. / Mode of access: World Wide Web.

Page generated in 0.0479 seconds