Searcharxiv⌕ Search

arXiv subjects

Jaume de Dios Pont

Publications and source records attributed to Jaume de Dios Pont.

At least 19 recordsLinked to original sources
arXiv2026

Phase retrieval from a uniformly discrete point set

We prove that for every window $w$ of the form $w(x) = e^{-π|x|^2} h(x)$, where $h$ is a polynomial, there exists a uniformly discrete set of points $\mathcal{S} \subset \mathbb R^{2d}$ such that the magnitude of the short-time Fourier transform $V_w f$ on $\mathcal{S}$ determines every $f \in L^2(\mathbb R^d)$ up to a constant phase factor. The separation distance can be chosen independent of the degree of $h$ and proportional to the square root of the dimension. The proof combines a discrete norming inequality, based on a multidimensional Remez inequality and VC-dimension bounds, with tail estimates for the reproducing kernel. A formalization of our main result in Lean 4 is also provided.

math.CA↗
arXiv2026

Banach lattices and phase retrieval: A case study for the use of AI in mathematics

The ability of large language models to assist professional mathematicians has been progressing rapidly. Earlier this year, a group of researchers in Banach lattice theory and phase retrieval began incorporating this technology into their research workflows. Facing challenges about the reliability of these models, they also decided to couple the discovery process with Lean verification. Here, we present a case study of how this has led to a more united community and a deeper understanding of our field.

math.FA↗
arXiv2026

Gabor Frames of Totally Positive Functions: A Complete Characterization

We prove that the set of time-frequency shifts $\{e^{2πi βl t} g(t-αk) : k,l \in \mathbb{Z}\}$ with a continuous, integrable totally positive function $g$ and lattice parameters $α,β>0$ generates a frame for $L^2(\mathbb{R})$ if and only if $αβ<1$. This fully settles the so-called frame set problem for the class of totally positive functions. As a closely related result we prove a sharp Kadets-type theorem for every shift-invariant space generated by a continuous totally positive function. The proofs are based on Fredholm theory and limit-operator theory. A formalization of our main result in Lean 4 is also provided.

math.FA↗
arXiv2026

Counterexamples to Schiffer's Conjecture

The Schiffer conjecture states that if a smooth domain $Ω\subset \mathbb{R}^n$ admits a Neumann eigenfunction of the Laplacian which is constant at the boundary, then the domain is a ball. It is intimately related to Pompeiu's problem, stating that if a nonzero function integrates zero over any rigid motion of $Ω$, then $Ω$ is a ball. We disprove both conjectures in $\mathbb{R}^2$, constructing infinitely many planar domains $Ω$ which are not balls and satisfy the conditions above. Our domains are $N$-fold symmetric, with $N$ sufficiently large. Our approach is based on a novel strategy of considering a relaxed problem where $N$ can be any real number (which corresponds to the Schiffer problem only when $N$ is a natural number). We then apply bifurcation theory to this relaxed problem, showing that the size of the local bifurcation branch can be taken independently of $N$. This result allows us to conclude that branches starting with $N$ sufficiently close to an integer reach integer values of $N$.

math.AP↗
arXiv2026

Geometric Dyson Brownian Motions and the Free Log-Normal Limit for a Non-Square Gaussian Matrix Product

We study the squared singular value spectrum of a non-square product of independent real Gaussian matrices, equivalently the feature covariance spectrum of a deep linear neural network at initialization. Starting from the fixed-$m$ covariance diffusion previously obtained in the proportional depth-width limit, we record an equivalent matrix realization, describe its affine invariance, and derive the interacting diffusion satisfied by its eigenvalues. We then take a second limit, sending $m\to\infty$ on the accelerated spectral clock $τ=mt$, which corresponds in this sequential construction to the relation $dm/n\to\barτ$. We establish convergence of the empirical spectral measure path to a deterministic mean-field limit and derive a closed Burgers equation for its $T$-transform. Together with the proportional depth-width limit, these results give a rigorous sequential route from the deep non-square Gaussian product to the free log-normal limit of its feature covariance spectrum; for more general initial laws, the transform yields a free multiplicative convolution form. We further analyze the support of the free log-normal law, give a fixed point iteration for numerical evaluation and a formal Marchenko--Pastur approximation at small time, and use the limiting spectrum to predict the risk in a toy random feature model.

math.PR↗
arXiv2026

Cantor measures with odd base do not admit Fourier frames

We prove that the Cantor measure with base $b$ does not admit a Fourier frame whenever $b > 1$ is an odd integer. In particular, this answers a question of Strichartz on the existence of a Fourier frame for the middle third Cantor measure. A formalization of our main result in Lean 4 is also provided.

math.FA↗
arXiv2026

Stable Phase Retrieval for Spans of Independent Random Variables

