Related papers: Pseudo PCF
We continue the study of properties related to monotone countable paracompactness, investigating various monotone versions of $\delta$-normality. We factorize monotone normality and stratifiability in terms of these weaker properties.
This paper presents a theory of non-linear integer/real arithmetic and algorithms for reasoning about this theory. The theory can be conceived as an extension of linear integer/real arithmetic with a weakly-axiomatized multiplication…
We discuss walking behavior in gauge theories and weak first-order phase transitions in statistical physics. Despite appearing in very different systems (QCD below the conformal window, the Potts model, deconfined criticality) these two…
Principal component analysis is considered as an addition to the well-tested parametrization w(a)=w_0+w_a(1-a) for the dark energy equation of state. This brief note cautions against some unjustified assumptions in interpretation of PCA…
Probabilistic cellular automata (PCA) are used to model a variety of discrete spatially extended systems undergoing parallel-updating. We propose an embedding of a number of classical nonequilibrium concepts in the PCA-world. We start from…
We prove a weak version of the cross--product conjecture: ${F}(k+1,\ell) {F}(k,\ell+1) \geq (\frac12+\varepsilon) {F}(k,\ell) {F}(k+1,\ell+1)$, where ${F}(k,\ell)$ is the number of linear extensions for which the values at fixed elements…
A new pseudoclassical model to describe Weyl particles is proposed. Different ways of its quantization are presented. They all lead to the theory of Weyl particle; namely, the massless Dirac equation and the Weyl condition are reproduced.…
We present a semantics of a probabilistic while-language with soft conditioning and continuous distributions which handles programs diverging with positive probability. To this end, we extend the probabilistic guarded command language…
The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and…
Weak measurement of a quantum system followed by postselection based on a subsequent strong measurement gives rise to a quantity called the weak value: a complex number for which the interpretation has long been debated. We analyse the…
In a context of multiple hypothesis testing, we provide several new exact calculations related to the false discovery proportion (FDP) of step-up and step-down procedures. For step-up procedures, we show that the number of erroneous…
It is well-known that the higher-order language PCF is not fully abstract: there is a program - the so-called parallel or tester, meant to test whether its input behaves as a parallel or - which never terminates on any input, operationally,…
We study the detection capability of the weak-value amplification on the basis of the statistical hypothesis testing. We propose a reasonable testing method in the physical and statistical senses to find that the weak measurement with the…
LANL Memorandum of potentially broad interest. A direct comparison is performed between transport coefficients for weakly coupled plasmas obtained with different formalisms to demonstrate that these formalisms give identical predictions.…
The arrival time probability distribution is defined by analogy with the classical mechanics. The difficulty of requirement to have the values of non-commuting operators is circumvented using the concept of weak measurements. The proposed…
We show that the classifying category C(T) of a dependent type theory T with axioms for identity types admits a non-trivial weak factorisation system. We provide an explicit characterisation of the elements of both the left class and the…
We propose Equivariant ZFA with Choice as a foundation for nominal techniques that is stronger than ZFC and weaker than FM, and why this may be particularly helpful in the context of automated reasoning.
Let $F$ be a discrete Morse function on a simplicial complex $L$. We construct a discrete Morse function $\Delta(F)$ on the barycentric subdivision $\Delta(L)$. The constructed function $\Delta(F)$ "behaves the same way" as $F$, i. e. has…
Counterfactual explanations (CEs) offer interpretable insights into machine learning predictions by answering ``what if?" questions. However, in real-world settings where models are frequently updated, existing counterfactual explanations…
This paper provides convergence analysis for the approximation of a class of path-dependent functionals underlying a continuous stochastic process. In the first part, given a sequence of weak convergent processes, we provide a sufficient…