Related papers: Cupping with random sets

We provide a combinatorial characterization of all testable properties of $k$-uniform hypergraphs ($k$-graphs for short). Here, a $k$-graph property $P$ is testable if there is a randomized algorithm which makes a bounded number of edge…

We prove that a group obtained as a quotient of the free product of finitely many cubulable groups by a finite set of relators satisfying the classical $C'(1/6)$--small cancellation condition is cubulable. This yields a new large class of…

We show that for a coconnective ring spectrum satisfying regularity and flatness assumptions, its algebraic K-theory agrees with that of its $\pi_0$. We prove this as a consequence of a more general devissage result for stable infinity…

Let G be a connected complex Lie group. We show that any flat principal G-bundle over any finite CW-complex pulls back to a trivial bundle over some finite covering space of the base space if and only if each real characteristic class of…

A longstanding question is to characterize the lattice of supersets (modulo finite sets), $\mathcal{L}^*(A)$, of a low$_2$ computably enumerable (c.e.) set. The conjecture is that $\mathcal{L}^*(A)\cong {\mathcal E}^*$. In spite of claims…

Kirchberg's Embedding Problem (KEP) asks whether every separable C$^*$ algebra embeds into an ultrapower of the Cuntz algebra $\mathcal{O}_2$. In this paper, we use model theory to show that this conjecture is equivalent to a local…

Let Delta_{n-1} denote the (n-1)-dimensional simplex. Let Y be a random k-dimensional subcomplex of Delta_{n-1} obtained by starting with the full (k-1)-dimensional skeleton of Delta_{n-1} and then adding each k-simplex independently with…

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…

Given a closed, convex and pointed cone K in R^n, we present a result which infers K-irreducibility of sets of K-quasipositive matrices from strong connectedness of certain bipartite digraphs. The matrix-sets are defined via products, and…

The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…

Multistage sampling is commonly used for household surveys when there exists no sampling frame, or when the population is scattered over a wide area. Multistage sampling usually introduces a complex dependence in the selection of the final…

For any set $X$, ${\mathcal P}(X)$ denotes the collection of all subsets of $X$, ordered by inclusion. A {\it cutset} in ${\mathcal P}(X)$ is a subset of ${\mathcal P}(X)$ which meets every maximal chain of ${\mathcal P}(X)$. A cutset is…

For any real $x$ and any integer $k\ge1$, we say that a set $\mathcal{D}_{k}$ of $k$ distinct integers is a $k$-tuple jumping champion if it is the most common differences that occurs among $k+1$ consecutive primes less than or equal to…

In the present article, we investigate a possibility of a real-valued map on the space of tuples of commuting trace-class self-adjoint operators, which behaves like the usual trace map on the space of trace-class linear operators. It turns…

We examine the question whether random set attractors for continuous-time random dynamical systems on a connected state space are connected. In the deterministic case, these attractors are known to be connected. In the probabilistic setup,…

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…

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for reals: A is K-trivial if its initial segments have the lowest…

Toward defining commutative cubes in all dimensions, Brown and Spencer introduced the notion of "connection" as a new kind of degeneracy. In this paper, for a cubical set with connections, we show that the connections generate an acyclic…

In this paper, we first prove that a compact K\"ahler manifold is projective if it satisfies certain quasi-positive curvature conditions, including quasi-positive $S_2^\perp,\, S_2^+,\,\mbox{Ric}_3^\perp, \,\mbox{Ric}_3^+$ or…