Use of Enumerative Combinatorics for Proving the Applicability of an Asymptotic Stability Result on Discrete-Time SIS Epidemics in Complex Networks [PDF]
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 +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 +5 more sources
Druggable chemical space and enumerative combinatorics. [PDF]
J Cheminform, 2013 BackgroundThere is a growing body of literature describing the properties of marketed drugs, the concept of drug-likeness and the vastness of chemical space.
Yu MJ.
europepmc +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]
J Comput Biol, 2017 RNA sequencing (RNA-seq) has emerged as the method of choice for measuring the expression of RNAs in a given cell population. In most RNA-seq technologies, sequencing the full length of RNA molecules requires fragmentation into smaller pieces ...
Prakash C, Haeseler AV.
europepmc +4 more sources
Enumerative Combinatorics of Intervals in the Dyck Pattern Poset [PDF]
Order, 2021 We 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.
Antonio Bernini +3 more
openalex +3 more sources
Computer Algebra in the Service of Enumerative Combinatorics
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.
Alin Bostan
openalex +3 more sources
Complexity problems in enumerative combinatorics [PDF]
International Congress of Mathematicans, 2018 We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.
Igor Pak
openalex +3 more sources
Enumerative Combinatorics of Simplicial and Cell Complexes: Kirchhoff and Trent Type Theorems [PDF]
Discrete & Computational Geometry, 2018 This paper considers three separate matrices associated to graphs and (each dimension of) cell complexes. It relates all the coefficients of their respective characteristic polynomials to the geometric and combinatorial enumeration of three kinds of sub ...
Sylvain E. Cappell, Edward Y. Miller
semanticscholar +4 more sources
Enumerative Combinatorics of Lattice Polymers
, 2021 DOI: https://doi.org/10.1090/noti2255 physicists who appreciatemathematical beauty), the physicallymotivatedmodels aremathematically appealing, and have rich combinatorial structure. The third reason is that it is just a really fun research topic.
Nathan Clisby
openalex +2 more sources
Enumerative and Algebraic Combinatorics in the 1960's and 1970's [PDF]
Notices of the International Congress of Chinese Mathematicians, 2021 The period 1960–1979 was an exciting time for enumerative and algebraic combinatorics (EAC). During this period EAC was transformed into an independent subject which is even stronger and more active today.
Richard P. Stanley
openalex +3 more sources