Mathematics Commons^™

Equators Have At Most Countable Many Singularities With Bounded Total Angle, Pilar Herreros, Mario Ponce, J.J.P. Veerman

Mathematics and Statistics Faculty Publications and Presentations

For distinct points p and q in a two-dimensional Riemannian manifold, one defines their mediatrix Lpq as the set of equidistant points to p and q. It is known that mediatrices have a cell decomposition consisting of a finite number of branch points connected by Lipschitz curves. In the case of a topological sphere, mediatrices are called equators and it can benoticed that there are no branching points, thus an equator is a topological circle with possibly many Lipschitz singularities. This paper establishes that mediatrices have the radial …

Introduction To Mathematical Analysis I - 2nd Edition, Beatriz Lafferriere, Gerardo Lafferriere, Mau Nam Nguyen

PDXOpen: Open Educational Resources

This edition has been superseded by Introduction to Mathematical Analysis I, Third Edition.

Video lectures explaining problem solving strategies are available.

Our goal in this set of lecture notes is to provide students with a strong foundation in mathematical analysis. Such a foundation is crucial for future study of deeper topics of analysis. Students should be familiar with most of the concepts presented here after completing the calculus sequence. However, these concepts will be reinforced through rigorous proofs.

The lecture notes contain topics of real analysis usually covered in a 10-week course: the completeness axiom, sequences and convergence, continuity, …

A Scalable Preconditioner For A Primal Dpg Method, Andrew T. Barker, Veselin A. Dobrev, Jay Gopalakrishnan, Tzanio Kolev

Portland Institute for Computational Science Publications

We show how a scalable preconditioner for the primal discontinuous Petrov-Galerkin (DPG) method can be developed using existing algebraic multigrid (AMG) preconditioning techniques. The stability of the DPG method gives a norm equivalence which allows us to exploit existing AMG algorithms and software. We show how these algebraic preconditioners can be applied directly to a Schur complement system arising from the DPG method. One of our intermediate results shows that a generic stable decomposition implies a stable decomposition for the Schur complement. This justifies the application of algebraic solvers directly to the interface degrees of freedom. Combining such results, we …

Computational Methods For Asynchronous Basins, Ian H. Dinwoodie

Mathematics and Statistics Faculty Publications and Presentations

For a Boolean network we consider asynchronous updates and define the exclusive asynchronous basin of attraction for any steady state or cyclic attractor. An algorithm based on commutative algebra is presented to compute the exclusive basin. Finally its use for targeting desirable attractors by selective intervention on network nodes is illustrated with two examples, one cell signalling network and one sensor network measuring human mobility.

Secondary Analysis Of Concussion Data, Martin Zwick, Stephanie Kolakowsky-Hayner, Nancy Carney, Maya Balamane, Tracie Nettleton, D. Wright

Complex Systems Faculty Publications and Presentations

Clinical studies are expensive & time-consuming. Typically in these studies specific hypotheses are subjected to confirmatory test. Yet the data may harbor evidence of unanticipated relations between variables. It is thus desirable to subject the data to secondary analyses in the hope of discovering novel & valuable associations. Exploratory analysis, however, is tentative: findings should be replicated in new data. This presentation reports some secondary analyses on concussion data. Data mining on 2 datasets will be discussed, & some unexpected findings reported. The analyses use reconstructability analysis (RA), a probabilistic graphical modeling method implemented in the Occam software package developed …

Mapped Tent Pitching Schemes For Hyperbolic Systems, Jay Gopalakrishnan, Joachim Schöberl, C. Wintersteiger

Portland Institute for Computational Science Publications

A spacetime domain can be progressively meshed by tent shaped objects. Numerical methods for solving hyperbolic systems using such tent meshes to advance in time have been proposed previously. Such schemes have the ability to advance in time by different amounts at different spatial locations. This paper explores a technique by which standard discretizations, including explicit time stepping, can be used within tent-shaped spacetime domains. The technique transforms the equations within a spacetime tent to a domain where space and time are separable. After detailing techniques based on this mapping, several examples including the acoustic wave equation and the Euler …

