Related papers: Cupping with random sets
We answer in the affirmative a recently-posed question that asked if there exists an "untypical" convex mapping cone -- i.e., one that does not arise from the transpose map and the cones of k-positive and k-superpositive maps. We explicitly…
One of the central aims of the Minimal Model Program is to show that a projective log canonical pair $(X,\Delta)$ with $K_X+\Delta$ pseudoeffective has a good model, i.e.\ a minimal model $(Y,\Delta_Y)$ such that $K_Y+\Delta_Y$ is…
A resolution-free definition of rational singularities is introduced, and it is proved that for a variety admitting a resolution of singularities, so in particular in characteristic zero, this is equivalent to the usual definition. It is…
It is proved that every normalized weakly null \sq\ has a sub\sq\ which is convexly unconditional. Further, an Hierarchy of summability methods is introduced and with this we give a complete classification of the complexity of weakly null…
Self-rational maps of generic algebraic K3 surfaces are conjectured to be trivial. We relate this conjecture to a conjecture concerning the irreducibility of the universal Severi varieties parametrizing nodal curves of given genus and…
A cardinal kappa is countably closed if mu^omega < kappa whenever mu < kappa. Assume that there is no inner model with a Woodin cardinal and that every set has a sharp. Let K be the core model. Assume that kappa is a countably closed…
Let $X(\RR)$ be a geometrically connected variety defined over $\RR$ and such that the set of all its (also complex) points $X(\CC)$ is non-degenerate. We introduce the notion of \emph{admissible rank} of a point $P$ with respect to $X$ to…
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…
This paper concerns the characterisation of second order marginals for random sets in a discrete setting. Under the instance of unit covariances, this problem possesses a combinatorial symmetry, exploited jointly in the companion paper to…
A finite group is said to be weakly separable if every algebraic isomorphism between two $S$-rings over this group is induced by a combinatorial isomorphism. In the paper we prove that every abelian weakly separable group belongs to one of…
A subset of the Cantor cube is null-additive if its algebraic sum with any null set is null. We construct a set of cardinality continuum such that: all continuous images of the set into the Cantor cube are null-additive, it contains a…
Answering a question of Goode, we show that $k$-triviality collapses to (1-)triviality among simple theories. In particular, every stable theory with quantifier elimination in a relational language of bounded arity is trivial. We use our…
We discuss a weak constraint qualification for conic linear programs and its applications for a few classes of cones. This constraint qualification is used to give a solution to a problem proposed by Shapiro and Z\v{a}linescu and show that…
We show that under suitable hypotheses, the second homotopy group of the coned-off space associated to a $C(9)$ cubical presentation is trivial, and use this to provide classifying spaces for proper actions for the fundamental groups of…
We introduce the concept of a 1-coaligned $k$-graph and prove that the shift maps of a $k$-graph pairwise *-commute if and only if the $k$-graph is 1-coaligned. We then prove that for 2-graphs $\Lambda$ generated from basic data *-commuting…
A k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contraction-critically k-connected. These three classes play a…
We present a proof for a conjecture previously formulated by Dzhafarov, Kujala, and Larsson (Foundations of Physics, in press, arXiv:1411.2244). The conjecture specifies a measure for the degree of contextuality and a criterion (necessary…
The problem of quantum state classification asks how accurately one can identify an unknown quantum state that is promised to be drawn from a known set of pure states. In this work, we introduce the notion of $k$-learnability, which…
We revisit the Kahn-Kalai conjecture, recently proved in striking fashion by Park and Pham, and present a slightly reformulated simple proof which has a few advantages: (1) it works for non-uniform product measures, (2) it gives…
Let $K$ denote prefix-free Kolmogorov Complexity, and $K^A$ denote it relative to an oracle $A$. We show that for any $n$, $K^{\emptyset^{(n)}}$ is definable purely in terms of the unrelativized notion $K$. It was already known that…