Skip to main content

VISUALIZACION MATEMATICA: FUNDAMENTOS, ALGORITMOS Y APLICACIONES

PID2020-113192GB-I00

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2020
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre COLEGIO UNIVERSITARIO DE ESTUDIOS FINANCIEROS, S.L.

Resultados relacionados

Resultados totales (Incluyendo duplicados): 25
Encontrada(s) 1 página(s)

e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publication Artículo científico (JournalArticle)

Structured factor copulas for modeling the systemic risk of European and United States banks

  • Nguyen, Hoang
  • Virbickaite, Audrone
  • Ausín Olivera, María Concepción
  • Galeano San Miguel, Pedro
In this paper, we employ Credit Default Swaps (CDS) to model the joint and conditional distress probabilities of banks in Europe and the U.S. using factor copulas. We propose multi-factor, structured factor, and factor-vine models where the banks in the sample are clustered according to their geographic location. We find that within each region, the co-dependence between banks is best described using both, systematic and idiosyncratic, financial contagion channels. However, if we consider the banking system as a whole, then the systematic contagion channel prevails, meaning that the distress probabilities are driven by a latent global factor and region-specific factors. In all cases, the co-dependence structure of bank CDS spreads is highly correlated in the tail. The out-of-sample forecasts of several measures of systemic risk allow us to identify the periods of distress in the banking sector over the recent years including the COVID-19 pandemic, the interest rate hikes in 2022, and the banking crisis in 2023., The second author is partially supported by the grants PID2022-138289NB-I00 (Modeling and forecasting financial returns and macroeconomic variables in data-rich environments: new methods and applications) and PID2020-113192GB-I00/AEI/10.13039/501100011033 (Mathematical Visualization: Foundations, Algorithms and Applications) from the Spanish State Research Agency (Ministerio de Ciencia e Innovación). The third and fourth authors are supported by the grant PID2022-138114NB-I00/AEI/10.13039/501100011033 (High dimensional dependence modeling) from the Spanish State Research Agency (Ministerio de Ciencia e Innovación).
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

Geometric loci and ChatGPT: caveat emptor!

  • Botana Ferreiro, Francisco Ramon
  • Recio, Tomas
We compare the performance of two systems, ChatGPT 3.5 and GeoGebra 5, in a restricted, but quite relevant, benchmark from the realm of classical geometry: the determination of geometric loci, focusing, in particular, on the computation of envelopes of families of plane curves. In order to study the loci calculation abilities of ChatGPT, we begin by entering an informal description of a geometric construction involving a locus or an envelope and then we ask ChatGPT to compute its equation. The chatbot fails in most situations, showing that it is not mature enough to deal with the subject. Then, the same constructions are also approached through the automated reasoning tools implemented in the dynamic geometry program, GeoGebra Discovery, which successfully resolves most of them. Furthermore, although ChatGPT is able to write general computer code, it cannot currently output that of GeoGebra. Thus, we consider describing a simple method for ChatGPT to generate GeoGebra constructions. Finally, in case GeoGebra fails, or gives an incorrect solution, we refer to the need for improved computer algebra algorithms to solve the loci/envelope constructions. Other than exhibiting the current problematic performance of the involved programs in this geometric context, our comparison aims to show the relevance and benefits of analyzing the interaction between them., Agencia Estatal de Investigación | Ref. PID2020-113192GB-I00
Investigo. Repositorio Institucional de la Universidade de Vigo
Publication Artículo científico (JournalArticle)

On using GeoGebra and ChatGPT for geometric discovery

  • Botana Ferreiro, Francisco Ramon
  • Recio, Tomas
  • Vélez, María Pilar
This paper explores the performance of ChatGPT and GeoGebra Discovery when dealing with automatic geometric reasoning and discovery. The emergence of Large Language Models has attracted considerable attention in mathematics, among other fields where intelligence should be present. We revisit a couple of elementary Euclidean geometry theorems discussed in the birth of Artificial Intelligence and a non-trivial inequality concerning triangles. GeoGebra succeeds in proving all these selected examples, while ChatGPT fails in one case. Our thesis is that both GeoGebra and ChatGPT could be used as complementary systems, where the natural language abilities of ChatGPT and the certified computer algebra methods in GeoGebra Discovery can cooperate in order to obtain sound and—more relevant—interesting results., Agencia Estatal de Investigación | Ref. PID2020-113192GB-I00
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

On the summability of a class of formal power series

  • Lastra Sedano, Alberto|||0000-0002-4012-6471
  • Sanz, Javier
  • Sendra Pons, Juan Rafael|||0000-0003-2568-1159
