English
Related papers

Related papers: The weak pigeonhole principle for function classes…

200 papers

We introduce a new higher categorical structure called a weakly globular n-fold category. This structure is based on iterated internal categories and on the notion of weak globularity. We identify a suitable class of pseudo-functors whose…

Category Theory · Mathematics 2016-05-24 Simona Paoli

A conjecture of Hopkins (2018) posits that for certain high-dimensional hypothesis testing problems, no polynomial-time algorithm can outperform so-called "simple statistics", which are low-degree polynomials in the data. This conjecture…

Computational Complexity · Computer Science 2020-04-21 Justin Holmgren , Alexander S. Wein

A relation is obtained between weak values of quantum observables and the consistency criterion for histories of quantum events. It is shown that ``strange'' weak values for projection operators (such as values less than zero) always…

Quantum Physics · Physics 2007-05-23 R. E. Kastner

We give an example of two ordered structures M, N in the same language L with the same universe, the same order and admitting the same one-variable definable subsets such that M is a model of the common theory of o-minimal L-structures and…

Logic · Mathematics 2023-09-15 Nadav Meir

We prove a version of the reduction principle for functionals of vector long-range dependent random fields. The components of the fields may have different long-range dependent behaviours. The results are illustrated by an application to…

Probability · Mathematics 2018-04-02 Andriy Olenko , Dareen Omari

We consider several weak type estimates for singular operators using the Bellman function approach. We disprove the $A_1$ conjecture of Muckenhoupt, which stayed open after Muckenhoupt--Wheeden's conjecture was disproved by Reguera--Thiele.

Analysis of PDEs · Mathematics 2018-06-13 Fedor Nazarov , Alexander Reznikov , Vasily Vasyunin , Alexander Volberg

Structural recursion is a common technique used by programmers in modern languages and is taught to introductory computer science students. But what about its dual, structural corecursion? Structural corecursion is an elegant technique,…

Programming Languages · Computer Science 2026-03-05 Zena M. Ariola , Paul Downen , Hugo Herbelin

This paper is concerned with an elliptic system of Kirchhoff type, driven by the variable-order fractional $p(x)$-operator. With the help of the direct variational method and Ekeland variational principle, we show the existence of a weak…

Analysis of PDEs · Mathematics 2021-02-18 Yong Wu , Zhenhua Qiao , Mohamed Karim Hamdani , Bingyu Kou , Libo Yang

We present a recursive formulation of the Horn algorithm for deciding the satisfiability of propositional clauses. The usual presentations in imperative pseudo-code are informal and not suitable for simple proofs of its main properties. By…

Logic in Computer Science · Computer Science 2018-09-14 António Ravara

We prove lower bounds for proofs of the bit pigeonhole principle (BPHP) and its generalizations in bounded-depth resolution over parities (Res$(\oplus)$). For weak BPHP$_n^m$ with $m = cn$ pigeons (for any constant $c>1$) and $n$ holes, for…

Computational Complexity · Computer Science 2025-11-26 Farzan Byramji , Russell Impagliazzo

The purpose of this paper is to provide a proof of James' weak compactness theorem that is able to be taught in a first year graduate class in functional analysis.

Functional Analysis · Mathematics 2017-05-19 Warren B. Moors , Samuel White

We consider the problem of obtaining interpolation constraints for function classes, i.e., necessary and sufficient constraints that a set of points, function values and (sub)gradients must satisfy to ensure the existence of a global…

Optimization and Control · Mathematics 2025-09-16 Anne Rubbens , Julien M. Hendrickx

Let $R$ be a commutative ring with a non-zero identity, $S$ be a multiplicatively closed subset of $R$ and $M$ be a unital $R$-module. In this paper, we define a submodule $N$ of $M$ with $(N:_{R}M)\cap S=\emptyset$ to be weakly $S$-primary…

Commutative Algebra · Mathematics 2022-03-29 Ece Yetkin Celikel , Hani A. Khashan

In this paper we consider Dynkin's games with payoffs which are functions of an underlying process. Assuming extended weak convergence of underlying processes $\{S^{(n)}\}_{n=0}^{\infty}$ to a limit process $S$ we prove convergence Dynkin's…

Probability · Mathematics 2010-11-12 Yan Dolinsky

The time derivative of a physical property often gives rise to another meaningful property. Since weak values provide empirical insights that cannot be derived from expectation values, this paper explores what physical properties can be…

Quantum Physics · Physics 2026-01-21 Xavier Oriols

We prove that, consistently, there exists a weakly but not strongly inaccessible cardinal $\lambda$ for which the sequence $\langle 2^\theta:\theta<\lambda\rangle$ is not eventually constant and the weak diamond fails at $\lambda$. We also…

Logic · Mathematics 2021-03-12 Shimon Garti , Saharon Shelah

Let $R=\mathbb K[x,y,z]$ be a standard graded polynomial ring where $\mathbb K$ is an algebraically closed field of characteristic zero. Let $M = \oplus_j M_j$ be a finite length graded $R$-module. We say that $M$ has the Weak Lefschetz…

Algebraic Geometry · Mathematics 2018-03-29 Gioia Failla , Zachary Flores , Chris Peterson

In this article we give some refinements of Simpson's Rule in cases when it is not applicable in it's classical form i.e., when the target function is not four times differentiable on a given interval. Some sharp two-sided inequalities for…

Classical Analysis and ODEs · Mathematics 2020-11-30 Slavko Simic

The mild form of the Weak Gravity Conjecture states that quantum or higher-derivative corrections should decrease the mass of large extremal charged black holes at fixed charge. This allows extremal black holes to decay, unless protected by…

High Energy Physics - Theory · Physics 2021-04-27 Lars Aalsma , Alex Cole , Gregory J. Loges , Gary Shiu

A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.

Cryptography and Security · Computer Science 2008-01-16 Ephraim Feig , Vivian Feig
‹ Prev 1 8 9 10 Next ›