Related papers: The typical Turing degree
We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr,…
For a finitely generated algebra over a field, the transcendence degree is known to be equal to the Krull dimension. The aim of this paper is to generalize this result to algebras over rings. A new definition of the transcendence degree of…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
We introduce a new class of possibly infinite dimensional Lie algebras and study their structural properties. Examples of this new class of Lie algebras are finite dimensional simple Lie algebras containing a nonzero split torus, affine and…
We introduce a generalization of the notion of a negligible morphism and study the associated tensor ideals and thick ideals. These ideals are defined by considering deformations of a given monoidal category $\mathcal{C}$ over a local ring…
We study the notion of positive and negative complexity of pairs of objects in cluster categories. The first main result shows that the maximal complexity occurring is either one, two or infinite, depending on the representation type of the…
The classical D'Alembert's Ratio Test is a powerful test that we learn from calculus to determine convergence for a series of positive terms. Its range of applicability and ease of computation makes this test extremely appealing. However,…
Let $\pi$ be a factor code from a one dimensional shift of finite type $X$ onto an irreducible sofic shift $Y$. If $\pi$ is finite-to-one then the number of preimages of a typical point in $Y$ is an invariant called the degree of $\pi$. In…
We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set $A$ with non-trivial prefix-free initial segment…
The connection between self-assembly and computation suggests that a shape can be considered the output of a self-assembly ``program,'' a set of tiles that fit together to create a shape. It seems plausible that the size of the smallest…
The muliplicative attribute graph (MAG) model was introduced by Kim and Leskovec as a mathematically tractable model for networks where network structure is believed to be shaped by features or attributes associated with individual nodes.…
Despite great effort spent measuring topological features of large networks like the Internet, it was recently argued that sampling based on taking paths through the network (e.g., traceroutes) introduces a fundamental bias in the observed…
A function f:R -> R is approximately continuous iff it is continuous in the density topology, i.e., for any ordinary open set U the set E=f^{-1}(U) is measurable and has Lebesgue density one at each of its points. Denjoy proved that…
The theme here is category-measure duality, in the context of a topological group. One can often handle the (Baire) category case and the (Lebesgue, or Haar) measure cases together, by working bi-topologically: switching between the…
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…
For every commutative differential algebra one can define the Lie algebra of special derivations. It is known for years that not every Lie algebra can be embedded to the Lie algebra of special derivations of some differential algebra. More…
We prove a model theoretic Baire category theorem for $\tilde\tau_{low}^f$-sets in a countable simple theory in which the extension property is first-order and show some of its applications. We also prove a trichotomy for minimal types in…
Lusztig's fake degree is the generating polynomial for the major index of standard Young tableaux of a given shape. Results of Springer and James & Kerber imply that, mysteriously, its evaluation at a $k$-th primitive root of unity yields…
The theory of uniform approximation of real numbers motivates the study of products of consecutive partial quotients in regular continued fractions. For any non-decreasing positive function $\varphi:\mathbb{N}\to [2,\infty)$, we determine…
We investigate the teaching of infinite concept classes through the effect of the learning bias (which is used by the learner to prefer some concepts over others and by the teacher to devise the teaching examples) and the sampling bias…