Algorithms for Analytic Combinatorics – PI4 Program 2018
نویسنده
چکیده
One of the draws of combinatorics is its ability to take inspiration from, motivate, and even push forward diverse areas of mathematics and computer science. In particular, much current research focuses on the use of analytic techniques to address questions of computability and complexity in enumerative combinatorics. The universality of many analytic statements often allows for very general enumerative results which are ripe for automation. This program will study these techniques and their wide range of applications across several disciplines, with a focus on implementing algorithms which will be of use to current and future researchers.
منابع مشابه
The Order Steps of an Analytic Combinatorics
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. This theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology and information theory. With a caref...
متن کاملA mathematical approach for secondary structure analysis can provide an eyehole to the RNA world
CC-BY-NC 4.0 International license peer-reviewed) is the author/funder. It is made available under a The copyright holder for this preprint (which was not. Abstract The RNA pseudoknot is a conserved secondary structure encountered in a number of ribozymes, which assume a central role in the RNA world hypothesis. However, RNA folding algorithms could not predict pseudoknots until recently. Analy...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملThe Trade-off between Privacy and Fidelity via Ehrhart Theory
As an increasing amount of data is gathered nowadays and stored in databases, the question arises of how to protect the privacy of individual records in a database even while providing accurate answers to queries on the database. Differential Privacy (DP) has gained acceptance as a framework to quantify vulnerability of algorithms to privacy breaches. We consider the problem of how to sanitize ...
متن کاملSoftware for enumerative and analytic combinatorics
We survey some general-purpose symbolic software packages that implement algorithms from enumerative and analytic combinatorics. Software for the following areas is covered: basic combinatorial objects, symbolic combinatorics, Pólya theory, combinatorial species, and asymptotics. We describe the capabilities that the packages offer as well as some of the algorithms used, and provide links to or...
متن کامل