Sökning: "Diophantine equations"

Hittade 4 avhandlingar innehållade orden Diophantine equations.

  1. 1. Counting solutions to Diophantine equations

    Författare :Oscar Marmon; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Integral points; rational points; counting function; exponential sums; Weyl differencing; van der Corput s method; determinant method; sum of k-th powers; counting function;

    Sammanfattning : This thesis presents various results concerning the density of rational and integral points on algebraic varieties. These results are proven with methods from analytic number theory as well as algebraic geometry. LÄS MER

  3. 2. On the density of solutions to Diophantine equations

    Författare :Oscar Marmon; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; integral points; exponential sums; Weyl differencing; van der Corput s method; van der Corput s method;

    Sammanfattning : .... LÄS MER

  4. 3. Counting rational points on genus one curves

    Författare :Manh Hung Tran; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Diophantine equations; rational points; Elliptic curves; genus; descent; determinant method; cubic and quartic curves; genus;

    Sammanfattning : This thesis contains two papers dealing with counting problems for curves of genus one. We obtain uniform upper bounds for the number of rational points of bounded height on such curves. The main tools to study these problems are descent and various refined versions of Heath-Brown’s p-adic determinant method. LÄS MER

  5. 4. Automatic Verification of Petri Netsin a CLP framework

    Författare :Hans Olsén; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis presents an approach to automatic verification of Petri Nets. The method is formulated in a CLP framework and the class of systems we consider is characterized syntactically as a special class of Constraint Logic Programs. The state space of the system in question coincides with the least fixpoint of the program. LÄS MER