Complexity problems in enumerative combinatorics
نویسنده
چکیده
We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
منابع مشابه
Mathematisches Forschungsinstitut Oberwolfach Report No
Enumerative Combinatorics focusses on the exact and asymptotic counting of combinatorial objects. It is strongly connected to the probabilistic analysis of large combinatorial structures and has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, graph theory and computer science. This workshop brought together experts from all these various fiel...
متن کامل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 en...
متن کاملBULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY
The fundamental problem of enumerative combinatorics is to determine the number of elements of a set. More precisely, given an infinite indexed collection {Ai}i∈I of finite sets, we want to find a formula for the cardinality of Ai as a function of i, or at least a method for determining the number of elements of Ai that is easier (or more interesting) than counting them one at a time. There are...
متن کاملRecent Advances in Algebraic and Enumerative Combinatorics
Algebraic and enumerative combinatorics is concerned with objects that have both a combinatorial and an algebraic interpretation. It is a highly active area of the mathematical sciences, with many connections and applications to other areas, including algebraic geometry, representation theory, topology, mathematical physics and statistical mechanics. Enumerative questions arise in the mathemati...
متن کاملSen Software Engineering Coinductive Counting: Bisimulation in Enumerative Combinatorics Extended Abstract
Coinductive counting: bisimulation in enumerative combinatorics (extended abstract) CWI's research has a theme-oriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. ABSTRACT The recently developed coinductive calculus of streams nds here a further application in enumer-ative c o m binatorics. A general methodology is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018