The formal power series solutions for some classes of moment differential equations, induced by polynomial moment differential operators, are characterized in terms of their summability properties, and in terms of estimates for recursive expressions involving their coefficients. Of special interest are the particularization of these results to classes of fractional and of ordinary differential equations. The Stokes’ phenomenon can be described in some of these situations. The main results are extended into the framework of q-Gevrey asymptotics and q-difference equations., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

An effective algorithm for computing the asymptotes of an implicit curve

  • Pérez Díaz, Sonia|||0000-0002-0174-5325
  • Magdalena Benedicto, Rafael
  • Fernandez de Sevilla Vellon, Maria de los Angeles|||0000-0002-0630-1141
In this paper, we first summarize the algorithm presented in Blasco and Pérez-Díaz (2014) for computing the generalized asymptotes of algebraic curves implicitly defined. This algorithm is based on the computation of Puiseux series. The main and very important contribution of this paper is a new and efficient method that allows to easily compute all the generalized asymptotes of an algebraic plane curve implicitly defined by just solving a triangular system of equations. The method can be easily generalized to the case of algebraic curves implicitly defined in the n-dimensional space., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Design and implementation of symbolic algorithms for the computation of generalized asymptotes

  • Fernandez de Sevilla Vellon, Maria de los Angeles|||0000-0002-0630-1141
  • Magdalena Benedicto, Rafael
  • Pérez Díaz, Sonia|||0000-0002-0174-5325
In this paper we present two algorithms for computing the g-asymptotes or generalized asymptotes, of a plane algebraic curve, C , implicitly or parametrically defined. The asymptotes of a curve C reflect the status of C at points with sufficiently large coordinates. It is well known that an asymptote of a curve C is a line such that the distance between C and the line approaches zero as they tend to infinity. However, a curve C may have more general curves than lines describing the status of C at infinity. These curves are known as g-asymptotes or generalized asymptotes. The pseudocodes of these algorithms are presented, as well as the corresponding implementations. For this purpose, we use the algebra software Maple. A comparative analysis of the algorithms is carried out, based on some properties of the input curves and their results to analyze the efficiency of the algorithms and to establish comparative criteria. The results presented in this paper are a starting point to generalize this study to surfaces or to curves defined by a non-rational parametrization, as well as to improve the efficiency of the algorithms. Additionally, the methods developed can provide a new and different approach in prediction (regression) or classification algorithms in the machine learning field., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Computing branches and asymptotes of meromorphic functions

  • Fernandez de Sevilla Vellon, Maria de los Angeles|||0000-0002-0630-1141
  • Magdalena Benedicto, Rafael
  • Pérez Díaz, Sonia|||0000-0002-0174-5325
In this paper, we first summarize the existing algorithms for computing all the generalized asymptotes of a plane algebraic curve implicitly or parametrically defined. From these previous results, we derive a method that allows to easily compute the whole branch and all the generalized asymptotes of a ?special? curve defined in n-dimensional space by a parametrization that is not necessarily rational. So, some new concepts and methods are established for this type of curves. The approach is based on the notion of perfect curves introduced from the concepts and results presented in previous papers., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Determining the asymptotic family of an implicit curve

  • Campo Montalvo, Elena|||0000-0003-1799-7313
  • Fernández De Sevilla Vellón, María De Los Ángeles|||0000-0002-0630-1141
  • Magdalena Benedicto, Rafael
  • Pérez Díaz, Sonia|||0000-0002-0174-5325
In this paper we deal with the following problem: given an algebraic plane curve C, implicitly defined, we determine its “asymptotic family”, that is, the set of algebraic curves that have the same asymptotic behavior as C., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Detecting and parametrizing polynomial surfaces without base points

  • Pérez Díaz, Sonia|||0000-0002-0174-5325
  • Fernández de Sevilla Vellón, María de los Ángeles|||0000-0002-0630-1141
  • Magdalena Benedicto, Rafael
  • Shen, Li-Yong
Given an algebraic surface implicitly defined by an irreducible polynomial, we present a method that decides whether or not this surface can be parametrized by a polynomial parametrization without base points and, in the affirmative case, we show how to compute this parametrization., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Sufficient conditions for the surjectivity of radical curve parametrizations

  • Caravantes Tortajada, Jorge|||0000-0001-9550-2481
  • Sendra Pons, Juan Rafael|||0000-0003-2568-1159
  • Sevilla, David
  • Villarino Cabellos, Carlos|||0000-0003-3101-3245
