Asymptotic Counting Formulas For Markoff-Hurwitz Tuples, 2017 The Graduate Center, City University of New York

#### Asymptotic Counting Formulas For Markoff-Hurwitz Tuples, Ryan Ronan

*All Graduate Works by Year: 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 ...

Some Results In Combinatorial Number Theory, 2017 The Graduate Center, City University of New York

#### Some Results In Combinatorial Number Theory, Karl Levy

*All Graduate Works by Year: 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)$.

Interstructure Lattices And Types Of Peano Arithmetic, 2017 The Graduate Center, City University of New York

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

*All Graduate Works by Year: 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^{ℵ0} models with the ...

A Weighted Möbius Function, 2017 Portland State University

#### A Weighted Möbius Function, Derek Garton

*Mathematics and Statistics Faculty Publications and Presentations*

Fix an odd prime ℓ and let **G** be the poset of isomorphism classes of finite abelian** ℓ-**groups, ordered by inclusion. If** ξ:G→R ^{≥0} **is a discrete probability distribution on

**G**and

**A ∈ G**, define the

**A**th moment of

**ξ**to be . The question of determining conditions that ensure

**ξ**is completely determined by its moments has been of recent interest in many problems of Cohen–Lenstra type. Furthermore, recovering

**ξ**from its moments requires a new Möbius-type inversion formula on

**G**. In this paper, we define this function, relate it to the classical Möbius function ...

Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, 2017 Utah State University

#### Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore

*All Graduate Plan B and other Reports*

Let p be a prime positive integer and let α be a positive integer greater than 1. A method is given to reduce the problem of finding a nontrivial factorization of α to the problem of finding a solution to a system of modulo p polynomial congruences where each variable in the system is constrained to the set {0,...,p − 1}. In the case that p = 2 it is shown that each polynomial in the system can be represented by an ordered binary decision diagram with size less than 20.25log_{2}(α)^{3} + 16.5log_{2}(α)^{2} + 6log ...

Cryptographic Protocols Based On Nielsen Transformations, 2017 Fairfield University

#### Cryptographic Protocols Based On Nielsen Transformations, Benjamin Fine, Anja Is Moldenhauer, Gerhard Rosenberger

*Benjamin Fine*

We introduce in this paper cryptographic protocols which use combinatorial group theory. Based on a combinatorial distribution of shares we present secret sharing schemes and cryptosystems using Nielsen transformations. Nielsen transformations are a linear technique to study free groups and general infinite groups. In addition the group of all automorphisms of a free group F, denoted by ( )Aut F, is generated by a regular Nielsen transformation between two basis of F, and each regular Nielsen transformation between two bases of F defines an automorphism of F.

Frg: Collaborative Research: Homotopy Renormalization Of Topological Field Theories, 2017 Utah State University

#### Frg: Collaborative Research: Homotopy Renormalization Of Topological Field Theories, Nathan Geer

*Funded Research and Data*

No abstract provided.

Problem Solving Practice With Problems From Fibonacci's "Liber Abbaci", 2017 Pittsburg State University

#### Problem Solving Practice With Problems From Fibonacci's "Liber Abbaci", Cynthia J. Huffman Ph.D.

*Open Educational Resources - Math*

In this activity, problem solving skills are practiced using two well-known problems from Fibonacci's world-changing book "Liber Abbaci". Students are also asked to reflect on the differences and similarities between their solutions and those of Fibonacci. The two problems are the famous rabbit problem which led to what is now know as the Fibonacci sequence and the 30 birds for 30 denarii problem, which is not as well-known to the general public.

Improving The Accuracy For The Long-Term Hydrologic Impact Assessment (L-Thia) Model, 2017 Purdue University

#### Improving The Accuracy For The Long-Term Hydrologic Impact Assessment (L-Thia) Model, Anqi Zhang, Lawrence Theller, Bernard A. Engel

*The Summer Undergraduate Research Fellowship (SURF) Symposium*

