Related papers: Borel computation of names in template iterations
In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…
Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…
Parameterization extends higher-order processes with the capability of abstraction (akin to that in lambda-calculus), and is known to be able to enhance the expressiveness. This paper focuses on the parameterization of names, i.e. a…
We give a reformulation of the Lehmer conjecture about algebraic integers in terms of a simple counting problem modulo p.
The error function of real argument can be uniformly approximated to a given accuracy by a single closed-form expression for the whole variable range either in terms of addition, multiplication, division, and square root operations only, or…
We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
Theory interpolation has found several successful applications in model checking. We present a novel method for computing interpolants for ground formulas in the theory of equality. The method produces interpolants from colored congruence…
We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…
Causal inference is a key research area in machine learning, yet confusion reigns over the tools needed to tackle it. There are prevalent claims in the machine learning literature that you need a bespoke causal framework or notation to…
We investigate how set-theoretic forcing can be seen as a computational process on the models of set theory. Given an oracle for information about a model of set theory $\langle M,\in^M\rangle$, we explain senses in which one may compute…
Recently, there has been considerable progress on designing algorithms with provable guarantees -- typically using linear algebraic methods -- for parameter learning in latent variable models. But designing provable algorithms for inference…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
We provide a simple way to add, multiply, invert, and take traces and norms of algebraic integers of a number field using integral matrices. With formulas for the integral bases of the ring of integers of at least a significant proportion…
Let T be Goedel's system of primitive recursive functionals of finite type in the lambda formulation. We define by constructive means using recursion on nested multisets a multivalued function I from the set of terms of T into the set of…
We study how the field of definition of a rational function changes under iteration. We provide a complete classification of polynomials with the property that the field of definition of one of their iterates drops in degree (over a given…
Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a theorem prover or proof assistant in a convenient and highly…
We explain the algebra needed to make sense of the log signature of a path, with plenty of examples. We show how the log signature can be calculated numerically, and explain some software tools which demonstrate it.
We show that a circuit walk from a given feasible point of a given linear program to an optimal point can be computed in polynomial time using only linear algebra operations and the solution of the single given linear program. We also show…
We prove that for a countable, commutative ring $R$, the class of countable $R$-modules either has only countably many isomorphism types, or else it is Borel complete. The machinery gives a succinct proof of the Borel completeness of TFAB,…