J. Caravantes and C. Villarino belong to the Research Group ASYNACS (Ref. CT-CE2019/683). D. Sevilla is a member of the research group GADAC and is partially supported by Junta de Extremadura and Fondo Europeo de Desarrollo Regional (GR21055)., En este artículo se introduce la noción de parametrización radical suprayectiva y se dan condiciones suficientes para que una parametrización radical de una curva sea suprayectiva., In this paper, we introduce the notion of surjective radical parametrization and we prove sufficient conditions for a radical curve parametrization to be surjective., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Asymptotic behavior of parametric algebraic surfaces

  • Pérez Díaz, Sonia|||0000-0002-0174-5325
  • Fernández de Sevilla Vellón, María de los Ángeles|||0000-0002-0630-1141
  • Magdalena Benedicto, Rafael
Starting from the concept of infinite branches and approximation surfaces, we present a method to compute infinite branches and surfaces having the same asymptotic behavior as an input parametric surface. The results obtained in this work represent a breakthrough for the study of surfaces and their applications., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Using μ-bases to reduce the degree in the computation of projective equivalences between rational curves in n-space

  • Alcázar Arribas, Juan Gerardo|||0000-0002-1665-9710
  • Hermoso Ortíz, Carlos|||0000-0002-5556-1839
  • Pérez Díaz, Sonia|||0000-0002-0174-5325
  • Shen, Li-Yong
We study how projective equivalences between rational curves in Rn are transferred to the elements of smallest degree of the μ-bases of the curves. We show how to compute these elements of smallest degree without computing the whole μ-basis, and prove some results on the degrees of μ-bases of curves in Rn. As a result, we provide a way to reduce the cost of computing the projective equivalences between rational curves in Rn by replacing the given curves for the curves represented by the elements of smallest degree of the μ-bases of the curves, which have a much smaller degree compared to the original degree of the curves., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Globally certified G¹ approximation of planar algebraic curves

  • Wang, Xin-Yu
  • Shen, Li-Yong
  • Yuan, Chun-Ming
  • Pérez Díaz, Sonia|||0000-0002-0174-5325
Topology analysis and geometric feature determination for curves and surfaces are basic problems in geometric modeling and computer aided design. When the curves and surfaces are given in implicit expressions, the problems become more difficult. This paper presents a complete algorithm framework for the problem of certified G¹ approximation of a planar algebraic curve under global error control. Compared to other work on topology and geometric analysis of algebraic curves, this method presents a new topology analysis as well as a geometric information computation. Moreover, this method uses generalized asymptotes as the approximation of the unbounded part, which makes it achieve global approximation with given precision., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Contribución de congreso (ConferenceOutput)

Cálculo de asíntotas generalizadas de curvas

  • Campo Montalvo, Elena|||0000-0003-1799-7313
  • Fernández de Sevilla Vellón, María de los Ángeles|||0000-0002-0630-1141
  • Pérez Díaz, Sonia|||0000-0002-0174-5325
XXII Encuentro de Álgebra Computacional y Aplicaciones, EACA 2022, 20-22 Junio 2022, Castellón de la Plana, España., Se presenta un algoritmo para calcular las asíntotas generalizadas o g-asíntotas de una curva algebraica plana, C, definida implícitamente en C². Las g-asíntotas generalizan el concepto clásico de asíntota de una curva definida por un polinomio de la forma yg(x) – f(x). Para ello, se definen los conceptos de ramas infinitas y ramas convergentes, y se establecen los fundamentos a partir de los cuales se definirán las g-asíntotas, es decir, las curvas aproximantes y las curvas perfectas. Estos conceptos constituyen una herramienta fundamental para analizar el comportamiento de una curva en el infinito., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

A simple formula for the computation of branches and asymptotes of curves and some applications

  • Campo Montalvo, Elena|||0000-0003-1799-7313
  • Fernández De Sevilla Vellón, María De Los Ángeles|||0000-0002-0630-1141
  • Pérez Díaz, Sonia|||0000-0002-0174-5325
In this paper, we obtain a simple formula based on the computation of some derivatives for determining the branches and the asymptotes of curves that are defined by a parametrization. For this purpose, we use some previous results and notions presented in Blasco and Pérez-Díaz, 2014a, Blasco and Pérez-Díaz, 2014b, Blasco and Pérez-Díaz, 2015, Blasco and Pérez-Díaz, 2020. From these results, we show how the generalized asymptotes of the input curve can be easily computed and we present some applications related to the ramification index and degree of the asymptote, the infinity form and the multiplicity of the infinity points. Furthermore, we show how to construct all the families of parametric curves having some given asymptotes. We develop this method for the plane case but it can be trivially adapted for dealing with rational curves in n-dimensional space. In addition, the formulaes presented can be similarly obtained for curves defined by a parametrization not necessarily rational., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

