Related papers: Generalized parity proofs of the Kochen-Specker th…
In this paper, we prove a theorem that gives a simple criterion for generating commuting pairs of generalized almost complex structures on spaces that are the product of two generalized almost contact metric spaces. We examine the…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
We address generating theorems from a given set of axioms, without proof goal, aiming at value from a mathematical point of view or as lemmas for automated proving. As benchmark, we convert a fragment of the Metamath database set.mm. Our…
We analyze the validity of Bell and Kochen-Specker theorems under local (or noncontextual) realism but avoiding an assumption of the existence of a joint probability distribution for incompatible observables. We formulate a realist model…
The Bell-Kochen-Specker theorem (BKS) theorem rules out realistic {\it non-contextual} theories by resorting to impossible assignments of rays among a selected set of maximal orthogonal bases. We investigate the geometrical structure of…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
It is shown that the codewords of the binary and ternary Golay codes can be converted into rays in RP(23) and RP(11) that provide proofs of the Kochen-Specker theorem in real state spaces of dimension 24 and 12, respectively. Some…
We give a short geometric proof of the Kochen-Specker no-go theorem for non-contextual hidden variables models. Note added to this version: I understand from Jan-Aake Larsson that the construction we give here actually contains the original…
Structural proof theory is praised for being a symbolic approach to reasoning and proofs, in which one can define schemas for reasoning steps and manipulate proofs as a mathematical structure. For this to be possible, proof systems must be…
The mixing set with a knapsack constraint arises as a substructure in mixed-integer programming reformulations of chance-constrained programs with stochastic right-hand-sides over a finite discrete distribution. Recently, Luedtke et al.…
We use Koll\'ar's gluing theory to prove the contraction theorem for generalized pairs. In particular, we show that we can run the MMP for any generalized log canonical pairs.
We investigate the possibility of constructing Kochen-Specker uncolorable sets of idempotent matrices whose entries lie in various rings, including the rational numbers, the integers, and finite fields. Most notably, we show that there is…
Coinductive reasoning about infinitary structures such as streams is widely applicable. However, practical frameworks for developing coinductive proofs and finding reasoning principles that help structure such proofs remain a challenge,…
Kochen-Specker (KS) sets are key tools for proving some fundamental results in quantum theory and also have potential applications in quantum information processing. However, so far, their intrinsic complexity has prevented experimentalists…
Little effort has been devoted to studying generalised notions or models of (un)predictability, yet is an important concept throughout physics and plays a central role in quantum information theory, where key results rely on the supposed…
In this paper we introduce generalized symmetric Meir-Keeler contractions and prove some coupled fixed point theorems for mixed monotone operators $F:X \times X \rightarrow X$ in partially ordered metric spaces. The obtained results extend,…
PARITY is the problem of determining the parity of a string $f$ of $n$ bits given access to an oracle that responds to a query $x\in\{0,1,...,n-1\}$ with the $x^{\rm th}$ bit of the string, $f(x)$. Classically, $n$ queries are required to…
We provide here a proof theoretic account of constraint programming that attempts to capture the essential ingredients of this programming style. We exemplify it by presenting proof rules for linear constraints over interval domains, and…
Several examples of generalized number systems are constructed to compare various conditions occurring in the literature for the prime number theorem in the context of Beurling generalized primes.
Gleason-type theorems for quantum theory allow one to recover the quantum state space by assuming that (i) states consistently assign probabilities to measurement outcomes and that (ii) there is a unique state for every such assignment. We…