Physical Sciences and Mathematics Commons^™

Semi-Fredholm Solvability In The Framework Of Singular Solutions For The (3+1)-D Protter-Morawetz Problem, Nedyu Popivanov, Todor Popov, Allen Tesdall

Publications and Research

For the four-dimensional nonhomogeneous wave equation boundary value problems that are multidimensional analogues of Darboux problems in the plane are studied. It is known that for smooth right-hand side functions the unique generalized solution may have a strong power-type singularity at only one point. This singularity is isolated at the vertex �� of the boundary light characteristic cone and does not propagate along the bicharacteristics.The present paper describes asymptotic expansions of the generalized solutions in negative powers of the distance to ��. Some necessary and sufficient conditions for existence of bounded solutions are proven and additionally a priori estimates for …

Martingales For Uniformly Quasisymmetric Circle Endomorphisms, Yunchun Hu

Dissertations, Theses, and Capstone Projects

The main subject studied in this thesis is the space of all uniformly quasisymmetric circle endomorphisms preserving the Lebesgue measure. Although many of our arguments work for any degree d≥2, our proof will be mainly written for degree 2 maps.

We will introduce a sequence of Markov partitions of the unit circle by using preimages of the fixed point of such circle endomorphism f. The uniform quasisymmetry condition is equivalent to the bounded nearby geometry condition of the Markov partitions. In Chapter 2 of this thesis, for each f, we use the Lebesgue invariant condition and the …

Combinatorial Properties Of Polyiamonds, Christopher Larson

Dissertations, Theses, and Capstone Projects

Polyiamonds are plane geometric figures constructed by pasting together equilateral triangles edge-to-edge. It is shown that a diophantine equation involving vertices of degrees 2, 3, 5 and 6 holds for all polyiamonds; then an Eberhard-type theorem is proved, showing that any four-tuple of non-negative integers that satisfies the diophantine equation can be realized geometrically by a polyiamond. Further combinatorial and graph-theoretic aspects of polyiamonds are discussed, including a characterization of those polyiamonds that are three-connected and so three-polytopal, a result on Hamiltonicity, and constructions that use minimal numbers of triangles in realizing four-vectors.

Self-Referentiality In Constructive Semantics Of Intuitionistic And Modal Logics, Junhua Yu

Dissertations, Theses, and Capstone Projects

This thesis explores self-referentiality in the framework of justification logic. In this framework initialed by Artemov, the language has formulas of the form t:F, which means "the term t is a justification of the formula F." Moreover, terms can occur inside formulas and hence it is legal to have t:F(t), which means "the term t is a justification of the formula F about t itself." Expressions like this is not only interesting in the semantics of justification logic, but also, as we will see, necessary in applications of justification logic in formalizing constructive contents implicitly carried by modal and intuitionistic …

An Algorithmic Approach To The Differential Galois Theory Of Second-Order Linear Differential Equations With Differential Parameters, Carlos Eduardo Arreche Aguayo

Dissertations, Theses, and Capstone Projects

We present algorithms to compute the differential Galois group G associated via the parameterized Picard-Vessiot theory to a parameterized second-order linear differential equation with respect to d/dx, with coefficients in the field of rational functions F(x) over a differential field F, where we think of the derivations on F as being derivations with respect to parameters. We build on an earlier procedure, developed by Dreyfus, that computes G when the equation is unimodular, assuming either that G is reductive, or else that its maximal reductive quotient is differentially constant. We first show how to modify the space of parametric derivations …

Motivic Integration Over Nilpotent Structures, Andrew Ryan Stout

Dissertations, Theses, and Capstone Projects

This thesis concerns developing the notion of Motivic Integration in such a way that it captures infinitesimal information yet reduces to the classical notion of motivic integration for reduced schemes. Moreover, I extend the notion of Motivic Integration from a discrete valuation ring to any complete Noetherian ring with residue field $\kappa$, where $\kappa$ is any field. Schoutens' functorial approach (as opposed to the traditional model theoretic approach) allows for some very general notions of motivic integration. However, the central focus is on using this general framework to study generically smooth schemes, then non-reduced schemes, and then, finally, formal schemes. …

