Binomial prolate spheroidal functions, Pascal matrices, and arithmetic of elliptic curves

The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>N</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> <mml:mo>×</mml:mo> <mml:mo stretchy="false">(</mml:mo> <mml:mi>N</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> symmetric Pascal matrix <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:msub> <mml:mi>T</mml:mi> <mml:mi>N</mml:mi> </mml:msub> </mml:math> is a generalized discrete time and band-limiting operator for the binomial transform and its eigenvectors are generalized discrete prolate spheroidal wave functions which we call binomial prolates. Their generating functions are also generalized prolate spheroidal functions in the sense that they are simultaneously eigenfunctions of a third-order differential operator and an integral operator over the line <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:mo stretchy="false">{</mml:mo> <mml:mi>z</mml:mi> <mml:mo>∈</mml:mo> <mml:mi mathvariant="double-struck">C</mml:mi> <mml:mo>:</mml:mo> <mml:mo> </mml:mo> <mml:mtext>Re</mml:mtext> <mml:mo stretchy="false">(</mml:mo> <mml:mi>z</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">/</mml:mo> <mml:mn>2</mml:mn> <mml:mo stretchy="false">}</mml:mo> </mml:mrow> </mml:math> . For even, positive integers N , we obtain an explicit formula for the generating function of an eigenvector of the symmetric Pascal matrix with eigenvalue 1. When <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>=</mml:mo> <mml:mi>p</mml:mi> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> for an odd prime p , we show that the generating function is equivalent modulo p to <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:msup> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mo>#</mml:mo> <mml:msub> <mml:mi>E</mml:mi> <mml:mi>z</mml:mi> </mml:msub> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:msub> <mml:mi mathvariant="double-struck">F</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:mn>2</mml:mn> </mml:msup> </mml:math> , where <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:mo>#</mml:mo> <mml:msub> <mml:mi>E</mml:mi> <mml:mi>z</mml:mi> </mml:msub> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:msub> <mml:mi mathvariant="double-struck">F</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> is the number of points on the Legendre elliptic curve <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:msup> <mml:mi>y</mml:mi> <mml:mn>2</mml:mn> </mml:msup> <mml:mo>=</mml:mo> <mml:mi>x</mml:mi> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>x</mml:mi> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>x</mml:mi> <mml:mo>−</mml:mo> <mml:mi>z</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> over the finite field <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:msub> <mml:mi mathvariant="double-struck">F</mml:mi> <mml:mi>p</mml:mi> </mml:msub> </mml:math> . Furthermore when <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>=</mml:mo> <mml:msup> <mml:mi>p</mml:mi> <mml:mi>n</mml:mi> </mml:msup> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> , our generating function is the square of a period of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:msub> <mml:mi>E</mml:mi> <mml:mi>z</mml:mi> </mml:msub> </mml:math> modulo <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:msup> <mml:mi>p</mml:mi> <mml:mi>n</mml:mi> </mml:msup> </mml:math> in the open p -adic unit disk.

Authors

Institutions

Publication Details

Journal
Proceedings of the National Academy of Sciences
Published
2026-06-18
DOI
https://doi.org/10.1073/pnas.2529171123
Primary Topic
Mathematical Analysis and Transform Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Binomial prolate spheroidal functions, Pascal matrices, and arithmetic of elliptic curves

W. Riley Casper
Proceedings of the National Academy of Sciences
Mathematical Analysis and Transform Methods
article

Binomial prolate spheroidal functions, Pascal matrices, and arithmetic of elliptic curves

W. Riley Casper
article en

Abstract

The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>N</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> <mml:mo>×</mml:mo> <mml:mo stretchy="false">(</mml:mo> <mml:mi>N</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> symmetric Pascal matrix <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:msub> <mml:mi>T</mml:mi> <mml:mi>N</mml:mi> </mml:msub> </mml:math> is a generalized discrete time and band-limiting operator for the binomial transform and its eigenvectors are generalized discrete prolate spheroidal wave functions which we call binomial prolates. Their generating functions are also generalized prolate spheroidal functions in the sense that they are simultaneously eigenfunctions of a third-order differential operator and an integral operator over the line <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:mo stretchy="false">{</mml:mo> <mml:mi>z</mml:mi> <mml:mo>∈</mml:mo> <mml:mi mathvariant="double-struck">C</mml:mi> <mml:mo>:</mml:mo> <mml:mo> </mml:mo> <mml:mtext>Re</mml:mtext> <mml:mo stretchy="false">(</mml:mo> <mml:mi>z</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">/</mml:mo> <mml:mn>2</mml:mn> <mml:mo stretchy="false">}</mml:mo> </mml:mrow> </mml:math> . For even, positive integers N , we obtain an explicit formula for the generating function of an eigenvector of the symmetric Pascal matrix with eigenvalue 1. When <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>=</mml:mo> <mml:mi>p</mml:mi> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> for an odd prime p , we show that the generating function is equivalent modulo p to <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:msup> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mo>#</mml:mo> <mml:msub> <mml:mi>E</mml:mi> <mml:mi>z</mml:mi> </mml:msub> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:msub> <mml:mi mathvariant="double-struck">F</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:mn>2</mml:mn> </mml:msup> </mml:math> , where <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:mo>#</mml:mo> <mml:msub> <mml:mi>E</mml:mi> <mml:mi>z</mml:mi> </mml:msub> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:msub> <mml:mi mathvariant="double-struck">F</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> is the number of points on the Legendre elliptic curve <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:msup> <mml:mi>y</mml:mi> <mml:mn>2</mml:mn> </mml:msup> <mml:mo>=</mml:mo> <mml:mi>x</mml:mi> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>x</mml:mi> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>x</mml:mi> <mml:mo>−</mml:mo> <mml:mi>z</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> over the finite field <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:msub> <mml:mi mathvariant="double-struck">F</mml:mi> <mml:mi>p</mml:mi> </mml:msub> </mml:math> . Furthermore when <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>=</mml:mo> <mml:msup> <mml:mi>p</mml:mi> <mml:mi>n</mml:mi> </mml:msup> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> , our generating function is the square of a period of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:msub> <mml:mi>E</mml:mi> <mml:mi>z</mml:mi> </mml:msub> </mml:math> modulo <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:msup> <mml:mi>p</mml:mi> <mml:mi>n</mml:mi> </mml:msup> </mml:math> in the open p -adic unit disk.

Proceedings of the National Academy of SciencesVol. 123(25)
California State University, Fullerton (US)
Openalex Percentile: Top 4%
Mathematical Analysis and Transform Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.