Excerpt from Robotics Research Technical Report: Nonlinearity of Davenport-Schinzel, Sequences and of Generalized, Path Compression Schemes
Davenport-schinzel sequences are sequences that do not contain forbidden subsequences of alternating symbols. They arise in the computation of the envelope of a set of functions. We show that the maximal length of a davenport-schinzel sequence composed of n symbols is where o(u) is the functional inverse of Ackermann's function, and is thus very slowly increasing to infinity. This is achieved by establishing an equivalence between such sequences and generalized path compression schemes on rooted trees, and then by analyzing these schemes.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sinopsis" puede pertenecer a otra edición de este libro.
Excerpt from Robotics Research Technical Report: Nonlinearity of Davenport-Schinzel, Sequences and of Generalized, Path Compression Schemes
Davenport-schinzel sequences are sequences that do not contain forbidden subsequences of alternating symbols. They arise in the computation of the envelope of a set of functions. We show that the maximal length of a davenport-schinzel sequence composed of n symbols is where o(u) is the functional inverse of Ackermann's function, and is thus very slowly increasing to infinity. This is achieved by establishing an equivalence between such sequences and generalized path compression schemes on rooted trees, and then by analyzing these schemes.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Excerpt from Robotics Research Technical Report: Nonlinearity of Davenport-Schinzel, Sequences and of Generalized, Path Compression Schemes
This problem has originally been posed by Davenport and Schinzel Ds. Their interest in it arose from its connection to the analysis of solutions of linear differential equations. Recently, Atallah At has raised it again independently, because of its significance for problems in dynamic computational geometry. These two applications are quite similar, and can be briefly described a follows.
Thus, in this setting, Davenport-Schinzel sequences are strongly related to the problem of computing the (lower) envelope of a set of functions which intersect each other in pairs in at most some fixed number of points. This problem has many applications in computational geometry and related areas, many of which are given in [At]; some additional applications will be noted in Section 7.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 0,64 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoLibrería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332092116
Cantidad disponible: 15 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332092116
Cantidad disponible: 15 disponibles
Librería: Forgotten Books, London, Reino Unido
Paperback. Condición: New. Print on Demand. This book explores the unexpected properties of Davenport-Schinzel sequences and generalized path compression schemes on trees. These intricate sequences possess unique characteristics that have fascinated mathematicians for decades, with applications in a wide range of fields, including computational geometry and dynamic computational problems. The author delves into the history of these sequences, their mathematical significance, and their practical implications. Through a rigorous analysis, the book reveals the surprising connections between these seemingly unrelated concepts, providing a deeper understanding of their underlying structures. Ultimately, this book offers valuable insights into the nature of these mathematical objects and their potential for future research and applications. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Nº de ref. del artículo: 9781332092116_0
Cantidad disponible: Más de 20 disponibles