Related papers: Dynamic computations inside the algebraic closure …

The geometry of algebraic curves over finite fields is a rich area of research. In previous work, the authors investigated a particular aspect of the geometry over finite fields of the classical unit circle, namely how the number of…

We observe that over an algebraically closed field, any finite-dimensional algebra is the endomorphism algebra of an m-cluster-tilting object in a triangulated m-Calabi-Yau category, where m is any integer greater than 2.

We describe derivations of the Clifford algebra of a nondegenerate quadratic form on a countable dimensional vector space over an algebraically closed field of characteristic not equal to $2$. We also construct an algebraic automorphism of…

What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…

In 1995, Meinardus & Berg presented a reformulation of the Collatz Conjecture in terms of a functional equation in a single complex variable over the open unit disk. This paper generalizes that method to deal with not only a large class of…

We construct an expansion of a real closed field by a multiplicative subgroup adapting Poizat's theory of green points. Its theory is strongly dependent, and every open set definable in a model of this theory is semialgebraic. We prove that…

A definable set in a pair (K, k) of algebraically closed fields is co-analyzable relative to the subfield k of the pair if and only if it is almost internal to k. To prove this and some related results for tame pairs of real closed fields…

The first two steps of the construction of motivic integration in the fundamental work of Hrushovski and Kazhdan have been presented in arXiv:1006.2467v1. In this paper we present the final third step. As in arXiv:1006.2467v1, we limit our…

The use of Shap scores has become widespread in Explainable AI. However, their computation is in general intractable, in particular when done with a black-box classifier, such as neural network. Recent research has unveiled classes of…

The Cylindrical Algebraic Decomposition (CAD) algorithm is a comprehensive tool to perform quantifier elimination over real closed fields. CAD has doubly exponential running time, making it infeasible for practical purposes. We propose to…

Decision circuits perform efficient evaluation of influence diagrams, building on the ad- vances in arithmetic circuits for belief net- work inference [Darwiche, 2003; Bhattachar- jya and Shachter, 2007]. We show how even more compact…

We present a unifying theory of fields with certain classes of analytic functions, called fields with analytic structure. Both real closed fields and Henselian valued fields are considered. For real closed fields with analytic structure,…

Inspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we give fast algorithms to compute in (the first levels of) the ell-adic closure of a finite field. In many cases, our algorithms have quasi-linear complexity.

In this short note, we describe the so-called homogeneous involution on finite-dimensional graded-division algebra over an algebraically closed field. We also compute their graded polynomial identities with involution. As pointed out by L.…

We describe various structures of algebraic nature on the space of continuous valuations on convex sets, their properties (like versions of Poincar\'e duality and hard Lefschetz theorem), and their relations and applications to integral…

We present several naturally occurring classes of spectral spaces using commutative algebra on pointed monoids. For this purpose, our main tools are finite type closure operations and continuous valuations on monoids which we introduce in…

In this paper, we undertake a systematic model and valuation theoretic study of the class of ordered fields which are dense in their real closure. We apply this study to determine definable henselian valuations on ordered fields, in the…

We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…