Results 11 to 20 of about 2,704,358 (204)
Computation and Calculus for Combinatorial Geometric Series and Binomial Identities and Expansions
The Journal of Engineering and Exact Sciences, 2022 Nowadays, the growing complexity of mathematical and computational modelling demands the simplicity of mathematical and computational equations for solving today’s scientific problems and challenges.
Chinnaraji Annamalai
doaj +1 more source
ANALISIS KEMAMPUAN PEMECAHAN MASALAH MAHASISWA DALAM MATA KULIAH MATEMATIKA DISKRIT PADA MATERI KOMBINATORIKA [PDF]
, 2021 This study aims to determine the ability of problem solving in discrete mathematics courses on combinatorics material for the sixth semester students of Mathematics Education at Sultan Ageng Tirtayasa University.
Pujiastuti, Heni, Triyani, Evi
core +1 more source
Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Binary relations derived from labeled rooted trees play an import role in mathematical biology as formal models of evolutionary relationships. The (symmetrized) Fitch relation formalizes xenology as the pairs of genes separated by at least one horizontal
Marc Hellmuth +2 more
doaj +1 more source
Journal of Graph Theory, Volume 102, Issue 3, Page 472-483, March 2023., 2023 Abstract Goodman proved that the sum of the number of triangles in a graph on n nodes and its complement is at least n3∕24
wiley +1 more source
On the heapability of finite partial orders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing such a ...
János Balogh +4 more
doaj +1 more source
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n vertices. Those hypergraphs (and their minimal transversals) are commonly found in database applications.
Alexandre Bazin +3 more
doaj +1 more source
The agreement distance of unrooted phylogenetic networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A rearrangement operation makes a small graph-theoretical change to a phylogenetic network to transform it into another one. For unrooted phylogenetic trees and networks, popular rearrangement operations are tree bisection and reconnection (TBR) and ...
Jonathan Klawitter
doaj +1 more source
On the shelling antimatroids of split graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids.
Jean Cardinal +2 more
doaj +1 more source
Parameter and q asymptotics of Lq‐norms of hypergeometric orthogonal polynomials
International Journal of Quantum Chemistry, Volume 123, Issue 2, January 15, 2023., 2023 The weighted Lq‐norms of orthogonal polynomials are determined when q and the polynomial's parameter tend to infinity. They are given in this work by the leading term of the q and parameter asymptotics of the corresponding quantities of the associated probability density. These results are not only interesting per se, but also because they control many
Nahual Sobrino, Jesus S. Dehesa
wiley +1 more source
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