Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"Combinatorial mathematics"”.
-
Matchings and Representation Theory
… identify three scenarios in different areas of combinatorial mathematics where the algebraic structure of matchings gives keen insight into the combinatorial problem at hand. In particular, we prove tight conditional lower bounds on the computational complexity of counting Hamiltonian cycles, …
-
Graphs and Ultrapowers
… various problems of graph theory and infinite combinatorial mathematics can be formulated and solved. Thus, theorems extending to the infinite case results of N.G.de Bruijn and P.Erdős in graph colouring, and of P. and M. Hall in combinatorial set theory are proved via the method of …
-
Designing for Peer Learning : Mathematics, Games and Peer Groups in Leisure-time Centers
Constrained by national tests and the mathematics curriculum, teachers have problems finding time for exploratory and hands-on mathematical activities, especially so in classes with a reduced pace of progression, for example because of a large proportion of second-language learners. Could the …
-
Weighing matrices: generalizations and related configurations
… their generalizations, and various other combinatorial configurations. Principally, it will be shown that any balanced generalized weighing matrix with entries from a finite abelian group is equivalent to the existence of families of commutative association schemes. Additionally, novel …
-
Time-Optimal Trajectory Generation and Way-Point Sequencing for 5-Axis Laser Drilling
… with state-of-the-art TSP solvers from combinatorial mathematics, considering only 2-axis Euclidean distance as the objective function, indicate that the proposed sequencing algorithm for percussion drilling is sub-optimal by 9-12%. Thus, it can still use further improvement in future …
-
Pseudoku: A Sudoku Adjacency Algebra and Fractional Completion Threshold
The standard Sudoku puzzle is a 9 × 9 grid partitioned into 3 × 3 square boxes and partially filled with symbols from the set {1, 2, ..., 9}, with the goal of the puzzle being to complete the grid so that each symbol appears once and only once in each row, column, and box. We study generalized …