On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms
| dc.contributor.author | Estevan Muguerza, Asier | |
| dc.contributor.author | Miñana, Juan José | |
| dc.contributor.author | Valero, Óscar | |
| dc.contributor.department | Estatistika, Informatika eta Matematika | eu |
| dc.contributor.department | Institute for Advanced Materials and Mathematics - INAMAT2 | en |
| dc.contributor.department | Estadística, Informática y Matemáticas | es_ES |
| dc.date.accessioned | 2020-01-15T11:54:51Z | |
| dc.date.available | 2020-05-08T23:00:10Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we discuss whether the hypothesis of the aforementioned result can be weakened. An affirmative answer to the aforesaid inquiry is provided so that a characterization of those properties that a self-mapping must satisfy in order to guarantee that its set of fixed points is non-empty when no notion of completeness are assumed to be satisfied by the partially ordered set. Moreover, the case in which the partially ordered set is coming from a quasi-metric space is treated in depth. Finally, an application of the exposed theory is obtained. Concretely, a mathematical method to discuss the asymptotic complexity of those algorithms whose running time of computing fulfills a recurrence equation is presented. Moreover, the aforesaid method retrieves the fixed point based methods that appear in the literature for asymptotic complexity analysis of algorithms. However, our new method improves the aforesaid methods because it imposes fewer requirements than those that have been assumed in the literature and, in addition, it allows to state simultaneously upper and lower asymptotic bounds for the running time computing. | en |
| dc.description.sponsorship | A. Estevan acknowledges financial support from Spanish Ministry of Economy and Competitiveness under Grants MTM2015-63608-P (MINECO/FEDER) and ECO2015-65031. J.J. Miñana and O. Valero acknowledge financial support from Spanish Ministry of Science, Innovation and Universities under Grant PGC2018-095709-B-C21 and AEI/FEDER, UE funds. This work is also partially supported by Programa Operatiu FEDER 2014–2020 de les Illes Balears, by project PROCOE/4/2017 (Direcció General d’Innovació i Recerca, Govern de les Illes Balears) and by project ROBINS. The latter has received research funding from the EU H2020 framework under GA 779776. | en |
| dc.embargo.lift | 2020-05-08 | |
| dc.embargo.terms | 2020-05-08 | |
| dc.format.extent | 22 p. | |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.doi | 10.1007/s13398-019-00691-8 | |
| dc.identifier.issn | 1578-7303 | |
| dc.identifier.uri | https://academica-e.unavarra.es/handle/2454/36069 | |
| dc.language.iso | eng | en |
| dc.publisher | Springer | en |
| dc.relation.ispartof | RACSAM (2019) 113:3233–3252 | en |
| dc.relation.projectID | info:eu-repo/grantAgreement/MINECO//MTM2015-63608-P/ES/ | |
| dc.relation.projectID | info:eu-repo/grantAgreement/European Commission/Horizon 2020 Framework Programme/779776/ | |
| dc.relation.publisherversion | https://doi.org/10.1007/s13398-019-00691-8 | |
| dc.rights | © The Royal Academy of Sciences, Madrid 2019 | en |
| dc.rights.accessRights | info:eu-repo/semantics/openAccess | |
| dc.subject | Partial order | en |
| dc.subject | Quasi-metric | en |
| dc.subject | Fixed point | en |
| dc.subject | Kleene | en |
| dc.subject | Asymptotic complexity | en |
| dc.subject | Recurrence equation | en |
| dc.title | On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms | en |
| dc.type | info:eu-repo/semantics/article | |
| dc.type.version | info:eu-repo/semantics/acceptedVersion | |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | e442a64a-b62e-4338-9a67-d7f4d9f12813 | |
| relation.isAuthorOfPublication.latestForDiscovery | e442a64a-b62e-4338-9a67-d7f4d9f12813 |