English
Related papers

Related papers: Sets of $p$-restriction and $p$-spectral synthesis

200 papers

We study spectral synthesis for measures supported on thin subsets of compact Riemannian manifolds. We prove that under natural non-concentration conditions, such measures admit quantitative spectral synthesis, with explicit stability…

Classical Analysis and ODEs · Mathematics 2026-03-24 A. Iosevich , A. Mayeli , E. Wyman

We show that spectral synthesis thresholds are governed by a quantitative spectral complexity parameter, the Fourier Ratio, in addition to the geometric size of the Fourier support. In the Euclidean setting, we prove that if a compactly…

Classical Analysis and ODEs · Mathematics 2026-03-30 S. Deodhar , A. Iosevich

The Stein-Tomas restriction theorem on Euclidean space says one can meaningfully restrict $\hat{f}$ to the unit sphere of $\mathbb{R}^n$ provided $f \in L^p(\mathbb{R}^n)$ with $1 < p < 2$. This result can be rewritten in terms of the…

Analysis of PDEs · Mathematics 2015-06-03 Xi Chen

We introduce and study the notion of reduced spectral synthesis, which unifies the concepts of spectral synthesis and uniqueness in locally compact groups. We exhibit a number of examples and prove that every non-discrete locally compact…

Functional Analysis · Mathematics 2019-01-18 V. S. Shulman , I. G. Todorov , L. Turowska

In this paper, we study the $\ell^p\to \ell^r$ estimates for the $S$-operator arising in restriction problems for spheres over finite fields. We establish a necessary and sufficient condition for the boundedness of the $S$-operator.…

Classical Analysis and ODEs · Mathematics 2026-03-03 Hunseok Kang , Doowon Koh , Changhun Yang

A set $\Omega \subset \mathbb{R}^d$ is said to be spectral if $L^2(\Omega)$ admits an orthogonal basis of exponentials. While the product of spectral sets is known to be spectral, the converse fails in general. In this paper, we prove that…

Classical Analysis and ODEs · Mathematics 2025-09-09 Aditya Ramabadran , Johannes van Vliet

Physical and numerical constraints in building up self-consistent population synthesis models are briefly analysed discussing their application to most of the current synthesis codes widely adopted in Galactic and extragalactic studies.

Astrophysics · Physics 2007-05-23 Alberto Buzzoni

In this paper we introduce a new type of restriction problem, called the \textit{restriction problem with moments}. We show that the surface area measure of the sphere satisfies the $L^p$-$L^2$ restriction problem with moments if $1 \leq p…

Classical Analysis and ODEs · Mathematics 2019-05-17 G. Hoepfner , A. Raich

We study the decision version of tensor spectral norm from the viewpoint of real algebraic complexity. For a rationally specified tensor, the tensor spectral threshold problem asks whether its spectral norm exceeds a prescribed rational…

Computational Complexity · Computer Science 2026-05-05 Angshul Majumdar

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

Combinatorics · Mathematics 2019-09-17 Peter Bernstein , Cashous Bortner , Samuel Coskey , Shuni Li , Connor Simpson

In this article, we prove that a compact open set in the field $\mathbb{Q}_p$ of $p$-adic numbers is a spectral set if and only if it tiles $\mathbb{Q}_p$ by translation, and also if and only if it is $p$-homogeneous which is easy to check.…

Functional Analysis · Mathematics 2016-08-25 Aihua Fan , Shilei Fan , Ruxi Shi

General purpose correct-by-construction synthesis methods are limited to systems with low dimensionality or simple specifications. In this work we consider highly symmetrical counting problems and exploit the symmetry to synthesize provably…

Systems and Control · Computer Science 2018-07-11 Petter Nilsson , Necmiye Ozay

Consider an unitary highest weight representation of a group U(p,q) in holomorphic functions on the symmetric space U(p,q)/U(p)\times U(q). Consider its restriction \rho to the subgroup O(p,q). This restriction has a complicated spectrum…

Representation Theory · Mathematics 2013-01-15 Yu. A. Neretin

Let $\mathcal{P}$ be a subset of primes and for each prime $p\in \mathcal{P}$, consider a subset $\mathcal{L}_p$ of $\mathbb{Z}/p\mathbb{Z}$. We provide restriction estimates with integers $\leq N$ sifted by…

Number Theory · Mathematics 2026-05-14 Tanmoy Bera , G. K. Viswanadham

The Fourier restriction problem asks when it is meaningful to restrict the Fourier transform of a function to a given set. Many of the key examples are smooth co-dimension 1 manifolds, although there is increasing interest in fractal sets.…

Probability · Mathematics 2026-01-12 Jonathan M. Fraser , Ana E. de Orellana

We survey recent results concerning the hereditary completeness of some special systems of functions and the spectral synthesis problem for a related class of linear operators. We present a solution of the spectral synthesis problem for…

Functional Analysis · Mathematics 2016-04-21 Anton Baranov , Yurii Belov , Alexander Borichev , Dmitry Yakubovich

We use polynomial method techniques to bound the number of tangent pairs in a collection of $N$ spheres in $\mathbb{R}^n$ subject to a non-degeneracy condition, for any $n \geq 3$. The condition, inspired by work of Zahl for $n=3$, asserts…

Combinatorics · Mathematics 2023-01-18 Conrad Crowley , Marco Vitturi

In this paper we show a characterization of the joint spectral radius of a set of matrices as the limit of the $p$-radius of an associated probability distribution when $p$ tends to $\infty$. Allowing the set to have infinitely many…

Optimization and Control · Mathematics 2016-11-04 Masaki Ogura , Clyde F. Martin

We prove a new lower bound for the unitary synthesis problem in the so-called 1.5-query setting. Our analysis establishes that any attempt to implement arbitrary n-qubit unitaries via limited oracle access requires resources that exceed the…

Quantum Physics · Physics 2025-08-22 Eric Huang

We introduce a new approach for the synthesis of Mealy machines from specifications in linear-time temporal logic (LTL), where the number of cycles in the state graph of the implementation is limited by a given bound. Bounding the number of…

Logic in Computer Science · Computer Science 2016-05-06 Bernd Finkbeiner , Felix Klein
‹ Prev 1 2 3 10 Next ›