Related papers: Isomorphism Spectra and Computably Composite Struc…

Proposed the computerized method for calculating the relative level of order composites. Correlation between a level of structure order and properties of solids is shown. Discussed the possibility of clarifying the terminology used in…

Given two two-dimensional conformal field theories, a domain wall -- or defect line -- between them is called invertible if there is another defect with which it fuses to the identity defect. A defect is called topological if it is…

We introduce a new type of equivalence between blocks of finite group algebras called a strong isotypy. A strong isotypy is equivalent to a $p$-permutation equivalence and restricts to an isotypy in the sense of Brou\'{e}. To prove these…

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

Mapping class group averages appear in the study of 3D gravity partition functions. In this paper, we work with 3D topological field theories to establish a bulk-boundary correspondence between such averages and correlators of 2D rational…

We show that bounded type implies finite type for a constructible subcategory of the module category of a finitely generated algebra over a field, which is a variant of the first Brauer-Thrall conjecture. A full subcategory is constructible…

We show that there is a strong minimal pair in the computably enumerable Turing degrees.

We give classifications of group gradings, up to equivalence and up to isomorphism, on the tensor product of a Cayley algebra $\mathcal{C}$ and a Hurwitz algebra over a field of characteristic different from 2. We also prove that the…

Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a…

We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…

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…

We consider interpretable topological spaces and topological groups in a $p$-adically closed field $K$. We identify a special class of "admissible topologies" with topological tameness properties like generic continuity, similar to the…

The theory of spin models intersects with condensed matter physics, complex systems, graph theory, combinatorial optimization, computational complexity and neural networks. Many ensuing applications rely on the fact that complicated spin…

We describe the spreading property for finite transitive permutation groups in terms of properties of their associated coherent configurations, in much the same way that separating and synchronising groups can be described via properties of…

We construct a 2-category of differential graded schemes. The local affine models in this theory are differential graded algebras, which are graded commutative with unit over a field of characteristic zero, are concentrated in non-positive…

Let $(R, \frak m)$ be a homomorphic image of a Cohen-Macaulay local ring and $M$ a finitely generated $R$-module. We use the splitting of local cohomology to shed a new light on the structure of non-Cohen-Macaulay modules. Namely, we show…

This thesis is concerned with studying the properties of gradings on several examples of cluster algebras, primarily of infinite type. We first consider two finite type cases: $B_n$ and $C_n$, completing a classification by Grabowski for…

We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…

In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…

We describe the structure of module categories of finite dimensional algebras over an algebraically closed field for which the cycles of nonzero nonisomorphisms between indecomposable finite dimensional modules are finite (do not belong to…