Related papers: Formalizing Factorization on Euclidean Domains and…
Let $F$ be a field, and let Zar$(F)$ be the space of valuation rings of $F$ with respect to the Zariski topology. We prove that if $X$ is a quasicompact set of rank one valuation rings in Zar$(F)$ whose maximal ideals do not intersect to…
Machine learning systems generally assume that the training and testing distributions are the same. To this end, a key requirement is to develop models that can generalize to unseen distributions. Domain generalization (DG), i.e.,…
A semidomain is an additive submonoid of an integral domain that is closed under multiplication and contains the identity element. Although atomicity and divisibility in integral domains have been systematically investigated for more than…
Given a star operation * of finite type, we call a domain R a *-unique representation domain (*-URD) if each *-invertible *-ideal of R can be uniquely expressed as a *-product of pairwise *-comaximal ideals with prime radical. When * is the…
We review the definition of D-rings introduced by H. Gunji & D. L. MacQuillan. We provide an alternative characterization for such rings that allows us to give an elementary proof of that a ring of algebraic integers is a D-ring. Moreover,…
The factorization technique for superintegrable Hamiltonian systems is revisited and applied in order to obtain additional (higher-order) constants of the motion. In particular, the factorization approach to the classical anisotropic…
We show that the quantum coordinate ring of a semisimple group is a unique factorisation domain in the sense of Chatters and Jordan in the case where the deformation parameter q is a transcendental element.
In this paper, we introduce and formalize a rank-one partitioning learning paradigm that unifies partitioning methods that proceed by summarizing a data set using a single vector that is further used to derive the final clustering…
Probabilistic Circuits (PCs) have emerged as an efficient framework for representing and learning complex probability distributions. Nevertheless, the existing body of research on PCs predominantly concentrates on data-driven parameter…
This article revisits standard theorems from elementary number theory from a constructive, algorithmic, and proof-theoretic perspective, framed within the theory of computable functionals TCF. Key examples include B\'ezout's identity, the…
We study functions from a unique factorization monoid to a field. The set of all such functions is a commutative ring isomorphic to a ring of formal power series over the field, with indeterminates indexed by the prime elements of the…
Let $F$ be a field, let $D$ be a subring of $F$ and let $Z$ be an irreducible subspace of the space of all valuation rings between $D$ and $F$ that have quotient field $F$. Then $Z$ is a locally ringed space whose ring of global sections is…
We describe a project to formalize Galois theory using the Lean theorem prover, which is part of a larger effort to formalize all of the standard undergraduate mathematics curriculum in Lean. We discuss some of the challenges we faced and…
In the problem of domain generalization (DG), there are labeled training data sets from several related prediction problems, and the goal is to make accurate predictions on future unlabeled data sets that are not known to the learner. This…
Most undergraduate level abstract algebra texts use $\mathbb{Z}[\sqrt{-5}]$ as an example of an integral domain which is not a unique factorization domain (or UFD) by exhibiting two distinct irreducible factorizations of a nonzero element.…
In classical factorization theory, an integral domain is called \emph{atomic} if every nonzero nonunit element can be written as a finite product of irreducible elements. Here, we introduce and study a weaker notion of atomicity, which…
We describe algorithms to compute fixed fields, splitting fields and towers of radical extensions without using polynomial factorisation in towers or constructing any field containing the splitting field, instead extending Galois group…
An integral domain (or a commutative cancellative monoid) is atomic if every nonzero nonunit element is the product of irreducibles, and it satisfies the ACCP if every ascending chain of principal ideals eventually stabilizes. The interplay…
Drawing inspiration from Emmy Noether'set-theoretic foundations for algebra and Charles Ehresmann's topology without points, we adopt a new order-theoretic approach to ideal theory. For this we emphasize the order of divisibility in…
Let $V$ be a valuation ring of a global field $K$. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $V$, that is, an element of $\text{Int}(V) = \{ f \in K[X] \mid…