A note about rational surfaces as unions of affine planes

  • Caravantes Tortajada, Jorge|||0000-0001-9550-2481
  • Sendra Pons, Juan Rafael|||0000-0003-2568-1159
  • Sevilla, David
  • Villarino Cabellos, Carlos|||0000-0003-3101-3245
J. Caravantes and C. Villarino belong to the Research Group ASYNACS (Ref. CT-CE2019/683). D. Sevilla is a member of the research group GADAC and is partially supported by Junta de Extremadura and Fondo Europeo de Desarrollo Regional (GR21055), Demostramos que cualquier superficie proyectiva racional lisa, sobre el cuerpo de los números complejos, admite un recubrimiento por medio de tres subconjuntos isomorfos a planos afines., We prove that any smooth rational projective surface over the field of complex numbers has an open covering consisting of 3 subsets isomorphic to affine planes., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

On G2 approximation of planar algebraic curves under certified error control by quintic Pythagorean-hodograph splines

  • Wang, Xin-Yu
  • Shen, Li-Yong
  • Yuan, Chun-Ming
  • Pérez Díaz, Sonia|||0000-0002-0174-5325
The Pythagorean-Hodograph curve (PH curve) is a valuable curve type extensively utilized in computer-aided geometric design and manufacturing. This paper presents an approach to approximate a planar algebraic curve within a bounding box by employing piecewise quintic PH spline curves, while maintaining 𝐺2 smoothness of the approximating curve and preserving second-order geometric details at singularities. The bounding box encompasses all 𝑥-coordinates of key topological points, ensuring accurate representation. The paper explores the analysis of the 𝐺2 interpolation problem for quintic PH curves with invariant convexity, transforming the quest for interpolation solutions into identifying positive roots within a set of algebraic equations. Through infinitesimal order analysis, it is established that a solution necessarily exists following adequate subdivision, laying the groundwork for practical application. Finally, the paper introduces a novel algorithm that integrates prior research to construct the approximating curve while maintaining control over the desired error levels., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Some New Symbolic Algorithms for the Computation of Generalized Asymptotes

  • Campo Montalvo, Elena|||0000-0003-1799-7313
  • Fernández De Sevilla Vellón, María De Los Ángeles|||0000-0002-0630-1141
  • Magdalena Benedicto, Rafael
  • Pérez Díaz, Sonia|||0000-0002-0174-5325
We present symbolic algorithms for computing the g-asymptotes, or generalized asymptotes, of a plane algebraic curve, C, implicitly or parametrically defined. The g-asymptotes generalize the classical concept of asymptotes of a plane algebraic curve. Both notions have been previously studied for analyzing the geometry and topology of a curve at infinity points, as well as to detect the symmetries that can occur in coordinates far from the origin. Thus, based on this research, and in order to solve practical problems in the fields of science and engineering, we present the pseudocodes and implementations of algorithms based on the Puiseux series expansion to construct the g-asymptotes of a plane algebraic curve, implicitly or parametrically defined. Additionally, we propose some new symbolic methods and their corresponding implementations which improve the efficiency of the preceding. These new methods are based on the computation of limits and derivatives; they show higher computational performance, demanding fewer hardware resources and system requirements, as well as reducing computer overload. Finally, as a novelty in this research area, a comparative analysis for all the algorithms is carried out, considering the properties of the input curves and their outcomes, to analyze their efficiency and to establish comparative criteria between them., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Challenges and opportunities in machine learning for geometry

  • Magdalena Benedicto, Rafael
  • Pérez Díaz, Sonia|||0000-0002-0174-5325
  • Costa Roig, Adrià
Over the past few decades, the mathematical community has accumulated a significant amount of pure mathematical data, which has been analyzed through supervised, semi-supervised, and unsupervised machine learning techniques with remarkable results, e.g., artificial neural networks, support vector machines, and principal component analysis. Therefore, we consider as disruptive the use of machine learning algorithms to study mathematical structures, enabling the formulation of conjectures via numerical algorithms. In this paper, we review the latest applications of machine learning in the field of geometry. Artificial intelligence can help in mathematical problem solving, and we predict a blossoming of machine learning applications during the next years in the field of geometry. As a contribution, we propose a new method for extracting geometric information from the point cloud and reconstruct a 2D or a 3D model, based on the novel concept of generalized asymptotes., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Affine equivalences of surfaces of translation and minimal surfaces, and applications to symmetry detection and design

  • Alcázar Arribas, Juan Gerardo|||0000-0002-1665-9710
  • Muntingh, Georg
