English
Related papers

Related papers: Pitowsky's Kolmogorovian models and Super-Determin…

200 papers

Some notions in mathematics can be considered relative. Relative is a term used to denote when the variation in the position of an observer implies variation in properties or measures on the observed object. We know, from Skolem theorem,…

Logic in Computer Science · Computer Science 2016-03-04 Edward Hermann Haeusler

Classical theorem of Luzin states that a measurable function of one real variable is "almost" continuous. For measurable functions of several variables the analogous statement (continuity on the product of sets having almost full measure)…

Functional Analysis · Mathematics 2015-06-23 A. Vershik , F. Petrov , P. Zatitskiy

Classical Luzin's theorem states that the measurable function of one variable is "almost" continuous. This is not so anymore for functions of several variables. The search of right analogue of the Luzin theorem leads to a notion of…

Functional Analysis · Mathematics 2013-07-17 Anatoly Vershik , Pavel Zatitskiy , Fedor Petrov

Within psychology, neuroscience and artificial intelligence, there has been increasing interest in the proposal that the brain builds probabilistic models of sensory and linguistic input: that is, to infer a probabilistic model from a…

Machine Learning · Computer Science 2017-08-08 Paul M. B. Vitanyi , Nick Chater

We study the removability of compact sets for continuous Sobolev functions. In particular, we focus on sets with infinitely many complementary components, called "detour sets", which resemble the Sierpi\'nski gasket. The main theorem is…

Classical Analysis and ODEs · Mathematics 2020-10-30 Dimitrios Ntalampekos

We constructed a Hilbert space representation of a contextual Kolmogorov model. This representation is based on two fundamental observables -- in the standard quantum model these are position and momentum observables. This representation…

Quantum Physics · Physics 2015-06-26 Andrei Khrennikov

Parabolic integro-differential Kolmogorov equations with different space-dependent operators are considered in H\"{o}lder-type spaces defined by a scalable L\'{e}vy measure. Probabilistic representations are used to prove continuity of the…

Probability · Mathematics 2018-10-04 Fanhui Xu

A recently formulated conjecture of Gamayun, Iorgov and Lisovyy gives an asymptotic expansion of the Jimbo--Miwa--Ueno isomonodromic $\tau$-function for certain Painlev\'e transcendents. The coefficients in this expansion are given in terms…

Mathematical Physics · Physics 2015-06-19 F. Balogh

No physical measurement can be performed with infinite precision. This leaves a loophole in the standard no-go arguments against non-contextual hidden variables. All such arguments rely on choosing special sets of quantum-mechanical…

Quantum Physics · Physics 2009-10-31 Rob Clifton , Adrian Kent

In the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $\mathbf{ZF}$, some are shown to be independent of…

General Topology · Mathematics 2020-08-05 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

The classical Sturm-Hurwitz-Kellogg theorem asserts that a function, orthogonal to an n-dimensional Chebyshev system on a circle, has at least n+1 sign changes. We prove the converse: given an n-dimensional Chebyshev system on a circle and…

Differential Geometry · Mathematics 2007-11-01 S. Tabachnikov

The Kantorovich-Rubinshtein metric is an $L^1$-like metric on spaces of probability distributions that enjoys several serendipitous properties. It is complete separable if the underlying metric space of points is complete separable, and in…

General Topology · Mathematics 2022-12-23 Jean Goubault-Larrecq

In 1952, Littlewood stated a conjecture about the average growth of spherical derivatives of polynomials, and showed that it would imply that for entire function of finite order, "most" preimages of almost all points are concentrated in a…

Complex Variables · Mathematics 2019-10-30 Lukas Geyer

Virtually all questions that one can ask about the behavioral and structural complexity of a stochastic process reduce to a linear algebraic framing of a time evolution governed by an appropriate hidden-Markov process generator. Each type…

Chaotic Dynamics · Physics 2018-04-18 Paul M. Riechers , James P. Crutchfield

Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory -- in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the…

Computational Complexity · Computer Science 2008-03-28 Martin Ziegler , Wouter M. Koolen

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

Machine Learning · Computer Science 2011-11-09 Marcus Hutter

We develop a theory for functional independent component analysis in an infinite-dimensional framework using Sobolev spaces that accommodate smoother functions. The notion of penalized kurtosis is introduced motivated by Silverman's method…

Statistics Theory · Mathematics 2025-08-05 Marc Vidal , Marc Leman , Ana M. Aguilera

We prove a variant of the Chance-McDuff conjecture for pseudo-rotations: under certain additional conditions, a closed symplectic manifold which admits a Hamiltonian pseudo-rotation must have deformed quantum product and, in particular,…

Symplectic Geometry · Mathematics 2019-08-08 Erman Cineli , Viktor L. Ginzburg , Basak Z. Gurel

One of the fundamental challenges found throughout the data sciences is to explain why things happen in specific ways, or through which mechanisms a certain variable $X$ exerts influences over another variable $Y$. In statistics and machine…

Methodology · Statistics 2023-06-09 Drago Plecko , Elias Bareinboim

Opacity is a generic security property, that has been defined on (non probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an…

Cryptography and Security · Computer Science 2014-09-02 Béatrice Bérard , Krishnendu Chatterjee , Nathalie Sznajder