Results 21 to 30 of about 11,854 (238)
A Didactic Analysis of Functional Queues
Informatics in Education, 2011 When first introduced to the analysis of algorithms, students are taught how to assess the best and worst cases, whereas the mean and amortized costs are considered advanced topics, usually saved for graduates.
Christian RINDERKNECHT
doaj +1 more source
Congruence for Lattice Path Models with Filter Restrictions and Long Steps
Mathematics, 2022 We derive a path counting formula for a two-dimensional lattice path model with filter restrictions in the presence of long steps, source and target points of which are situated near the filters. This solves the problem of finding an explicit formula for
Dmitry Solovyev
doaj +1 more source
Polyominoes determined by involutions [PDF]
Discrete 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
PreLie-decorated hypertrees [PDF]
Discrete 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
Generation modulo the action of a permutation group [PDF]
Discrete 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
Transactions 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
Discrete 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
Generalized triangulations, pipe dreams, and simplicial spheres [PDF]
Discrete 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
Combinatorics of Second Derivative: Graphical Proof of Glaisher-Crofton Identity
Advances 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
Many 2-level polytopes from matroids [PDF]
, 2015 The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties.
Grande, Francesco, Rué, Juanjo
core +3 more sources