Physical Sciences and Mathematics Commons^™

Inquiry Into Saving [Mathematics], Jeanne Funk

Open Educational Resources

‘Inquiry Into Saving’ is an assignment originally designed for MAT117, which is a course for students who have been placed in basic skills mathematics and who can apply a college level course in Algebra and Trigonometry to their program. These students should, ideally, be early in their LaGuardia career, though that is frequently not the case. All, however, are novices of mathematics. The assignment was vetted and revised based on feedback from the Inquiry and Problem Solving in STEM CTL seminar and a charrette not affiliated with the seminar. Revisions addressed connections to the Inquiry and Problem Solving/Written competency/ability pair, …

World Population Dynamics: Modeling Involving Polynomial Functions [Mathematics], Mangala Kothari

Open Educational Resources

In this Inquiry and Problem Solving Assignment students are expected to reflect on their analysis and compare their results with the actual population by conducting their own elementary level research such as searching databases, gathering information and interpreting. Students are expected to comment on the scope of the mathematical model and connect their learning in context to the real-world problem. The assignment includes open-ended questions such as: Write a paragraph about the dynamics of population for the world. What could be some of the possible parameters that contribute to the change in population size? Reflect on what you learned by …

Interstructure Lattices And Types Of Peano Arithmetic, Athar Abdul-Quader

Dissertations, Theses, and Capstone Projects

The collection of elementary substructures of a model of PA forms a lattice, and is referred to as the substructure lattice of the model. In this thesis, we study substructure and interstructure lattices of models of PA. We apply techniques used in studying these lattices to other problems in the model theory of PA.

In Chapter 2, we study a problem that had its origin in Simpson, who used arithmetic forcing to show that every countable model of PA has an expansion to PA^∗ that is pointwise definable. Enayat later showed that there are 2^ℵ₀ models with …

Asymptotic Counting Formulas For Markoff-Hurwitz Tuples, Ryan Ronan

Dissertations, Theses, and Capstone Projects

The Markoff equation is a Diophantine equation in 3 variables first studied in Markoff's celebrated work on indefinite binary quadratic forms. We study the growth of solutions to an n variable generalization of the Markoff equation, which we refer to as the Markoff-Hurwitz equation. We prove explicit asymptotic formulas counting solutions to this generalized equation with and without a congruence restriction. After normalizing and linearizing the equation, we show that all but finitely many solutions appear in the orbit of a certain semigroup of maps acting on finitely many root solutions. We then pass to an accelerated subsemigroup of maps …

Some Results In Combinatorial Number Theory, Karl Levy

Dissertations, Theses, and Capstone Projects

The first chapter establishes results concerning equidistributed sequences of numbers. For a given $d\in\mathbb{N}$, $s(d)$ is the largest $N\in\mathbb{N}$ for which there is an $N$-regular sequence with $d$ irregularities. We compute lower bounds for $s(d)$ for $d\leq 10000$ and then demonstrate lower and upper bounds $\left\lfloor\sqrt{4d+895}+1\right\rfloor\leq s(d)< 24801d^{3} + 942d^{2} + 3$ for all $d\geq 1$. In the second chapter we ask if $Q(x)\in\mathbb{R}[x]$ is a degree $d$ polynomial such that for $x\in[x_k]=\{x_1,\cdots,x_k\}$ we have $|Q(x)|\leq 1$, then how big can its lead coefficient be? We prove that there is a unique polynomial, which we call $L_{d,[x_k]}(x)$, with maximum lead coefficient under these constraints and construct an algorithm that generates $L_{d,[x_k]}(x)$.

Involute Analysis: Virtual Discourse, Memory Systems And Archive In The Involutes Of Thomas De Quincey, Kimberley A. Garcia

Dissertations, Theses, and Capstone Projects

Thomas De Quincey’s involutes inform metaphysical thought on memory and language, particularly concerning multiplicity and the virtual, repetition and difference. When co-opting the mathematic and mechanic involute in Suspiria de Profundis, De Quincey generates an interdisciplinary matrix for the semiotics underpinning his philosophy of language and theory of memory and experience. Involutes entangle and reproduce. De Quincey’s involute exposes the concrete and actual through which all experience accesses the abstract or virtual. The materiality of their informatics and technics provides a literary model and theoretical precursor to a combination of archive and systems theory. The textuality of involute system(s)—both …

Morphogenesis And Growth Driven By Selection Of Dynamical Properties, Yuri Cantor

Dissertations, Theses, and Capstone Projects

Organisms are understood to be complex adaptive systems that evolved to thrive in hostile environments. Though widely studied, the phenomena of organism development and growth, and their relationship to organism dynamics is not well understood. Indeed, the large number of components, their interconnectivity, and complex system interactions all obscure our ability to see, describe, and understand the functioning of biological organisms.

Here we take a synthetic and computational approach to the problem, abstracting the organism as a cellular automaton. Such systems are discrete digital models of real-world environments, making them more accessible and easier to study then their physical world …

Some Metric Properties Of The Teichmüller Space Of A Closed Set In The Riemann Sphere, Nishan Chatterjee

Dissertations, Theses, and Capstone Projects

Let E be an infinite closed set in the Riemann sphere, and let T(E) denote its Teichmüller space. In this dissertation we study some metric properties of T(E). We prove Earle's form of Teichmüller contraction for T(E), holomorphic isometries from the open unit disk into T(E), extend Earle's form of Schwarz's lemma for classical Teichmüller spaces to T(E), and finally study complex geodesics and unique extremality for T(E).

Counting Rational Points, Integral Points, Fields, And Hypersurfaces, Joseph Gunther

Dissertations, Theses, and Capstone Projects

This thesis comes in four parts, which can be read independently of each other.

In the first chapter, we prove a generalization of Poonen's finite field Bertini theorem, and use this to show that the obvious obstruction to embedding a curve in some smooth surface is the only obstruction over perfect fields, extending a result of Altman and Kleiman. We also prove a conjecture of Vakil and Wood on the asymptotic probability of hypersurface sections having a prescribed number of singularities.

In the second chapter, for a fixed base curve over a finite field of characteristic at least 5, we …

Turaev Surfaces And Toroidally Alternating Knots, Seungwon Kim

Dissertations, Theses, and Capstone Projects

In this thesis, we study knots and links via their alternating diagrams on closed orientable surfaces. Every knot or link has such a diagram by a construction of Turaev, which is called the Turaev surface of the link. Links that have an alternating diagram on a torus were defined by Adams as toroidally alternating. For a toroidally alternating link, the minimal genus of its Turaev surface may be greater than one. Hence, these surfaces provide different topological measures of how far a link is from being alternating.

First, we classify link diagrams with Turaev genus one and two in terms …

Solving Algorithmic Problems In Finitely Presented Groups Via Machine Learning, Jonathan Gryak

Dissertations, Theses, and Capstone Projects

Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this dissertation, we seek to extend these techniques to finitely presented non-free groups, in particular to polycyclic and metabelian groups that are of interest to non-commutative cryptography.

As a prototypical example, we utilize supervised learning methods to construct classifiers that can solve the conjugacy decision problem, i.e., determine whether or not a pair of elements from a specified group are conjugate. The accuracies of classifiers created using decision trees, random forests, and N-tuple neural network models are evaluated for several non-free groups. …

Joint Laver Diamonds And Grounded Forcing Axioms, Miha Habič

Dissertations, Theses, and Capstone Projects

In chapter 1 a notion of independence for diamonds and Laver diamonds is investigated. A sequence of Laver diamonds for κ is joint if for any sequence of targets there is a single elementary embedding j with critical point κ such that each Laver diamond guesses its respective target via j. In the case of measurable cardinals (with similar results holding for (partially) supercompact cardinals) I show that a single Laver diamond for κ yields a joint sequence of length κ, and I give strict separation results for all larger lengths of joint sequences. Even though the principles get …

Elimination For Systems Of Algebraic Differential Equations, Richard Gustavson

Dissertations, Theses, and Capstone Projects

We develop new upper bounds for several effective differential elimination techniques for systems of algebraic ordinary and partial differential equations. Differential elimination, also known as decoupling, is the process of eliminating a fixed subset of unknown functions from a system of differential equations in order to obtain differential algebraic consequences of the original system that do not depend on that fixed subset of unknowns. A special case of differential elimination, which we study extensively, is the question of consistency, that is, if the given system of differential equations has a solution. We first look solely at the ``algebraic data" of …

Manifold Convergence: Sewing Sequences Of Riemannian Manifolds With Positive Or Nonnegative Scalar Curvature, Jorge E. Basilio