We prove that, after $L^2$ normalization, stable phase retrieval holds over the $L^2$-spans of independent real-valued centered random variables if and only if all but possibly one coordinate satisfies a uniform two-sided $L^1$ bound. This provides a complete characterization of stable phase retrieval for such subspaces, building upon the pioneering work of Calderbank--Daubechies--Freeman--Freeman and confirming the conjectured characterization communicated to us by those authors. We provide two different proofs of this fact, both based on a decomposition of the $\ell^2$-coefficients of each random variable. The first is a compactness proof, which makes use of the infinite divisibility of limit laws of tail sums. The second is a quantitative proof, which substitutes the compactness step with an explicit dichotomy based on anticoncentration estimates of Sperner type. This latter proof was partially LLM generated based on the ideas in the first proof and a considerable amount of guidance by the authors. An autoformalization of our main result in Lean 4 is also provided, following the ideas in the quantitative proof.

math.FA↗
arXiv2026

On the existence problem of regular Gabor frames

For every dimension $d > 1$, we establish explicit criteria on lattices $Λ\subset \mathbb{R}^{2d}$ with density $D(Λ) > 1$ such that no function with a continuous Zak transform generates a Gabor frame along $Λ$. In particular, this gives a negative answer to the existence problem of Gabor frames with window functions in the Schwartz space, the Feichtinger algebra, and the Fourier-invariant Wiener space. Our result is based on a characterization of when a collection of quasiperiodic functions admits a common zero, which may be of independent interest. We also include a formalization of our main result in Lean 4.

math.FA↗
arXiv2026

$L^2$-Stability for STFT phase retrieval

We prove that the short-time Fourier transform with Gaussian window performs $L^2$-local stable phase retrieval at the constant function. The proof involved significant interplay between mathematicians and LLMs. An autoformalization in Lean 4 of an extension of our result to $L^2$-local stable phase retrieval for all Hermite windows and all elements in the finite span of the canonical basis vectors is also presented.

math.FA↗
arXiv2026

Almost-Orthogonality in Lp Spaces: A Case Study with Grok

