English
Related papers

Related papers: Characterizing Direct Product Testing via Cobounda…

200 papers

We study quantum property testing for directed graphs with maximum in-degree and out-degree bounded by some universal constant $d$. For a proximity parameter $\varepsilon$, we show that any property that can be tested with…

Quantum Physics · Physics 2026-04-10 Pan Peng , Jingyu Wu

A key challenge in scientific machine learning is solving partial differential equations (PDEs) on complex domains, where the curved geometry complicates the approximation of functions and their derivatives required by differential…

Numerical Analysis · Mathematics 2025-09-26 Hanfei Zhou , Lei Shi

High dimensional expanders is a vibrant emerging field of study. Nevertheless, the only known construction of bounded degree high dimensional expanders is based on Ramanujan complexes, whereas one dimensional bounded degree expanders are…

Combinatorics · Mathematics 2023-09-29 Tali Kaufman , Izhar Oppenheim

Our basic concept is the set $\mathcal{E}(H)$ of effects on a finite dimensional complex Hilbert space $H$. If $a,b\in\mathcal{E}(H)$, we define the sequential product $a[\mathcal{I}]b$ of $a$ then $b$. The sequential product depends on the…

Quantum Physics · Physics 2023-08-01 Stanley Gudder

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 purpose of this paper is to exhibit fine structure for polyhedral products Z(K;(X,A) and polyhedral smash products $\widehat{Z}(K;(X,A)$. (Moment-angle complexes are special cases for which (X,A) = (D^2,S^1)). There are three main…

Algebraic Topology · Mathematics 2015-11-30 A. Bahri , M. Bendersky , F. R. Cohen , S. Gitler

In this paper, we study the asymptotic properties (bias, variance, mean squared error) of Bernstein estimators for cumulative distribution functions and density functions near and on the boundary of the $d$-dimensional simplex. Our results…

Statistics Theory · Mathematics 2023-02-09 Frédéric Ouimet

This article deals with two different problems in commutative algebra. In the first part, we give a proof of generalized forms of the Direct Summand Theorem (DST (or DCS)) for module-finite extension rings of mixed characteristic $R\subset…

Commutative Algebra · Mathematics 2017-08-14 Danny A. J. Gomez-Ramirez , Edisson Gallego , Juan D. Velez

Ultrahigh-dimensional variable selection plays an increasingly important role in contemporary scientific discoveries and statistical research. Among others, Fan and Lv [J. R. Stat. Soc. Ser. B Stat. Methodol. 70 (2008) 849-911] propose an…

Methodology · Statistics 2012-11-14 Jianqing Fan , Rui Song

The problem of testing low-degree polynomials has received significant attention over the years due to its importance in theoretical computer science, and in particular in complexity theory. The problem is specified by three parameters:…

Computational Complexity · Computer Science 2022-02-18 Tali Kaufman , Dor Minzer

The set B of geodesic rays avoiding a suitable obstacle in a complete negatively curved Riemannian manifold determines a spectrum S. While various properties of this spectrum are known, we define and study dimension functions on S in terms…

Dynamical Systems · Mathematics 2014-09-08 Steffen Weil

The paper introduces new sufficient conditions of strict positive definiteness for kernels on d-dimensional spheres which are not radially symmetric but possess specific coefficient structures. The results use the series expansion of the…

Numerical Analysis · Mathematics 2021-05-07 Martin Buhmann , Janin Jäger

An object type characterizes the domain space and the operations that can be invoked on an object of that type. In this paper we introduce a new property for concurrent objects, we call coverability, that aims to provide precise guarantees…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-03-14 Nicolas Nicolaou , Antonio Fernández Anta , Chryssis Georgiou

We consider Laplacian eigenfunctions on a $d-$dimensional bounded domain $M$ (or a $d-$dimensional compact manifold $M$) with Dirichlet conditions. These operators give rise to a sequence of eigenfunctions $(e_\ell)_{\ell \in \mathbb{N}}$.…

Analysis of PDEs · Mathematics 2018-11-27 Jianfeng Lu , Christopher D. Sogge , Stefan Steinerberger

Finite-dimensional linear programs satisfy strong duality (SD) and have the "dual pricing" (DP) property. The (DP) property ensures that, given a sufficiently small perturbation of the right-hand-side vector, there exists a dual solution…

Optimization and Control · Mathematics 2015-10-27 Amitabh Basu , Kipp Martin , Christopher Thomas Ryan

If $G$ is a group, we say a subset $S$ of $G$ is product-free if the equation $xy=z$ has no solutions with $x,y,z \in S$. For $D \in \mathbb{N}$, a group $G$ is said to be $D$-quasirandom if the minimal dimension of a nontrivial complex…

Combinatorics · Mathematics 2024-05-06 David Ellis , Guy Kindler , Noam Lifshitz , Dor Minzer

We say a smooth projective surface $X$ satisfies the bounded cohomology property if there exists a positive constant $c_X$ such that $h^1(\mathcal O_X(C))\le c_Xh^0(\mathcal O_X(C))$ for every prime divisor $C$ on $X$. Let the closed Mori…

Algebraic Geometry · Mathematics 2023-06-13 Sichen Li

I prove that if $\emptyset \neq K \subset \mathbb{R}^{2}$ is a compact $s$-Ahlfors-David regular set with $s \geq 1$, then $$\dim_{\mathrm{p}} D(K) = 1,$$ where $D(K) := \{|x - y| : x,y \in K\}$ is the distance set of $K$, and…

Classical Analysis and ODEs · Mathematics 2016-12-14 Tuomas Orponen

We characterize the set of properties of Boolean-valued functions on a finite domain $\mathcal{X}$ that are testable with a constant number of samples. Specifically, we show that a property $\mathcal{P}$ is testable with a constant number…

Data Structures and Algorithms · Computer Science 2016-12-20 Eric Blais , Yuichi Yoshida

Property Testing is a formal framework to study the computational power and complexity of sampling from combinatorial objects. A central goal in standard graph property testing is to understand which graph properties are testable with…

Data Structures and Algorithms · Computer Science 2025-09-08 Artur Czumaj , Christian Sohler , Stefan Walzer
‹ Prev 1 3 4 5 6 7 10 Next ›