Related papers: Sparse bounds for oscillating multipliers on strat…

We derive an information-theoretic lower bound for sample complexity in sparse recovery problems where inputs can be chosen sequentially and adaptively. This lower bound is in terms of a simple mutual information expression and unifies many…

This paper studies sparse elliptic random matrix models which generalize both the classical elliptic ensembles and sparse i.i.d. matrix models by incorporating correlated entries and a tunable sparsity parameter $p_n$. Each $n\times n$…

In this note, we investigate a mixture of combinatorial spectra and stratified simplicial sets, which would be thought of as a model of the spectrum objects of $(\infty, \infty)$-categories.

We introduce new models for Schr\"odinger-type equations, which generalize standard NLS and for which different dispersion occurs depending on the directions. Our purpose is to understand dispersive properties depending on the directions of…

The goal of this paper is to achieve a computational model and corresponding efficient algorithm for obtaining a sparse representation of the fitting surface to the given scattered data. The basic idea of the model is to utilize the…

Sparse tensors are prevalent in many data-intensive applications, yet existing differentiable programming frameworks are tailored towards dense tensors. This presents a significant challenge for efficiently computing gradients through…

For Lie algebras whose Poisson semi-center is a polynomial ring we give a bound for the sum of the degrees of the generating semi-invariants. This bound was previously known in many special cases.

Let $K$ be a multiquadratic extension of $\mathbb{Q}$ and let $\text{Cl}^{+}(K)$ be its narrow class group. Recently, the authors \cite{KP} gave a bound for $|\text{Cl}^{+}(K)[2]|$ only in terms of the degree of $K$ and the number of…

We inspect the relationship between relative Fourier multipliers on noncommutative Lebesgue-Orlicz spaces of a discrete group and relative Toeplitz-Schur multipliers on Schatten-von-Neumann-Orlicz classes. Four applications are given:…

We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…

We derive sparse bounds for the bilinear spherical maximal function in any dimension $d\geq 1$. When $d\geq 2$, this immediately recovers the sharp $L^p\times L^q\to L^r$ bound of the operator and implies quantitative weighted norm…

Extending a method of D. Wolke, we establish a general result on the large sieve with sparse sets S of moduli which are in a sense well-distributed in arithmetic progressions. We then apply our result to the case when S consists of sqares.…

In this paper, we demonstrate that many of the computational tools for univariate orthogonal polynomials have analogues for a family of bivariate orthogonal polynomials on the triangle, including Clenshaw's algorithm and sparse…

We study bounds on the Riesz means of the mixed Steklov-Neumann and Steklov-Dirichlet eigenvalue problem on a bounded domain $\Omega$ in $\mathbb{R}^n$. The Steklov-Neumann eigenvalue problem is also called the sloshing problem. We obtain…

A class of splitting alternating algorithms is proposed for finding the sparse solution of linear systems with concatenated orthogonal matrices. Depending on the number of matrices concatenated, the proposed algorithms are classified into…

We investigate the boundedness of unimodular Fourier multipliers on modulation spaces. Surprisingly, the multipliers with general symbol $e^{i|\xi|^\alpha}$, where $\alpha\in[0, 2]$, are bounded on all modulation spaces, but, in general,…

This work is devoted to studying the boundedness on Lebesgue spaces of bilinear multipliers on $\R$ whose symbol is narrowly supported around a curve (in the frequency plane). We are looking for the optimal decay rate (depending on the…

We extend the divergence preserving cut finite element method presented in [T. Frachon, P. Hansbo, E. Nilsson, S. Zahedi, SIAM J. Sci. Comput., 46 (2024)] for the Darcy interface problem to unfitted outer boundaries. We impose essential…

Matrix perturbation bounds play an essential role in the design and analysis of spectral algorithms. In this paper, we use a "contour bootstrapping" argument to derive several new perturbation bounds. As applications, we discuss new bounds…

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…