Related papers: A Note on Computable Embeddings for Ordinals and T…

We study the weight 2 graded piece of the compactly supported rational cohomology of the moduli spaces of curves $M_{g,n}$ and show that this can be computed as the cohomology of a graph complex that is closely related to graph complexes…

A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…

We provide analogues of the results from [FMR11, CMMR13] in the reference list (which correspond to the case $\kappa = \omega$) for arbitrary $\kappa$-Souslin quasi-orders on any Polish space, for $\kappa$ an infinite cardinal smaller than…

An invariant of orientable 3-manifolds is defined by taking the minimum $n$ such that a given 3-manifold embeds in the connected sum of $n$ copies of $S^2 \times S^2$, and we call this $n$ the embedding number of the 3-manifold. We give…

Let $\omega$ be a closed, non-degenerate differential form of arbitrary degree. Associated to it there are an $L_{\infty}$-algebra of observables, and an $L_{\infty}$-algebra of sections of the higher Courant algebroid twisted by $\omega$.…

A criterion for determining exactly when an order of a maximal subfield of a central simple algebra over a number field can be embedded into an order of this algebra is given. Various previous results have been generalized and recovered by…

We introduce $\mathcal{B}_{\kappa}$-embeddings, nonlinear mathematical structures that connect, through smooth paths parameterized by $\kappa$, a finite or denumerable set of objects at $\kappa=0$ (e.g. numbers, functions, vectors,…

For each k greater than or equal to 5, we construct a modular operad of "k-log-canonically embedded" curves.

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

For an ideal $I_{m,n}$ generated by all square-free monomials of degree $m$ in a polynomial ring $R$ with $n$ variables, we obtain a specific embedding of a canonical module of $R/I_{m,n}$ to $R/I_{m,n}$ itself. The construction of this…

We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…

Quadratic algebras are generalizations of Lie algebras; they include the symmetry algebras of 2nd order superintegrable systems in 2 dimensions as special cases. The superintegrable systems are exactly solvable physical systems in classical…

Let $k_1,k_2$ be two fields of characteristic 0. Let $G_1$ be a split semisimple algebraic group over $k_1$, $G_2$ a split Kac--Moody group over $k_2$ and $\phi\colon G_1(k_1)\to G_2(k_2)$ an abstract embedding. We show that $\im \phi$ is a…

In this paper we give an alternative construction using Monk like algebras that are binary generated to show that the class of strongly representable atom structures is not elementary. The atom structures of such algebras are cylindric…

There is a Turing computable embedding $\Phi$ of directed graphs $A$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform interpretation; i.e., for all directed graphs $A$, these formulas interpret $A$ in…

A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B isomorphic to A there is an isomorphism f:B -> A with f computable in x. A degree x is a degree of categoricity if there is a…

Suppose $p \geq 1$ is a computable real. We extend previous work of Clanin, Stull, and McNicholl by classifying the computable $L^p$ spaces whose underlying measure spaces are atomic but not purely atomic. In addition, we determine the…

Exactly integrable systems connected to semisimple algebras of second rank with an arbitrary choice of grading are presented in explicit form. General solutions of these systems are expressed in terms of matrix elements of two fundamental…

Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…

We classify rotary (orientably-regular) maps whose underlying graphs are multicycles. For the multicycle $\mathrm{C}_n^{(\lambda)}$ of length $n$ and edge-multiplicity $\lambda$, we determine all rotary embeddings for $n\geqslant 3$ and…