Results 31 to 40 of about 11,631 (230)
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
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
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
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
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
Fourier series of functions involving higher-order ordered Bell polynomials
Open Mathematics, 2017 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
Bayer noise quasisymmetric functions and some combinatorial algebraic structures [PDF]
Categories and General Algebraic Structures with ApplicationsRecently, quasisymmetric functions have been widely studied due to their big connection to enumerative combinatorics, combinatorial Hopf algebra and number theory.
Adnan Abdulwahid
doaj +1 more source
Tangency quantum cohomology and characteristic numbers
Anais da Academia Brasileira de Ciências, 2001 This work establishes a connection between gravitational quantum cohomology and enumerative geometry of rational curves (in a projective homogeneous variety) subject to conditions of infinitesimal nature like, for example, tangency.
JOACHIM KOCK
doaj +1 more source
COMBINATORIAL ANALYSIS OF THE DOMINOES SCHEME AND THE CASE OF FIXED MINIMAL FIGURE ON A DOMINO TILE
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2017 The dominoes scheme is defined as a scheme of random tiling with poliomino tiles with $r$ ends and $n$ figures from 0 to $(n-1)$ on the ends of tiles of all possible compositions with repetitions, regardless of their order.
Natalia Enatskaya
doaj +1 more source
Unimodality Problems in Ehrhart Theory
, 2017 Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart $h^*$-vector. Ehrhart $h^*
A. Stapledon +45 more
core +1 more source