Mathematics Commons^™

The Elliptic Curve Discrete Logarithm And Functional Graphs, Christopher J. Evans

Mathematical Sciences Technical Reports (MSTR)

The discrete logarithm problem, and its adaptation to elliptic curves, called the elliptic curve discrete logarithm problem (ECDLP) is an open problem in the field of number theory, and its applications to modern cryptographic algorithms are numerous. This paper focuses on a statistical analysis of a modification to the ECDLP, called the x-ECDLP, where one is only given the xcoordinate of a point, instead of the entire point. Focusing only on elliptic curves whose field of definition is smaller than the number of points, this paper attempts to find a statistical indication of underlying structure (or lack thereof) in the …

Structure And Randomness Of The Discrete Lambert Map, Jingjing Chen, Mark Lotts

Mathematical Sciences Technical Reports (MSTR)

We investigate the structure and cryptographic applications of the Discrete Lambert Map (DLM). The mapping is closely related to the Discrete Log Problem, but has received far less attention since it is considered to be a more complicated map that is likely even harder to invert. However, this mapping is quite important because it underlies the security of the ElGamal Digital Signature Scheme. Using functional graphs induced by this mapping, we were able to find non-random properties that could potentially be used to exploit the ElGamal DSS.

The Square Discrete Exponentiation Map, A Wood

Mathematical Sciences Technical Reports (MSTR)

We will examine the square discrete exponentiation map and its properties. The square discrete exponentiation map is a variation on a commonly seen problem in cryptographic algorithms. This paper focuses on understanding the underlying structure of the functional graphs generated by this map. Specifically, this paper focuses on explaining the in-degree of graphs of safe primes, which are primes of the form p = 2q + 1, where q is also prime.

Ball Remotality In Banach Spaces And Related Topics, Tanmoy Paul Dr.

Doctoral Theses

In this work we aim to study Ball Remotality and densely Ball Remotality of subspaces in Banach spaces. We study this property in many classical spaces of type c0, c,\\â„“p and C(K) where K is a compact Hausdorff space. The said problem also discussed for Banach spaces when considered as a subspace in its bidual. It is observed M-ideals in C(K) are densely ball remotal. It is shown that a particular type of M-ideal in A(K) where K is a Choquet simplex is densely ball remotal.

Operation Comics: The Story Continues, Bruce Kessler, Tressa Tullis

Mathematics Faculty Publications

This talk was given, with Tressa Tullis as the main presenter and Bruce Kessler as a minor co-presenter, at the 2011 Bridges Conference in Coimbre, Portugal, on the current developments on our Operation Comics project with Cumberland Trace Elementary.

Distributed Algorithms For Initialization And Topology Control In Wireless Ad Hoc Networks., Subhasis Bhattacharjee Dr.

Doctoral Theses

Wireless ad hoc networking is an upcoming communication technology that makes exchange of information possible without any pre-existing infrastructure. Over the last decade it has grabbed tremendous interest in the research community due to its easy deployability and high flexibility, with numerous applications to social, industrial and personal uses. In this thesis, we designed effcient light weight distributed algorithms based on minimal local information to resolve the problems related to the initialization and topology configuration of wireless ad hoc networks with special emphasis on optimal utilization of limited resources. Once the ad hoc nodes with in-built radio transceivers are deployed …

A Parallel Robin-Robin Domain Decomposition Method For The Stokes-Darcy System, Wenbin Chen, Max Gunzburger, Fei Hua, Xiaoming Wang

Mathematics and Statistics Faculty Research & Creative Works

We propose a new parallel Robin-Robin domain decomposition method for the coupled Stokes-Darcy system with Beavers-Joseph-Saffman-Jones interface boundary condition. in particular, we prove that, with an appropriate choice of parameters, the scheme converges geometrically independent of the mesh size. © 2011 Society for Industrial and Applied Mathematics.

Flow-Induced Channel Formation In The Cytoplasm Of Motile Cells, Robert D. Guy, Toshiyuki Nakagaki, Grady Wright

Mathematics Faculty Publications and Presentations

A model is presented to explain the development of flow channels within the cytoplasm of the plasmodium of the giant amoeba Physarum polycephalum. The formation of channels is related to the development of a self-organizing tubular network in large cells. Experiments indicate that the flow of cytoplasm is involved in the development and organization of these networks, and the mathematical model proposed here is motivated by recent experiments involving the observation of development of flow channel in small cells. A model of pressure-driven flow through a polymer network is presented in which the rate of flow increases the rate …

Covariant Representations Of C*-Dynamical Systems Involving Compact Groups, Firuz Kamalov

Department of Mathematics: Dissertations, Theses, and Student Research

Given a C*-dynamical system (A, G, σ) the crossed product C*-algebra A x _σG encodes the action of G on A. By the universal property of A x _σG there exists a one to one correspondence between the set all covariant representations of the system (A, G, σ) and the set of all *-representations of A x _σG. Therefore, the study of representations of A x _σG is equivalent to that of covariant representations of (A, G, σ).

We study induced covariant representations of systems involving compact groups. We prove that every irreducible (resp. factor) covariant …

On Khovanov-Seidel Quiver Algebras And Bordered Floer Homology, Denis Auroux, J. Elisenda Grigsby, Stephan M. Wehrli

Mathematics - All Scholarship

We discuss a relationship between Khovanov- and Heegaard Floer-type homology theories for braids. Explicitly, we define a filtration on the bordered Heegaard-Floer homology bimodule associated to the double-branched cover of a braid and show that its associated graded bimodule is equivalent to a similar bimodule defined by Khovanov and Seidel.

