English
Related papers

Related papers: Constant Degree Direct Product Testers with Small …

200 papers

We consider the symmetric Darlington synthesis of a p x p rational symmetric Schur function S with the constraint that the extension is of size 2p x 2p. Under the assumption that S is strictly contractive in at least one point of the…

Optimization and Control · Mathematics 2011-05-04 Laurent Baratchart , Per Enqvist , Andrea Gombani , Martine Olivi

We investigate the structure of subdirect products of groups, particularly their finiteness properties. We pay special attention to the subdirect products of free groups, surface groups and HNN extensions. We prove that a finitely presented…

Group Theory · Mathematics 2014-02-26 Martin R Bridson , Charles F Miller

We characterize the model spaces $K_\Theta$ in which functions with smooth boundary extensions are dense. It is shown that such approximations are possible if and only if the singular measure associated to the singular inner factor of…

Functional Analysis · Mathematics 2021-06-18 Adem Limani , Bartosz Malman

We study two classes of extension problems, and their interconnections: (i) Extension of positive definite (p.d.) continuous functions defined on subsets in locally compact groups $G$; (ii) In case of Lie groups, representations of the…

Functional Analysis · Mathematics 2015-07-10 Palle Jorgensen , Steen Pedersen , Feng Tian

In this paper, authors prove that if $X$ is a weak Asplund space, then the space $X\times R$ is a weak Asplund space. Thus the author definitely answered an open problem raised by D.G. Larman and R.R. Phelps for 45 years ago (J. London.…

Functional Analysis · Mathematics 2025-11-03 Shaoqiang Shang

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

Logic · Mathematics 2026-04-29 Milan Rosko

Gowers introduced, for d\geq 1, the notion of dimension-d uniformity U^d(f) of a function f: G -> \C, where G is a finite abelian group and \C are the complex numbers. Roughly speaking, if U^d(f) is small, then f has certain…

Combinatorics · Mathematics 2007-05-23 Alex Samorodnitsky , Luca Trevisan

We analyze the Fourier growth, i.e. the $L_1$ Fourier weight at level $k$ (denoted $L_{1,k}$), of various well-studied classes of "structured" $\mathbb{F}_2$-polynomials. This study is motivated by applications in pseudorandomness, in…

Computational Complexity · Computer Science 2024-10-15 Jarosław Błasiok , Peter Ivanov , Yaonan Jin , Chin Ho Lee , Rocco A. Servedio , Emanuele Viola

We introduce a framework of layered subsets, and give a sufficient condition for when a set system supports an agreement test. Agreement testing is a certain type of property testing that generalizes PCP tests such as the plane vs. plane…

Computational Complexity · Computer Science 2019-09-04 Yotam Dikstein , Irit Dinur

We study correlation bounds under pairwise independent distributions for functions with no large Fourier coefficients. Functions in which all Fourier coefficients are bounded by $\delta$ are called $\delta$-{\em uniform}. The search for…

Probability · Mathematics 2010-11-09 Per Austrin , Elchanan Mossel

$C^*$-algebras, group algebras, and the algebra $\mathcal{A}(X)$ of approximable operators on a Banach space $X$ having the bounded approximation property are known to be zero product determined. We are interested in giving a quantitative…

Functional Analysis · Mathematics 2021-04-14 J. Alaminos , J. Extremera , M. L. C. Godoy , A. R. Villena

We prove a query complexity variant of the weak polynomial Freiman-Ruzsa conjecture in the following form. For any $\epsilon > 0$, a set $A \subset \mathbb{Z}^d$ with doubling $K$ has a subset of size at least $K^{-\frac{4}{\epsilon}}|A|$…

Number Theory · Mathematics 2022-01-14 Dmitrii Zhelezov , Dömötör Pálvölgyi

In this work we prove a new $L^p$ holomorphic extension result for functions defined on product Lipschitz surfaces with small Lipschitz constants in two complex variables. We define biparameter and partial Cauchy integral operators that…

Classical Analysis and ODEs · Mathematics 2015-04-02 Jarod Hart , Alessandro Monguzzi

We consider the problem of unconstrained minimization of a smooth function in the derivative-free setting using. In particular, we propose and study a simplified variant of the direct search method (of direction type), which we call…

Optimization and Control · Mathematics 2014-11-14 Jakub Konečný , Peter Richtárik

We establish a spectral duality for certain unbounded operators in Hilbert space. The class of operators includes discrete graph Laplacians arising from infinite weighted graphs. The problem in this context is to establish a practical…

Functional Analysis · Mathematics 2008-08-05 Dorin Ervin Dutkay , Palle E. T. Jorgensen

Cosystolic expansion is a high-dimensional generalization of the Cheeger constant for simplicial complexes. Originally, this notion was motivated by the fact that it implies the topological overlapping property, but more recently it was…

Combinatorics · Mathematics 2025-04-09 Izhar Oppenheim , Inga Valentiner-Branth

We study boundary value problems associated with singular, strongly nonlinear differential equations with functional terms of type $$\big(\Phi(k(t)\,x'(t))\big)' + f(t,\mathcal{G}_x(t))\,\rho(t, x'(t)) = 0$$ on a compact interval $[a,b]$.…

Classical Analysis and ODEs · Mathematics 2020-03-03 Stefano Biagi , Alessandro Calamai , Cristina Marcelli , Francesca Papalini

Let $X$ be a simplicial complex with $n$ vertices. A missing face of $X$ is a simplex $\sigma\notin X$ such that $\tau\in X$ for any $\tau\subsetneq \sigma$. For a $k$-dimensional simplex $\sigma$ in $X$, its degree in $X$ is the number of…

Combinatorics · Mathematics 2019-10-16 Alan Lew

Recently there has been much interest in Gowers uniformity norms from the perspective of theoretical computer science. This is mainly due to the fact that these norms provide a method for testing whether the maximum correlation of a…

Computational Complexity · Computer Science 2013-08-14 Hamed Hatami , Shachar Lovett

The primary problem in property testing is to decide whether a given function satisfies a certain property, or is far from any function satisfying it. This crucially requires a notion of distance between functions. The most prevalent notion…

Discrete Mathematics · Computer Science 2014-04-04 Deeparnab Chakrabarty , Kashyap Dixit , Madhav Jha , C. Seshadhri
‹ Prev 1 3 4 5 6 7 10 Next ›