Results 21 to 30 of about 45,358 (192)

Well quasi-order in combinatorics : embeddings and homomorphisms [PDF]

open access: yes, 2015
The notion of well quasi-order (wqo) from the theory of ordered sets often arises naturally in contexts where one deals with infinite collections of structures which can somehow be compared, and it then represents a useful discriminator between ‘tame ...
Ruskuc, Nik   +5 more
core   +1 more source

Polyominoes determined by involutions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
A permutomino of size n is a polyomino determined by particular pairs $(\pi_1, \pi_2)$ of permutations of length $n$, such that $\pi_1(i) \neq \pi_2(i)$, for $1 \leq i \leq n$.
Filippo Disanto, Simone Rinaldi
doaj   +1 more source

Combinatorics of Second Derivative: Graphical Proof of Glaisher-Crofton Identity

open access: yesAdvances in Mathematical Physics, 2018
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

PreLie-decorated hypertrees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2013
Weighted hypertrees have been used by C. Jensen, J. McCammond, and J. Meier to compute some Euler characteristics in group theory. We link them to decorated hypertrees and 2-coloured rooted trees. After the enumeration of pointed and non-pointed types of
Bérénice Oger
doaj   +1 more source

Enumerative Combinatorics in the Partition Lattice [PDF]

open access: yes, 2009
The focus of this thesis lies on the application of enumerative combinatorics to the partition lattice n. Some ideas beyond enumerative combinatorics are used to examine the lattice properties of n.
Simon, Frank
core   +2 more sources

Generation modulo the action of a permutation group [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2013
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

COMBINATORIAL ANALYSIS IN THE SCHEME OF ALLOCATION OF DISTINGUISHABLE PARTICLES INTO INDISTINGUISHABLE CELLS WITH A GIVEN NUMBER OF NON-EMPTY CELLS

open access: yesTransactions of the Karelian Research Centre of the Russian Academy of Sciences, 2019
The scheme of allocating r distinguishable particles into n indistinguishable cells with k non-empty cells is studied along the directions of enumerative combinatorics.
Natalia Enatskaya
doaj   +1 more source

Hopf Algebra of Sashes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
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

ICECA2023 - Yaakov Malinovsky - International Conference on Enumerative Combinatorics & Applications

open access: yes, 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

Generalized triangulations, pipe dreams, and simplicial spheres [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
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

Home - About - Disclaimer - Privacy