Related papers: How Bad Are Vandermonde Matrices?
Let $\mathscr{M}$ be a conditional oriented matroid. We define a graded algebra $\widehat{\mathscr{VG}}_\mathscr{M}$ with vector space dimension given by the number of covectors in $\mathscr{M}$ which admits a distinguished filtration…
In this work, we introduce a definition of the Discrete Fourier Transform (DFT) on Euclidean lattices in $\R^n$, that generalizes the $n$-th fold DFT of the integer lattice $\Z^n$ to arbitrary lattices. This definition is not applicable for…
Groundstates of 1+1d conformal field theories (CFTs) satisfy a local entropic condition called the vector fixed point equation. This condition is surprisingly well satisfied by groundstates of quantum critical lattice models even at small…
One proposal to compute parton distributions from first principles is the large momentum effective theory (LaMET), which requires the Fourier transform of matrix elements computed non-perturbatively. Lattice quantum chromodynamics (QCD)…
We consider perturbations of a large Jordan matrix, either random and small in norm or of small rank. In both cases we show that most of the eigenvalues of the perturbed matrix are very close to a circle with centre at the origin. In the…
Vector-valued discrete Fourier transforms (DFTs) and ambiguity functions are defined. The motivation for the definitions is to provide realistic modeling of multi-sensor environments in which a useful time-frequency analysis is essential.…
Disordered mechanical systems with high connectivity represent a limit opposite to the more familiar case of disordered crystals. Individual ions in a crystal are subjected essentially to nearest-neighbor interactions. In contrast, the…
We study ill-conditioned positive definite matrices that are disturbed by the sum of $m$ rank-one matrices of a specific form. We provide estimates for the eigenvalues and eigenvectors. When the condition number of the initial matrix tends…
We systematically investigated the limited inverse discrete Fourier transform of the quasi distributions from the perspective of inverse problem theory. This transformation satisfies two of Hadamard's well-posedness criteria, existence and…
Within the framework of relative and absolute quantum field theories (QFTs), we present a general formalism for understanding polarizations of the intermediate defect group and constructing non-invertible duality defects in theories in $2k$…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
We introduce the notion of a confluent Vandermonde matrix with quaternion entries and discuss its connection with Lagrange-Hermite interpolation over quaternions. Further results include the formula for the rank of a confluent Vandermonde…
Conventional inversion of the discrete Fourier transform (DFT) requires all DFT coefficients to be known. When the DFT coefficients of a rasterized image (represented as a matrix) are known only within a pass band, the original matrix…
We study quasiperiodically forced circle endomorphisms, homotopic to the identity, and show that under suitable conditions these exhibit uncountably many minimal sets with a complicated structure, to which we refer to as `strangely…
Many numerical problems with input $x$ and output $y$ can be formulated as a system of equations $F(x, y) = 0$ where the goal is to solve for $y$. The condition number measures the change of $y$ for small perturbations to $x$. From this…
The concept of matrix rigidity was first introduced by Valiant in 1977. Roughly speaking, a matrix is rigid if its rank cannot be reduced significantly by changing a small number of entries. There has been extensive interest in rigid…
Many interesting examples of complex Hadamard matrices $H\in M_N(\mathbb C)$ can be put, up to the standard equivalence relation for such matrices, in bistochastic form. We discuss here this phenomenon, with a number of computations for…
In this paper, we study approximate Hadamard matrices, that is, well-conditioned $n\times n$ matrices with all entries in $\{\pm1\}$. We show that the smallest-possible condition number goes to $1$ as $n\to\infty$, and we identify some…
For a sufficiently nice 2 dimensional shape, we define its approximating matrix (or patterned matrix) as a random matrix with iid entries arranged according to a given pattern. For large approximating matrices, we observe that the…
The theory of almost commuting matrices can be used to quantify topological obstructions to the existence of localized Wannier functions with time-reversal symmetry in systems with time-reversal symmetry and strong spin-orbit coupling. We…