Skip to content.
|
Skip to navigation
Site Map
Accessibility
Contact
Search Site
only in current section
Advanced Search…
Navigation
Home
About
RISC Forum
Personal tools
Log in
You are here:
Home
Info
Search results
1
items matching your search terms.
Filter the results.
Item type
Select All/None
Page
Event
File
Folder
Form Folder
Image
Link
Collection
New items since
Yesterday
Last week
Last month
Ever
Sort by
relevance
·
date (newest first)
·
alphabetically
RISC Forum
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.
Located in
Internal
/
RISC Forum
/
Summer Semester 2022
Powered by Plone