We introduce a characterization for affine equivalence of two surfaces of translation defined by either rational or meromorphic generators. In turn, this induces a similar characterization for minimal surfaces. In the rational case, our results provide algorithms for detecting affine equivalence of these surfaces, and therefore, in particular, the symmetries of a surface of translation or a minimal surface of the considered types. Additionally, we apply our results to designing surfaces of translation and minimal surfaces with symmetries, and to computing the symmetries of the higher-order Enneper surfaces., Agencia Estatal de Investigación, European Commission
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Asymptotic behavior of a surface implicitly defined

  • Campo Montalvo, Elena|||0000-0003-1799-7313
  • Fernández De Sevilla Vellón, María De Los Ángeles|||0000-0002-0630-1141
  • Pérez Díaz, Sonia|||0000-0002-0174-5325
In this paper, we introduce the notion of infinity branches and approaching surfaces. We obtain an algorithm that compares the behavior at the infinity of two given algebraic surfaces that are defined by an irreducible polynomial. Furthermore, we show that if two surfaces have the same asymptotic behavior, the Hausdorff distance between them is finite. All these concepts are new and represent a great advance for the study of surfaces and their applications., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Representations and geometrical properties of generalized inverses over fields

  • Stanimirovic, Predrag S.
  • Ciric, Miroslav
  • Lastra Sedano, Alberto|||0000-0002-4012-6471
  • Sendra Pons, Juan Rafael|||0000-0003-2568-1159
  • Sendra Pons, Juana
In this paper, as a generalization of Urquhart’s formulas, we present a full description of the sets of inner inverses and (B, C)-inverses over an arbitrary field. In addition, identifying the matrix vector space with an affine space, we analyze geometrical properties of the main generalized inverse sets. We prove that the set of inner inverses, and the set of (B, C)-inverses, form affine subspaces and we study their dimensions. Furthermore, under some hypotheses, we prove that the set of outer inverses is not an affine subspace but it is an affine algebraic variety. We also provide lower and upper bounds for the dimension of the outer inverse set., Agencia Estatal de Investigación, Universidad de Alcalá
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Inner Bohemian inverses

  • Chan, Eunice Y.S.
  • Corless, Robert M.
  • González Vega, Laureano
  • Sendra Pons, Juan Rafael|||0000-0003-2568-1159
  • Sendra Pons, Juana
In this paper, for certain type of structured {0, 1, -1}-matrices, we give a complete description of the inner Bohemian inverses over any population containing the set {0, 1, -1}. In addition, when the population is exactly {0, 1, -1}, we provide explicit formulas for the number of inner Bohemian inverses of these type of matrices., Agencia Estatal de Investigación, Natural Sciences and Engineering Research Council of Canada
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Algebraic and Puiseux series solutions of systems of autonomous algebraic ODEs of dimension one in several variables

  • Cano, José
  • Falkensteiner, Sebastian
  • Robertz, Daniel
  • Sendra Pons, Juan Rafael|||0000-0003-2568-1159
In this paper we study systems of autonomous algebraic ODEs in several differential indeterminates. We develop a notion of algebraic dimension of such systems by considering them as algebraic systems. Afterwards we apply differential elimination and analyze the behavior of the dimension in the resulting Thomas decomposition. For such systems of algebraic dimension one, we show that all formal Puiseux series solutions can be approximated up to an arbitrary order by convergent solutions. We show that the existence of Puiseux series and algebraic solutions can be decided algorithmically. Moreover, we present a symbolic algorithm to compute all algebraic solutions. The output can either be represented by triangular systems or by their minimal polynomials., Agencia Estatal de Investigación, Austrian Science Fund
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

A new method to detect projective equivalences and symmetries of rational 3D curves

  • Gözütok, Uğur
  • Çoban, Hüsnü Anıl
  • Sağıroğlu, Yasemin
  • Alcázar Arribas, Juan Gerardo|||0000-0002-1665-9710
We present a new approach to detect projective equivalences and symmetries between two rational parametric curves properly parametrized. In order to do this, we introduce two rational functions that behave nicely for Möbius transformations, which are the transformations in the parameter space associated with the projective equivalences between the curves. The Möbius transformations are found by first computing the gcd of two polynomials built from these two functions, and then searching for a special type of factors, ?Möbius-like?, of this gcd. The projective equivalences themselves are easily computed from the Möbius transformations. In particular, and unlike previous approaches, we avoid solving big polynomial systems. The algorithm has been implemented in Maple? (2021), and evidences of its efficiency as well as a comparison with previous approaches are given., Agencia Estatal de Investigación, Karadeniz Technical University