Results 1 to 10 of about 70,969 (177)
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
Bringing a CURE into a Discrete Mathematics Course and Beyond
The Mathematics Enthusiast, 2022 Course-based Undergraduate Research Experiences (CUREs) have been well developed in the hard sciences, but math CUREs are all but absent from the literature.
Lipika Deka +2 more
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
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
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
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
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
, 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
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
An Alternate Proof of Near-Optimal Light Spanners [PDF]
TheoretiCSIn 2016, a breakthrough result of Chechik and Wulff-Nilsen [SODA '16] established that every $n$-node graph $G$ has a $(1+\varepsilon)(2k-1)$-spanner of lightness $O_{\varepsilon}(n^{1/k})$, and recent followup work by Le and Solomon [STOC '23 ...
Greg Bodwin
doaj +1 more source