Related papers: Random strings and tt-degrees of Turing complete C…
In this paper, we present a conjecture on the degree of unipotent characters in the cohomology of particular Deligne-Lusztig varieties for groups of Lie type, and derive consequences of it. These degrees are a necessary piece of data in the…
Given positive integers k and r where 4 divides k and k/2 \leq r \leq k-1, we give a minimum r-degree condition that ensures a perfect matching in a k-uniform hypergraph. This condition is best possible and improves on work of Pikhurko who…
A large class of two-dimensional topological conformal field theories (TCFTs) are obtained by the twisting construction of Witten and Eguchi-Yang. However there seem to exist TCFTs which are not obtained in this way; for instance, TCFTs…
We study conditions that will ensure that a crossed product of a C*-algebra by a discrete exact group is purely infinite (simple or non-simple). We are particularly interested in the case of a discrete non-amenable exact group acting on a…
In this paper, we prove that given any \Pi^0_1 subset $P$ of $\{0,1\}^\NN$ there is a tileset $\tau$ with a set of configurations $C$ such that $P\times\ZZ^2$ is recursively homeomorphic to $C\setminus U$ where $U$ is a computable set of…
Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently shown to occur in large random graphs. Hard constraints must…
We study the joint degree counts in proportional attachment random graphs and find a simple representation for the limit distribution in infinite sequence space. We show weak convergence with respect to the p-norm topology for appropriate p…
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…
We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…
The study of the word problems of groups dates back to Dehn in 1911, and has been a central topic of study in both group theory and computability theory. As most naturally occurring presentations of groups are recursive, their word problems…
The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…
We study pairs of reals that are mutually Martin-L\"{o}f random with respect to a common, not necessarily computable probability measure. We show that a generalized version of van Lambalgen's Theorem holds for non-computable probability…
A computably enumerable equivalence relation (ceer) $X$ is called self-full if whenever $f$ is a reduction of $X$ to $X$ then the range of $f$ intersects all $X$-equivalence classes. It is known that the infinite self-full ceers properly…
We show that some sets of quantum observables are unique up to an isometry and have a contextuality witness that attains the same value for any initial state. We prove that these two properties make it possible to certify any of these sets…
We study the class of selfless C*-probability spaces introduced by Robert. It is known that a selfless tracial algebra has strict comparison and a unique trace. We prove that for separable tracial C*-algebras, selflessness is equivalent to…
Given integers $m\le c$ and an exact $c$-coloring of the edges of a complete countably infinite graph (i.e. a coloring that uses exactly $c$ colors), must there be an infinite subgraph that is exactly $m$-colored? Using the Infinite Ramsey…
We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
We survey results in the literature that establish the \v{C}ern\'y conjecture for various classes of finite automata. We also list classes for which the conjecture remains open, but a quadratic (in the number of states) upper bound on the…
Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…