Related papers: Degrees of randomized computability: decomposition…

We give an overview of some properties of Lie algebras generated by at most 5 extremal elements. In particular, for any finite graph {\Gamma} and any field K of characteristic not 2, we consider an algebraic variety X over K whose K-points…

We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…

Quantum $L_\infty$ algebras are a generalization of $L_\infty$ algebras with a scalar product and with operations corresponding to higher genus graphs. We construct a minimal model of a given quantum $L_\infty$ algebra via the homological…

We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…

The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…

A relational structure $\mathbb{X}$ is called reversible iff each bijective homomorphism from $\mathbb{X}$ onto $\mathbb{X}$ is an isomorphism, and linear orders are prototypical examples of such structures. One way to detect new reversible…

Existentially closed groups are, informally, groups that contain solutions to every consistent finite system of equations and inequations. They were introduced in 1951 in an algebraic context and subsequent research elucidated deep…

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

A numerical semigroup is an additive subsemigroup of the natural numbers that contains zero and has finite complement. A numerical semigroup is irreducible if it cannot be written as an intersection of numerical semigroups properly…

Derived brackets provide a mechanism for generating algebraic structures from graded Lie superalgebras, with applications in Poisson geometry, mathematical physics, and the theory of algebroids. In this paper, we present a complete…

Statistics and Optimization are foundational to modern Machine Learning. Here, we propose an alternative foundation based on Abstract Algebra, with mathematics that facilitates the analysis of learning. In this approach, the goal of the…

We consider Dynkin algebras, these are the hereditary artin algebras of finite representation type. The indecomposable modules for a Dynkin algebra correspond bijectively to the positive roots of a Dynkin diagram. Given a Dynkin algebra…

We present assembly-theory, a Rust package for computing assembly indices of covalently bonded molecular structures. This is a key complexity measure of assembly theory, a recent theoretical framework quantifying selection across diverse…

A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…

We present a formalization, in the theorem prover Lean, of the classification of solvable Lie algebras of dimension at most three over arbitrary fields. Lie algebras are algebraic objects which encode infinitesimal symmetries, and as such…

Compositional generalization tests are often used to estimate the compositionality of LLMs. However, such tests have the following limitations: (1) they only focus on the output results without considering LLMs' understanding of sample…

Let $G$ be a complex connected reductive algebraic group and let $G_{\mathbb{R}}$ be a real form of $G$. We construct a sequence of functors $L_i\mathcal{R}$ from admissible (resp. finite-length) representations of $G$ to admissible (resp.…

We obtain a complete structural characterization of Cohn-Leavitt algebras over no-exit objects as graded involutive algebras. Corollaries of this result include graph-theoretic conditions characterizing when a Leavitt path algebra is a…