Results 11 to 20 of about 35,860 (197)
Tests and Proofs for Enumerative Combinatorics [PDF]
Lecture Notes in Computer Science, 2016 In this paper we show how the research domain of enumerative combinatorics can benefit from testing and formal verification. We formalize in Coq the combinatorial structures of permutations and maps, and a couple of related operations. Before formally proving soundness theorems about these operations, we first validate them, by using logic programming (
Alain Giorgetti, Catherine Dubois
exaly +4 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
core +6 more sources
Druggable chemical space and enumerative combinatorics [PDF]
Journal of Cheminformatics, 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.
openaire +3 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
exaly +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]
Journal of Computational Biology, 2017 Arndt Von Haeseler, Celine Prakash
exaly +2 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.
exaly +3 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
ICECA2023 - Yaakov Malinovsky - International Conference on Enumerative Combinatorics & Applications
, 2023 ICECA2023 , International Conference on Enumerative Combinatorics & Applications, September 4-6, 2023, Virtual, University of Haifa, Israelhttps://www.youtube.com/watch?v ...
Malinovsky, Yaakov, Alon, Noga
core +1 more source