English
Related papers

Related papers: Algebraic and algorithmic aspects of radical param…

200 papers

A new algebraic object is introduced - recurrent fractions, which is an n-dimensional generalization of continued fractions. It is used to describe an algorithm for rational approximations of algebraic irrational numbers. Some…

Number Theory · Mathematics 2011-03-31 Roman Zatorsky

We aim at studying collections of algebraic structures defined over a commutative ring and investigating the complexity of significant constructions carried out on these objects. The assignment of measures of size, via a multiplicity…

Commutative Algebra · Mathematics 2014-02-11 Wolmer V. Vasconcelos

Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…

Symbolic Computation · Computer Science 2009-11-13 Juan Gerardo Alcazar

This preprint is dedicated to a self contained simple proof of the classical criteria for representability of algebraic functions of several complex variables by radicals. It also contains a criteria for representability of algebroidal…

Algebraic Geometry · Mathematics 2019-04-16 Askold Khovanskii

Probabilistic programming has emerged as a powerful paradigm in statistics, applied science, and machine learning: by decoupling modelling from inference, it promises to allow modellers to directly reason about the processes generating…

Machine Learning · Statistics 2019-06-10 Maria I. Gorinova , Dave Moore , Matthew D. Hoffman

The developable surface is an important surface in computer aided design, geometric modeling and industrial manufactory. It is often given in the stan- dard parametric form, but it can also be in the implicit form which is commonly used in…

Symbolic Computation · Computer Science 2013-05-14 Sonia Perez-Diaz , Li-Yong Shen

We give a polymorphic account of the relational algebra. We introduce a formalism of ``type formulas'' specifically tuned for relational algebra expressions, and present an algorithm that computes the ``principal'' type for a given…

Logic in Computer Science · Computer Science 2007-05-23 Jan Van den Bussche , Emmanuel Waller

Over the last 20 years a large number of automata-based specification theories have been proposed for modeling of discrete,real-time and probabilistic systems. We have observed a lot of shared algebraic structure between these formalisms.…

Logic in Computer Science · Computer Science 2011-01-26 Axel Legay , Andrzej Wąsowski

We present axiomatisations for a number of partial function signatures that include domain restriction, modelled as a right normal band operation. Other operations considered are override and update, difference, minus, intersection,…

Logic · Mathematics 2022-06-23 Marcel Jackson , Tim Stokes

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

Formal Languages and Automata Theory · Computer Science 2025-09-30 Attila Egri-Nagy , Chrystopher L. Nehaniv

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…

Logic · Mathematics 2023-07-25 Sergey V. Sudoplatov

An informal discussion of how the construction problem in algebraic geometry motivates the search for formal proof methods. Also includes a brief discussion of my own progress up to now, which concerns the formalization of category theory…

Algebraic Geometry · Mathematics 2007-05-23 Carlos T. Simpson

We report on implementations for algorithms treating algebraic and arithmetic properties of hypergeometric functions in the computer algebra system SageMath. We treat hypergeometric series over the rational numbers, over finite fields, and…

Symbolic Computation · Computer Science 2026-02-05 Xavier Caruso , Florian Fürnsinn

First some old as well as new results about P.I. algebras, Ore extensions, and degrees are presented. Then quantized $n\times r$ matrices as well as quantized factor algebras of $M_q(n)$ are analyzed. The latter are the quantized function…

Quantum Algebra · Mathematics 2007-05-23 Hans Plesner Jakobsen , Søren Jøndrup

Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…

Statistics Theory · Mathematics 2007-06-13 Mathias Drton

We introduce the notion of a robust parameterized arithmetic circuit for the evaluation of algebraic families of multivariate polynomials. Based on this notion, we present a computation model, adapted to Scientific Computing, which captures…

Computational Complexity · Computer Science 2012-04-26 Joos Heintz , Bart Kuijpers , Andres Rojas Paredes

Autonomous systems require the management of several model views to assure properties such as safety and security among others. A crucial issue in autonomous systems design assurance is the notion of emergent behavior; we cannot use their…

Logic in Computer Science · Computer Science 2022-03-31 Georgios Bakirtzis , Ufuk Topcu

This is an overview of higher structural constructions in physics. The main motivations of our current attempt are as follows: (i) to provide a brief introduction to derived algebraic geometry, (ii) to understand how derived objects…

Algebraic Geometry · Mathematics 2023-07-14 Kadri İlker Berktav

In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced…

Computer Vision and Pattern Recognition · Computer Science 2024-02-14 Anvar Kabulov , Alimdzhan Babadzhanov , Islambek Saymanov

Machine learning algorithms use error function minimization to fit a large set of parameters in a preexisting model. However, error minimization eventually leads to a memorization of the training dataset, losing the ability to generalize to…

Machine Learning · Computer Science 2018-03-16 Fernando Martin-Maroto , Gonzalo G. de Polavieja