Results 31 to 40 of about 2,704,358 (204)
Nestings of Matchings and Permutations and North Steps in PDSAWs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We present a simple bijective proof of the fact that matchings of $[2n]$ with N nestings are equinumerous to $\textit{partially directed self avoiding walks}$ confined to the symmetric wedge defined by $y= \pm x$, with $n$ east steps and $N$ north steps.
Martin Rubey
doaj +1 more source
Incorporating Perspectival Elements in a Discrete Mathematics Course [PDF]
, 2022 Discrete mathematics is a vast field that can be explored along many different paths. Opening with a unit on logic and proof and then taking up some additional core topics (induction, set theory, combinatorics, relations, Boolean algebra, graph theory ...
Jongsma, Calvin
core +1 more source
On the existence of block-transitive combinatorial designs [PDF]
, 2010 Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory, and ...
Huber, Michael
core +4 more sources
Row-strict quasisymmetric Schur functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions called the $\textit{quasisymmetric Schur function basis}$ which are generated combinatorially through fillings of composition diagrams in much the same way as ...
Sarah K Mason, Jeffrey Remmel
doaj +1 more source
Incorporating Perspectival Elements in a Discrete Mathematics Course [PDF]
, 2023 Discrete mathematics is a vast field that can be explored along many different paths. Opening with a unit on logic and proof and then taking up some additional core topics (induction, set theory, combinatorics, relations, Boolean algebra, graph theory ...
Jongsma, Calvin
core +1 more source
Minkowski decompositions of associahedra [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Realisations of associahedra can be obtained from the classical permutahedron by removing some of its facets and the set of facets is determined by the diagonals of certain labeled convex planar $n$-gons as shown by Hohlweg and Lange (2007).
Carsten Lange
doaj +1 more source
, 2017 A number of important recent developments in various branches of discrete geometry were presented at the workshop. The presentations illustrated both the diversity of the area and its strong connections to other fields of mathematics such as topology ...
core +2 more sources
Dynamics of the Picking transformation on integer partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper studies a conservative transformation defined on families of finite sets. It consists in removing one element from each set and adding a new set composed of the removed elements.
Thi Ha Duong Phan, Eric Thierry
doaj +1 more source
Influence of the tie-break rule on the end-vertex problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 End-vertices of a given graph search may have some nice properties, as for example it is well known that the last vertex of Lexicographic Breadth First Search (LBFS) in a chordal graph is simplicial, see Rose, Tarjan and Lueker 1976.
Pierre Charbit +2 more
doaj +1 more source
Number conserving cellular automata: new results on decidability and dynamics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 This paper is a survey on our recent results about number conserving cellular automata. First, we prove the linear time decidability of the property of number conservation. The sequel focuses on dynamical evolutions of number conserving cellular automata.
Bruno Durand +3 more
doaj +1 more source