Temporal Order Of Alzheimer's Disease-Related Cognitive Marker Changes In Blsa And Wrap Longitudinal Studies, Murat Bilgel, Rebecca L. Koscik, Yang An, Jerry L. Prince, Susan M. Resnick, Sterling C. Johnson, Bruno Jedynak

Mathematics and Statistics Faculty Publications and Presentations

Investigation of the temporal trajectories of currently used neuropsychological tests is critical to identifying earliest changing measures on the path to dementia due to Alzheimer's disease (AD). We used the Progression Score (PS) method to characterize the temporal trajectories of measures of verbal memory, executive function, attention, processing speed, language, and mental state using data spanning normal cognition, mild cognitive impairment (MCI), and AD from 1661 participants with a total of 7839 visits (age at last visit 77.6 SD 9.2) in the Baltimore Longitudinal Study of Aging and 1542 participants with a total of 4467 visits (age at last visit …

Exploratory Modeling Of Tbi Data, Martin Zwick, Stephanie Kolakowsky-Hayner, Sadie Carney, Maya Balamane, Tracie Nettleton, D. Wright

Complex Systems Faculty Publications and Presentations

Most data analyses are confirmatory, but exploratory studies can find unexpected non-linear & many-variable interaction effects. The methodology of reconstructability analysis (RA) is explicitly designed for exploratory modeling. It analyzes both nominal and continuous (binned) variables, is easily interpretable, takes standard text input, is web-accessible, and is available for research use. This presentation reports some results of applying RA to data sets from Preece (auto accidents) and Wright (auto/motorcycle/bike accidents, hit pedestrians, and falls).

Cycle Structures Of Orthomorphisms Extending Partial Orthomorphisms Of Boolean Groups, Nichole Louise Schimanski, John S. Caughman Iv

Mathematics and Statistics Faculty Publications and Presentations

A partial orthomorphism of a group GG (with additive notation) is an injection π:S→G for some S⊆G such that π(x)−x ≠ π(y) for all distinct x,y∈S. We refer to |S| as the size of π, and if S=G, then π is an orthomorphism. Despite receiving a fair amount of attention in the research literature, many basic questions remain concerning the number of orthomorphisms of a given group, and what cycle types these permutations have.

It is known that conjugation by automorphisms of G forms a group action on the set of orthomorphisms of G. In this paper, we consider the …

Orthomorphisms Of Boolean Groups, Nichole Louise Schimanski

Dissertations and Theses

An orthomorphism, π, of a group, (G, +), is a permutation of G with the property that the map x → -x + π(x) is also a permutation. In this paper, we consider orthomorphisms of the additive group of binary n-tuples, Zⁿ₂. We use known orthomorphism preserving functions to prove a uniformity in the cycle types of orthomorphisms that extend certain partial orthomorphisms, and prove that extensions of particular sizes of partial orthomorphisms exist. Further, in studying the action of conjugating orthomorphisms by automorphisms, we find several symmetries within the orbits and stabilizers of this action, and …

Breaking Spaces And Forms For The Dpg Method And Applications Including Maxwell Equations, Carsten Carstensen, Leszek Demkowicz, Jay Gopalakrishnan

Mathematics and Statistics Faculty Publications and Presentations

