Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAdditivity of the dp-rank
81
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The main result of this article is sub-additivity of the dp-rank. We also show that the study of theories of finite dp-rank can not be reduced to the study of its dp-minimal types, and discuss the possible relations between dp-rank and VC-density.
rate research
Read More
Whereas matrix rank is additive under direct sum, in 1981 Schonhage showed that one of its generalizations to the tensor setting, tensor border rank, can be strictly subadditive for tensors of order three. Whether border rank is additive for higher order tensors has remained open. In this work, we settle this problem by providing analogs of Schonhages construction for tensors of order four and higher. Schonhages work was motivated by the study of the computational complexity of matrix multiplication; we discuss implications of our results for the asymptotic rank of higher order generalizations of the matrix multiplication tensor.
We obtain a computable structure of Scott rank omega_1^{CK} (call this ock), and give a general coding procedure that transforms any hyperarithmetical structure A into a computable structure A such that the rank of A is ock, ock+1, or < ock iff the same is true of A.
N. Hindman, I. Leader and D. Strauss proved that it is consistent that there is a finite colouring of $mathbb R$ so that no infinite sumset $X+X={x+y:x,yin X}$ is monochromatic. Our aim in this paper is to prove a consistency result in the opposite direction: we show that, under certain set-theoretic assumptions, for any $c:mathbb Rto r$ with $r$ finite there is an infinite $Xsubseteq mathbb R$ so that $c$ is constant on $X+X$.
This list presents problems in the Reverse Mathematics of infinitary Ramsey theory which I find interesting but do not personally have the techniques to solve. The intent is to enlist the help of those working in Reverse Mathematics to take on such problems, and the myriad of related questions one can infer from them. A short bit of background and starting references are provided.
We solve the decidability problem for Boolean Set Theory with unordered cartesian product.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
