Results 1 to 10 of about 11,631 (230)
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
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 +7 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 +5 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
Enumerative combinatorics on words [PDF]
, 2001 Generating series, also called generating functions, play an important role in combinatorial mathematics. Many enumeration problems can be solved by transferring the basic operations on sets into algebraic operations on formal series leading to a solution of an enumeration problem.
Dominique Perrin
openalex +5 more sources
Mathematics, 2018 In this paper, we justify by the use of Enumerative Combinatorics, the applicability of an asymptotic stability result on Discrete-Time Epidemics in Complex Networks, where the complex dynamics of an epidemic model to identify the nodes that contribute ...
Carlos Rodríguez Lucatero +1 more
doaj +3 more sources
Enumerative and Algebraic Combinatorics in the 1960’s and 1970’s [PDF]
Notices of the International Congress of Chinese Mathematicians, 2021 43 pages, 5 ...
Richard P. Stanley
+7 more sources
Selected non-holonomic functions in lattice statistical mechanics and enumerative combinatorics [PDF]
, 2016 We recall that the full susceptibility series of the Ising model, modulo powers of the prime 2, reduce to algebraic functions. We also recall the non-linear polynomial differential equation obtained by Tutte for the generating function of the q-coloured ...
S. Boukraa, J-M Maillard
openalex +4 more sources
An Extension of the Exponential Formula in Enumerative Combinatorics [PDF]
The Electronic Journal of Combinatorics, 1995 Let $\alpha$ be a formal variable and $F_w$ be a weighted species of structures (class of structures closed under weight-preserving isomorphisms) of the form ${F}_{w} = E({F}_{w}^{c})$, where $E$ and $F_w^c$ respectively denote the species of sets and of connected $F_w$-structures.
Gilbert Labelle, Pierre Leroux
openalex +4 more sources