Discontinuous Petrov Galerkin (DPG) methods are made easily implementable using `broken' test spaces, i.e., spaces of functions with no continuity constraints across mesh element interfaces. Broken spaces derivable from a standard exact sequence of first order (unbroken) Sobolev spaces are of particular interest. A characterization of interface spaces that connect the broken spaces to their unbroken counterparts is provided. Stability of certain formulations using the broken spaces can be derived from the stability of analogues that use unbroken spaces. This technique is used to provide a complete error analysis of DPG methods for Maxwell equations with perfect electric boundary conditions. …

Tree Graphs And Orthogonal Spanning Tree Decompositions, James Raymond Mahoney

Dissertations and Theses

Given a graph G, we construct T(G), called the tree graph of G. The vertices of T(G) are the spanning trees of G, with edges between vertices when their respective spanning trees differ only by a single edge. In this paper we detail many new results concerning tree graphs, involving topics such as clique decomposition, planarity, and automorphism groups. We also investigate and present a number of new results on orthogonal tree decompositions of complete graphs.

Math And Sudoku: Exploring Sudoku Boards Through Graph Theory, Group Theory, And Combinatorics, Kyle Oddson

Student Research Symposium

Encoding Sudoku puzzles as partially colored graphs, we state and prove Akman’s theorem [1] regarding the associated partial chromatic polynomial [5]; we count the 4x4 sudoku boards, in total and fundamentally distinct; we count the diagonally distinct 4x4 sudoku boards; and we classify and enumerate the different structure types of 4x4 boards.

The Log-Exponential Smoothing Technique And Nesterov’S Accelerated Gradient Method For Generalized Sylvester Problems, N. T. An, Daniel J. Giles, Nguyen Mau Nam, R. Blake Rector

Mathematics and Statistics Faculty Publications and Presentations

The Sylvester or smallest enclosing circle problem involves finding the smallest circle enclosing a finite number of points in the plane. We consider generalized versions of the Sylvester problem in which the points are replaced by sets. Based on the log-exponential smoothing technique and Nesterov’s accelerated gradient method, we present an effective numerical algorithm for solving these problems.

Minimizing Differences Of Convex Functions With Applications To Facility Location And Clustering, Mau Nam Nguyen, R. Blake Rector, Daniel J. Giles

Mathematics and Statistics Faculty Publications and Presentations

In this paper we develop algorithms to solve generalized Fermat-Torricelli problems with both positive and negative weights and multifacility location problems involving distances generated by Minkowski gauges. We also introduce a new model of clustering based on squared distances to convex sets. Using the Nesterov smoothing technique and an algorithm for minimizing differences of convex functions called the DCA introduced by Tao and An, we develop effective algorithms for solving these problems. We demonstrate the algorithms with a variety of numerical examples.

Tridiagonal Matrices And Boundary Conditions, J. J. P. Veerman, David K. Hammond

Mathematics and Statistics Faculty Publications and Presentations

We describe the spectra of certain tridiagonal matrices arising from differential equations commonly used for modeling flocking behavior. In particular we consider systems resulting from allowing an arbitrary boundary condition for the end of a one-dimensional flock. We apply our results to demonstrate how asymptotic stability for consensus and flocking systems depends on the imposed boundary condition.

Full State Revivals In Linearly Coupled Chains With Commensurate Eigenspectra, J. J. P. Veerman, Jovan Petrovic

Mathematics and Statistics Faculty Publications and Presentations

Coherent state transfer is an important requirement in the construction of quantum computer hardware. The state transfer can be realized by linear next-neighbour-coupled finite chains. Starting from the commensurability of chain eigenvalues as the general condition of periodic dynamics, we find chains that support full periodic state revivals. For short chains, exact solutions are found analytically by solving the inverse eigenvalue problem to obtain the coupling coefficients between chain elements. We apply the solutions to design optical waveguide arrays and perform numerical simulations of light propagation thorough realistic waveguide structures. Applications of the presented method to the realization of a …

Signal Velocity In Oscillator Arrays, Carlos E. Cantos, David K. Hammond, J. J. P. Veerman

Mathematics and Statistics Faculty Publications and Presentations

We investigate a system of coupled oscillators on the circle, which arises from a simple model for behavior of large numbers of autonomous vehicles. The model considers asymmetric, linear, decentralized dynamics, where the acceleration of each vehicle depends on the relative positions and velocities between itself and a set of local neighbors. We first derive necessary and sufficient conditions for asymptotic stability, then derive expressions for the phase velocity of propagation of disturbances in velocity through this system. We show that the high frequencies exhibit damping, which implies existence of well-defined signal velocities c+>0 and c−f(x−c+t) in the direction …

Voxel Based Morphometry In Optical Coherence Tomography: Validation & Core Findings, Bhavna J. Antony, Min Chen, Aaron Carass, Bruno M. Jedynak, Omar Al-Louzi, Sharon D. Solomon, Shiv Saidha, Peter Calabresi, Jerry L. Prince

Mathematics and Statistics Faculty Publications and Presentations

Optical coherence tomography (OCT) of the human retina is now becoming established as an important modality for the detection and tracking of various ocular diseases. Voxel based morphometry (VBM) is a long standing neuroimaging analysis technique that allows for the exploration of the regional differences in the brain. There has been limited work done in developing registration based methods for OCT, which has hampered the advancement of VBM analyses in OCT based population studies. Following on from our recent development of an OCT registration method, we explore the potential benefits of VBM analysis in cohorts of healthy controls (HCs) and …

The Design And Validation Of A Group Theory Concept Inventory, Kathleen Mary Melhuish

Dissertations and Theses

Within undergraduate mathematics education, there are few validated instruments designed for large-scale usage. The Group Concept Inventory (GCI) was created as an instrument to evaluate student conceptions related to introductory group theory topics. The inventory was created in three phases: domain analysis, question creation, and field-testing. The domain analysis phase included using an expert consensus protocol to arrive at the topics to be assessed, analyzing curriculum, and reviewing literature. From this analysis, items were created, evaluated, and field-tested. First, 383 students answered open-ended versions of the question set. The questions were converted to multiple-choice format from these responses and disseminated …

On A Convex Set With Nondifferentiable Metric Projection, Shyan S. Akmal, Nguyen Mau Nam, J. J. P. Veerman

Mathematics and Statistics Faculty Publications and Presentations

A remarkable example of a nonempty closed convex set in the Euclidean plane for which the directional derivative of the metric projection mapping fails to exist was constructed by A. Shapiro. In this paper, we revisit and modify that construction to obtain a convex set with smooth boundary which possesses the same property.

A Posteriori Eigenvalue Error Estimation For The Schrödinger Operator With The Inverse Square Potential, Hengguang Li, Jeffrey S. Ovall

Mathematics and Statistics Faculty Publications and Presentations

We develop an a posteriori error estimate of hierarchical type for Dirichlet eigenvalue problems of the form (−∆ + (c/r) 2 )ψ = λψ on bounded domains Ω, where r is the distance to the origin, which is assumed to be in Ω. This error estimate is proven to be asymptotically identical to the eigenvalue approximation error on a family of geometrically-graded meshes. Numerical experiments demonstrate this asymptotic exactness in practice.

An Investigation Of The Role Of Alternate Numeration Systems In Preservice Teacher Mathematics Content Courses, Jodi I. Fasteen

Dissertations and Theses

Alternate numeration systems are common in preservice teacher (PST) mathematics curricula, but there is limited research on how to leverage alternate systems to promote the development of mathematical knowledge for teaching. I analyzed the role of alternate numeration systems in three ways. I conducted a thematic analysis of current PST textbooks to consider the role of alternate numeration systems in written curricula. I conducted a teaching experiment to analyze PSTs' mathematical activity as they engaged with a base five task sequence to reinvent an algorithm for multiplication. And I introduced problematizing mathematical contexts as a design heuristic, situating this within …

Non-Orientable Objects As Gaming Surfaces, Haley P. Bourke, Paul Latiolais

Student Research Symposium

Developed in Python, Klein Space Fighter is an interactive learning tool and mathematically themed arcade game that allows the player to combat on different mathematical surfaces including a 2D Klein bottle. The app is available for Android and desktop devices, and will be made available for iOS in the future.

To receive an invitation to download the app through Google Play, contact me at [email protected]

The Smallest Intersecting Ball Problem, Daniel J. Giles, Mau Nam Nguyen

Student Research Symposium

The smallest intersecting ball problem involves finding the minimal radius necessary to intersect a collection of closed convex sets. This poster discusses relevant tools of convex optimization and explores three methods of finding the optimal solution: the subgradient method, log-exponential smoothing, and an original approach using target set expansion. A fourth algorithm based on weighted projections is given, but its convergence is yet unproven. Numerical tests and comparison between methods are also presented.

Stochastic Comparisons Of Weighted Sums Of Arrangement Increasing Random Variables, Xiaoqing Pan, Min Yuan, Subhash C. Kochar

Mathematics and Statistics Faculty Publications and Presentations

Assuming that the joint density of random variables X1,X2, . . . ,Xn is arrangement increasing (AI), we obtain some stochastic comparison results on weighted sums of Xi’s under some additional conditions. An application to optimal capital allocation is also given.

Monomials And Basin Cylinders For Network Dynamics, Daniel Austin, Ian H. Dinwoodie

Mathematics and Statistics Faculty Publications and Presentations

We describe methods to identify cylinder sets inside a basin of attraction for Boolean dynamics of biological networks. Such sets are used for designing regulatory interventions that make the system evolve towards a chosen attractor, for example initiating apoptosis in a cancer cell. We describe two algebraic methods for identifying cylinders inside a basin of attraction, one based on the Groebner fan that finds monomials that define cylinders and the other on primary decomposition. Both methods are applied to current examples of gene networks.

Robust Estimates For Hp-Adaptive Approximations Of Non-Self-Adjoint Eigenvalue Problems, Stefano Giani, Luka Grubišić, Agnieszka Międlar, Jeffrey S. Ovall

Mathematics and Statistics Faculty Publications and Presentations

We present new residual estimates based on Kato’s square root theorem for spectral approximations of non-self-adjoint differential operators of convection–diffusion–reaction type. These estimates are incorporated as part of an hp-adaptive finite element algorithm for practical spectral computations, where it is shown that the resulting a posteriori error estimates are reliable. Provided experiments demonstrate the efficiency and reliability of our approach.

Mathematical Model For Bone Mineralization, Svetlana V. Komarova, Lee Safranek, Jay Gopalakrishnan, Miao-Jung Yvonne Ou, Marc D. Mckee, Monzur Murshed, Frank Rauch, Erica Zuhr

Mathematics and Statistics Faculty Publications and Presentations

Defective bone mineralization has serious clinical manifestations, including deformities and fractures, but the regulation of this extracellular process is not fully understood. We have developed a mathematical model consisting of ordinary differential equations that describe collagen maturation, production and degradation of inhibitors, and mineral nucleation and growth. We examined the roles of individual processes in generating normal and abnormal mineralization patterns characterized using two outcome measures: mineralization lag time and degree of mineralization. Model parameters describing the formation of hydroxyapatite mineral on the nucleating centers most potently affected the degree of mineralization, while the parameters describing inhibitor homeostasis most effectively …

Nonsmooth Algorithms And Nesterov's Smoothing Technique For Generalized Fermat-Torricelli Problems, Nguyen Mau Nam, Nguyen Thai An, R. Blake Rector, Jie Sun

Mathematics and Statistics Faculty Publications and Presentations

We present algorithms for solving a number of new models of facility location which generalize the classical Fermat--Torricelli problem. Our first approach involves using Nesterov's smoothing technique and the minimization majorization principle to build smooth approximations that are convenient for applying smooth optimization schemes. Another approach uses subgradient-type algorithms to cope directly with the nondifferentiability of the cost functions. Convergence results of the algorithms are proved and numerical tests are presented to show the effectiveness of the proposed algorithms.