Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions
summary
The gist
We study certain algebras of theta-like functions on partitions for which the corresponding generating functions give rise to theta functions, quasi-Jacobi forms, Appell–Lerch sums…
In short
The study investigates algebras of theta-like functions on partitions and their associated q-brackets, which are related to modular forms. The work establishes connections between these structures and Jacobi forms, Appell–Lerch sums, and false theta functions. It characterizes specific algebras (A and B) whose elements generate these important mathematical objects.
Key concepts
- q-bracket
- The q-bracket hfiq is a map that takes a function f on partitions λ and produces an element in QJqK. It acts as a bridge connecting enumerative geometry, statistical properties of partitions, and number theory by relating partition invariants to modular objects.
- Jacobi forms
- These are mathematical functions that possess specific transformation properties under the action of the modular group SL2(Z). The paper shows that elements from algebra A and products involving A and B generate these forms, which have non-holomorphic completions.
- Appell–Lerch sums
- These are special types of sums arising in the context of partition theory. The paper demonstrates that certain q-brackets, specifically $ht(N)s^*iq$, can be expressed as a linear combination involving Jacobi theta functions, false theta functions, and these Appell–Lerch sums.
- False Theta Functions
- A specific function defined as $T = Tb(z; au, ar{ au}, ar{ heta})$ is introduced. This function appears in the decomposition of certain q-brackets, showing how they relate to Jacobi theta functions and other forms.
Terminology used across episodes
This episode discusses
- Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions · Paper Radio
- Quantum Black Holes, Wall Crossing, and Mock Modular Forms
The paper
Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions · Read on arXiv
Kathrin Bringmann, Jan-Willem Van Ittersum, Jonas Kaszian
Max Planck Institute for Mathematics
DOI: 10.1007/s00208-026-03497-3
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions".
Emmy: Here's the gist of the paper. We study certain algebras of theta-like functions on partitions for which the corresponding generating functions give rise to theta functions, quasi-Jacobi forms, Appell–Lerch sums, and false theta functions The q-bracket of a function f on partitions λ is defined as hfiq:= Pλ∈P f(λ)qλ / Pλ∈P qλ ∈ QJqK For many classes of functions, the q-bracket is a quasimodular form The connection to modular forms is not too surprising, since the denominator of the q-bracket equals q 1/24 η(τ)−1 with η(τ):= q 1/24 Q n≥1 (1 − q n) the Dedekind eta function (with q:= e 2πiτ) Interpreting the q-bracket as the expectation value of some partition invariant f with respect to the normalized probability distribution ν 7→ qν Pλ∈P qλ by this property all the moments of f are modular objects In short, the theory of q-brackets forms a bridge between enumerative geometry, statistical properties of partitions and number theory Key Algebras and their Properties Two examples of such algebras are the algebra of so-called symmetric functions S and the algebra of shifted symmetric functions Λ∗ These algebras are generated by the symmetric functions Sk and shifted symmetric functions Qk, respectively, for λ ∈ P given by (λj is the j-th part of λ and Bk the k-th Bernoulli number) For all homogeneous f ∈ S or f ∈ Λ∗ the q-bracket hfiq is a quasimodular form Every function f ∈ QP such that all moments hf n iq are quasimodular for SL2(Z) seems to be an element of either of these two algebras Algebra A and its Consequences We introduce an algebra A of theta-like functions on partitions and explain how several types of modularity arise if such functions are paired with elements of S and their generalizations Theorem 1.1 states that the vector space A satisfies the following properties: (1) If f ∈
A: ζl=1, then hfiq is a modular theta function of some level (2) If f ∈ A, then hfiq is a Jacobi theta function In particular, by (1), for f ∈
Φ(A): ζl=1, the moments hf n iq are modular forms for all n ∈ N Jacobi Forms and Quasi-Jacobi Forms The elements of B give rise to Jacobi forms Moreover, also products of elements of A and B give rise to Jacobi forms Theorem 1.2 states that if f ∈ A and g ∈ B, then hfgiq is a meromorphic quasi-Jacobi form Quasi-Jacobi forms admit non-holomorphic completions which transform as Jacobi forms Appell–Lerch Functions and False Theta Functions Theorem 1.4 states that for N ∈ N, the bracket ht(N)s∗ iq can be expressed as a linear combination of a Jacobi theta function, a false theta function, and an Appell–Lerch sum In Section 4.1, we define the false theta function T as Tb(z; τ, ω) = X n∈Z E−i p 2πi(ω − τ) n + z 2/2τ squared ζ n q n squared The paper establishes a framework for understanding the modularity properties arising from the q-bracket on functions defined on partitions, connecting these structures to Jacobi forms and Appell–Lerch sums The main findings include the characterization of algebras A and B, which generate theta-like functions whose q-brackets yield modular or quasi-modular forms Furthermore, the paper proves that certain combinations of these functions result in Jacobi forms and Appell–Lerch sums, providing a deep link between partition theory and complex analysis.
Ada: Pruning redundant reasoning tokens The connected q-bracket is defined as the multilinear map h·iq: (QP) ⊗l → Q extending the q-bracket such that for f1,..., fl ∈ QP hf1 ⊗ · · · ⊗ fliq = X α∈Π(l) µ(α, 1l) Y A∈α hfAiq How the training signal is built The proof of Theorem 3.3 shows that the algebras A and A◦ are isomorphic and B◦ is contained in hBi This involves showing that the connected bracket of the tNj, defined by (1.2), is an element of A◦ Where the gains come from The transformation properties of T and fN in Proposition 4.1 and Corollary 4.3 complete the proof The final expression for htN s iq is given by a linear combination involving Jacobi theta functions, false theta functions, and Appell–Lerch sums Pruning redundant reasoning tokens The inversion formula for connected brackets (2.3) allows to replace the sum over α ∈ Π(n) by A = A = 1,..., n The transformation properties of T and fN in Proposition 4.1 and Corollary 4.3 complete the proof Where the gains come from The final expression for htN s iq is given by a linear combination involving Jacobi theta functions, false theta functions, and Appell–Lerch sums The transformation properties of T and fN in Proposition 4.1 and Corollary 4.3 complete the proof Pruning redundant reasoning tokens The final expression for htN s iq is given by a linear combination involving Jacobi theta functions, false theta functions, and Appell–Lerch sums The transformation properties of T and fN in Proposition 4.1 and Corollary 4.3 complete the proof Where the gains come from The final expression for htN s iq is given by a linear combination involving Jacobi theta functions, false theta functions, and Appell–Lerch sums The transformation properties of T and fN in Proposition 4.1 and Corollary 4.
Paper summary: Emmy: So, wrapping up on "Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions". The core contribution is defining the algebras A and B that generate these specific types of theta-like functions.
Ada: That's right. The paper shows how pairing elements from S with algebra A leads to modular theta functions, while combining A and B yields meromorphic quasi-Jacobi forms. And crucially, it proves that certain combinations land in the space of Appell–Lerch sums and false theta functions when you look at specific generators like t N s star iq <ref:2401.02820#pg3>.
Kolya: So, what does this title really imply for the broader mathematical community? It suggests that q-brackets on partitions aren't just random sums; they are highly structured and predictable when you know which algebraic structures you're working within.
Emmy: It means the complexity of these partition statistics is not arbitrary. There is an underlying structure—the algebras A, B, S, and Lambda star—that governs exactly what kind of modularity we will find through the q-bracket operation.
Ada: It gives a precise set of conditions for when you can expect to get Jacobi forms or quasi-Jacobi forms from these structures. It's a roadmap for exploring these connections between enumerative geometry and number theory.
Kolya: And it shows that even when we hit the limits, like with the multiple Eisenstein series mentioned earlier, there are still deep objects there that fit into this picture. It keeps the focus on structure over just finding one single answer.
Conclusion: Ada: So we've seen how these q-brackets connect partition statistics to Jacobi forms and other complex objects like Appell–Lerch sums today.
Emmy: It really boils down to finding these specific algebras, A and B, that generate those theta-like functions which then produce the nice modular or quasi-modular behavior when you apply the q-bracket.
Kolya: I'm thinking about what this means for the statistical side of things. It gives us a way to see if all these partition moments are actually governed by something more rigid than just random counting.
Ada: Exactly, it’s about imposing structure on that counting. The paper shows these algebras A and B are the key players here, which is a big deal for organizing what we think we know about partitions.
Emmy: It’s interesting how they use these structures to generate things like false theta functions, which are already pretty weird objects in their own right.
Kolya: And the results show that even those weird things are connected back to standard forms, which suggests a deep underlying relationship we need to explore further.
Ada: Right, so the authors of this paper they've mapped out a whole territory where partition counting meets complex analysis and number theory.
Emmy: It’s less about just finding one new formula and more about building a framework that shows how different mathematical worlds intersect through this q-bracket tool.
Kolya: And I think it opens up avenues for looking at other types of partition statistics in the same way, testing if similar structures pop up elsewhere.
More episodes
- 2508.18266-On models of affine arithmetic
- 2508.20749-Rates of convergence for extremal spacings in Kakutani's random interval-splitting process
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes