Mathematics Commons^™

Evolution Of Computational Thinking Contextualized In A Teacher-Student Collaborative Learning Environment., John Arthur Underwood

LSU Doctoral Dissertations

The discussion of Computational Thinking as a pedagogical concept is now essential as it has found itself integrated into the core science disciplines with its inclusion in all of the Next Generation Science Standards (NGSS, 2018). The need for a practical and functional definition for teacher practitioners is a driving point for many recent research endeavors. Across the United States school systems are currently seeking new methods for expanding their students’ ability to analytically think and to employee real-world problem-solving strategies (Hopson, Simms, and Knezek, 2001). The need for STEM trained individuals crosses both the vocational certified and college degreed …

An Analysis And Comparison Of Knot Polynomials, Hannah Steinhauer

Senior Honors Projects, 2020-current

Knot polynomials are polynomial equations that are assigned to knot projections based on the mathematical properties of the knots. They are also invariants, or properties of knots that do not change under ambient isotopy. In other words, given an invariant α for a knot K, α is the same for any projection of K. We will define these knot polynomials and explain the processes by which one finds them for a given knot projection. We will also compare the relative usefulness of these polynomials.

Hyperbolic Endomorphisms Of Free Groups, Jean Pierre Mutanguha

Graduate Theses and Dissertations

We prove that ascending HNN extensions of free groups are word-hyperbolic if and only if they have no Baumslag-Solitar subgroups. This extends Brinkmann's theorem that free-by-cyclic groups are word-hyperbolic if and only if they have no Z2 subgroups. To get started on our main theorem, we first prove a structure theorem for injective but nonsurjective endomorphisms of free groups. With the decomposition of the free group given by this structure theorem, we (more or less) construct representatives for nonsurjective endomorphisms that are expanding immersions relative to a homotopy equivalence. This structure theorem initializes the development of (relative) train track theory …

Syllabus For Semester Bridge Course: Fundamental Concepts Of Math For Educators: Fundamental Concepts Of Algebra And Geometry & Problem Solving Through Theory And Practice (Math 301a Qbr), Lamies Nazzal, Joyce Ahlgren

Q2S Enhancing Pedagogy

The Quarter-to-Semester transition at CSUSB brought a number of challenges for many courses or course series. One of those included the math requirement for Liberal Studies series, Math 30x courses. The challenge here is that the 30x series includes four courses, yet the transition to semesters will yield three courses. In the Fall of 2020, the fourth 2-unit course in the series, Math 308 (Problem Solving Through Theory and Practice), will no longer be offered. Instead, it will be embedded into the first three courses. Students beginning the series after Fall 2019, will not have enough time to complete the …

Numerical Solution For Solving Two-Points Boundary Value Problems Using Orthogonal Boubaker Polynomials, Imad Noah Ahmed

Emirates Journal for Engineering Research

In this paper, a new technique for solving boundary value problems (BVPs) is introduced. An orthogonal function for Boubaker polynomial was utilizedand by the aid of Galerkin method the BVP was transformed to a system of linear algebraic equations with unknown coefficients, which can be easily solved to find the approximate result. Some numerical examples were added with illustrations, comparing their results with the exact to show the efficiency and the applicability of the method.

Isoperimetric Problems On The Line With Density |𝑥|ᵖ, Juiyu Huang, Xinkai Qian, Yiheng Pan, Mulei Xu, Lu Yang, Junfei Zhou

Rose-Hulman Undergraduate Mathematics Journal

On the line with density |x|^p, we prove that the best single bubble is an interval with endpoint at the origin and that the best double bubble is two adjacent intervals that meet at the origin.

Geogebra Activities: Tracing Points, Jeremy Aikin, Corey Dunn, Jeffrey Meyer, Rolland Trapp

Q2S Enhancing Pedagogy

In this activity, we will learn how to use GeoGebra (www.geogebra.org) to trace the movement of points, which depend on the movement of other objects. The paths of these points determine curves and we will provide algebraic descriptions of these curves.

Pascal's Mystic Hexagon In Tropical Geometry, Hanna Hoffman

HMC Senior Theses

Pascal's mystic hexagon is a theorem from projective geometry. Given six points in the projective plane, we can construct three points by extending opposite sides of the hexagon. These three points are collinear if and only if the six original points lie on a nondegenerate conic. We attempt to prove this theorem in the tropical plane.

Gröbner Bases And Systems Of Polynomial Equations, Rachel Holmes

All Graduate Theses, Dissertations, and Other Capstone Projects

This paper will explore the use and construction of Gröbner bases through Buchberger's algorithm. Specifically, applications of such bases for solving systems of polynomial equations will be discussed. Furthermore, we relate many concepts in commutative algebra to ideas in computational algebraic geometry.

Introduction To Neutroalgebraic Structures And Antialgebraic Structures (Revisited), Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In all classical algebraic structures, the Laws of Compositions on a given set are well-defined. But this is a restrictive case, because there are many more situations in science and in any domain of knowledge when a law of composition defined on a set may be only partially-defined (or partially true) and partially-undefined (or partially false), that we call NeutroDefined, or totally undefined (totally false) that we call AntiDefined. Again, in all classical algebraic structures, the Axioms (Associativity, Commutativity, etc.) defined on a set are totally true, but it is again a restrictive case, because similarly there are numerous situations …

A New Trend To Extensions Of Ci-Algebras, Florentin Smarandache, Akbar Rezaei, Hee Sik Kim

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, as an extension of CI-algebras, we discuss the new notions of Neutro-CI-algebras and Anti-CI-algebras. First, some examples are given to show that these definitions are different. We prove that any proper CI-algebra is a Neutro-BE-algebra or Anti-BE-algebra. Also, we show that any NeutroSelf-distributive and AntiCommutative CI-algebras are not BE-algebras.

On Neutro-Be-Algebras And Anti-Be-Algebras, Florentin Smarandache, Akbar Rezaei

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, the concepts of Neutro-BE-algebra and Anti-BE-algebra are introduced, and some related properties and four theorems are investigated. We show that the classes of Neutro-BE-algebra and Anti-BE-algebras are alternatives of the class of BE-algebras.

New Challenges In Neutrosophic Theory And Applications, Florentin Smarandache, Stefan Vladutescu, Miihaela Colhon, Wadei Al-Omeri, Saeid Jafari, Muhammad Zahir Khan, Muhammad Farid Khan, Muhammad Aslam, Abdur Razzaque Mughal

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic theory has representatives on all continents and, therefore, it can be said to be a universal theory. On the other hand, according to the three volumes of “The Encyclopedia of Neutrosophic Researchers” (2016, 2018, 2019), plus numerous others not yet included in Encyclopedia book series, about 1200 researchers from 73 countries have applied both the neutrosophic theory and method. Neutrosophic theory was founded by Professor Florentin Smarandache in 1998; it constitutes further generalization of fuzzy and intuitionistic fuzzy theories. The key distinction between the neutrosophic set/logic and other types of sets/logics lies in the introduction of the degree of …

The Neutrosophic Triplet Of ����-Algebras, Florentin Smarandache, Akbar Rezaei

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, the concepts of a Neutro-����-algebra and Anti-����-algebra are introduced, and some related properties are investigated. We show that the class of Neutro-����-algebra is an alternative of the class of ����-algebras.

Extension Of Hypergraph To N-Superhypergraph And To Plithogenic N-Superhypergraph, And Extension Of Hyperalgebra To N-Ary (Classical-/Neutro-/Anti-)Hyperalgebra, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

We recall and improve our 2019 concepts of n-Power Set of a Set, n-SuperHyperGraph, Plithogenic n-SuperHyperGraph, and n-ary HyperAlgebra, n-ary NeutroHyperAlgebra, n-ary AntiHyperAlgebra respectively, and we present several properties and examples connected with the real world.

Neutro-Bck-Algebra, Florentin Smarandache, Mohammad Hamidi

Branch Mathematics and Statistics Faculty and Staff Publications

This paper introduces the novel concept of Neutro-BCK-algebra. In Neutro-BCK-algebra, the outcome of any given two elements under an underlying operation (neutro-sophication procedure) has three cases, such as: appurtenance, non-appurtenance, or indeterminate. While for an axiom: equal, non-equal, or indeterminate. This study investigates the Neutro-BCK-algebra and shows that Neutro-BCK-algebra are different from BCK-algebra. The notation of Neutro-BCK-algebra generates a new concept of NeutroPoset and Neutro-Hass-diagram for NeutroPosets. Finally, we consider an instance of applications of the Neutro-BCK-algebra.

Harmonic Morphisms With One-Dimensional Fibres And Milnor Fibrations, Murphy Griffin

UNF Graduate Theses and Dissertations

We study a problem at the intersection of harmonic morphisms and real analytic Milnor fibrations. Baird and Ou establish that a harmonic morphism from G: \mathbb{R}^m \setminus V_G \rightarrow \mathbb{R}^n\setminus \{0\} defined by homogeneous polynomials of order p retracts to a harmonic morphism \psi|: S^{m-1} \setminus K_\epsilon \rightarrow S^{n-1} that induces a Milnor fibration over the sphere. In seeking to relax the homogeneity assumption on the map G, we determine that the only harmonic morphism $\varphi: \mathbb{R}^m \setminus V_G \rightarrow S^{m-1}\K_\epsilon$ that preserves \arg G is radial projection. Due to this limitation, we confirm Baird and Ou's result, yet establish …

Algebraic And Geometric Properties Of Hierarchical Models, Aida Maraj

Theses and Dissertations--Mathematics

In this dissertation filtrations of ideals arising from hierarchical models in statistics related by a group action are are studied. These filtrations lead to ideals in polynomial rings in infinitely many variables, which require innovative tools. Regular languages and finite automata are used to prove and explicitly compute the rationality of some multivariate power series that record important quantitative information about the ideals. Some work regarding Markov bases for non-reducible models is shown, together with advances in the polyhedral geometry of binary hierarchical models.

Scrollar Invariants Of Tropical Chains Of Loops, Kalila Joelle Sawyer

Theses and Dissertations--Mathematics

We define scrollar invariants of tropical curves with a fixed divisor of rank 1. We examine the behavior of scrollar invariants under specialization, and compute these invariants for a much-studied family of tropical curves. Our examples highlight many parallels between the classical and tropical theories, but also point to some substantive distinctions.

Geometry Of Linear Subspace Arrangements With Connections To Matroid Theory, William Trok

Theses and Dissertations--Mathematics

This dissertation is devoted to the study of the geometric properties of subspace configurations, with an emphasis on configurations of points. One distinguishing feature is the widespread use of techniques from Matroid Theory and Combinatorial Optimization. In part we generalize a theorem of Edmond's about partitions of matroids in independent subsets. We then apply this to establish a conjectured bound on the Castelnuovo-Mumford regularity of a set of fat points.

We then study how the dimension of an ideal of point changes when intersected with a generic fat subspace. In particular we introduce the concept of a ``very unexpected hypersurface'' …

Heat Kernel Voting With Geometric Invariants, Alexander Harr

All Graduate Theses, Dissertations, and Other Capstone Projects

Here we provide a method for comparing geometric objects. Two objects of interest are embedded into an infinite dimensional Hilbert space using their Laplacian eigenvalues and eigenfunctions, truncated to a finite dimensional Euclidean space, where correspondences between the objects are searched for and voted on. To simplify correspondence finding, we propose using several geometric invariants to reduce the necessary computations. This method improves on voting methods by identifying isometric regions including shapes of genus greater than 0 and dimension greater than 3, as well as almost retaining isometry.

Phylogenetic Networks And Functions That Relate Them, Drew Scalzo

Williams Honors College, Honors Research Projects

Phylogenetic Networks are defined to be simple connected graphs with exactly n labeled nodes of degree one, called leaves, and where all other unlabeled nodes have a degree of at least three. These structures assist us with analyzing ancestral history, and its close relative - phylogenetic trees - garner the same visualization, but without the graph being forced to be connected. In this paper, we examine the various characteristics of Phylogenetic Networks and functions that take these networks as inputs, and convert them to more complex or simpler structures. Furthermore, we look at the nature of functions as they relate …

Codes, Cryptography, And The Mceliece Cryptosystem, Bethany Matsick

Senior Honors Theses

Over the past several decades, technology has continued to develop at an incredible rate, and the importance of properly securing information has increased significantly. While a variety of encryption schemes currently exist for this purpose, a number of them rely on problems, such as integer factorization, that are not resistant to quantum algorithms. With the reality of quantum computers approaching, it is critical that a quantum-resistant method of protecting information is found. After developing the proper background, we evaluate the potential of the McEliece cryptosystem for use in the post-quantum era by examining families of algebraic geometry codes that allow …

Model Selection And Experimental Design Of Biological Networks With Algebraic Geometry, Anyu Zhang

Mathematics Theses and Dissertations

Model selection based on experimental data is an essential challenge in biological data science. In decades, the volume of biological data from varied sources, including laboratory experiments, field observations, and patient health records has seen an unprecedented increase. Mainly when collecting data is expensive or time-consuming, as it is often in the case with clinical trials and biomolecular experiments, the problem of selecting information-rich data becomes crucial for creating relevant models.

Motivated by certain geometric relationships between data, we partitioned input data sets, especially data sets that correspond to a unique basis, into equivalence classes with the same basis to …

Algebraic Methods For Proving Geometric Theorems, Lynn Redman

Electronic Theses, Projects, and Dissertations

Algebraic geometry is the study of systems of polynomial equations in one or more variables. Thinking of polynomials as functions reveals a close connection between affine varieties, which are geometric structures, and ideals, which are algebraic objects. An affine variety is a collection of tuples that represents the solutions to a system of equations. An ideal is a special subset of a ring and is what provides the tools to prove geometric theorems algebraically. In this thesis, we establish that a variety depends on the ideal generated by its defining equations. The ability to change the basis of an ideal …

Local And Global Color Symmetries Of A Symmetrical Pattern, Ma. Louise Antonette N. De Las Peñas, Agatha Kristel Abila, Eduard C. Taganap

Mathematics Faculty Publications

This study addresses the problem of arriving at transitive perfect colorings of a symmetrical pattern P consisting of disjoint congruent symmetric motifs. The pattern P has local symmetries that are not necessarily contained in its global symmetry group G. The usual approach in color symmetry theory is to arrive at perfect colorings of P ignoring local symmetries and considering only elements of G. A framework is presented to systematically arrive at what Roth [Geom. Dedicata (1984), 17, 99–108] defined as a coordinated coloring of P, a coloring that is perfect and transitive under G, satisfying the condition that the coloring …

Effective Statistical Energy Function Based Protein Un/Structure Prediction, Avdesh Mishra

University of New Orleans Theses and Dissertations

Proteins are an important component of living organisms, composed of one or more polypeptide chains, each containing hundreds or even thousands of amino acids of 20 standard types. The structure of a protein from the sequence determines crucial functions of proteins such as initiating metabolic reactions, DNA replication, cell signaling, and transporting molecules. In the past, proteins were considered to always have a well-defined stable shape (structured proteins), however, it has recently been shown that there exist intrinsically disordered proteins (IDPs), which lack a fixed or ordered 3D structure, have dynamic characteristics and therefore, exist in multiple states. Based on …

Topology And Dynamics Of Gene Regulatory Networks: A Meta-Analysis, Claus Kadelka

Biology and Medicine Through Mathematics Conference

No abstract provided.

Unifications Of Pythagorean Triple Schema, Emily Hammes

Undergraduate Honors Theses

Euclid’s Method of finding Pythagorean triples is a commonly accepted and applied technique. This study focuses on a myriad of other methods behind finding such Pythagorean triples. Specifically, we discover whether or not other ways of finding triples are special cases of Euclid’s Method.

On The Complexity Of Computing Galois Groups Of Differential Equations, Mengxiao Sun

Dissertations, Theses, and Capstone Projects

The differential Galois group is an analogue for a linear differential equation of the classical Galois group for a polynomial equation. An important application of the differential Galois group is that a linear differential equation can be solved by integrals, exponentials and algebraic functions if and only if the connected component of its differential Galois group is solvable. Computing the differential Galois groups would help us determine the existence of the solutions expressed in terms of elementary functions (integrals, exponentials and algebraic functions) and understand the algebraic relations among the solutions.

Hrushovski first proposed an algorithm for computing the differential …