Related papers: Cupping with random sets

We prove that suitably generic pairs of linear equations on an even number of variables are uncommon. This verifies a conjecture of Kam\v{c}ev, Morrison and the second author. Moreover, we prove that any large system containing such a…

Recall that the Mouse Set Conjecture says that under AD++V=L(P(R)), a real is ordinal definable if and only if it belongs to an iterable mouse. The Mouse Set Conjecture for sets of reals says that under the same theory, a set of reals is…

Given any subvariety of a complex torus defined over $\mathbb{Z}$ and any positive integer $k$, we construct a finite CW complex $X$ such that the $k$-th cohomology jump locus of $X$ is equal to the chosen subvariety, and the $i$-th…

We prove that negative K-groups of small abelian categories are trivial.

Using methods from coarse topology we show that fundamental classes of closed enlargeable manifolds map non-trivially both to the rational homology of their fundamental groups and to the K-theory of the corresponding reduced C*-algebras.…

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…

We consider families of k-subsets of the standard n-set. Two families F, G are said to be cross-intersecting if every member of F has non-empty intersection with every member of G. A family is called non-trivial if the intersection of all…

In this paper we consider the set of mu-types, an extension of the set of simple types freely generated from a set of atomic types and the type constructor ->, by a new operator mu, to explicitly denote solutions of recursive equations like…

We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…

The unit conjecture, commonly attributed to Kaplansky, predicts that if $K$ is a field and $G$ is a torsion-free group then the only units of the group ring $K[G]$ are the trivial units, that is, the non-zero scalar multiples of group…

In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter…

The Laver tables are finite combinatorial objects with a simple elementary definition, which were introduced by R. Laver from considerations of logic and set theory. Although these objects exhibit some fascinating properties, they seem to…

This paper aims at investigating the contractibility of the solution sets for set optimization problems by utilizing strictly quasi cone-convexlikeness, which is an assumption weaker than strictly cone-convexity, strictly…

The statement ``no nonabelian simple group can be obtained from a nonsimple group by adding one generator and one relator" 1) is equivalent to the Kervaire--Laudenbach conjecture; 2) becomes true under the additional assumption that the…

Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…

We introduce a delooping model of relative exact categories. It gives us a condition that the negative K-group of a relative exact category becomes trivial.

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

A real is called integer-valued random if no integer-valued martingale can win arbitrarily much capital betting against it. A real is low for integer-valued randomness if no integer-valued martingale recursive in A can succeed on an…

The basic random $k$-SAT problem is: Given a set of $n$ Boolean variables, and $m$ clauses of size $k$ picked uniformly at random from the set of all such clauses on our variables, is the conjunction of these clauses satisfiable? Here we…