Dissertations, Theses, and Capstone Projects

In this thesis, we develop a new method of performing surgery on 3-dimensional manifolds called "sewing" and use this technique to construct sequences of Riemannian manifolds with positive or nonnegative scalar curvature. The foundation of our method is a strengthening of the Gromov-Lawson tunnel construction which guarantees the existence of “tiny” and arbitrarily “short” tunnels. We study the limits of sequences of sewn spaces under the Gromov-Hausdorff (GH) and Sormani-Wenger Instrinsic-Flat (SWIF) distances and discuss to what extent the notion of scalar curvature extends to these spaces. We give three applications of the sewing technique to demonstrate that stability theorems …

Intercusp Geodesics And Cusp Shapes Of Fully Augmented Links, Rochy Flint

Dissertations, Theses, and Capstone Projects

We study the geometry of fully augmented link complements in the 3-sphere by looking at their link diagrams. We extend the method introduced by Thistlethwaite and Tsvietkova to fully augmented links and define a system of algebraic equations in terms of parameters coming from edges and crossings of the link diagrams. Combining it with the work of Purcell, we show that the solutions to these algebraic equations are related to the cusp shapes of fully augmented link complements. As an application we use the cusp shapes to study the commensurability classes of fully augmented links.

Rewriting Methods In Groups With Applications To Cryptography, Gabriel Zapata

Dissertations, Theses, and Capstone Projects

In this thesis we describe how various rewriting methods in combinatorial group theory can be used to diffuse information about group elements, which makes it possible to use these techniques as an important constituent in cryptographic primitives. We also show that, while most group-based cryptographic primitives employ the complexity of search versions of algorithmic problems in group theory, it is also possible to use the complexity of decision problems, in particular the word problem, to claim security of relevant protocols.

Diophantine Approximation And The Atypical Numbers Of Nathanson And O'Bryant, David Seff

Dissertations, Theses, and Capstone Projects

For any positive real number $\theta > 1$, and any natural number $n$, it is obvious that sequence $\theta^{1/n}$ goes to 1. Nathanson and O'Bryant studied the details of this convergence and discovered some truly amazing properties. One critical discovery is that for almost all $n$, $\displaystyle\floor{\frac{1}{\fp{\theta^{1/n}}}}$ is equal to $\displaystyle\floor{\frac{n}{\log\theta}-\frac{1}{2}}$, the exceptions, when $n > \log_2 \theta$, being termed atypical $n$ (the set of which for fixed $\theta$ being named $\mcA_\theta$), and that for $\log\theta$ rational, the number of atypical $n$ is finite. Nathanson left a number of questions open, and, subsequently, O'Bryant developed a theory to answer most of these …

Volatility Analysis Of Us Equity And Federal Funds Markets Through The Recent Financial Crisis And Recovery Periods, Based On Release Of Fomc Meeting Statements And Minutes, Hanxiao Yue

Student Theses and Dissertations

The Federal Open Market Committee (FOMC) is the principal maker of monetary policy in the United States. The main instrument of monetary policy is the target federal funds rate, which is de facto the base interest rate of the US economy. The FOMC meets around eight times a year to discuss the economic outlook and decide on this metric. Throughout most of its history, the Fed has been opaque about how it decides on monetary policy, but in recent years it has adopted a more transparent disclosure policy. For each FOMC meeting, it currently releases a brief statement immediately after …

Asymptotics For Primitive Roots Producing Polynomials And Primitive Points On Elliptic Curves, Nelson Carella

Publications and Research

Let $x \geq 1$ be a large number, let $f(n) \in \mathbb{Z}[x]$ be a prime producing polynomial of degree $\deg(f)=m$, and let \(u\neq \pm 1,v^2\) be a fixed integer. Assuming the Bateman-Horn conjecture, an asymptotic counting function for the number of primes $p=f(n) \leq x$ with a fixed primitive root $u$ is derived in this note. This asymptotic result has the form $$\pi_f(x)=\# \{ p=f(n)\leq x:\ord_p(u)=p-1 \}=\left (c(u,f)+ O\left (1/\log x )\right ) \right )x^{1/m}/\log x$$, where $c(u,f)$ is a constant depending on the polynomial and the fixed integer. Furthermore, new results for the asymptotic order of elliptic primes with …

Algorithmically Complex Residually Finite Groups, Olga Kharlampovich, Alexei Myanikov, Mark Sapir

