Results 31 to 40 of about 35,860 (197)
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
Enumerative Combinatorics. Volume 2
, 2023 Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike.
Stanley, Richard
core +3 more sources
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
Enumerative Combinatorics in the Partition Lattice [PDF]
, 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
On permutation classes defined by token passing networks, gridding matrices and pictures : three flavours of involvement [PDF]
, 2007 The study of pattern classes is the study of the involvement order on finite permutations. This order can be traced back to the work of Knuth. In recent years the area has attracted the attention of many combinatoralists and there have been many ...
Waton, Stephen D.
core +2 more sources
Journal of Graph Theory, EarlyView.ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley +1 more source
Promotion of Lattice Paths by Riordan Arrays
MathematicsThis paper investigates the use of Riordan arrays in the enumeration and transformation of lattice paths through a combinatorial framework of promotion.
Aoife Hennessy +3 more
doaj +1 more source
Saturated Partial Embeddings of Planar Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley +1 more source
Structure and Combinatorics on Right Groups
MathematicsRight groups form an important bridge between group theory and semigroup theory, combining the algebraic symmetry of groups with the one-sided structure of right zero semigroups.
Aftab Hussain Shah +2 more
doaj +1 more source