Crouzeix's Conjecture And The Gmres Algorithm, Sarah Mcbride Luo

Theses and Dissertations

This thesis explores the connection between Crouzeix's conjecture and the convergence of the GMRES algorithm. GMRES is a popular iterative method for solving linear systems and is one of the many Krylov methods. Despite its popularity, the convergence of GMRES is not completely understood. While the spectrum can in some cases be a good indicator of convergence, it has been shown that in general, the spectrum does not provide sufficient information to fully explain the behavior of GMRES iterations. Other sets associated with a matrix that can also help predict convergence are the pseudospectrum and the numerical range. This …

3d Image Reconstruction And Level Set Methods, Spencer R. Patty

Theses and Dissertations

We give a concise explication of the theory of level set methods for modeling motion of an interface as well as the numerical implementation of these methods. We then introduce the geometry of a camera and the mathematical models for 3D reconstruction with a few examples both simulated and from a real camera. We finally describe the model for 3D surface reconstruction from n-camera views using level set methods.

Stability For Traveling Waves, Joshua W. Lytle

Theses and Dissertations

In this work we present some of the general theory of shock waves and their stability properties. We examine the concepts of nonlinear stability and spectral stability, noting that for certain classes of equations the study of nonlinear stability is reduced to the analysis of the spectra of the linearized eigenvalue problem. A useful tool in the study of spectral stability is the Evans function, an analytic function whose zeros correspond to the eigenvalues of the linearized eigenvalue problem. We discuss techniques for numerical Evans function computation that ensure analyticity, allowing standard winding number arguments and rootfinding methods to be …

Quasisymmetric Graphs And Zygmund Functions, Leonid V. Kovalev, Jani Onninen

Mathematics - All Scholarship

A quasisymmetric graph is a curve whose projection onto a line is a quasisymmetric map. We show that this class of curves is related to solutions of the reduced Beltrami equation and to a generalization of the Zygmund class lambda. This relation makes it possible to use the tools of harmonic analysis to construct nontrivial examples of quasisymmetric graphs and of quasiconformal maps.

The Constrained Isoperimetric Problem, Minh Nhat Vo Do

Theses and Dissertations

Let X be a space and let S ⊂ X with a measure of set size |S| and boundary size |∂S|. Fix a set C ⊂ X called the constraining set. The constrained isoperimetric problem asks when we can find a subset S of C that maximizes the Følner ratio FR(S) = |S|/|∂S|. We consider different measures for subsets of R^2,R^3,Z^2,Z^3 and describe the properties that must be satisfied for sets S that maximize the Folner ratio. We give explicit examples.

Stone-Weierstrass Approximation Theorem, A Constructive Approach, Orhan Kaplan

Student Theses and Dissertations

The Weierstrass approximation theorem is well known in analysis. This theorem states that on a closed interval we can find a sequence of polynomials that comes closer and closer to any continuous real function. The importance of this theorem is that it is valid for both differentiable and non-differentible functions. In this paper we review and prove this theorem in one and higher dimensions by a constructive method and then give examples. An idea - different from the one used in Walter Rudin's book "Principles of Mathematical Analysis" - enables us to prove this theorem in one and higher dimensions …

An Algebra Isomorphism For The Landau-Ginzburg Mirror Symmetry Conjecture, Jared Drew Johnson

Theses and Dissertations

Landau-Ginzburg mirror symmetry takes place in the context of affine singularities in CN. Given such a singularity defined by a quasihomogeneous polynomial W and an appropriate group of symmetries G, one can construct the FJRW theory (see [3]). This construction fills the role of the A-model in a mirror symmetry proposal of Berglund and H ubsch [1]. The conjecture is that the A-model of W and G should match the B-model of a dual singularity and dual group (which we denote by WT and GT). The B-model construction is based on the Milnor ring, or local algebra, of the singularity. …

Maximal Unramified Extensions Of Cyclic Cubic Fields, Ka Lun Wong

Theses and Dissertations

Maximal unramified extensions of quadratic number fields have been well studied. This thesis focuses on maximal unramified extensions of cyclic cubic fields. We use the unconditional discriminant bounds of Moreno to determine cyclic cubic fields having no non-solvable unramified extensions. We also use a theorem of Roquette, developed from the method of Golod-Shafarevich, and some results by Cohen to construct cyclic cubic fields in which the unramified extension is of infinite degree.

Parts Of The Whole: An Algebra Lesson, Dorothy Wallace

Numeracy

This column draws on research of Eon Harper to demonstrate how an understanding of his proposed stages of algebra acquisition would inform a systemic overhaul of algebra education. Harper's stages also explain why students may pass a series of algebra courses yet still be unable to make sense of calculus, as well as offering insight on what aspects of algebra support quantitative literacy.

Reducing Math Anxiety: Findings From Incorporating Service Learning Into A Quantitative Reasoning Course At Seattle University, Allison Henrich, Kristi Lee

Numeracy

How might one teach mathematics to math-anxious students and at the same time reduce their math anxiety? This paper describes what we found when we incorporated a service learning component into a quantitative reasoning course at Seattle University in Fall 2010 (20 students) and Spring 2011 (28 students). The course is taken primarily by humanities majors, many of whom would not take a course in math if they didn’t need to satisfy the university’s core requirement. For the service learning component, each student met with and tutored children at local schools for 1-2 hours per week (total about 15 service …