Generalized Least-Squares Regressions Iv: Theory And Classification Using Generalized Means, Nataniel Greene

Publications and Research

The theory of generalized least-squares is reformulated here using the notion of generalized means. The generalized least-squares problem seeks a line which minimizes the average generalized mean of the square deviations in x and y. The notion of a generalized mean is equivalent to the generating function concept of the previous papers but allows for a more robust understanding and has an already existing literature. Generalized means are applied to the task of constructing more examples, simplifying the theory, and further classifying generalized least-squares regressions.

Exploring Platform (Semi)Groups For Non-Commutative Key-Exchange Protocols, Ha Lam

Dissertations, Theses, and Capstone Projects

In this work, my advisor Delaram Kahrobaei, our collaborator David Garber, and I explore polycyclic groups generated from number fields as platform for the AAG key-exchange protocol. This is done by implementing four different variations of the length-based attack, one of the major attacks for AAG, and submitting polycyclic groups to all four variations with a variety of tests. We note that this is the first time all four variations of the length-based attack are compared side by side. We conclude that high Hirsch length polycyclic groups generated from number fields are suitable for the AAG key-exchange protocol.

Delaram Kahrobaei …

Stable Commutator Length In Amalgamated Free Products, Timothy Susse

Dissertations, Theses, and Capstone Projects

We show that stable commutator length is rational on free products of free Abelian groups amalgamated over Z^k, a class of groups containing the fundamental groups of all torus knot complements. We consider a geometric model for these groups and parameterize all surfaces with specified boundary mapping to this space. Using this work we provide a topological algorithm to compute stable commutator length in these groups. We then use the combinatorics of this algorithm to prove that for a word w in the (p, q)-torus knot complement, scl(w) is quasirational in p and q. Finally, we analyze central …

Asymptotic Invariants And Flatness Of Local Endomorphisms, Nikita Miasnikov

Dissertations, Theses, and Capstone Projects

For a local endomorphism of a noetherian local ring we introduce 3 asymptotic invariants one of which we call entropy. We use this notion of entropy to extend numerical conditions in Kunz' regularity criterion to every contracting endomorphism of a noetherian local ring, and to give a characteristic-free interpretation of the definition of Hilbert-Kunz multiplicity. We also show that every finite endomorphism of a complete noetherian local ring of equal characteristic can be lifted to a finite endomorphism of a complete regular local ring. The local ring of an algebraic or analytic variety at a point fixed by a finite …

The Asymptotic Dirichlet Problems On Manifolds With Unbounded Negative Curvature, Ran Ji

Dissertations, Theses, and Capstone Projects

Elton P. Hsu used probabilistic method to show that the asymptotic Dirichlet problem is uniquely solvable if the curvature satisfies the condition $-C e^{(2-\eta)r(x)} \leq K_M(x)\leq -1$ with $\eta>0$. We give an analytical proof of the same statement. In addition, using this new approach we are able to establish two boundary Harnack inequalities under the curvature condition $-C e^{(2/3-\eta)r(x)} \leq K_M(x)\leq -1$ with $\eta>0$. This implies that there is a natural homeomorphism between the Martin boundary and the geometric boundary of $M$. As far as we know, this is the first result of this kind under unbounded curvature …

Decoding Quantitative Language, Steven Cosares, Evelyn Burg

Open Educational Resources

We all need some “quantitative literacy” in order to communicate effectively. This means being able to read, write or speak intelligently in a medium where some quantitative information is a part the discussion, proof, or argument. The readers of these materials are expected to have sufficient wherewithal to understand this language so as to draw appropriate conclusions. Developing this type of literacy requires practice. It means using everyday language to describe the ways in which quantities relate to one another.

