Related papers: Degrees of randomized computability: decomposition…
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…
Machine learning (ML) can be used to construct surrogate models for the fast prediction of a property of interest. ML can thus be applied to chemical projects, where the usual experimentation or calculation techniques can take hours or days…
Let $C^{pr}_m$ be the upper semilattice of degrees of computable sets with respect to primitive recursive $m$-reducibility. We prove that the first-order theory of $C^{pr}_m$ is hereditarily undecidable.
Using the BV-formalism of mathematical physics an explicit construction for the minimal model of a quantum L-infinity-algebra is given as a formal super integral. The approach taken herein to these formal integrals is axiomatic; they can be…
Given a countable structure $\mathcal{A}$, the degree spectrum of $\mathcal{A}$ is the set of all Turing degrees which can compute an isomorphic copy of $\mathcal{A}$. One of the major programs in computable structure theory is to determine…
We study representations of a Leavitt path algebra $L$ of a finitely separated digraph $\Gamma$ over a field. We show that the category of $L$-modules is equivalent to a full subcategory of quiver representations. When $\Gamma$ is a…
If ${\cal D}$ is a definable category then it may contain no nonzero finitely presented modules but, by a result of Makkai, there is a $\varinjlim$-generating set of strictly ${\cal D}$-atomic modules. These modules share some key…
Fix a manifold M, and let V be an infinite dimensional Lie algebra of vector fields on M. Assume that V contains a finite dimensional semisimple maximal subalgebra A, the projective or conformal subalgebra. A projective or conformal…
Quantum Chern-Simons invariants of differentiable manifolds are analyzed from the point of view of homological algebra. Given a manifold M and a Lie (or, more generally, an L-infinity) algebra g, the vector space H^*(M) \otimes g has the…
We propose algorithms for construction and random generation of hypergraphs without loops and with prescribed degree and dimension sequences. The objective is to provide a starting point for as well as an alternative to Markov chain Monte…
The main objective of this project is to determine all irreducible modules of a given modular Lie algebra. In contrast to ordinary Lie algebras, modular Lie algebras require an additional structure known as the p-mapping. The minimal…
In this paper, we study an impact of Leibniz algebras on the algebraic structure of $\mathbb{N}$-graded vertex algebras. We provide easy ways to characterize indecomposable non-simple $\mathbb{N}$-graded vertex algebras…
For a cellular algebra $\A$ with a cellular basis $\ZC$, we consider a decomposition of the unit element $1_\A$ into orthogonal idempotents (not necessary primitive) satisfying some conditions. By using this decomposition, the cellular…
Decomposition of text into atomic propositions is a flexible framework allowing for the closer inspection of input and output text. We use atomic decomposition of hypotheses in two natural language reasoning tasks, traditional NLI and…
Convergence is a crucial issue in iterative algorithms. Damping is commonly employed to ensure the convergence of iterative algorithms. The conventional ways of damping are scalar-wise, and either heuristic or empirical. Recently, an…
We show that group C*-algebras of finitely generated, nilpotent groups have finite nuclear dimension. It then follows, from a string of deep results, that the C*-algebra $A$ generated by an irreducible representation of such a group has…
The aim of this paper is to build a theory of commutative and noncommutative {\it injective} valuations of various algebras (including algebras with zero divisors). The targets of our valuations are (well-)ordered commutative and…
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
We describe an algorithm for the sequential sampling of entries in multiway contingency tables with given constraints. The algorithm can be used for computations in exact conditional inference. To justify the algorithm, a theory relates…
This paper provides a construction of an uncountable family of i.i.d. random vectors, indexed by the points of a nonatomic measure space, such that (a) a sample is a measurable function from the index space, and (b) an idealization of the…