Related papers: Computing Bits of Algebraic Numbers
A strong link between information geometry and algebraic statistics is made by investigating statistical manifolds which are algebraic varieties. In particular it it shown how first and second order efficient estimators can be constructed,…
Schubert calculus provides algebraic tools to solve enumerative problems. There have been several applied problems in systems theory, linear algebra and physics which were studied by means of Schubert calculus. The method is most powerful…
The lower and upper bound of any given algorithm is one of the most crucial pieces of information needed when evaluating the computational effectiveness for said algorithm. Here a novel method of Boolean Algebraic Programming for symbolic…
We investigate the distribution of real algebraic numbers of a fixed degree having a close conjugate number, the distance between the conjugate numbers being given as a function of their height. The main result establishes the ubiquity of…
The Waring Problem over polynomial rings asks for how to decompose an homogeneous polynomial of degree $d$ as a finite sum of $d^{th}$ powers of linear forms. First, we give a constructive method to obtain a real Waring decomposition of any…
A constructive method for decomposing finite dimensional representations of semisimple real Lie algebras is developed. The method is illustrated by an example. We also discuss an implementation of the algorithm in the language of the…
In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…
Near full-null degenerate singular points of analytic vector fields, asymptotic behaviors of orbits are not given by eigenvectors but totally decided by nonlinearities. Especially, in the case of high full-null degeneracy, i.e., the lowest…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
Let $\mathrm{R}$ be a real closed field and $\mathrm{C}$ the algebraic closure of $\mathrm{R}$. We give an algorithm for computing a semi-algebraic basis for the first homology group, $\mathrm{H}_1(S,\mathbb{F})$, with coefficients in a…
In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…
We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…
This paper focuses on greedy expansions, one possible representation of numbers, and on arithmetical operations with them. Performing addition or multiplication some additional digits can appear. We study bounds on the number of such digits…
We present techniques for successfully performing numerical relativity simulations of binary black holes with fourth-order accuracy. Our simulations are based on a new coding framework which currently supports higher order finite…
We present algorithmic and complexity results concerning computations with one and two real algebraic numbers, as well as real solving of univariate polynomials and bivariate polynomial systems with integer coefficients using Sturm-Habicht…
We determine the decomposition numbers of the partition algebra when the characteristic of the ground field is zero or larger than the degree of the partition algebra. This will allow us to determine for which exact values of the parameter…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
We prove a refinement of Ado's theorem for Lie algebras over an algebraically-closed field of characteristic zero. We first define what it means for a Lie algebra $L$ to be approximated with a nilpotent ideal, and we then use such an…
Previous research on exceptional units has primarily focused on the ring of rational integers or abstract finite rings, often restricted to linear or quadratic constraints. In this paper, we extend the concept of polynomial-type exceptional…
This thesis was concerned with classifying the real indecomposable solvable Lie algebras with codimension one nilradicals of dimensions two through seven. This thesis was organized into three chapters. In the first, we described the…