Related papers: Turing degree spectra of differentially closed fie…
A computable structure $\mathcal{A}$ has degree of categoricity $\mathbf{d}$ if $\mathbf{d}$ is exactly the degree of difficulty of computing isomorphisms between isomorphic computable copies of $\mathcal{A}$. Fokina, Kalimullin, and Miller…
The purpose of this paper is to introduce a Zariski-like topology on the spectrum of all proper ideals of a ring. We show that the space is T_0, quasi-compact, and every irreducible closed subset has a unique generic point. Furthermore,…
Definable topological groups whose topologies are affine have definable $\mathcal C^r$ structures in d-minimal expansions of ordered fields, where $r$ is a positive integer. We prove this fact using a new notion called partition degree of a…
The set of semialgebraic graphs having countable list-chromatic numbers is characterized. Some other related sets of graphs having countable list-chromatic numbers also are.
The distinguishing number of a structure is the smallest size of a partition of its elements so that only the trivial automorphism of the structure preserves each cell of the partition. We show that for any countable subset of the positive…
We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…
We introduce the concept of subalgebra spectrum, $Sp(A)$, for a subalgebra $A$ of finite codimension in $\mathbb{K}[x]$. The spectrum is a subset of the underlying field. We also introduce a tool, the characteristic polynomial of $A$, which…
The cyclotomic trace provides a comparison of the algebraic K-theory spectrum and a pro-spectrum TR that is built from the cyclic fixed points of topological Hochschild homology. In a previous paper with Ib Madsen, we used this comparison…
For any classical field configuration or mechanical system with a finite number of degrees of freedom we introduce the concept of topological spectrum. It is based upon the assumption that for any classical configuration there exists a…
We use homotopy theory to define certain rational coefficients characteristic numbers with integral values, depending on a given prime number q and positive integer t. We prove the first nontrivial degree formula and use it to show that…
The categoricity spectrum of a class of structures is the collection of cardinals in which the class has a single model up to isomorphism. Assuming that cardinal exponentiation is injective (a weakening of the generalized continuum…
A graph with degree sequence $\pi$ is a \emph{unigraph} if it is isomorphic to every graph that has degree sequence $\pi$. The class of unigraphs is not hereditary and in this paper we study the related hereditary class HCU, the hereditary…
We investigate character degree graphs of solvable groups. In particular, we provide general results that can be used to eliminate which degree graphs can occur as solvable groups. Finally, we show a specific family of graphs cannot occur…
Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…
A set $A$ is coarsely computable with density $r \in [0,1]$ if there is an algorithm for deciding membership in $A$ which always gives a (possibly incorrect) answer, and which gives a correct answer with density at least $r$. To any Turing…
In this paper a class of conformal field theories with nonabelian and discrete group of symmetry is investigated. These theories are realized in terms of free scalar fields starting from the simple $b-c$ systems and scalar fields on…
We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering,…
The formation of triangles in complex networks is an important network property that has received tremendous attention. The formation of triangles is often studied through the clustering coefficient. The closure coefficient or transitivity…
The theories of strings and $D$-branes have motivated the development of non Abelian cohomology techniques in differential geometry, on the purpose to find a geometric interpretation of characteristic classes. The spaces studied here, like…
Two graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues, and generalized cospectral if they are cospectral and so are their complements. We study generalized cospectrality in relation to…