Carbery proposed the following sharpened form of triangle inequality for many functions: for any $p\ge 2$ and any finite sequence $(f_j)_j\subset L^p$ we have \[ \Big\|\sum_j f_j\Big\|_p \ \le\ \left(\sup_{j} \sum_{k} α_{jk}^{\,c}\right)^{1/p'} \Big(\sum_j \|f_j\|_p^p\Big)^{1/p}, \] where $c=2$, $1/p+1/p'=1$, and $α_{jk}=\sqrt{\frac{\|f_{j}f_{k}\|_{p/2}}{\|f_{j}\|_{p}\|f_{k}\|_{p}}}$. In the first part of this paper we construct a counterexample showing that this inequality fails for every $p>2$. We then prove that if an estimate of the above form holds, the exponent must satisfy $c\le p'$. Finally, at the critical exponent $c=p'$, we establish the inequality for all integer values $p\ge 2$. In the second part of the paper we obtain a sharp three-function bound \[ \Big\|\sum_{j=1}^{3} f_j\Big\|_p \ \le\ \left(1+2Γ^{c(p)}\right)^{1/p'} \Big(\sum_{j=1}^{3} \|f_j\|_p^p\Big)^{1/p}, \] where $p \geq 3$, $c(p) = \frac{2\ln(2)}{(p-2)\ln(3)+2\ln(2)}$ and $Γ=Γ(f_1,f_2,f_3)\in[0,1]$ quantifies the degree of orthogonality among $f_1,f_2,f_3$. The exponent $c(p)$ is optimal, and improves upon the power $r(p) = \frac{6}{5p-4}$ obtained previously by Carlen, Frank, and Lieb. Some intermediate lemmas and inequalities appearing in this work were explored with the assistance of the large language model Grok.

math.CA↗
arXiv2025

Sharp bounds on the failure of the hot spots conjecture

The hot spots ratio of a domain $Ω\subset \mathbb{R}^d$ measures the degree of failure of Rauch's hot spots conjecture on that domain. We identify the largest possible value of this ratio over all connected Lipschitz domains $Ω\subset \mathbb{R}^d$, for any dimension $d$. As $d\to \infty$, we show that this maximal ratio converges to $\sqrt{e}$, which asymptotically matches the previous best known upper bound by Mariano, Panzo and Wang. For $d\ge 2$, we show that sets extremizing the hot spots ratio do not exist, and extremizing sequences must converge to a ball at a quantitative rate. We then give a sharp bound on the measure of the set for which the first Neumann eigenfunction exceeds its maximal boundary value. From this we deduce that the hot spots conjecture is asymptotically true "in measure'' as $d\to \infty$.

math.SP↗
arXiv2024

Convex sets can have interior hot spots

The hot spots conjecture asserts that for any convex bounded domain $Ω$ in $\mathbb R^d$, the first non-trivial Neumann eigenfunction of the Laplace operator in $Ω$ attains its maximum at the boundary. We construct counterexamples to the conjecture for all sufficiently large values of $d$. The construction is based on an extension of the conjecture from convex sets to log-concave measures.

math.AP↗
arXiv2024

Periodicity and decidability of translational tilings by rational polygonal sets

The periodic tiling conjecture asserts that if a region $Σ\subset \mathbb R^d$ tiles $\mathbb R^d$ by translations then it admits at least one fully periodic tiling. This conjecture is known to hold in $\mathbb R$, and recently it was disproved in sufficiently high dimensions. In this paper, we study the periodic tiling conjecture for polygonal sets: bounded open sets in $\mathbb R^2$ whose boundary is a finite union of line segments. We prove the periodic tiling conjecture for any polygonal tile whose vertices are rational. As a corollary of our argument, we also obtain the decidability of tilings by rational polygonal sets. Moreover, we prove that any translational tiling by a rational polygonal tile is weakly-periodic, i.e., can be partitioned into finitely many singly-periodic pieces.

math.CO↗
arXiv2024

Predicting quantum channels over general product distributions

We investigate the problem of predicting the output behavior of unknown quantum channels. Given query access to an $n$-qubit channel $E$ and an observable $O$, we aim to learn the mapping \begin{equation*} ρ\mapsto \mathrm{Tr}(O E[ρ]) \end{equation*} to within a small error for most $ρ$ sampled from a distribution $D$. Previously, Huang, Chen, and Preskill proved a surprising result that even if $E$ is arbitrary, this task can be solved in time roughly $n^{O(\log(1/ε))}$, where $ε$ is the target prediction error. However, their guarantee applied only to input distributions $D$ invariant under all single-qubit Clifford gates, and their algorithm fails for important cases such as general product distributions over product states $ρ$. In this work, we propose a new approach that achieves accurate prediction over essentially any product distribution $D$, provided it is not "classical" in which case there is a trivial exponential lower bound. Our method employs a "biased Pauli analysis," analogous to classical biased Fourier analysis. Implementing this approach requires overcoming several challenges unique to the quantum setting, including the lack of a basis with appropriate orthogonality properties. The techniques we develop to address these issues may have broader applications in quantum information.

quant-ph↗
arXiv2023

Query lower bounds for log-concave sampling

Log-concave sampling has witnessed remarkable algorithmic advances in recent years, but the corresponding problem of proving lower bounds for this task has remained elusive, with lower bounds previously known only in dimension one. In this work, we establish the following query lower bounds: (1) sampling from strongly log-concave and log-smooth distributions in dimension $d\ge 2$ requires $Ω(\log κ)$ queries, which is sharp in any constant dimension, and (2) sampling from Gaussians in dimension $d$ (hence also from general log-concave and log-smooth distributions in dimension $d$) requires $\widetilde Ω(\min(\sqrtκ\log d, d))$ queries, which is nearly sharp for the class of Gaussians. Here $κ$ denotes the condition number of the target distribution. Our proofs rely upon (1) a multiscale construction inspired by work on the Kakeya conjecture in geometric measure theory, and (2) a novel reduction that demonstrates that block Krylov algorithms are optimal for this problem, as well as connections to lower bound techniques based on Wishart matrices developed in the matrix-vector query literature.

math.ST↗
arXiv2023

Additive energies on discrete cubes

We prove that for $d\geq 0$ and $k\geq 2$, for any subset $A$ of a discrete cube $\{0,1\}^d$, the $k-$higher energy of $A$ (the number of $2k-$tuples $(a_1,a_2,\dots,a_{2k})$ in $A^{2k}$ with $a_1-a_2=a_3-a_4=\dots=a_{2k-1}-a_{2k}$) is at most $|A|^{\log_{2}(2^k+2)}$, and $\log_{2}(2^k+2)$ is the best possible exponent. We also show that if $d\geq 0$ and $2\leq k\leq 10$, for any subset $A$ of a discrete cube $\{0,1\}^d$, the $k-$additive energy of $A$ (the number of $2k-$tuples $(a_1,a_2,\dots,a_{2k})$ in $A^{2k}$ with $a_1+a_2+\dots+a_k=a_{k+1}+a_{k+2}+\dots+a_{2k}$) is at most $|A|^{\log_2{ \binom{2k}{k}}}$, and $\log_2{ \binom{2k}{k}}$ is the best possible exponent. We discuss the analogous problems for the sets $\{0,1,\dots,n\}^d$ for $n\geq 2$.

math.CO↗
arXiv2023

A new proof of the description of the convex hull of space curves with totally positive torsion

We give new proofs of the description convex hulls of space curves $γ: [a,b] \mapsto \mathbb{R}^{d}$ having totally positive torsion. These are curves such that all the leading principal minors of $d\times d$ matrix $(γ', γ'', \ldots, γ^{(d)})$ are positive. In particular, we recover parametric representation of the boundary of the convex hull, different formulas for its surface area and the volume of the convex hull, and the solution to a general moment problem corresponding to $γ$.

math.PR↗