We study weighted periodic-orbit zeta functions for an infinitely cusped tree lattice $Y_q$, where $q\ge2$ is even and the quotient is a one-sided comb. The global Euler product fails coefficientwise because infinitely many primitive cycles have length four. A first-return determinant at a finite directed-edge set nevertheless exists, and stationary Schur elimination gives an algebraic formula for the root local zeta and its dominant poles. For the two-step multiplicity potential we compute the Gurevich pressure $P_G=2\log(q+1)$ and pressure at infinity $P_\infty=\log(4q)$, yielding strong positive recurrence and exponential local-orbit asymptotics. The height-damped transition operator is trace class. After subtraction of an explicit integrated-pressure counterterm, the inverse Fredholm determinant has a locally uniform finite part, expressed by a convergent dilogarithmic product and covariant under changes of height.
Restriction to the full cusp divisor of a modular curve defines a secondary invariant whose rational indeterminacy comes from a single global modular form. For every integral weakly holomorphic level-one modular form $h$ of weight divisible by four, we prove that the imported value $[h/2]$ vanishes at every nontrivial...
We give an all-level proof of the four-point $SU(2)$ AGT correspondence with four fundamental hypermultiplets at generic $\beta=-\epsilon_1/\epsilon_2$, by proving an all-level factorization formula for Selberg averages of generalized Jack polynomials. Taking a coefficientwise Jack limit of the generalized Macdonald Pi...
We prove that broad families of finite Dirichlet sums exhibit deterministic concentration of normalized vertical zero density on a single line. The main result gives a general criterion under which the normalized Jessen potentials converge locally uniformly to a piecewise-linear convex function with a single corner. Th...
We study finite-fibre determinants for rational Bishop operators and their role in cyclicity for irrational parameters. The paper has two main parts. First, for the constant vector $f=1$, a resultant identity and a discrete Fourier factorization reveal a determinant parity mechanism for general modular orbit order: odd...
We study root-of-unity sections of quotients formed from dilated Euler products. At the boundary point \(q=1\), odd sections tend to nonzero cyclotomic constants, whereas even sections have infinitely many simple real poles. We determine the locations, spacing, and residues of all sufficiently late poles. In the cubic...
We study the right derivative of the zeta-star correspondence between binary expansions and multiple zeta-star values of infinite depth. At a finite-index point, this derivative is a normalized difference of two finite-depth multiple zeta-star values. We use this identity to express its local behavior in terms of lower...
Jiang-Tao Li· 0 citations
Related blog posts
Microsoft Research Blog· microsoft.comOct 29, 2026
Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
