|
Size: 1437
Comment:
|
Size: 3497
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 23: | Line 23: |
| This will be announced later. | || Time || Monday (Aug 4) || Tuesday (Aug 5) || Wednesday (Aug 6) || || 9:00-10:00 || || Coding sprint || Coding sprint || || 10:00-11:00 || || Luo || Coding sprint || || 12:00-14:00 || Lunch || Lunch || Lunch || || 14:00-15:00 || SageMath Tutorial || Coding sprint || Coding sprint || || 15:00-16:00 || Coding sprint || Coding sprint || Coding sprint || || 16:00-17:00 || Combinatorics Tutorial || Rubey || Coding sprint || || 17:00-18:00 || Coding sprint || Hackl || Coding sprint || A coding sprint is a time to work on code. During these periods, since we will have no talks, participants can use this as breaks. The conference will officially begin Monday 14:00 (JST), but the room will be available before that for additional coding sprints and discussions. === Titles / Abstracts === ==== Benjamin Hackl ==== Title: Abstract: TBA ==== Andrew Luo ==== Title: A SageMath Package for Analytic Combinatorics in Several Variables Abstract: Analytic Combinatorics in Several Variables (ACSV) is a branch of mathematics concerned with the asymptotic behaviour of sequences derived from their multivariate generating functions, and has applications ranging from the analysis of data structures to bioinformatics, algebraic statistics, and queuing theory. While ACSV adapts techniques from a wide range of mathemetical topics including multivariate complex analysis, algebraic geometry, and stratified Morse theory, computer algebra systems can be used to automate much of the theory. We present the sage-acsv package which, under certain niceness conditions, can rigorously compute the asymptotic behaviour of sequences given its multivariate generating function. We extensively use Sage's built-in Polynomial Rings and Algebraic Numbers structures and various algorithms from commutative algebra to perform our computations. Our package aims to increase the accessibility of the theory of ACSV for researchers and demonstrates an interesting and practical use-case of the SageMath software. ==== Martin Rubey ==== Title: Being Lazy Abstract: TBA |
SageDays 129
This workshop will focus on (algebraic) combinatorics, broadly interpreted, and will take place after FPSAC 2025. We will also have tutorials for beginners and time for coding sprints.
More information will be made available soon.
Dates
August 4-6, 2025
Venue
Hokkaido University Science Building 4 room 4-501 (5th floor)
Details
To register, please email Travis Scrimshaw tcscrims <at> gmail.com with your name and affiliation. There is no registration fee.
If you are interested in giving a talk, please indicate so in your registration email.
Schedule
Time |
Monday (Aug 4) |
Tuesday (Aug 5) |
Wednesday (Aug 6) |
9:00-10:00 |
|
Coding sprint |
Coding sprint |
10:00-11:00 |
|
Luo |
Coding sprint |
12:00-14:00 |
Lunch |
Lunch |
Lunch |
14:00-15:00 |
SageMath Tutorial |
Coding sprint |
Coding sprint |
15:00-16:00 |
Coding sprint |
Coding sprint |
Coding sprint |
16:00-17:00 |
Combinatorics Tutorial |
Rubey |
Coding sprint |
17:00-18:00 |
Coding sprint |
Hackl |
Coding sprint |
A coding sprint is a time to work on code. During these periods, since we will have no talks, participants can use this as breaks.
The conference will officially begin Monday 14:00 (JST), but the room will be available before that for additional coding sprints and discussions.
Titles / Abstracts
Benjamin Hackl
Title:
Abstract: TBA
Andrew Luo
Title: A SageMath Package for Analytic Combinatorics in Several Variables
Abstract: Analytic Combinatorics in Several Variables (ACSV) is a branch of mathematics concerned with the asymptotic behaviour of sequences derived from their multivariate generating functions, and has applications ranging from the analysis of data structures to bioinformatics, algebraic statistics, and queuing theory. While ACSV adapts techniques from a wide range of mathemetical topics including multivariate complex analysis, algebraic geometry, and stratified Morse theory, computer algebra systems can be used to automate much of the theory. We present the sage-acsv package which, under certain niceness conditions, can rigorously compute the asymptotic behaviour of sequences given its multivariate generating function. We extensively use Sage's built-in Polynomial Rings and Algebraic Numbers structures and various algorithms from commutative algebra to perform our computations. Our package aims to increase the accessibility of the theory of ACSV for researchers and demonstrates an interesting and practical use-case of the SageMath software.
Martin Rubey
Title: Being Lazy
Abstract: TBA
Attendees
Speakers
Benjamin Hackl (University of Graz)
Andrew Luo (University of Waterloo)
Martin Rubey (TU Wien)
Travis Scrimshaw (Hokkaido University)
Participants
- Ryo Kato (Tsukuba University)
Jianrong Li (University of Vienna)
Duc-Khanh Nguyen (Okinawa Institute of Science and Technology)
Organizers
Travis Scrimshaw (Hokkaido University)