The Subset Sum Problem, I

Speaker: 

Professor Daqing Wan

Institution: 

UCI

Time: 

Thursday, January 27, 2011 - 3:00pm

Location: 

RH 306

For a subset D in an abelian group A, the subset
sum problem for D is to determine if D has a subset S which
sums to a given element of A. This is a well known NP-complete
problem, arising from diverse applications in coding theory,
cryptography and complexity theory. In this series of two
expository talks, we discuss and outline an emerging theory
of this subset sum problem by allowing D to have some
algebraic structure.

An Introduction to the Weil Conjectures

Speaker: 

Tommy Occhipinti

Institution: 

UCI

Time: 

Tuesday, October 26, 2010 - 3:00pm

Location: 

RH 340P

The Weil Conjectures are one of the most beautiful theorems in mathematics. In the number field context zeta and L-functions are transcendental. It is well known, for example, that zeta(2)=pi^2/6. The values of these functions, even at integers, are not well understood. The Weil conjectures state the perhaps shocking result that the function field analogues of these functions are almost as simple as possible: they are rational functions. Further, they include the analogue of the Riemann Hypothesis for function fields. In this talk we will explore what the Weil conjectures say, as well as how they are proven.

On group structures realized by elliptic curves over a fixed finite field

Speaker: 

Reza Rezaeian Farashahi

Institution: 

Macquarie University

Time: 

Thursday, October 14, 2010 - 3:00pm

Location: 

RH 440R

We obtain explicit formulas for the number of non-isomorphic
elliptic curves with a given group structure (considered as an abstract abelian group).
Moreover, we give explicit formulas for the number of distinct group structures of all
elliptic curves over a finite field. We use these formulas to derive
some asymptotic estimates and tight upper and lower bounds for
various counting functions related to classification of elliptic
curves accordingly to their group structure. Finally, we present
results of some numerical tests which exhibit several interesting
phenomena in the distribution of group structures.

Efficient Arithmetic on Hessian Curves

Speaker: 

Reza Rezaeian Farashahi

Institution: 

Macquarie University

Time: 

Tuesday, October 12, 2010 - 3:00pm

Location: 

RH 340P

In this talk, we present the family of generalized Hessian curves.

The family of generalized Hessian curves covers more isomorphism classes of elliptic curves than Hessian curves.

We provide efficient unified addition formulas for generalized Hessian curves. The formulas even feature completeness for suitably chosen curve parameters.

We also also present extremely fast addition formulas for generalized binary Hessian curves. The fastest projective addition formulas require $9\M+3\s$, where $\M$ is the cost of a field multiplication and $\s$ is the cost of a field squaring. Moreover, very fast differential addition and doubling formulas are provided that need only $5\M+4\s$ when the curve is chosen with small parameters.

Counting points on reductions of CM abelian surfaces

Speaker: 

Nick Alexander

Institution: 

UCI

Time: 

Tuesday, May 18, 2010 - 2:00pm

Location: 

RH 306

We construct explicit genus 2 hyperelliptic curves whose Jacobian varieties have complex multiplication and are defined over an explicit algebraic number field. For these Jacobians, we give a formula for the number of points on their reductions modulo primes of good reduction. The construction and results can be viewed as a dimension 2 generalization of results of H. Stark. These formulas have application to cryptography and the CM method in dimension 2.

Pages

Subscribe to RSS - Number Theory