Related papers: Dynamic computations inside the algebraic closure …
We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…
The article demonstrates the procedure how to compute the Zariski closure of an orbit by an algebraic action of finitely generated group on the affine plane. First half of the algorithm is about deciding whether given finitely generated…
A procedure for counting the number of eigenvalues of a matrix in a region surrounded by a closed curve is presented. It is based on the application of the residual theorem. The quadrature is performed by evaluating the principal argument…
We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse…
Improved algorithms for computing (partial and full) exterior algebraic shifts of hypergraphs and simplicial complexes are presented. The main benefit is in positive characteristic. Experiments with an implementation in OSCAR with various…
Dynamic evaluation is a paradigm in computer algebra which was introduced for computing with algebraic numbers. In linear algebra, for instance, dynamic evaluation can be used to apply programs which have been written for matrices with…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
Local fields, and fields complete with respect to a discrete valuation, are essential objects in commutative algebra, with applications to number theory and algebraic geometry. We formalize in Lean the basic theory of discretely valued…
Continuous models used in physics and other areas of mathematics applications become discrete when they are computerized, e.g., utilized for computations. Besides, computers are controlling processes in discrete spaces, such as films and…
Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…
In this note, we construct an algorithm that, on input of a description of a structurally stable planar dynamical flow $f$ defined on the closed unit disk, outputs the exact number of the (hyperbolic) equilibrium points and their locations…
The aim of this paper is to unify the points of view of three recent and independent papers (Ventura 1997, Margolis, Sapir and Weil 2001 and Kapovich and Miasnikov 2002), where similar modern versions of a 1951 theorem of Takahasi were…
In this paper, we characterize NIP henselian valued fields modulo the theory of their residue field, both in an algebraic and in a model-theoretic way. Assuming the conjecture that every infinite NIP field is either separably closed, real…
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…
A method is discussed to analyze the dynamics of a dissipative quantum system. The method hinges upon the definition of an alternative (time-dependent) product among the observables of the system. In the long time limit this yields a…
Numerical approximate computation can solve large and complex problems fast. It has the advantage of high efficiency. However it only gives approximate results, whereas we need exact results in many fields. There is a gap between…
This paper deals with $n$-dimensional algebras, over any field, which have only trivial derivation (automorphism) and simple algebras. It is shown that the corresponding sets of algebras are not empty and, in algebraically closed field…
We explain how to encode an algebraic series by finite data and how to do effective arithmetic on the level of these encodings. The reasoning is based on the Newton-Puiseux algorithm and an effective equality test for algebraic series.…
We propose the extension of the complex numbers to be the new domain where new concepts, like negative and imaginary probabilities, can be defined. The unit of the new space is defined as the solution of the unsolvable equation in the…
The representation of polynomials by arithmetic circuits evaluating them is an alternative data structure which allowed considerable progress in polynomial equation solving in the last fifteen years. We present a circuit based computation…