Related papers: Turing Degrees of Isomorphism Types of Algebraic O…
We prove several results about the relationship between the word complexity function of a subshift and the set of Turing degrees of points of the subshift, which we call the Turing spectrum. Among other results, we show that a Turing…
In the present paper we obtain the list of algebras, up to isomorphism, such that closure of any complex finite-dimensional algebra contains one of the algebra of the given list.
The algebraic degree $Deg(G)$ of a graph $G$ is the dimension of the splitting field of the adjacency polynomial of $G$ over the field $\mathbb{Q}$. It can be shown that for every positive integer $d$, there exists a circulant graph with…
In previous work we showed that the contact category algebra of a quadrangulated surface is isomorphic to the homology of a strand algebra from bordered sutured Floer theory. Being isomorphic to the homology of a differential graded…
The aim of this paper is to study the group of isomorphism classes of torsors of finite flat group schemes of rank 2 over a commutative ring $R$. This, in particular, generalises the group of quadratic algebras (free or projective), which…
Let $A$ be an $n$-dimensional algebra over a field $k$ and $a(A)$ its quantum symmetry semigroup. We prove that the automorphisms group ${\rm Aut}_{\rm Alg} (A)$ of $A$ is isomorphic to the group $U \bigl( G(a (A)^{\rm o} ) \bigl)$ of all…
A basic finite dimensional algebra over an algebraically closed field $k$ is isomorphic to a quotient of a tensor algebra by an admissible ideal. The category of left modules over the algebra is isomorphic to the category of representations…
We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and classify all tapes conforming to these constraints. Surprisingly, this generalization…
Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of $v$ in $G$ is the number of triangles that contain $v$. While every graph has at least two vertices with the same degree, there are graphs in which every vertex…
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table…
We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…
Let R be a local ring and A a connected differential graded algebra over R which is free as a graded R-module. Using homological perturbation theory techniques, we construct a minimal free multi model for A having properties similar to that…
A twisting system is one of the major tools to study graded algebras, however, it is often difficult to construct a (non-algebraic) twisting system if a graded algebra is given by generators and relations. In this paper, we show that a…
The main goal of this paper is to study the structure of the graded algebra associated to a valuation. More specifically, we prove that the associated graded algebra ${\rm gr}_v(R)$ of a subring $(R,\mathfrak{m})$ of a valuation ring…
We explore the notion of degree of asymmetry for integer sequences and related combinatorial objects. The degree of asymmetry is a new combinatorial statistic that measures how far an object is from being symmetric. We define this notion…
We classify isomorphism types of unital commutative algebras of rank 7 over an algebraically closed field of characteristic not 2 or 3 completely.
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
We extend the loop algebra construction for algebras graded by abelian groups to study graded-simple algebras over the field of real numbers (or any real closed field). As an application, we classify up to isomorphism the graded-simple…
The Scott rank of a countable structure is a measure, coming from the proof of Scott's isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of $\mathcal{L}_{\omega_1 \omega}$)…
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…