Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Recursion and iteration in combinatorics of Chandaśśāstra
by
Kulkarni, Amba
in
Algorithms
/ Grammatical aspect
/ History of Science
/ Humanities and Social Sciences
/ Mathematics
/ multidisciplinary
/ Philosophy of History
/ Recursion
/ Science
/ Science (multidisciplinary)
/ Teaching
2023
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Recursion and iteration in combinatorics of Chandaśśāstra
by
Kulkarni, Amba
in
Algorithms
/ Grammatical aspect
/ History of Science
/ Humanities and Social Sciences
/ Mathematics
/ multidisciplinary
/ Philosophy of History
/ Recursion
/ Science
/ Science (multidisciplinary)
/ Teaching
2023
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Recursion and iteration in combinatorics of Chandaśśāstra
2023
Request Book From Autostore
and Choose the Collection Method
Overview
Piṅgaḷa in his book on
Chandaśśāstra
, a text related to the description and analysis of meters in poetic work, describes algorithms that deal with Combinatorial Mathematics and are tail-recursive in nature. Later after almost a millennium in around 800 CE, Kedāra Bhaṭṭa provides iterative algorithms for the same operations. Another major difference between the two works is stylistic. Piṅgaḷa uses a cryptic style of
sūtras
while Kedāra Bhaṭṭa uses a verse style. The purpose of this paper is to highlight the methodological differences between Piṅgaḷa’s algorithms and the corresponding algorithms of Kedāra Bhaṭṭa. We look at the algorithms described by both scholars, and express them in modern mathematical notation or in algorithmic style in order to understand the differences. Recursive algorithms are easy to conceptualise. However, the iterative algorithms are easy from the learner’s point of view. The transition from
sūtras
to verses and from recursion to iteration in the later period might be due to pedagogy.
Publisher
Indian National Science Academy,Nature Publishing Group
This website uses cookies to ensure you get the best experience on our website.