Results 1 to 10 of about 11,976 (219)
Druggable chemical space and enumerative combinatorics [PDF]
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)
Melvin J. Yu
europepmc +5 more sources
Use of Enumerative Combinatorics for Proving the Applicability of an Asymptotic Stability Result on Discrete-Time SIS Epidemics in Complex Networks [PDF]
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 +4 more sources
Complexity problems in enumerative combinatorics [PDF]
We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
Igor Pak
openalex +4 more sources
Schubert varieties, linear codes and enumerative combinatorics [PDF]
We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult questions in combinatorics and algebraic geometry.
Sudhir R. Ghorpade, M. A. Tsfasman
openalex +4 more sources
Enumerative Combinatorics of XX0 Heisenberg Chain [PDF]
In the present paper, the enumeration of a certain class of directed lattice paths is based on the analysis of dynamical correlation functions of the exactly solvable XX0 model. This model is the zero anisotropy limit of one of the basic models of the theory of integrable systems, the XXZ Heisenberg magnet.
N. M. Bogoliubov
openalex +2 more sources
ENUMERATIVE COMBINATORICS AND CODING THEORY
The author develops a new method of investigation of combinatorial problems, introducing the value enumerator \(V_ f(T)= \sum_ p T^{f(p)}\in \mathbb{N}[T,T^{-1}]\) \((p\in \{1,-1\}^ n)\) for a certain polynomial \(f\) in \(n\) variables with non-negative integral coefficients. The coefficient of \(T^ v\) is the number of binary points \(p\) such that \(
Shalom Eliahou
openalex +4 more sources
Algebraic and geometric methods in enumerative combinatorics [PDF]
A survey written for the upcoming "Handbook of Enumerative Combinatorics".
Federico Ardila
openalex +4 more sources
An Enumerative Combinatorics Model for Fragmentation Patterns in RNA Sequencing Provides Insights into Nonuniformity of the Expected Fragment Starting-Point and Coverage Profile [PDF]
Celine Prakash, Arndt von Haeseler
openalex +2 more sources
Three Open Problems in Enumerative Combinatorics [PDF]
Firdous Ahmad Mala
openalex +2 more sources

