A classifier for simple isolated complete intersection singularities

2015 ◽  
Vol 52 (1) ◽  
pp. 1-11
Author(s):  
Deeba Afzal ◽  
Gerhard Pfister
Keyword(s):  
Complete Intersection ◽  
Computer Algebra ◽  
Computer Algebra System

M. Giusti’s classification of the simple complete intersection singularities is characterized in terms of invariants. This is a basis for the implementation of a classifier in the computer algebra system Singular.

A classifier for simple space curve singularities

2014 ◽  
Vol 51 (1) ◽  
pp. 92-104
Author(s):  
Faira Janjua ◽  
Gerhard Pfister
Keyword(s):  
Computer Algebra ◽  
Computer Algebra System ◽  
Plane Curve ◽  
Space Curve ◽  
Plane Curve Singularities ◽  
Curve Singularities

The classification of Bruce and Gaffney respectively Gibson and Hobbs for simple plane curve singularities respectively simple space curve singularities is characterized in terms of invariants. This is the basis for the implementation of a classifier in the computer algebra system singular.

On the classification of simple maps from the plane to the plane

2017 ◽  
Vol 16 (10) ◽  
pp. 1750199 ◽  
Author(s):  
Muhammad Ahsan Binyamin ◽  
Hasan Mahmood ◽  
Shamsa Kanwal
Keyword(s):  
Computer Algebra ◽  
Computer Algebra System

In this paper, we characterize the classification of simple maps from the plane to the plane given by J. H. Rieger, in terms of invariants. On the basis of this characterization we present an algorithm to classify the simple maps from the plane to the plane and also give its implementation in computer algebra system SINGULAR.

Characterization of uni-modal parametric plane curve singularities

2017 ◽  
Vol 16 (02) ◽  
pp. 1750039
Author(s):  
Muhammad Ahsan Binyamin ◽  
Rabia ◽  
Hasan Mahmood ◽  
Junaid Alam Khan ◽  
Khawar Mehmood
Keyword(s):  
Computer Algebra ◽  
Computer Algebra System ◽  
Plane Curve ◽  
Plane Curve Singularities ◽  
Parametric Plane ◽  
Curve Singularities

In this article we characterize the classification of uni-modal parametric plane curve singularities given by Ishikawa and Janeczko, in terms of invariants. On the basis of this characterization we present an algorithm to classify the uni-modal parametric plane curve singularities and also give its implementation in computer algebra system SINGULAR.

Primitive Genus Two Groups of Meta Type

2018 ◽  
Vol 7 (1-2) ◽  
pp. 1
Author(s):  
Haval Mohammed Salih
Keyword(s):  
Computer Algebra ◽  
Computer Algebra System ◽  
Complete Classification ◽  
Permutation Groups ◽  
Affine Groups ◽  
Two Systems ◽  
Genus Two

This paper is a contribution to the classification of the finite primitive permutation groups of genus two. We consider the case of affine groups. Our main result, Lemma 3.10 gives a complete classification of genus two systems when . We achieve this classification with the aid of the computer algebra system GAP.

Recognition of unimodal map germs from the plane to the plane by invariants

2018 ◽  
Vol 28 (07) ◽  
pp. 1199-1208
Author(s):  
Saima Aslam ◽  
Muhammad Ahsan Binyamin ◽  
Gerhard Pfister
Keyword(s):  
Normal Form ◽  
Computer Algebra ◽  
Computer Algebra System ◽  
Closed Field ◽  
Unimodal Maps ◽  
Unimodal Map ◽  
Algebraically Closed Field

In this paper, we characterize the classification of unimodal maps from the plane to the plane with respect to [Formula: see text]-equivalence given by Rieger in terms of invariants. We recall the classification over an algebraically closed field of characteristic [Formula: see text]. On the basis of this characterization, we present an algorithm to compute the type of the unimodal maps from the plane to the plane without computing the normal form and also give its implementation in the computer algebra system Singular.

Characterization of stably simple curve singularities

2016 ◽  
Vol 53 (3) ◽  
pp. 314-321
Author(s):  
Muhammad Ahsan Binyamin ◽  
Junaid Alam Khan ◽  
Faira Kanwal Janjua ◽  
Naveed Hussain
Keyword(s):  
Computer Algebra ◽  
Computer Algebra System ◽  
Curve Singularities

In this article we characterize the classification of stably simple curve singularities given by V. I. Arnold, in terms of invariants. On the basis of this characterization we describe an implementation of a classifier for stably simple curve singularities in the computer algebra system SINGULAR.

scholarly journals An Implementation of Lipschitz Simple Functions in Computer Algebra System Singular

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-5
Author(s):  
Yanan Liu ◽  
Muhammad Ahsan Binyamin ◽  
Adnan Aslam ◽  
Minahal Arshad ◽  
Chengmei Fan ◽  
...  
Keyword(s):  
Normal Form ◽  
Computer Algebra ◽  
Computer Algebra System ◽  
Complete Classification ◽  
Simple Function ◽  
Complex Numbers ◽  
Lipschitz Equivalence

A complete classification of simple function germs with respect to Lipschitz equivalence over the field of complex numbers ℂ was given by Nguyen et al. The aim of this article is to implement a classifier in terms of easy computable invariants to compute the type of the Lipschitz simple function germs without computing the normal form in the computer algebra system Singular.

Generation of Correlated Logistic-Normal Random Variates for Medical Decision Trees

1998 ◽  
Vol 37 (03) ◽  
pp. 235-238 ◽  
Author(s):  
M. El-Taha ◽  
D. E. Clark
Keyword(s):  
Monte Carlo ◽  
Decision Trees ◽  
Computer Algebra ◽  
Taylor Series ◽  
Computer Algebra System ◽  
Random Variable ◽  
Monte Carlo Analysis ◽  
Normal Random Variable ◽  
Medical Decision ◽  
Theoretical Results

AbstractA Logistic-Normal random variable (Y) is obtained from a Normal random variable (X) by the relation Y = (ex)/(1 + ex). In Monte-Carlo analysis of decision trees, Logistic-Normal random variates may be used to model the branching probabilities. In some cases, the probabilities to be modeled may not be independent, and a method for generating correlated Logistic-Normal random variates would be useful. A technique for generating correlated Normal random variates has been previously described. Using Taylor Series approximations and the algebraic definitions of variance and covariance, we describe methods for estimating the means, variances, and covariances of Normal random variates which, after translation using the above formula, will result in Logistic-Normal random variates having approximately the desired means, variances, and covariances. Multiple simulations of the method using the Mathematica computer algebra system show satisfactory agreement with the theoretical results.

The Maple computer algebra system: A review

1995 ◽  
Vol 10 (3) ◽  
pp. 329-337 ◽  
Author(s):  
John Hutton ◽  
James Hutton
Keyword(s):  
Computer Algebra ◽  
Computer Algebra System ◽  
System A
Sign in / Sign up

Export Citation Format

Share Document