Related papers: Degrees of randomized computability: decomposition…
Generative molecular design has moved from proof-of-concept to real-world applicability, as marked by the surge in very recent papers reporting experimental validation. Key challenges in explainability and sample efficiency present…
Given an associative graded algebra equipped with a degree +1 differential we define an A-infinity structure that measures the failure of the differential to be a derivation. This can be seen as a non-commutative analog of generalized…
This paper aims to establish a framework for extreme learning machines (ELMs) on general hypercomplex algebras. Hypercomplex neural networks are machine learning models that feature higher-dimension numbers as parameters, inputs, and…
Machine learning interatomic potentials (MLIPs) have become a workhorse of modern atomistic simulations, and recently published universal MLIPs, pre-trained on large datasets, have demonstrated remarkable accuracy and generalizability.…
In general, the study of gradations has always represented a cornerstone in algebra theory. In particular, \textit{naturally graded} seems to be the first and the most relevant gradation when it comes to nilpotent algebras, a large class of…
We introduce a path-theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher level generalisations over fields of arbitrary characteristic. Our first main result is a…
The dissertation focuses on decomposing a group algebra $kG$ over a field of positive characteristic into a direct sum of projective indecomposable modules. Such a decomposition is obtained together with the Artin--Wedderburn Theorem. The…
Reversible computing is a paradigm of computation that reflects physical reversibility, one of the fundamental microscopic laws of Nature. In this survey, we discuss topics on reversible logic elements with memory (RLEM), which can be used…
This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…
Semisimple Lie algebras have been completely classified by Cartan and Killing. The Levi theorem states that every finite dimensional Lie algebra is isomorphic to a semidirect sum of its largest solvable ideal and a semisimple Lie algebra.…
We develop a new Low-level, First-order Probabilistic Programming Language (LF-PPL) suited for models containing a mix of continuous, discrete, and/or piecewise-continuous variables. The key success of this language and its compilation…
We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
We study a notion of indecomposability in differential algebraic groups which is inspired by both model theory and differential algebra. After establishing some basic definitions and results, we prove an indecomposability theorem for…
This expository paper treats the model theory of probability spaces using the framework of continuous $[0,1]$-valued first order logic. The metric structures discussed, which we call probability algebras, are obtained from probability…
The ring of invariant polynomials ${\mathbb C}[V]^G$ over a given finite dimensional representation space $V$ of a complex reductive group $G$ is known, by a famous theorem of Hilbert, to be finitely generated. The general proof being…
Neural networks excel at pattern recognition but struggle with reliable logical reasoning, often violating basic logical principles during inference. We address this limitation by developing a categorical framework that systematically…
We construct a new family of infinite-dimensional quasi-graded Lie algebras on hyperelliptic curves. We show that constructed algebras possess infinite number of invariant functions and admit a decomposition into the direct sum of two…
We explore the indecomposable submodule structure of quantum Grassmann super-algebra $\Omega_q(m|n)$ and its truncated objects $\Omega_q(m|n,\textbf{r})$ in the case when $q=\varepsilon$ is an $\ell$-th root of unity. A net-like…
We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…