Results 41 to 50 of about 70,780 (208)
, 2022 In this volume, the authors present a self-contained introduction to discrete mathematics – the science of finite and countably infinite structures. In addition to taking a theoretical approach, they also include many practical exercises. The text covers
Cecilia Boschini +2 more
semanticscholar +1 more source
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
Counting descents, rises, and levels, with prescribed first element, in words [PDF]
, 2006 Recently, Kitaev and Remmel [Classifying descents according to parity, Annals of Combinatorics, to appear 2007] refined the well-known permutation statistic ``descent'' by fixing parity of one of the descent's numbers. Results in that paper were extended
Kitaev, Sergey +2 more
core +12 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
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
, 2004 This article is not a research paper, but a little note on the history of combinatorics: We present here a tentative short biography of Henri Delannoy, and a survey of his most notable works.
Aeppli +70 more
core +5 more sources
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
Rainbow perfect matchings in r-partite graph structures [PDF]
, 2016 A matching M in an edge–colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of Erdos and Spencer on the existence of rainbow perfect matchings in the complete bipartite graph Kn,n to complete bipartite ...
Cano Vila, María del Pilar +2 more
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
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