DeepAI AI Chat
Log In Sign Up

Algebraic and algorithmic aspects of radical parametrizations

09/30/2016
by   J. Rafael Sendra, et al.
Universidad de Alcalá
University of Extremadura
0

In this article algebraic constructions are introduced in order to study the variety defined by a radical parametrization (a tuple of functions involving complex numbers, n variables, the four field operations and radical extractions). We provide algorithms to implicitize radical parametrizations and to check whether a radical parametrization can be reparametrized into a rational parametrization.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/03/2020

Calcium: computing in exact real and complex fields

Calcium is a C library for real and complex numbers in a form suitable f...
11/17/2016

D-finite Numbers

D-finite functions and P-recursive sequences are defined in terms of lin...
05/06/2018

RealCertify: a Maple package for certifying non-negativity

Let Q (resp. R) be the field of rational (resp. real) numbers and X = (X...
10/09/2019

Efficiently and Effectively Recognizing Toricity of Steady State Varieties

We consider the problem of testing whether the points in a complex or re...
03/11/2009

Free actions and Grassmanian variety

An algebraic notion of representational consistency is defined. A theore...
12/11/2017

Operads in algebraic combinatorics

The main ideas developed in this habilitation thesis consist in endowing...