Oberwolfach Reports, 2023 Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike.
Richard Stanley
exaly +3 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 +2 more sources
Tests and Proofs for Enumerative Combinatorics
Lecture Notes in Computer Science, 2016 International audienceIn this paper we show how the research domain of enumerative combinatorics can benefit from testing and formal verification.
Alain Giorgetti, Catherine Dubois
exaly +3 more sources
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 +2 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 +2 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 +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.
A. Bostan
semanticscholar +2 more sources
THE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G [PDF]
Journal of Algebraic Systems, 2020 To a simple graph $G=(V,E)$, we correspond a simple graph $G_{\triangle,\square}$ whose vertex set is $\{\{x,y\}: x,y\in V\}$ and two vertices $\{x,y\},\{z,w\}\in G_{\triangle,\square}$ are adjacent if and only if $\{x,z\},\{x,w\},\{y,z\},\{y,w\}\in V ...
Gh. A. Nasiriboroujeni +2 more
doaj +1 more source
Enumeration of Graded (3 + 1)-Avoiding Posets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 The notion of (3+1)-avoidance appears in many places in enumerative combinatorics, but the natural goal of enumerating all (3+1)-avoiding posets remains open. In this paper, we enumerate \emphgraded (3+1)-avoiding posets.
Joel Lewis Brewster, Yan X Zhang
doaj +1 more source
Enumerative Geometry Meets Statistics, Combinatorics, and Topology [PDF]
Notices of the American Mathematical Society, 2022 We explain connections among several, a priori unrelated, areas of mathematics: combinatorics, algebraic statistics, topology and enumerative algebraic geometry.
Mateusz Michałek
semanticscholar +1 more source