Open Access. Powered by Scholars. Published by Universities.®

Number Theory Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 7 of 7

Full-Text Articles in Number Theory

Arithmetical Structures On Paths With A Doubled Edge, Darren B. Glass, Joshua R. Wagner Aug 2020

Arithmetical Structures On Paths With A Doubled Edge, Darren B. Glass, Joshua R. Wagner

Math Faculty Publications

An arithmetical structure on a graph is given by a labeling of the vertices that satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical structures for graphs in these families.


Multiparty Non-Interactive Key Exchange And More From Isogenies On Elliptic Curves, Dan Boneh, Darren B. Glass, Daniel Krashen, Kristin Lauter, Shahed Sharif, Alice Silverberg, Mehdi Tibouchi, Mark Zhandry Jun 2020

Multiparty Non-Interactive Key Exchange And More From Isogenies On Elliptic Curves, Dan Boneh, Darren B. Glass, Daniel Krashen, Kristin Lauter, Shahed Sharif, Alice Silverberg, Mehdi Tibouchi, Mark Zhandry

Math Faculty Publications

We describe a framework for constructing an efficient non-interactive key exchange (NIKE) protocol for n parties for any n ≥ 2. Our approach is based on the problem of computing isogenies between isogenous elliptic curves, which is believed to be difficult. We do not obtain a working protocol because of a missing step that is currently an open mathematical problem. What we need to complete our protocol is an efficient algorithm that takes as input an abelian variety presented as a product of isogenous elliptic curves, and outputs an isomorphism invariant of the abelian variety.

Our framework builds a cryptographic …


On A Frobenius Problem For Polynomials, Ricardo Conceição, R. Gondim, M. Rodriguez Sep 2017

On A Frobenius Problem For Polynomials, Ricardo Conceição, R. Gondim, M. Rodriguez

Math Faculty Publications

We extend the famous diophantine Frobenius problem to a ring of polynomials over a field~k. Similar to the classical problem we show that the n = 2 case of the Frobenius problem for polynomials is easy to solve. In addition, we translate a few results from the Frobenius problem over ℤ to k[t] and give an algorithm to solve the Frobenius problem for polynomials over a field k of sufficiently large size.


Cyclic Critical Groups Of Graphs, Ryan P. Becker, Darren B. Glass Feb 2016

Cyclic Critical Groups Of Graphs, Ryan P. Becker, Darren B. Glass

Math Faculty Publications

In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the group exactly.


A Frobenius Question Related To Actions On Curves In Characteristic P, Darren B. Glass Jan 2014

A Frobenius Question Related To Actions On Curves In Characteristic P, Darren B. Glass

Math Faculty Publications

We consider which integers g can occur as the genus and of a curve defined over a field of characteristic p which admits an automorphism of degree pq, where p and q are distinct primes. This investigation leads us to consider a certain family of three-dimensional Frobenius problems and prove explicit formulas giving their solution in many cases.


Pointless Hyperelliptic Curves, Ryan P. Becker, Darren B. Glass Jan 2013

Pointless Hyperelliptic Curves, Ryan P. Becker, Darren B. Glass

Math Faculty Publications

In this paper we consider the question of whether there exists a hyperelliptic curve of genus g which is defined over but has no rational points over for various pairs . As an example of such a result, we show that if p is a prime such that is also prime then there will be pointless hyperelliptic curves over of every genus.


Galois Structure And De Rhan Invariants Of Elliptic Curves, Darren B. Glass, Sonin Kwon Jan 2009

Galois Structure And De Rhan Invariants Of Elliptic Curves, Darren B. Glass, Sonin Kwon

Math Faculty Publications

Let K be a number field with ring of integers OK. Suppose a finite group G acts numerically tamely on a regular scheme X over OK. One can then define a de Rham invariant class in the class group Cl(OK[G]), which is a refined Euler characteristic of the de Rham complex of X. Our results concern the classification of numerically tame actions and the de Rham invariant classes. We first describe how all Galois etale G-covers of a K-variety may be built up from finite Galois extensions of K and from geometric covers. When X is a curve of positive …