Publications and Research

We construct the first examples of algorithmically complex finitely presented residually finite groups and the first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn functions, and arbitrarily large depth functions. The groups are solvable of class 3.

The Proscriptive Principle And Logics Of Analytic Implication, Thomas M. Ferguson

Dissertations, Theses, and Capstone Projects

The analogy between inference and mereological containment goes at least back to Aristotle, whose discussion in the Prior Analytics motivates the validity of the syllogism by way of talk of parts and wholes. On this picture, the application of syllogistic is merely the analysis of concepts, a term that presupposes—through the root ἀνά + λύω —a mereological background.

In the 1930s, such considerations led William T. Parry to attempt to codify this notion of logical containment in his system of analytic implication AI. Parry’s original system AI was later expanded to the system PAI. The hallmark of Parry’s systems—and of …

Teaching And Learning Mathematics In The Ar/Vr Environment, Alexander Vaninsky

Publications and Research

This presentation discusses teaching and learning mathematics in augmented (AR) or virtual (VR) reality created by a combination of goggles and earphones. It claims that interactive learning in such an environment is more attractive and efficient. It increases motivation and interest in the subject matter. The approach is underlain by the findings of educational neuroscience considering the learning process as the formation of domains in the brain forming mathematics knowledge centers. The teaching process provides sensory excitation and establishes connections among these and other domains. Hardware and software are available in the market. The suggested approach allows for practical implementation …

Study Guide For Cuny Elementary Algebra Final Exam (Ceafe), Olen Dias, William Baker, Amrit Singh

Open Educational Resources

No abstract provided.

Case Study Of Undergraduate Research Projects In Vector Analysis, Alexander Vaninsky, Willy Baez Lara, Madieng Diao, Analilia Mendez

Publications and Research

This paper presents two examples of the undergraduate research projects in vector analysis conducted under the first author’s supervision at one of the community colleges that is an integral part of a large city university. The projects were accomplished by the students pursuing associated degrees in engineering, during their sophomore year. One project was to obtain an explicit formula for the curvature of a curve in plane defined implicitly in rectangular or polar coordinates. Another project was aimed to develop an alternative procedure for finding potential function for a vector field in space based on simultaneous integration. Participation in these …

College Algebra Through Problem Solving, Danielle Cifone, Karan Puri, Debra Maslanko, Ewa Dabkowska

Open Educational Resources

This is a self-contained, open educational resource (OER) textbook for college algebra. Students can use the book to learn concepts and work in the book themselves. Instructors can adapt the book for use in any college algebra course to facilitate active learning through problem solving. Additional resources such as classroom assessments and online/printable homework is available from the authors.

Arithmetic | Algebra Homework, Samar Elhitti, Ariane Masuda, Lin Zhou

Open Educational Resources

Arithmetic | Algebra Homework book is a static version of the WeBWork online homework assignments that accompany the textbook Arithmetic | Algebra for the developmental math courses MAT 0630 and MAT 0650 at New York City College of Technology, CUNY.

Arithmetic | Algebra, Samar Elhitti, Marianna Bonanome, Holly Carley, Thomas Tradler, Lin Zhou

Open Educational Resources

Arithmetic | Algebra provides a customized open-source textbook for the math developmental students at New York City College of Technology. The book consists of short chapters, addressing essential concepts necessary to successfully proceed to credit-level math courses. Each chapter provides several solved examples and one unsolved “Exit Problem”. Each chapter is also supplemented by its own WeBWork online homework assignment. The book can be used in conjunction with WeBWork for homework (online) or with the Arithmetic | Algebra Homework handbook (traditional). The content in the book, WeBWork and the homework handbook are also aligned to prepare students for the CUNY …

A Novel Approach For Library Materials Acquisition Using Discrete Particle Swarm Optimization, Daniel A. Sabol

Publications and Research

The academic library materials acquisition problem is a challenge for librarian, since library cannot get enough funding from universities and the price of materials inflates greatly. In this paper, we analyze an integer mathematical model by considering the selection of acquired materials to maximize the average preference value as well as the budget execution rate under practical restrictions. The objective is to improve the Discrete Particle Swarm Optimization (DPSO) algorithm by adding a Simulate Annealing algorithm to reduce premature convergence. Furthermore, the algorithm is implemented in multiple threaded environment. The experimental results show the efficiency of this approach.