Related papers: Upper bound on some hightness notions
The paper proves finite model property and decidability for a family of modal logics. A binary relation $R$ is called pretransitive, if $R^*=\cup_{i\leq m} R^i$ for some $m\geq 0$, where $R^*$ is the transitive reflexive closure of $R$. By…
A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…
Using the Lieb-Robinson inequality and the continuity property of the quantum capacities in terms of the diamond norm, we derive an upper bound on the values that these capacities can attain in spin-network communication i.i.d. models of…
Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation…
A random matrix model with a sigma-model like constraint, the restricted trace ensemble (RTE), is solved in the large-n limit. In the macroscopic limit the smooth connected two-point resolvent G(z,w) is found to be non-universal, extending…
Given a finite structure $M$ and property $p$, it is a natural to study the degree of satisfiability of $p$ in $M$; i.e. to ask: what is the probability that uniformly randomly chosen elements in $M$ satisfy $p$? In group theory, a…
Biggins [Uniform convergence of martingales in the branching random walk. {\em Ann. Probab.}, 20(1):137--151, 1992] proved local uniform convergence of additive martingales in $d$-dimensional supercritical branching random walks at complex…
In this paper upper and lower bounds on the probability of decoding failure under maximum likelihood decoding are derived for different (nonbinary) Raptor code constructions. In particular four different constructions are considered; (i)…
We show that, consistently, there can be maximal subtrees of P (omega) and P (omega) / fin of arbitrary regular uncountable size below the size of the continuum. We also show that there are no maximal subtrees of P (omega) / fin with…
For any countably infinite graph $G$, Ramsey's theorem guarantees an infinite monochromatic copy of $G$ in any $r$-coloring of the edges of the countably infinite complete graph $K_\mathbb{N}$. Taking this a step further, it is natural to…
We introduce the notion of \textit{Perron capacity} of a set of slopes $\Omega \subset \mathbb{R}$. Precisely, we prove that if the Perron capacity of $\Omega$ is finite then the directional maximal operator associated $M_\Omega$ is not…
We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed…
Ramsey's theorem asserts that every $k$-coloring of $[\omega]^n$ admits an infinite monochromatic set. Whenever $n \geq 3$, there exists a computable $k$-coloring of $[\omega]^n$ whose solutions compute the halting set. On the other hand,…
The subcube partition model of computation is at least as powerful as decision trees but no separation between these models was known. We show that there exists a function whose deterministic subcube partition complexity is asymptotically…
In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…
Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matrix on the other side. To that end, integer linear programming…
For a martingale $(X_n)$ converging almost surely to a random variable $X$, the sequence $(X_n - X)$ is called martingale tail sum. Recently, Neininger [Random Structures Algorithms, 46 (2015), 346-361] proved a central limit theorem for…
We consider the first-order theory of random variables with the probabilistic independence relation, which concerns statements consisting of random variables, the probabilistic independence symbol, logical operators, and existential and…
Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…
A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…