Results 21 to 30 of about 69,062 (214)
Stable gonality is computable [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the minimum number
Ragnar Groot Koerkamp +1 more
doaj +1 more source
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
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
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
Opinion Exchange Dynamics [PDF]
, 2017 We survey a range of models of opinion exchange. From the introduction: "The exchange of opinions between individuals is a fundamental social interaction...
Mossel, Elchanan, Tamuz, Omer
core +4 more sources