Results 11 to 20 of about 45,358 (192)

Enumerative Combinatorics [PDF]

open access: yesOberwolfach 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

Enumerative Combinatorics [PDF]

open access: yes, 2022
Enumerative Combinatorics focuses on the exact and asymptotic counting of combinatorial objects. It has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, probability theory, graph theory and computer science.
openaire   +2 more sources

Enumerative Combinatorics

open access: yesOberwolfach Reports
Enumerative Combinatorics focuses on the exact and asymptotic counting of combinatorial objects. It is strongly connected to several disciplines, including probability theory, geometry, algebra, statistical physics, computer science, and biology. Within combinatorics, it has strong links with structural graph theory and with algebraic combinatorics, in
Guillaume Chapuy   +2 more
openaire   +2 more sources

Enumerative Combinatorics of Intervals in the Dyck Pattern Poset [PDF]

open access: yesOrder, 2021
AbstractWe 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. In most of the cases, we are also able to refine our formulas by rank.
Bernini A.   +3 more
core   +8 more sources

Computer Algebra in the Service of Enumerative Combinatorics [PDF]

open access: yesProceedings of the 2021 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. We give an overview of recent results on structural properties (e.g., algebraicity versus transcendence) and on explicit ...
Bostan, Alin, Alin Bostan
openaire   +4 more sources

Enumerative combinatorics on words

open access: yes, 2015
Combinatorics on words is a field which has both historical roots and a substantial growth. Its roots are to be found in the early results of Axel Thue on square free words and the development of combinatorial group theory. The present interest in the field is pushed by its links with several connexions with other topics external to pure mathematics ...
Perrin, Dominique, Restivo, Antonio
core   +5 more sources

Coinductive Counting: Bisimulation in Enumerative Combinatorics. [PDF]

open access: yesElectronic Notes in Theoretical Computer Science, 2002
The recently developed coinductive calculus of streams finds here a further application in enumerative combinatorics. A general methodology is developed to solve a wide variety of basic counting problems in a uniform way: (1) the objects to be counted ...
Rutten, J.J.M.M.   +3 more
openaire   +3 more sources

Interpretability and Representability of Commutative Algebra, Algebraic Topology, and Topological Spectral Theory for Real-World Data. [PDF]

open access: yesAdv Intell Discov
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Ren Y, Wei GW.
europepmc   +2 more sources

Druggable chemical space and enumerative combinatorics. [PDF]

open access: yesJ Cheminform, 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.
europepmc   +4 more sources

New directions in enumerative chess problems [PDF]

open access: yes, 2005
Normally a chess problem must have a unique solution, and is deemed unsound even if there are alternatives that differ only in the order in which the same moves are played.
Elkies, Noam, Elkies, Noam D.
core   +7 more sources

Home - About - Disclaimer - Privacy