Results 11 to 20 of about 11,854 (238)
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 Prakash C, Haeseler AV.
europepmc +3 more sources
Enumerative Combinatorics of Lattice Polymers
Notices of the American Mathematical Society, 2021 Nathan Clisby
openalex +3 more sources
Enumerative Combinatorics [PDF]
Oberwolfach Reports, 2014 Enumerative Combinatorics focusses on the exact and asymptotic counting of combinatorial objects. It is strongly connected to the probabilistic analysis of large combinatorial structures and has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, graph theory and computer science.
Mireille Bousquet-Mélou +3 more
+4 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
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 +1 more source
Note on r-central Lah numbers and r-central Lah-Bell numbers
AIMS Mathematics, 2022 The r-Lah numbers generalize the Lah numbers to the r-Stirling numbers in the same sense. The Stirling numbers and the central factorial numbers are one of the important tools in enumerative combinatorics. The r-Lah number counts the number of partitions
Hye Kyung Kim
doaj +1 more source
Total positivity for cominuscule Grassmannians [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper we explore the combinatorics of the non-negative part $(G/P)_{\geq 0}$ of a cominuscule Grassmannian. For each such Grassmannian we define Le-diagrams ― certain fillings of generalized Young diagrams which are in bijection with the cells of
Thomas Lam, Lauren Williams
doaj +1 more source
Urn Sampling Without Replacement: Enumerative Combinatorics in R
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 +1 more source