Urbanization increases runoff by changing land use types from less impervious to impervious covers. Improving the accuracy of a runoff assessment model, the Long-Term Hydrologic Impact Assessment (L-THIA) Model, can help us to better evaluate the potential uses of Low Impact Development (LID) practices aimed at reducing runoff, as well as to identify appropriate runoff and water quality mitigation methods. Several versions of the model have been built over time, and inconsistencies have been introduced between the models. To improve the accuracy and consistency of the model, the equations and parameters (primarily curve numbers in the case of this model ...

Predicting Locations Of Pollution Sources Using Convolutional Neural Networks, 2017 Purdue University

#### Predicting Locations Of Pollution Sources Using Convolutional Neural Networks, Yiheng Chi, Nickolas D. Winovich, Guang Lin

*The Summer Undergraduate Research Fellowship (SURF) Symposium*

Pollution is a severe problem today, and the main challenge in water and air pollution controls and eliminations is detecting and locating pollution sources. This research project aims to predict the locations of pollution sources given diffusion information of pollution in the form of array or image data. These predictions are done using machine learning. The relations between time, location, and pollution concentration are first formulated as pollution diffusion equations, which are partial differential equations (PDEs), and then deep convolutional neural networks are built and trained to solve these PDEs. The convolutional neural networks consist of convolutional layers, reLU layers ...

Vertex Weighted Spectral Clustering, 2017 East Tennessee State University

#### Vertex Weighted Spectral Clustering, Mohammad Masum

*Electronic Theses and Dissertations*

Spectral clustering is often used to partition a data set into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An eigenvector corresponding with the second smallest eigenvalue of the Laplacian matrix of a graph is called a Fiedler vector. Coefficients of a Fiedler vector are used to partition vertices of a given graph into two clusters. A vertex of a graph is classified as unassociated if the Fiedler coefficient of the vertex is close to ...

Ideal Containments Under Flat Extensions And Interpolation On Linear Systems In P2, 2017 University of Nebraska-Lincoln

#### Ideal Containments Under Flat Extensions And Interpolation On Linear Systems In P2, Solomon Akesseh

*Dissertations, Theses, and Student Research Papers in Mathematics*

Fat points and their ideals have stimulated a lot of research but this dissertation concerns itself with aspects of only two of them, broadly categorized here as, the ideal containments and polynomial interpolation problems.

Ein-Lazarsfeld-Smith and Hochster-Huneke cumulatively showed that for all ideals I in k[**P**^{n}], I^{(mn)} ⊆ I^{m} for all m ∈ N. Over the projective plane, we obtain I^{(4)}< ⊆ I^{2}. Huneke asked whether it was the case that I^{(3)} ⊆ I^{2}. Dumnicki, Szemberg and Tutaj-Gasinska show that if I is the saturated homogeneous radical ideal of the 12 points of the Hesse configuration, then ...

Place Value In Primary Sources Activity, 2017 Pittsburg State University

#### Place Value In Primary Sources Activity, Cynthia J. Huffman Ph.D.

*Open Educational Resources - Math*

An activity for student to examine the use of place-value in the Hindu-Arabic numeration system from a historical viewpoint by looking at primary sources.

Constructing A Square An Ancient Indian Way Activity, 2017 Pittsburg State University

#### Constructing A Square An Ancient Indian Way Activity, Cynthia J. Huffman Ph.D.

*Open Educational Resources - Math*

In this activity students use string to model one of the ways that was used in ancient India for constructing a square. The construction was used in building a temporary fire altar. The activity is based on a translation by Sen and Bag of the Baudhāyana-śulba-sūtra.

Euler Construction Activity, 2017 Pittsburg State University

#### Euler Construction Activity, Cynthia J. Huffman Ph.D.

*Open Educational Resources - Math*

Original sources of mathematics provide many opportunities for students to both do mathematics and to improve their problem solving skills. It is also interesting to explore original sources in new ways with the use of technology. In this activity, students can gain experience with dynamic geometry software and enhance their geometric intuition by working through a construction given by Euler in 1783.

Constructing A Square Indian Fire Altar Activity, 2017 Pittsburg State University

#### Constructing A Square Indian Fire Altar Activity, Cynthia J. Huffman Ph.D.

*Open Educational Resources - Math*

In this activity, we will model constructing a square fire altar with a method similar to one used by people in ancient India. The fire altars, which were made of bricks, had various shapes. Instructions for building the altars were in Vedic texts called *Śulba-sūtras*. We will follow instructions for constructing a square *gārhapatya *fire altar* *from the *Baudhāyana-śulba-sūtra*, which was written during the Middle Vedic period, about 800-500 BC.

Antichains And Diameters Of Set Systems, 2017 University of Nebraska-Lincoln

#### Antichains And Diameters Of Set Systems, Brent Mckain

*Dissertations, Theses, and Student Research Papers in Mathematics*

In this thesis, we present a number of results, mostly concerning set systems that are antichains and/or have bounded diameter. Chapter 1 gives a more detailed outline of the thesis. In Chapter 2, we give a new short proof of Kleitman's theorem concerning the maximal size of a set system with bounded diameter. In Chapter 3, we turn our attention to antichains with bounded diameter. Šileikis conjectured that an antichain of diameter *D* has size at most (*n/D*/2). We present several partial results towards the conjecture.

In 2014, Leader and Long gave asymptotic bounds on the ...

Stable Cohomology Of Local Rings And Castelnuovo-Mumford Regularity Of Graded Modules, 2017 University of Nebraska-Lincoln

#### Stable Cohomology Of Local Rings And Castelnuovo-Mumford Regularity Of Graded Modules, Luigi Ferraro

*Dissertations, Theses, and Student Research Papers in Mathematics*

This thesis consists of two parts:

1) A bimodule structure on the bounded cohomology of a local ring (Chapter 1),

2) Modules of infinite regularity over graded commutative rings (Chapter 2).

Chapter 1 deals with the structure of stable cohomology and bounded cohomology. Stable cohomology is a $\mathbb{Z}$-graded algebra generalizing Tate cohomology and first defined by Pierre Vogel. It is connected to absolute cohomology and bounded cohomology. We investigate the structure of the bounded cohomology as a graded bimodule. We use the information on the bimodule structure of bounded cohomology to study the stable cohomology algebra as a ...

Sourcebook In The Mathematics Of Medieval Europe And North Africa (Book Review), 2017 Dordt College

#### Sourcebook In The Mathematics Of Medieval Europe And North Africa (Book Review), Calvin Jongsma

*Faculty Work: Comprehensive List*

Reviewed Title: *Sourcebook in the Mathematics of Medieval Europe and North Africa, *by Victor J. Katz. Menso Folkerts, Barnabas Hughes, Roi Wagner, and J. Lennart Berggren, Eds., Princeton University Press, Princeton, 2016. 574 pp. ISBN: 9780691156859.

Active Calculus 2.0, 2017 Grand Valley State University

#### Active Calculus 2.0, Matthew Boelkins, David Austin, Steven Schlicker

*Open Textbooks*

Active Calculus is different from most existing calculus texts in at least the following ways: the text is freely readable online in HTML format and is also available for in PDF; in the electronic format, graphics are in full color and there are live links to java applets; version 2.0 now contains WeBWorK exercises in each chapter, which are fully interactive in the HTML format and included in print in the PDF; the text is open source, and interested users can gain access to the original source files on GitHub; the style of the text requires students to be ...