Open Access. Powered by Scholars. Published by Universities.®
Science and Mathematics Education Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- 1-factor (1)
- Ball (1)
- Bisection (1)
- Computational approaches (1)
- Computational combinatorics (1)
-
- Computational complexity (1)
- Degree sequence (1)
- Discrepancy (1)
- Extremal Trees (1)
- Festoon (1)
- Fluid mechanics (1)
- Graph Theory (1)
- Graph theory (1)
- Grids (1)
- Hamiltonian cycle (1)
- Homomorphisms (1)
- Independent Sets (1)
- Invariants (1)
- K-factor (1)
- Linear Extension (1)
- Matchings (1)
- Mathematics (1)
- Packing (1)
- Pedagogical issues (1)
- Posets (1)
- Reconstruction (1)
- Spectrum (1)
- Teaching (1)
- Wiener index (1)
Articles 1 - 7 of 7
Full-Text Articles in Science and Mathematics Education
Contributions To The Teaching And Learning Of Fluid Mechanics, Ashwin Vaidya
Contributions To The Teaching And Learning Of Fluid Mechanics, Ashwin Vaidya
Department of Mathematics Facuty Scholarship and Creative Works
This issue showcases a compilation of papers on fluid mechanics (FM) education, covering different sub topics of the subject. The success of the first volume [1] prompted us to consider another follow-up special issue on the topic, which has also been very successful in garnering an impressive variety of submissions. As a classical branch of science, the beauty and complexity of fluid dynamics cannot be overemphasized. This is an extremely well-studied subject which has now become a significant component of several major scientific disciplines ranging from aerospace engineering, astrophysics, atmospheric science (including climate modeling), biological and biomedical science …
Greatest Common Divisor: Algorithm And Proof, Mary K. Flagg
Greatest Common Divisor: Algorithm And Proof, Mary K. Flagg
Number Theory
No abstract provided.
Investigating Difference Equations, Dave Ruch
Investigating Difference Equations, Dave Ruch
Discrete Mathematics
No abstract provided.
The Weak Discrepancy And Linear Extension Diameter Of Grids And Other Posets, Katherine Victoria Johnson
The Weak Discrepancy And Linear Extension Diameter Of Grids And Other Posets, Katherine Victoria Johnson
Department of Mathematics: Dissertations, Theses, and Student Research
A linear extension of a partially ordered set is simply a total ordering of the poset that is consistent with the original ordering. The linear extension diameter is a measure of how different two linear extensions could be, that is, the number of pairs of elements that are ordered differently by the two extensions. In this dissertation, we calculate the linear extension diameter of grids. This also gives us a nice characterization of the linear extensions that are the farthest from each other, and allows us to conclude that grids are diametrally reversing.
A linear extension of a poset might …
Combinatorics Using Computational Methods, Derrick Stolee
Combinatorics Using Computational Methods, Derrick Stolee
Department of Mathematics: Dissertations, Theses, and Student Research
Computational combinatorics involves combining pure mathematics, algorithms, and computational resources to solve problems in pure combinatorics. This thesis provides a theoretical framework for combinatorial search, which is then applied to several problems in combinatorics. Some results in space-bounded computational complexity are also presented.
Packings And Realizations Of Degree Sequences With Specified Substructures, Tyler Seacrest
Packings And Realizations Of Degree Sequences With Specified Substructures, Tyler Seacrest
Department of Mathematics: Dissertations, Theses, and Student Research
This dissertation focuses on the intersection of two classical and fundamental areas in graph theory: graph packing and degree sequences. The question of packing degree sequences lies naturally in this intersection, asking when degree sequences have edge-disjoint realizations on the same vertex set. The most significant result in this area is Kundu's k-Factor Theorem, which characterizes when a degree sequence packs with a constant sequence. We prove a series of results in this spirit, and we particularly search for realizations of degree sequences with edge-disjoint 1-factors.
Perhaps the most fundamental result in degree sequence theory is the Erdos-Gallai Theorem, characterizing …
Extremal Trees And Reconstruction, Andrew Ray
Extremal Trees And Reconstruction, Andrew Ray
Department of Mathematics: Dissertations, Theses, and Student Research
Problems in two areas of graph theory will be considered.
First, I will consider extremal problems for trees. In these questions we examine the trees that maximize or minimize various invariants. For instance the number of independent sets, the number of matchings, the number of subtrees, the sum of pairwise distances, the spectral radius, and the number of homomorphisms to a fixed graph. I have two general approaches to these problems. To find the extremal trees in the collection of trees on n vertices with a fixed degree bound I use the certificate method. The certificate is a branch invariant, …