Related papers: Comparing the isomorphism types of equivalence str…
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…
In this paper we put a cofibrantly generated model category structure on the category of small simplicial categories. The weak equivalences are a simplicial analogue of the notion of equivalence of categories.
To a bicomplex one can associate two natural filtrations, the column and row filtrations, and then two associated spectral sequences. This can be generalized to $N$-multicomplexes. We present a family of model category structures on the…
We continue and complete our previous paper `Lifts of projective congruence groups' [2] concerning the question of whether there exist noncongruence subgroups of $\SL_2(\Z)$ that are projectively equivalent to one of the groups…
Our aim is to give a fairly complete account on the construction of compatible model structures on exact categories and symmetric monoidal exact categories, in some cases generalizing previously known results. We describe the close…
Given a multiplicatively closed subset $S$ of the integers, there exist Structure Theorems for $LC$ modules over the localization $\mathbb{Z}S^{-1}$ that are "similar" to those of $LCA$ groups. The most notable one is the 1st Theorem: Given…
We give examples of $\mathrm{NIP}$ structures in which new algebraic structure appears in the Shelah completion. In particular we construct a weakly o-minimal structure $\mathscr{M}$ such that $\mathscr{M}$ does not interpret an infinite…
Let $\Sigma$ be a closed orientable surface of genus at least two, and let $X, Y$ be distinct marked Riemann surface structures on $\Sigma$, possibly with opposite orientations. In this paper, we show that there are (exactly) countably…
Symmetry plays a major role in subgraph matching both in the description of the graphs in question and in how it confounds the search process. This work addresses how to quantify these effects and how to use symmetries to increase the…
We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…
In Part 1, we describe six projective-type model structures on the category of differential graded modules over a differential graded algebra A over a commutative ring R. When R is a field, the six collapse to three and are well-known, at…
It is demonstrated that, unless the meaning of conformal transformations for the underlying geometrical structure is discussed on a same footing as it is done for the equations of the given gravity theory, the notion of "conformal…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
The article is devoted to a structure of topological spaces related with topological quasigroups. Regular and complete spaces over topological quasigroups are studied. Separations and embeddings are also investigated for them. Their…
Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…
We investigate the mathematical structure of unit systems and the relations between them. Looking over the entire set of unit systems, we can find a mathematical structure that is called preorder (or quasi-order). For some pair of unit…
Isomorphism is central to the structure of mathematics and has been formalized in various ways within dependent type theory. All previous treatments have done this by replacing quantification over sets with quantification over groupoids of…
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
We introduce trace definability, a weak notion of interpretability, and trace equivalence, a weak notion of equivalence for first order structures and theories. In particular we get an interesting weak equivalence notion for $\mathrm{NIP}$…
This paper is a generalization of arXiv:0810.0808. We develop the de Rham homotopy theory of not necessarily nilpotent spaces, using closed dg-categories and equivariant dg-algebras. We see these two algebraic objects correspond in a…