Related papers: Degrees of randomized computability: decomposition…
Probabilistic graphical models (PGMs) are widely used to discover latent structure in data, but their success hinges on selecting an appropriate model design. In practice, model specification is difficult and often requires iterative…
The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…
Large Language Models (LLMs) have demonstrated outstanding performance in mathematical reasoning capabilities. However, we argue that current large-scale reasoning models primarily rely on scaling up training datasets with diverse…
Exploring further the properties of ITRM-recognizable reals, we provide a detailed analysis of recognizable reals and their distribution in G\"odels constructible universe L. In particular, we show that, for unresetting infinite time…
Machine learning is capable of discriminating phases of matter, and finding associated phase transitions, directly from large data sets of raw state configurations. In the context of condensed matter physics, most progress in the field of…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
We establish a version of a semistable reduction theorem over a log point with a non-trivial nilpotent structure. In order to do this we extend the classical desingularization theories to non-reduced schemes with generically principal…
The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…
A compatible $L_\infty$-algebra is a graded vector space together with two compatible $L_\infty$-algebra structures on it. Given a graded vector space, we construct a graded Lie algebra whose Maurer-Cartan elements are precisely compatible…
Let V be a symplectic vector space of dimension 2n. Given a partition \lambda with at most n parts, there is an associated irreducible representation S_{[\lambda]}(V) of Sp(V). This representation admits a resolution by a natural complex…
Let $\mathfrak g$ be a reductive Lie algebra, and $m$ a positive integer. There is a natural density of irreducible representations of $\mathfrak g$, whose degrees are not divisible by $m$. For $\mathfrak g=\mathfrak{gl}_n$, this density…
Machine-learning potentials (MLPs) for atomistic simulations are a promising alternative to conventional classical potentials. Current approaches rely on descriptors of the local atomic environment with dimensions that increase…
Let $A$ be a finite dimensional unital commutative associative algebra and let $B$ be a finite dimensional vertex $A$-algebroid such that its Levi factor is isomorphic to $sl_2$. Under suitable conditions, we construct an indecomposable…
Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…
The rigidity degree of a generator-cogenerator determines the dominant dimension of its endomorphism algebra, and is closely related to a recently introduced homological dimension -- rigidity dimension. In this paper, we give explicit…
From the Levi's Theorem it is known that every finite dimensional Lie algebra over a field of characteristic zero is decomposed into semidirect sum of solvable radical and semisimple subalgebra. Moreover, semisimple part is the direct sum…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
In this paper we introduce the notion of m-irreducibility that extends the standard concept of irreducibility of a numerical semigroup when the multiplicity is fixed. We analyze the structure of the set of m-irreducible numerical…
We design various logics for proving hyper properties of iterative programs by application of abstract interpretation principles. In part I, we design a generic, structural, fixpoint abstract interpreter parameterized by an algebraic…