Related papers: Cupping with random sets

A vertex $v$ of a 2-connected cubic graph $G$ is $\lambda$-matchable if $G$ has a spanning subgraph in which $v$ has degree three whereas every other vertex has degree one, and we let $\lambda(G)$ denote the number of such vertices.…

Using a recently introduced framework, we derive criteria for quantum k-separability, which are very easily computed. In the case k = 2, our criteria are equally strong to the best methods known so far, while in all other cases there are…

We generalize the optimal coupling theorem to multiple random variables: Given a collection of random variables, it is possible to couple all of them so that any two differ with probability comparable to the total-variation distance between…

A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits of A, but which does not necessarily give an answer for…

Following his discovery that finite metric spaces have injective envelopes naturally admitting a polyhedral structure, Isbell, in his pioneering work on injective metric spaces, attempted a characterization of cellular complexes admitting…

We completely characterize connected Lie groups all of whose countable subgroups are weakly amenable. We also provide a characterization of connected semisimple Lie groups that are weakly amenable. Finally, we show that a connected Lie…

We introduce a notion of realizability with ordinal Turing machines based on recognizability rather than computability, i.e., the ability to uniquely identify an object. We show that the arising concept of $r$-realizabilty has the property…

Suppose that M is countable, binary, primitive, homogeneous, and simple, and hence 1-based. We prove that the SU-rank of the complete theory of M is~1. It follows that M is a random structure. The conclusion that M is a random structure…

There are noncomputable c.e.\ sets, computable from every SJT-hard c.e.\ set. This yields a natural pseudo-jump operator, increasing on all sets, which cannot be inverted back to a minimal pair or even avoiding an upper cone.

We investigate the statement ``all automorphisms of $\mathcal P(\lambda)/[\lambda]^{<\lambda}$ are trivial''. We show that MA implies the statement for regular uncountable $\lambda<2^{\aleph_0}$; that the statement is false for measurable…

The famous Jacobian conjecture asks if a morphism $f:K[x,y]\to K[x,y]$ having an invertible Jacobian is invertible ($K$ is a characteristic zero field). We show that if one of the following three equivalent conditions is satisfied, then $f$…

In this paper we combine topological and functional analysis methods to prove that a non-locally trivial quasi-linear map defined on a $C(K)$ must be nontrivial on a subspace isomorphic to $c_0$. We conclude the paper with a few examples…

In this paper, we establish a theorem that proves a condition when an inclusion morphism between simplicial sets becomes a weak homotopy equivalence. Additionally, we present two applications of this result. The first application…

We investigate the relationship between coseparable and semisimple corings. In particular we prove that a coring over a separable algebra is coseparable if and only if it is absolutely semisimple.

In Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed as a disjunctive sum of two forms with smaller birthday. If…

A $k$-pairable $n$-qubit state is a resource state that allows Local Operations and Classical Communication (LOCC) protocols to generate EPR-pairs among any $k$-disjoint pairs of the $n$ qubits. Bravyi et al. introduced a family of…

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

Let G be a finite group. A subgroup M of G is said to be an NR-subgroup if, whenever K is normal in M, then K^G\cap M=K, where K^G is the normal closure of K in G. Using the Classification of Finite Simple Groups, we prove that if every…

For an arbitrary field $K$ and $K$-variety $V$, we introduce the \'etale-open topology on the set $V(K)$ of $K$-points of $V$. This topology agrees with the Zariski topology, Euclidean topology, or valuation topology when $K$ is separably…

Let Y and X denote C^k vector fields on a possibly noncompact surface with empty boundary, k >0. Say that Y tracks X if the dynamical system it generates locally permutes integral curves of X. Let K be a locally maximal compact set of…