Discovering Regularity In Point Clouds Of Urban Scenes, Sam Friedman

Dissertations, Theses, and Capstone Projects

Despite the apparent chaos of the urban environment, cities are actually replete with regularity. From the grid of streets laid out over the earth, to the lattice of windows thrown up into the sky, periodic regularity abounds in the urban scene. Just as salient, though less uniform, are the self-similar branching patterns of trees and vegetation that line streets and fill parks. We propose novel methods for discovering these regularities in 3D range scans acquired by a time-of-flight laser sensor. The applications of this regularity information are broad, and we present two original algorithms. The first exploits the efficiency of …

Lean, Green, And Lifetime Maximizing Sensor Deployment On A Barrier, Peter Michael Terlecky

Dissertations, Theses, and Capstone Projects

Mobile sensors are located on a barrier represented by a line segment, and each sensor has a single energy source that can be used for both moving and sensing. Sensors may move once to their desired destinations and then coverage/communication is commenced. The sensors are collectively required to cover the barrier or in the communication scenario set up a chain of communication from endpoint to endpoint. A sensor consumes energy in movement in proportion to distance traveled, and it expends energy per time unit for sensing in direct proportion to its radius raised to a constant exponent.

The first focus …

Special Representations, Nathanson's Lambda Sequences And Explicit Bounds, Satyanand Singh

Dissertations, Theses, and Capstone Projects

{Let $X$ be a group with identity $e$, we define $A$ as an infinite set of generators for $X$, and let $(X,d)$ be the metric space with word length $d_{A}$ induced by $A$. Nathanson showed that if $P$ is a nonempty finite set of prime numbers and $A$ is the set of positive integers whose prime factors all belong to $P$, then the metric space $({\bf{Z}},d_{A})$ has infinite diameter. Nathanson also studied the $\lambda_{A}(h)$ sequences, where $\lambda_{A}(h)$ is defined as the smallest positive integer $y$ with $d_{A}(e,y)=h$, and he posed the problem to compute $\lambda_{A}(h)$ and estimate its growth rate. …

Scheduling And Resource Allocation In Wireless Sensor Networks, Yosef Alayev

Dissertations, Theses, and Capstone Projects

In computer science and telecommunications, wireless sensor networks are an active research area. Each sensor in a wireless sensor network has some pre-defined or on demand tasks such as collecting or disseminating data. Network resources, such as broadcast channels, number of sensors, power, battery life, etc., are limited. Hence, a schedule is required to optimally allocate network resources so as to maximize some profit or minimize some cost. This thesis focuses on scheduling problems in the wireless sensor networks environment. In particular, we study three scheduling problems in the wireless sensor networks: broadcast scheduling, sensor scheduling for area monitoring, and …

Terminal Summation: Extending The Concept Of Convergence, Max Tran, Ayalur Krishnan

Publications and Research

This paper presents an atypical method for summing divergent series, and provides a sum for the divergent series log(n). We use an idea of T.E. Phipps, called Terminal Summation, which uses asymptotic analysis to assign a value to divergent series. The method associates a series to an appropriate difference equations having boundary conditions at infinity, and solves the difference equations which then provide a value for the original series. We point out connections between Phipps' method, the Euler-MacLaurin sum formula, the Ramanujan sum and other traditional methods for summing divergent series.

Generalized Least-Squares Regressions Iii: Further Theory And Classification, Nataniel Greene

Publications and Research

This paper continues the work of this series with two results. The first is an exponential equivalence theorem which states that every generalized least-squares regression line can be generated by an equivalent exponential regression. It follows that every generalized least-squares line has an effective normalized exponential parameter between 0 and 1 which classifies the line on the spectrum between ordinary least-squares and the extremal line for a given set of data. The second result is the presentation of fundamental formulas for the generalized least-squares slope and y-intercept.