English
Related papers

Related papers: On wavelet polynomials and Weyl multipliers

200 papers

The paper presents a versatile library of quasi-analytic complex-valued wavelet packets (WPs) which originate from polynomial splines of arbitrary orders. The real parts of the quasi-analytic WPs are the regular spline-based orthonormal WPs…

Numerical Analysis · Mathematics 2020-08-13 Amir Averbuch , Pekka Neittaanmaki , Valery Zheludev

In this paper, we investigate large values of Dirichlet polynomials with multiplicative coefficients $\sum_{n\le N}f(n)n^{it}$, where $1\ll t\le T$ for large $T$. We prove an improved Omega result in the region $\exp((\log…

Number Theory · Mathematics 2025-09-15 Zikang Dong , Yutong Song , Weijia Wang , Hao Zhang , Shengbo Zhao

A convergence theory for the $hp$-FEM applied to a variety of constant-coefficient Helmholtz problems was pioneered in the papers [Melenk-Sauter, 2010], [Melenk-Sauter, 2011], [Esterhazy-Melenk, 2012], [Melenk-Parsania-Sauter, 2013]. This…

Numerical Analysis · Mathematics 2022-03-08 David Lafontaine , Euan A. Spence , Jared Wunsch

We study the distribution of families of multiplicative functions among the coprime residue classes to moduli varying uniformly in a wide range, obtaining analogues of the Siegel--Walfisz Theorem for large classes of multiplicative…

Number Theory · Mathematics 2024-02-27 Akash Singha Roy

We give algorithms for computing multiplier ideals using Gr\"obner bases in Weyl algebras. The algorithms are based on a newly introduced notion which is a variant of Budur--Musta\c{t}\v{a}--Saito's (generalized) Bernstein--Sato polynomial.…

Algebraic Geometry · Mathematics 2010-01-30 Takafumi Shibuta

Let U(N) denote the maximal length of arithmetic progressions in a random uniform subset of {0,1}^N. By an application of the Chen-Stein method, we show that U(N)- 2 log(N)/log(2) converges in law to an extreme type (asymmetric)…

Probability · Mathematics 2012-05-22 Itai Benjamini , Ariel Yadin , Ofer Zeitouni

We investigate the estimation of a weighted density taking the form $g=w(F)f$, where $f$ denotes an unknown density, $F$ the associated distribution function and $w$ is a known (non-negative) weight. Such a class encompasses many examples,…

Statistics Theory · Mathematics 2017-03-13 Fabien Navarro , Christophe Chesneau , Jalal Fadili

The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Groebner bases methods. In this paper, we consider polynomial systems that are…

Cryptography and Security · Computer Science 2023-02-06 Alessio Caminata , Michela Ceria , Elisa Gorla

The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…

Optimization and Control · Mathematics 2015-09-15 G. Li , B. S. Mordukhovich , T. T. A. Nghia , T. S. Pham

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…

Algebraic Geometry · Mathematics 2010-11-09 Philippe Pebay , J. Maurice Rojas , David C. Thompson

We improve upper bounds on sphere packing densities and sizes of spherical codes in high dimensions. In particular, we prove that the maximal sphere packing densities $\delta_n$ in $\mathbb{R}^n$ satisfy \[\delta_n\leq \frac{1+o(1)}{e}\cdot…

Metric Geometry · Mathematics 2024-07-16 Masoud Zargar

Wavelet systems on the generalized Vilenkin groups are considered. An algorithmic method for the construction of orthogonal wavelet bases is presented. These bases consist of compactly supported test functions (i.e. functions whose Fourier…

Functional Analysis · Mathematics 2025-06-24 M. Babushkin , M. Skopina

We study the maximum matching problem in the random-order semi-streaming setting. In this problem, the edges of an arbitrary $n$-vertex graph $G=(V, E)$ arrive in a stream one by one and in a random order. The goal is to have a single pass…

Data Structures and Algorithms · Computer Science 2021-03-02 Sepehr Assadi , Soheil Behnezhad

We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…

Numerical Analysis · Mathematics 2008-07-10 Joerg Kampen

We prove essentially optimal $L^p(\mathbb{R})$-estimates for variational variants of the maximal Fourier multiplier operators considered by Bourgain in his work on pointwise convergence of polynomial ergodic averages. As a corollary of our…

Classical Analysis and ODEs · Mathematics 2025-03-25 Ben Krause

The classic lower bound of Kuhn, Moscibroda and Wattenhofer [JACM 2016] states that approximate maximum matching and approximate vertex cover (among other problems) in the LOCAL model require $\Omega(\min\{\sqrt{\frac{\log n}{\log\log n}},…

Data Structures and Algorithms · Computer Science 2026-05-14 Peter Davies-Peck

Let $X$ be a $d$-partite $d$-dimensional simplicial complex with parts $T_1,\dots,T_d$ and let $\mu$ be a distribution on the facets of $X$. Informally, we say $(X,\mu)$ is a path complex if for any $i<j<k$ and $F \in T_i,G \in T_j, K\in…

Combinatorics · Mathematics 2025-12-10 Jonathan Leake , Kasper Lindberg , Shayan Oveis Gharan

Let (M, g) be a compact smooth Riemannian manifold. We obtain new off-diagonal estimates as {\lambda} tend to infinity for the remainder in the pointwise Weyl Law for the kernel of the spectral projector of the Laplacian onto functions with…

Spectral Theory · Mathematics 2015-12-29 Yaiza Canzani , Boris Hanin

A subset $B$ of the ring $\mathbb{Z}_n$ is referred to as a $\ell$-covering set if $\{ ab \pmod n | 0\leq a \leq \ell, b\in B\} = \mathbb{Z}_n$. We show that there exists a $\ell$-covering set of $\mathbb{Z}_n$ of size $O(\frac{n}{\ell}\log…

Discrete Mathematics · Computer Science 2024-06-11 Ke Shi , Chao Xu

Given convex polytopes $P_1,...,P_r$ in $R^n$ and finite subsets $W_I$ of the Minkowsky sums $P_I=\sum_{i \in I} P_i$, we consider the quantity $N(W)=\sum_{I \subset {\bf [}r {\bf ]}} {(-1)}^{r-|I|} \big| W_I \big|$. We develop a technique…

Algebraic Geometry · Mathematics 2014-11-13 Frédéric Bihan
‹ Prev 1 4 5 6 7 8 10 Next ›