Results 11 to 20 of about 776 (182)
ICECA2023 - Yaakov Malinovsky - International Conference on Enumerative Combinatorics & Applications
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
Enumerative combinatorics of intervals in the Dyck pattern poset [PDF]
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.
Ferrari, Luca +7 more
core +1 more source
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 ...
core +2 more sources
Generalized triangulations, pipe dreams, and simplicial spheres [PDF]
We exhibit a canonical connection between maximal $(0,1)$-fillings of a moon polyomino avoiding north-east chains of a given length and reduced pipe dreams of a certain permutation.
Luis Serrano, Christian Stump
doaj +1 more source
Generation modulo the action of a permutation group [PDF]
Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism.
Nicolas Borie
doaj +1 more source
A general lattice theoretic construction of Reading constructs Hopf subalgebras of the Malvenuto-Reutenauer Hopf algebra (MR) of permutations. The products and coproducts of these Hopf subalgebras are defined extrinsically in terms of the embedding in MR.
Shirley Law
doaj +1 more source
Combinatorics of Second Derivative: Graphical Proof of Glaisher-Crofton Identity
We give a purely combinatorial proof of the Glaisher-Crofton identity which is derived from the analysis of discrete structures generated by the iterated action of the second derivative.
Pawel Blasiak +2 more
doaj +1 more source
Fourier series of functions involving higher-order ordered Bell polynomials
In 1859, Cayley introduced the ordered Bell numbers which have been used in many problems in number theory and enumerative combinatorics. The ordered Bell polynomials were defined as a natural companion to the ordered Bell numbers (also known as the ...
Kim Taekyun +3 more
doaj +1 more source
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 ...
Charalambos A. Charalambides
core +3 more sources
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 ...
core +3 more sources

