Differences between revisions 42 and 58 (spanning 16 versions)
Revision 42 as of 2008-09-22 09:03:28
Size: 4375
Comment: Link to Renault's abstract
Revision 58 as of 2008-10-11 16:27:54
Size: 6103
Editor: RobertMiller
Comment:
Deletions are marked like this. Additions are marked like this.
Line 8: Line 8:

See the [http://www.loria.fr/~zimmerma/sd10_participants.pdf list of participants].
Line 22: Line 24:
See [http://www.loria.fr/~zimmerma/sd10_schedule.pdf the full program in pdf format].
Line 24: Line 28:
       * [http://www.cs.uwaterloo.ca/~astorjoh/ Arne Storjohann]
       * [http://ljk.imag.fr/membres/Jean-Guillaume.Dumas/ Jean-Guillaume Dumas]:[:/JGDumasTalk: Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields]
       * [http://www.cs.uwaterloo.ca/~astorjoh/ Arne Storjohann]:[:/AStorjohannTalk: Algorithms for linear algebra on polynomial and integer matrices: similarities and differences] attachment:Storjohann_SD10_talk.pdf
       * [http://ljk.imag.fr/membres/Jean-Guillaume.Dumas/ Jean-Guillaume Dumas]:[:/JGDumasTalk: Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields] attachment:Dumas_SD10_talk.pdf
Line 27: Line 31:
       * Martin Albrecht: [:/MAlbrechtTalk: Matrix multiplication over GF(2) and the M4RI library]
       * Gregory Bard
       * [http://www.rlmiller.org Robert Miller]: [:/RMillerTalk: An example of implementing automorphism groups: linear codes]
       * Martin Albrecht: [:/MAlbrechtTalk: Matrix multiplication over GF(2) in the M4RI library] attachment:Martin_Albrecht_Matmul_M4RI.pdf
       * Gregory Bard : Using Graph Theory to Control Fill-in for Sparse Matrix Reduction to RREF over Fields of non-zero characteristic
       * [http://www.rlmiller.org Robert Miller]: [:/RMillerTalk: An example of implementing automorphism groups: linear codes] (cancelled due to illness)
Line 33: Line 37:
         This talk will give a survey of Sage's capabilities for computations with
         elliptic curves, including some recent developments and a wish-list of
  possible future developments.
Line 35: Line 42:
       * Nadia El Mrabet: [:/NadiaElMrabetTalk: Implementing the Weil, Tate and Ate pairings using Sage]        * Nadia El Mrabet: [:/NadiaElMrabetTalk: Implementing the Weil, Tate and Ate pairings using Sage]
   * October 11: Sage-Combinat (chair Nicolas Thiery) (follows the Elliptic Curves session)
       The purpose of the *-Combinat project is to provide an extensible
       toolbox for computer exploration in algebraic combinatorics, and
       foster code sharing between researchers in this area. We will present
       the history, features, and design of MuPAD-Combinat, and discuss the
       timeline, difficulties, but also great technical and community
       opportunities that arise from the ongoing port as Sage-Combinat.
     Invited Speakers:
       * Florent Hivert and Nicolas Thiéry: *-Combinat: Sharing Algebraic Combinatorics since 2000
     Contribution speakers:
       * Mike Hansen: Decomposable Objects and combinatorial species
       * [http://www.rlmiller.org Robert Miller]: Partition Refinement for Classification attachment:Miller_SD10_talk.pdf
       * Franco Saliola: Posets and words in Sage-Combinat
Line 41: Line 61:
       * B. Erocal : [:/BurcinErocalTalk: SCrypt: Using Symbolic Computation to Bridge the Gap Between Algebra and Cryptography]        * B. Erocal : [:/BurcinErocalTalk: SCrypt: Symbolic computation assists algebraic cryptanalysis]
Line 67: Line 87:

=== Coding Sprint ===

[:/CodingSprint: Overview page]

Sage days 10 in Nancy (France)

October 10 to 15, 2008 at the Lorraine Laboratory of IT Research and its Applications (Loria)

Registration

Please register on the [http://registration.net-resa.com/cgi-bin/WebObjects/gnetresa.woa/wa/newParticipant?idevt=281&profil=396 registration website].

See the [http://www.loria.fr/~zimmerma/sd10_participants.pdf list of participants].

Program committee

  • Michael Abshoff
  • Timothy Daly
  • Laurent Fousse
  • Clément Pernet
  • Ludovic Perret
  • Paul Zimmermann

The following program is preliminary.

Program:

See [http://www.loria.fr/~zimmerma/sd10_schedule.pdf the full program in pdf format].

  • October 10: Linear Algebra (chair Clement Pernet)
    • Invited speakers: Contributing speakers:
      • Martin Albrecht: [:/MAlbrechtTalk: Matrix multiplication over GF(2) in the M4RI library] attachment:Martin_Albrecht_Matmul_M4RI.pdf
      • Gregory Bard : Using Graph Theory to Control Fill-in for Sparse Matrix Reduction to RREF over Fields of non-zero characteristic
      • [http://www.rlmiller.org Robert Miller]: [:/RMillerTalk: An example of implementing automorphism groups: linear codes] (cancelled due to illness)

  • October 11: Elliptic Curves (chair Laurent Fousse)
  • October 11: Sage-Combinat (chair Nicolas Thiery) (follows the Elliptic Curves session)
    • The purpose of the *-Combinat project is to provide an extensible toolbox for computer exploration in algebraic combinatorics, and foster code sharing between researchers in this area. We will present the history, features, and design of MuPAD-Combinat, and discuss the timeline, difficulties, but also great technical and community opportunities that arise from the ongoing port as Sage-Combinat.
    • Invited Speakers:
      • Florent Hivert and Nicolas Thiéry: *-Combinat: Sharing Algebraic Combinatorics since 2000
      Contribution speakers:
      • Mike Hansen: Decomposable Objects and combinatorial species
      • [http://www.rlmiller.org Robert Miller]: Partition Refinement for Classification attachment:Miller_SD10_talk.pdf

      • Franco Saliola: Posets and words in Sage-Combinat
  • October 12: Groebner Bases (chair Ludovic Perret)
    • Invited speakers: Contributing speakers:
      • B. Erocal : [:/BurcinErocalTalk: SCrypt: Symbolic computation assists algebraic cryptanalysis]

      • M. Brickenstein : Secrets of Singular and PolyBoRi

        • This talk presents techniques for Gröbner bases calculations implemented in the computer algebra system Singular and the

          PolyBoRi framework. I will consider

          • data structures
          • algorithms
          and give application examples, show their structure and explain how to exploit it.
      • [http://www-calfor.lip6.fr/~renault/index.html Guénaël Renault]: [:/GuenaelRenaultTalk: Computation of the Triangular Representation of a Splitting Field]

  • October 13-15: Coding Sprints (chair Michael Abshoff)
  • October 14: SAGE Demo by Robert Bradshaw at 17h.

Standard day schedule is as follows:

  • 09h30-10h00 Arrival/registration
  • 10h00-11h00 Invited Talk 1
  • 11h00-11h30 Coffee Break
  • 11h30-12h00 Contributed Talk 1
  • 12h00-14h00 Lunch Break
  • 14h00-15h00 Invited Talk 2
  • 15h00-15h30 Coffee Break
  • 15h30-16h00 Contributed Talk 2
  • 16h00-16h30 Contributed Talk 3

The Sage Days 10 dinner will take place on the 11th.

Coding Sprint

[:/CodingSprint: Overview page]

Location:

[http://www.loria.fr/presentation-en Loria] [http://cado.gforge.inria.fr/workshop/venue.html Coming to Loria (webpage from another event, don't be confused).]

   LORIA
   Campus Scientifique
   54506 Vandoeuvre-lès-Nancy
   France

[http://maps.google.fr/maps?f=q&hl=en&geocode=&ie=UTF8&ll=48.665497,6.157295&spn=0.002643,0.00501&t=h&z=18 Google Maps]

Accomodations

Close events

You may be interested in the [http://cado.gforge.inria.fr/workshop/ CADO project workshop] which will occur at the same place, October 7-9.

Sponsors

days10 (last edited 2008-11-14 13:41:55 by anonymous)