English
Related papers

Related papers: Minimal bad sequences are necessary for a uniform …

200 papers

The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…

Logic in Computer Science · Computer Science 2017-03-14 Robin Adams , Marc Bezem , Thierry Coquand

The theory of Chebyshev (uniform) approximation for univariate polynomial and piecewise polynomial functions has been studied for decades. The optimality conditions are based on the notion of alternating sequence. However, the extension the…

Numerical Analysis · Mathematics 2017-09-01 Nadezda Sukhorukova , Julien Ugon , David Yost

Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. In programming, short-circuit…

Logic in Computer Science · Computer Science 2013-03-13 Jan A. Bergstra , A. Ponse , D. J. C. Staudt

Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. In programming, short-circuit…

Logic in Computer Science · Computer Science 2022-03-18 Dalia Papuc , Alban Ponse

The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…

Logic · Mathematics 2026-02-03 Roman Feller , Michael Pinsker

We show that the 1+1 dimensional reduction (i.e., the radial plane) of the Kruskal black hole can be embedded in 2+1 Minkowski spacetime and discuss how features of this spacetime can be seen from the embedding diagram. The purpose of this…

General Relativity and Quantum Cosmology · Physics 2015-06-25 Donald Marolf

A central question in quantum information theory is to determine how well lost information can be reconstructed. Crucially, the corresponding recovery operation should perform well without knowing the information to be reconstructed. In…

Quantum Physics · Physics 2016-02-08 David Sutter , Omar Fawzi , Renato Renner

We analyze Ekeland's variational principle in the context of reverse mathematics. We find that that the full variational principle is equivalent to $\Pi^1_1$-${\sf CA}_0$, a strong theory of second-order arithmetic, while natural…

Logic · Mathematics 2020-09-16 David Fernández-Duque , Paul Shafer , Keita Yokoyama

The famous theorem of Higman states that for any well-quasi-order (wqo) $Q$ the embeddability order on finite sequences over $Q$ is also wqo. In his celebrated 1965 paper, Nash-Williams established that the same conclusion holds even for…

Logic · Mathematics 2024-05-24 Fedor Pakhomov , Giovanni Soldà

Contrastive representation learning (CRL) underpins many modern foundation models. Despite recent theoretical progress, existing analyses suffer from several key limitations: (i) the statistical consistency of CRL remains poorly understood;…

Machine Learning · Computer Science 2026-05-29 Yuanfan Li , Xiyuan Wei , Tianbao Yang , Yiming Ying

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

In this thesis, we investigate the computational content and the logical strength of Ramsey's theorem and its consequences. For this, we use the frameworks of reverse mathematics and of computable reducibility. We proceed to a systematic…

Logic · Mathematics 2016-02-19 Ludovic Patey

Recently, many fundamental and important results in statistical decision theory have been extended to the quantum system. Quantum Hunt-Stein theorem and quantum locally asymptotic normality are typical successful examples. In the present…

Quantum Physics · Physics 2014-10-15 Fuyuhiko Tanaka

Despite significant progress in post-hoc explanation methods for neural networks, many remain heuristic and lack provable guarantees. A key approach for obtaining explanations with provable guarantees is by identifying a cardinally-minimal…

Machine Learning · Computer Science 2026-02-20 Shahaf Bassan , Yizhak Yisrael Elboher , Tobias Ladner , Volkan Şahin , Jan Kretinsky , Matthias Althoff , Guy Katz

A perturbative description of Large Scale Structure is a cornerstone of our understanding of the observed distribution of matter in the universe. Renormalization is an essential and defining step to make this description physical and…

High Energy Physics - Theory · Physics 2016-06-08 Ali Akbar Abolhasani , Mehrdad Mirbabayi , Enrico Pajer

We introduce the notion of minimal inversion sequences for a pattern $\rho$, which form the smallest set of inversion sequences whose avoidance is equivalent to the avoidance of $\rho$ for inversion sequences. We give a characterization of…

Combinatorics · Mathematics 2026-03-02 Benjamin Testart

Prokhorov's Theorem in probability theory states that a family $\Gamma$ of probability measures on a Polish space is tight if and only if every sequence in $\Gamma$ has a weakly convergent subsequence. Due to the highly non-constructive…

Logic · Mathematics 2025-07-16 Diego A. Rojas

In the present paper we prove several results concerning the existence of low-discrepancy point sets with respect to an arbitrary non-uniform measure $\mu$ on the $d$-dimensional unit cube. We improve a theorem of Beck, by showing that for…

Number Theory · Mathematics 2013-08-26 Christoph Aistleitner , Josef Dick

In this paper, we first provide a simple variational proof of the existence of Nash equilibrium in Hilbert spaces by using optimality conditions in convex minimization and Schauder's fixed-point theorem. Then applications of convex analysis…

Optimization and Control · Mathematics 2024-08-27 Nguyen Xuan Duy Bao , Boris Mordukhovich , Nguyen Mau Nam

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the minimum of…

Number Theory · Mathematics 2014-02-04 Caixia Shen , Li-meng Xia , Yuanlin Li