Results 31 to 40 of about 2,688,347 (211)
The Principle of Mathematical Induction: Applications in Physical Optics
Journal of Applied Mathematics, 2022 The bare rudiments of the principle of mathematical induction as a method of proof date back to ancient times. In the contemporary university milieu, the demonstrative scheme is taught as part of a course in discrete mathematics, set theory, number ...
Joseph Ivin Thomas
doaj +1 more source
The agreement distance of rooted phylogenetic networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The minimal number of rooted subtree prune and regraft (rSPR) operations needed to transform one phylogenetic tree into another one induces a metric on phylogenetic trees - the rSPR-distance.
Jonathan Klawitter
doaj +1 more source
Discrete Mathematics Days 2022
Discrete Mathematics Days 2022, 2022 The Discrete Mathematics Days (DMD20/22) will be held on July 4-6, 2022, at Facultad de Ciencias of the Universidad de Cantabria (Santander, Spain). The main focus of this international conference is on current topics in Discrete Mathematics, including ...
Luis Felipe Tabera Alonso
semanticscholar +1 more source
The Recurrence Relations in Teaching Students of Informatics
Informatics in Education, 2010 The topic ``Recurrence relations'' and its place in teaching students of Informatics is discussed in this paper. We represent many arguments about the importance, the necessity and the benefit of studying this subject by Informatics students.
Valentin P. BAKOEV
doaj +1 more source
Towards an Algebra for Cascade Effects [PDF]
Logical Methods in Computer Science, 2017 We introduce a new class of (dynamical) systems that inherently capture cascading effects (viewed as consequential effects) and are naturally amenable to combinations.
Elie M. Adam +2 more
doaj +1 more source
Noncommutative symmetric functions III : Deformations of Cauchy and convolution algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 [in "Special Issue : Lie Computations", G. Jacob, V. Koseleff, Eds.]
Gérard Duchamp +3 more
doaj +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
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
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