An Implementation of Lipschitz Simple Functions in Computer Algebra System Singular

, , , , , &
Complexity 2021:1-5 (2021)
  Copy   BIBTEX

Abstract

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.

Categories

Keywords

Reprint years

DOI

10.1155/2021/6695461

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,227

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Minimal stretch maps between hyperbolic surfaces.P. Thurston William - unknown
Approximation of o-minimal maps satisfying a Lipschitz condition.Andreas Fischer - 2014 - Annals of Pure and Applied Logic 165 (3):787-802.
The Norton-type lipschitz-indeterministic systems and elastic phenomena: Indeterminism as an artefact of infinite idealizations.Alexandre Korolev - unknown
The computable Lipschitz degrees of computably enumerable sets are not dense.Adam R. Day - 2010 - Annals of Pure and Applied Logic 161 (12):1588-1602.
Equivalence between Wadge and Lipschitz determinacy.Alessandro Andretta - 2003 - Annals of Pure and Applied Logic 123 (1-3):163-192.
Ones and Zeros: Understanding Boolean Algebra, Digital Circuits, and the Logic of Sets.John Gregg - 1998 - IEEE Pres.
KAT-ML: an interactive theorem prover for Kleene algebra with tests.Kamal Aboul-Hosn & Dexter Kozen - 2006 - Journal of Applied Non-Classical Logics 16 (1-2):9-33.
A Characterization of the free n-generated MV-algebra.Daniele Mundici - 2006 - Archive for Mathematical Logic 45 (2):239-247.
Maximal pairs of c.e. reals in the computably Lipschitz degrees.Yun Fan & Liang Yu - 2011 - Annals of Pure and Applied Logic 162 (5):357-366.
On the computational complexity of integral equations.Ker-I. Ko - 1992 - Annals of Pure and Applied Logic 58 (3):201-228.
The construction of transfinite equivalence algorithms.Han Geurdes - manuscript
A Simple Type Theory With Partial Functions And Subtypes.William M. Farmer - 1993 - Annals of Pure and Applied Logic 64 (3):211-240.
Indeterminism, asymptotic reasoning, and time irreversibility in classical physics.Alexandre Korolev - 2007 - Philosophy of Science 74 (5):943-956.
Preliminary Considerations on a Possible Quantum Model of Consciousness Interfaced with a non Lipschitz Chaotic Dynamics of Neural Activity.Elio Conte - 2012 - Journal of Consciousness Exploration and Research 3 (10):905-921.
λ-Definability on free algebras.Marek Zaionc - 1991 - Annals of Pure and Applied Logic 51 (3):279-300.

Analytics

Added to PP
2021-04-02

Downloads
21 (#741,388)

6 months
15 (#171,570)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references