Related papers: Partition genericity and pigeonhole basis theorems
The Boolean logic of subsets, usually presented as `propositional logic,' is considered as being "classical" while intuitionistic logic and the many sublogics and off-shoots are "non-classical." But there is another mathematical logic, the…
We derive exact and asymptotic results for random partitions from general results in the semi-classical analysis of coherent states applied to the classical periodic Benjamin-Ono equation at critical regularity $s= -1/2$. We find classical…
A seminal theorem of Tverberg states that any set of $T(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Almost any collection of fewer points in…
Quantum theory is notoriously counterintuitive, and yet remains entirely self-consistent when applied universally. Here we uncover a new manifestation of its unusual consequences. We demonstrate, theoretically and experimentally (by means…
Indistinguishability of particles is normally considered to be an inherently quantum property which cannot be possessed by a classical theory. However, Saunders has argued that this is incorrect, and that classically indistinguishable…
The superposition principle lies at the heart of many non-classical properties of quantum mechanics. Motivated by this, we introduce a rigorous resource theory framework for the quantification of superposition of a finite number of linear…
By means of several examples, we motivate that universal properties are the simplest way to solve a given mathematical problem, explaining in this way why they appear everywhere in mathematics. In particular, we present the co-universal…
In previous works, we studied intersection homotopy groups associated to a Goresky and MacPherson perversity and a filtered space. They are defined as the homotopy groups of simplicial sets introduced by P. Gajer. We particularized to…
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these…
We study some generalized notions of cohesiveness which arise naturally in connection with effective versions of Ramsey's Theorem. An infinite set $A$ of natural numbers is $n$--cohesive (respectively, $n$--r--cohesive) if $A$ is almost…
We propose a definition of partition quantum spaces. They are given by universal $C^*$-algebras whose relations come from partitions of sets. We ask for the maximal compact matrix quantum group acting on them. We show how those fit into the…
Motivated by the fundamental problem of measuring species diversity, this paper introduces the concept of a cluster structure to define an exchangeable cluster probability function that governs the joint distribution of a random count and…
We shift the perspective on the interval fragmentation problem from division points to division spacings. This leads to a proof that is both simpler and stronger, establishing limiting distributions for partition points and spacings and,…
This paper consists of three steps. In the first, we prove that the Bekenstein-Hawking entropy is the unique expression of black hole entropy. Our proof is constructed in the framework of thermodynamics without any statistical discussion.…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…
$P$-divisibility is a central concept in both classical and quantum non-Markovian processes; in particular, it is strictly related to the notion of information backflow. When restricted to a fixed commutative algebra generated by a complete…
The framework of generalized probabilistic theories (GPT) is a widely-used approach for studying the physical foundations of quantum theory. The standard GPT framework assumes the no-restriction hypothesis, in which the state space of a…
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…
By analyzing the key properties of black holes from the point of view of quantum information, we derive a model-independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with…
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…