English
Related papers

Related papers: Index of a matrix, complex logarithms, and multidi…

200 papers

We present a new method for evaluating tensor integrals in the large-scale structure. Decomposing a $\Lambda$CDM-like universe into a finite sum of scaling universes using the FFTLog, we can recast loop integrals for biased tracers in the…

Cosmology and Nongalactic Astrophysics · Physics 2024-10-21 Hayden Lee

The multi-index model is a simple yet powerful high-dimensional regression model which circumvents the curse of dimensionality assuming $ \mathbb{E} [ Y | X ] = g(A^\top X) $ for some unknown index space $A$ and link function $g$. In this…

Statistics Theory · Mathematics 2020-06-04 Timo Klock , Alessandro Lanteri , Stefano Vigogna

This paper is concerned with developing an efficient numerical algorithm for fast implementation of the sparse grid method for computing the $d$-dimensional integral of a given function. The new algorithm, called the MDI-SG ({\em multilevel…

Numerical Analysis · Mathematics 2022-10-27 Huicong Zhong , Xiaobing Feng

Let $M(n)$ denote the number of distinct entries in the $n \times n$ multiplication table. The function $M(n)$ has been studied by Erd\H{o}s, Tenenbaum, Ford, and others, but the asymptotic behaviour of $M(n)$ as $n \to \infty$ is not known…

Number Theory · Mathematics 2021-10-20 Richard Brent , Carl Pomerance , David Purdum , Jonathan Webster

We study the bit complexity of inverting diagonally dominant matrices, which are associated with random walk quantities such as hitting times and escape probabilities. Such quantities can be exponentially small, even on undirected…

Data Structures and Algorithms · Computer Science 2025-10-23 Mehrdad Ghadiri , Hoai-An Nguyen , Junzhao Yang

Consider the eigenvalues $\lambda_i(M_n)$ (in increasing order) of a random Hermitian matrix $M_n$ whose upper-triangular entries are independent with mean zero and variance one, and are exponentially decaying. By Wigner's semicircular law,…

Probability · Mathematics 2011-08-16 Terence Tao , Van Vu

What is the time complexity of matrix multiplication of sparse integer matrices with $m_{in}$ nonzeros in the input and $m_{out}$ nonzeros in the output? This paper provides improved upper bounds for this question for almost any choice of…

Data Structures and Algorithms · Computer Science 2023-09-13 Amir Abboud , Karl Bringmann , Nick Fischer , Marvin Künnemann

Let $(M,g)$ be a non-compact riemannian $n$-manifold with bounded geometry at order $k\geq\frac{n}{2}$. We show that if the spectrum of the Laplacian starts with $q+1$ discrete eigenvalues isolated from the essential spectrum, and if the…

Differential Geometry · Mathematics 2010-01-15 Samuel Tapie

The spectrum of a real and symmetric $N\times N$ matrix determines the matrix up to unitary equivalence. More spectral data is needed together with some sign indicators to remove the unitary ambiguities. In the first part of this work we…

Mathematical Physics · Physics 2022-01-24 Tomasz Maciążek , Uzy Smilansky

Randomized matrix sparsification has proven to be a fruitful technique for producing faster algorithms in applications ranging from graph partitioning to semidefinite programming. In the decade or so of research into this technique, the…

Numerical Analysis · Mathematics 2009-11-23 Alex Gittens , Joel A. Tropp

In this paper, we study the inverse scattering problem for a class of signals that have a compactly supported reflection coefficient. The problem boils down to the solution of the Gelfand-Levitan-Marchenko (GLM) integral equations with a…

Computational Physics · Physics 2019-02-12 Vishal Vaibhav

Index structures are fundamental for efficient query processing on large-scale datasets. Learned indexes model the indexing process as a prediction problem to overcome the inherent trade-offs of traditional indexes. However, most existing…

Databases · Computer Science 2026-03-31 Yuzhen Chen , Bin Yao

We show how the numerical range of a matrix can be used to bound the optimal value of certain optimization problems over real tensor product vectors. Our bound is stronger than the trivial bounds based on eigenvalues, and can be computed…

Optimization and Control · Mathematics 2023-05-24 Nathaniel Johnston , Logan Pipes

This work studies numerical integration by the M\"obius-transformed trapezoidal rule, which combines the classical trapezoidal rule with a change of variables induced by a M\"obius transformation that maps the unit circle onto the real…

Numerical Analysis · Mathematics 2026-05-01 Nuutti Hyvönen , Yuya Suzuki

We consider $n\times n$ real symmetric and hermitian random matrices $H_{n,m}$ equals the sum of a non-random matrix $H_{n}^{(0)}$ matrix and the sum of $m$ rank-one matrices determined by $m$ i.i.d. isotropic random vectors with…

Probability · Mathematics 2007-10-09 Alain Pajor , Leonid Pastur

We compute the supersymmetric partition function of $\mathcal{N}{=}1$ supersymmetric gauge theories with an $R$-symmetry on $\mathcal{M}_4 \cong \mathcal{M}_{g,p}\times S^1$, a principal elliptic fiber bundle of degree $p$ over a genus-$g$…

High Energy Physics - Theory · Physics 2017-09-13 Cyril Closset , Heeyeon Kim , Brian Willett

Assuming a symmetric potential and separated self-adjoint boundary conditions, we relate the Maslov and Morse indices for Schr\"odinger operators on $[0, 1]$. We find that the Morse index can be computed in terms of the Maslov index and two…

Classical Analysis and ODEs · Mathematics 2016-03-09 Peter Howard , Alim Sukhtayev

In this paper we propose methods for computing Fresnel integrals based on truncated trapezium rule approximations to integrals on the real line, these trapezium rules modified to take into account poles of the integrand near the real axis.…

Numerical Analysis · Mathematics 2015-09-11 Mohammad Alazah , Simon N. Chandler-Wilde , Scott La Porte

We estimate the number $|\mathcal{A}_{\boldsymbol\lambda}|$ of elements on a nonlinear family $\mathcal{A}$ of monic polynomials of $\mathbb{F}_q[T]$ of degree $r$ having factorization pattern…

Combinatorics · Mathematics 2018-07-24 Guillermo Matera , Mariana Pérez , Melina Privitelli

We consider linear matrix inequalities (LMIs) $A = A_0 + x_1 A_1 + ... + x_n A_n \succeq 0$ with the $A_i$'s being $m \times m$ symmetric matrices, with entries in a ring $\mathcal{R}$. When $\mathcal{R} = \mathbb{R}$, the feasibility…

Symbolic Computation · Computer Science 2025-08-28 Simone Naldi , Mohab Safey El Din , Adrien Taylor , Weijia Wang