Results 1 to 10 of about 11,687 (142)
COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS [PDF]
Proceedings of the International Congress of Mathematicians (ICM 2018), 2019 We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
Igor Pak
exaly +3 more sources
Druggable chemical space and enumerative combinatorics. [PDF]
J Cheminform, 2013 There is a growing body of literature describing the properties of marketed drugs, the concept of drug-likeness and the vastness of chemical space. In that context, enumerative combinatorics with simple atomic components may be useful in the conception and design of structurally novel compounds for expanding and enhancing high-throughput screening (HTS)
Yu MJ.
europepmc +4 more sources
Tests and Proofs for Enumerative Combinatorics [PDF]
Lecture Notes in Computer Science, 2016 In this paper we show how the research domain of enumerative combinatorics can benefit from testing and formal verification. We formalize in Coq the combinatorial structures of permutations and maps, and a couple of related operations. Before formally proving soundness theorems about these operations, we first validate them, by using logic programming (
Catherine Dubois, Alain Giorgetti
exaly +2 more sources
Enumerative Combinatorics [PDF]
Oberwolfach Reports, 2014 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.
Mireille Bousquet-Mélou +3 more
+4 more sources
Many 2-level polytopes from matroids [PDF]
, 2015 The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties.
Grande, Francesco, Rué, Juanjo
core +3 more sources
Enumerative Combinatorics of Intervals in the Dyck Pattern Poset [PDF]
Order, 2021 AbstractWe initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering relations. In most of the cases, we are also able to refine our formulas by rank.
Bernini A. +3 more
openaire +4 more sources
Analytic aspects of the shuffle product [PDF]
, 2008 There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages.
Mishna, Marni, Zabrocki, Mike
core +6 more sources
A note on statistical averages for oscillating tableaux [PDF]
, 2014 We define a statistic called the weight of oscillating tableaux. Oscillating tableaux, a generalization of standard Young tableaux, are certain walks in Young's lattice of partitions.
Hopkins, Sam, Zhang, Ingrid
core +2 more sources
Enumeration of simple random walks and tridiagonal matrices
, 2002 We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration of weighted ...
Bauer M +23 more
core +1 more source
New directions in enumerative chess problems [PDF]
, 2005 Normally a chess problem must have a unique solution, and is deemed unsound even if there are alternatives that differ only in the order in which the same moves are played.
Elkies, Noam D.
core +1 more source