English
Related papers

Related papers: Computing the theta function

200 papers

Let $j\geq 3$ be any fixed integer and $f$ be a primitive holomorphic cusp form of even integral weight $\kappa\geq 2$ for the full modular group $SL(2,\mathbb{Z})$. We write $\lambda_{{\rm{sym}^j }f}(n)$ for the $n^\text{th}$ normalized…

Number Theory · Mathematics 2026-01-27 Kampamolla Venkatasubbareddy

A recurring theme in attempts to break the curse of dimensionality in the numerical approximations of solutions to high-dimensional partial differential equations (PDEs) is to employ some form of sparse tensor approximation. Unfortunately,…

Numerical Analysis · Mathematics 2014-07-24 Wolfgang Dahmen , Ronald DeVore , Lars Grasedyck , Endre Süli

In this paper, we introduce a way to generalize the Euler's gamma function as well as some related special functions. With a given polynomial in one variable $f(t)\ge 0$, we can associate a function, so-called "gamma function associated…

Complex Variables · Mathematics 2011-05-31 Tran Gia Loc , Trinh Duc Tai

Theta-graphs are a type of spatial graph with two vertices connected by three edges. We investigate embeddings of theta-graphs in the square and simple cubic lattices, using a combination of the Wang-Landau Monte Carlo method with a variant…

Statistical Mechanics · Physics 2026-05-07 Nicholas R. Beaton , Aleksander L. Owczarek

Diversity maximization is an important concept in information retrieval, computational geometry and operations research. Usually, it is a variant of the following problem: Given a ground set, constraints, and a function $f(\cdot)$ that…

Data Structures and Algorithms · Computer Science 2015-11-24 Alfonso Cevallos , Friedrich Eisenbrand , Rico Zenklusen

A partial fraction decomposition of the Fermi function resulting in a finite sum over simple poles is proposed. This allows for efficient calculations involving the Fermi function in various contexts of electronic structure or electron…

Other Condensed Matter · Physics 2009-08-10 Alexander Croy , Ulf Saalmann

In this paper, we develop an approach to recursively estimate the quadratic risk for matrix recovery problems regularized with spectral functions. Toward this end, in the spirit of the SURE theory, a key step is to compute the (weak)…

Optimization and Control · Mathematics 2012-11-07 Charles-Alban Deledalle , Samuel Vaiter , Gabriel Peyré , Jalal Fadili , Charles Dossal

We consider the class of counting problems,i.e. functions in $\#$P, which are self reducible, and have easy decision version, i.e. for every input it is easy to decide if the value of the function $f(x)$ is zero. For example,…

Computational Complexity · Computer Science 2016-11-08 Eleni Bakali

We present highlights of computations of the Riemann zeta function around large values and high zeros. The main new ingredient in these computations is an implementation of the second author's fast algorithm for numerically evaluating…

Number Theory · Mathematics 2016-07-05 Jonathan W. Bober , Ghaith A. Hiary

For compact self-adjoint operators in Hilbert spaces, two algorithms are proposed to provide fully computable a posteriori error estimate for eigenfunction approximation. Both algorithms apply well to the case of tight clusters and multiple…

Numerical Analysis · Mathematics 2022-07-19 Xuefeng Liu , Tomáš Vejchodský

We consider the problem of approximating two, possibly unrelated probability distributions from a single complex-valued function $\psi$ and its Fourier transform. We show that this problem always has a solution within a specified degree of…

Mathematical Physics · Physics 2011-01-12 W. D. Flanders , G. Japaridze

A methodology to analyze the properties of the first (largest) eigenvalue and its eigenvector is developed for large symmetric random sparse matrices utilizing the cavity method of statistical mechanics. Under a tree approximation, which is…

Optimization and Control · Mathematics 2015-05-18 Yoshiyuki Kabashima , Hisanao Takahashi , Osamu Watanabe

Counting problems are fundamental across mathematics and computer science. Among the most subtle are those whose associated decision problem is solvable in polynomial time, yet whose exact counting version appears intractable. For some such…

Computational Complexity · Computer Science 2025-12-12 Markus Hecher , Matthias Lanzinger

We consider in this paper a class of single-ratio fractional minimization problems, in which the numerator part of the objective is the sum of a nonsmooth nonconvex function and a smooth nonconvex function while the denominator part is a…

Optimization and Control · Mathematics 2020-12-23 Na Zhang , Qia Li

When belief propagation (BP) converges, it does so to a stationary point of the Bethe free energy $F$, and is often strikingly accurate. However, it may converge only to a local optimum or may not converge at all. An algorithm was recently…

Machine Learning · Computer Science 2014-01-03 Adrian Weller , Tony Jebara

We study random series priors for estimating a functional parameter (f\in L^2[0,1]). We show that with a series prior with random truncation, Gaussian coefficients, and inverse gamma multiplicative scaling, it is possible to achieve…

Statistics Theory · Mathematics 2017-06-15 Jan van Waaij , Harry van Zanten

The plasma dispersion function $Z(s)$ is a fundamental complex special integral function widely used in the field of plasma physics. The simplest and most rapid, yet accurate, approach to calculating it is through rational or equivalent…

Plasma Physics · Physics 2024-07-04 Huasheng Xie

We consider analytic functions of the Riemann zeta type, for which, if $s$ is a zero, so is $1-s$. We use infinite product representations of these functions, assuming their zeros to be of first order. We use exponential factors to…

Number Theory · Mathematics 2018-02-20 R. C. McPhedran

We develop a new representation for the integrals associated with Feynman diagrams. This leads directly to a novel method for the numerical evaluation of these integrals, which avoids the use of Monte Carlo techniques. Our approach is based…

High Energy Physics - Phenomenology · Physics 2009-10-31 Richard Easther , Gerald Guralnik , Stephen Hahn

Given a `cost' functional $F$ on paths $\gamma$ in a domain $D\subset\mathbb{R}^d$, in the form $F(\gamma) = \int_0^1 f(\gamma(t),\dot\gamma(t))dt$, it is of interest to approximate its minimum cost and geodesic paths. Let $X_1,\ldots, X_n$…

Probability · Mathematics 2017-11-21 Erik Davis , Sunder Sethuraman