Previous Forums
Collection of RISC Forums in the past.
- RISC Forum Nov 21, 2022 from 01:30 PM to 02:45 PM
- Nikolai Fadeev: TBA
- RISC Forum Nov 14, 2022 from 01:30 PM to 01:45 PM
- David Cerna: Excuesions into Inductive Synthesis
- RISC Forum Nov 07, 2022 from 01:30 PM to 02:00 PM
- Wolfgang Schreiner: The RISCAL Software, Some Recent Developments...
- NO RISC Forum Oct 31, 2022 from 01:30 PM to 01:45 PM
- Originally planned talk by Nicolas Smoot will be shifted to later.
- RISC Forum Oct 24, 2022 from 01:30 PM to 01:45 PM
- Georg Ehling: Self-introduction
- RISC Forum Oct 17, 2022 from 01:30 PM to 01:45 PM
- Hans-Wolfgang Loidl (Heriot-Watt University, Edinburgh): Challenges and Opportunities in Parallel Symbolic Computation
- RISC Forum Oct 10, 2022 from 01:30 PM to 01:45 PM
- Prof. Paule: Welcome to the new Semester; organizational Items.
- RISC Forum Jun 27, 2022 from 01:30 PM to 01:45 PM
- Sebastian Falkensteiner: My Research at RISC in a nutshell
- RISC Forum Jun 20, 2022 from 01:30 PM to 01:45 PM
- Myriam Dupraz: self introduction
- RISC Forum Jun 13, 2022 from 01:30 PM to 01:50 PM
- Nikolai Fadeev: Behind the curtains of Mathematica
- NO RISC Forum Jun 06, 2022 from 01:30 PM to 01:45 PM
- Holiday (Pentecost)
- RISC Forum May 30, 2022 from 01:30 PM to 01:45 PM
- Edwin Lughofer: TBA
- RISC Forum May 23, 2022 from 01:30 PM to 01:55 PM
- David Cerna: What I talk about when I talk about my current research. Michal Buran: Self introduction.
- RISC Forum May 16, 2022 from 01:30 PM to 01:45 PM
- Carsten Schneider: Symbolic Computation in Difference Rings and Applications
- RISC Forum May 09, 2022 from 01:30 PM to 01:45 PM
- Silviu Radu: "A contribution to a problem posed by Bill Chen"
- RISC Forum May 02, 2022 from 01:30 PM to 01:45 PM
- Koustav Banerjee: "Inequalities for the partition function"
- RISC Forum Apr 25, 2022 from 01:30 PM to 01:45 PM
- Prof. Armin Straub: Lucas congruences and congruence schemes. Abstract: It is a well-known and beautiful classical result of Lucas that, modulo a prime $p$, the binomial coefficients satisfy the congruences \begin{equation*} \binom{n}{k} \equiv \binom{n_0}{k_0} \binom{n_1}{k_1} \cdots \binom{n_r}{k_r}, \end{equation*} where $n_i$, respectively $k_i$, are the $p$-adic digits of $n$ and $k$. Many interesting integer sequences have been shown to satisfy versions of these congruences. For instance, Gessel has done so for the numbers used by Ap\'ery in his proof of the irrationality of $zeta(3)$. We make the observation that a sequence satisfies Lucas congruences modulo $p$ if and only if its values modulo $p$ can be described by a linear $p$-scheme, as introduced by Rowland and Zeilberger, with a single state. This simple observation suggests natural generalizations of the notion of Lucas congruences. To illustrate this point, we derive explicit generalized Lucas congruences for integer sequences that can be represented as certain constant terms. This talk includes joint work with Joel Henningsen.
- NO RISC Forum Apr 18, 2022 from 01:30 PM to 01:45 PM
- Easter Holidays
- NO RISC Forum Apr 11, 2022 from 01:30 PM to 02:00 PM
- Lecture-free (Holy-Week)
- RISC Forum Apr 04, 2022 from 01:30 PM to 01:45 PM
- Georg Grasegger: Symmetric Rigidity and Flexibility of Graphs