Related papers: On cohesive powers of linear orders
We present the first examples of topological phases of matter with uniform power for measurement-based quantum computation. This is possible thanks to a new framework for analyzing the computational properties of phases of matter that is…
We study various orders on countably complete ultrafilters on ordinals that coincide and are wellorders under a hypothesis called the Ultrapower Axiom. Our main focus is on the relationship between the Ultrapower Axiom and the linearity of…
Let ${{B}_{3}}(n)$ denote the number of partition triples of $n$ where each partition is 3-core. With the help of generating function manipulations, we find several infinite families of arithmetic identities and congruences for…
Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite…
Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…
We show that the category of countable Borel equivalence relations (CBERs) is dually equivalent to the category of countable $\mathcal{L}_{\omega_1\omega}$ theories which admit a one-sorted interpretation of a particular theory we call…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…
We show that the compositions of positive integers may be interpreted in terms of powers of some power series, over arbitrary commutative ring. As consequences, several closed formulas for the compositions as well as for the generalized…
We continue the study of the pseudo-intersection property with respect to an ideal introduced in \cite{TomNatasha2}. Our theory applies to the study of the Tukey types of general sums of ultrafilters, which, as evidenced by the results of…
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 <…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
We conduct a computability-theoretic study of Ramsey-like theorems of the form "Every coloring of the edges of an infinite clique admits an infinite sub-clique avoiding some pattern", with a particular focus on transitive patterns. As it…
It is known that differences of symmetric functions corresponding to various bases are nonnegative on the nonnegative orthant exactly when the partitions defining them are comparable in dominance order. The only exception is the case of…
Computational devices combining two or more different parts, one controlling the operation of the other, for example, derive their power from the interaction, in addition to the capabilities of the parts. Non-classical computation has…
We investigate program equivalence for linear higher-order(sequential) languages endowed with primitives for computational effects. More specifically, we study operationally-based notions of program equivalence for a linear…
Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While researchers have identified many uses of spatial conjunction, its…
A central question in cognitive science is whether conceptual representations converge onto a shared manifold to support generalization, or diverge into orthogonal subspaces to minimize task interference. While prior work has discovered…
The main purpose of this paper is to popularize Danzer's power complex construction and establish some new results about covering maps between two power complexes. Power complexes are cube-like combinatorial structures that share many…
Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…