Results 1 to 10 of about 74,505 (227)
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 +7 more sources
Enumerative and Algebraic Combinatorics in the 1960's and 1970's [PDF]
arXiv, 2021 A partly autobiographical survey of the development of enumerative and algebraic combinatorics in the 1960's and 1970's.
Richard P. Stanley
arxiv +8 more sources
Software for enumerative and analytic combinatorics [PDF]
arXiv, 2016 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\'olya theory, combinatorial species, and asymptotics. We describe the capabilities that the packages offer as well as some of
Andrew MacFie
arxiv +5 more sources
Algebraic and geometric methods in enumerative combinatorics [PDF]
arXiv, 2014 A survey written for the upcoming "Handbook of Enumerative Combinatorics".
Federico Ardila
arxiv +5 more sources
Enumerative geometry meets statistics, combinatorics and topology [PDF]
arXiv, 2022 We explain connections among several, a priori unrelated, areas of mathematics: combinatorics, algebraic statistics, topology and enumerative algebraic geometry. Our focus is on discrete invariants, strongly related to the theory of Lorentzian polynomials. The main concept joining the mentioned fields is a linear space of matrices.
Mateusz Michałek
arxiv +5 more sources
Urn Sampling Without Replacement: Enumerative Combinatorics in R [PDF]
Journal of Statistical Software, 2007 This short paper introduces a code snippet in the form of two new R functions that enumerate possible draws from an urn without replacement; these functions call C code, written by the author.
Robin K. S. Hankin
doaj +6 more sources
Applications in Enumerative Combinatorics of In finite Weighted Automata and Graphs [PDF]
Scientific Annals of Computer Science, 2014 In this paper, we present a general methodology to solve a wide variety of classical lattice path counting problems in a uniform way. These counting problems are related to Dyck paths, Motzkin paths and some generalizations. The methodology uses weighted
R. De Castro, A. Ramírez, J.L. Ramírez
doaj +6 more sources
Computer Algebra in the Service of Enumerative Combinatorics [PDF]
Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation, 2021 Classifying lattice walks in restricted lattices is an important problem in enumerative combinatorics. Recently, computer algebra has been used to explore and to solve a number of difficult questions related to lattice walks. We give an overview of recent results on structural properties (e.g., algebraicity versus transcendence) and on explicit ...
Alin Bostan
openalex +6 more sources
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
openalex +5 more sources
Complexity problems in enumerative combinatorics [PDF]
arXiv, 2018 We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
Igor Pak
arxiv +3 more sources