Mathematics Commons^™

Compactness Of Isoresonant Potentials, Robert G. Wolf

Theses and Dissertations--Mathematics

Bruning considered sets of isospectral Schrodinger operators with smooth real potentials on a compact manifold of dimension three. He showed the set of potentials associated to an isospectral set is compact in the topology of smooth functions by relating the spectrum to the trace of the heat semi-group. Similarly, we can consider the resonances of Schrodinger operators with real valued potentials on Euclidean space of whose support lies inside a ball of fixed radius that generate the same resonances as some fixed Schrodinger operator, an ``isoresonant" set of potentials. This isoresonant set of potentials is also compact in the topology …

Orbital Stability Results For Soliton Solutions To Nonlinear Schrödinger Equations With External Potentials, Joseph B. Lindgren

Theses and Dissertations--Mathematics

For certain nonlinear Schroedinger equations there exist solutions which are called solitary waves. Addition of a potential $V$ changes the dynamics, but for small enough $||V||_{L^\infty}$ we can still obtain stability (and approximately Newtonian motion of the solitary wave's center of mass) for soliton-like solutions up to a finite time that depends on the size and scale of the potential $V$. Our method is an adaptation of the well-known Lyapunov method.

For the sake of completeness, we also prove long-time stability of traveling solitons in the case $V=0$.

On P-Adic Fields And P-Groups, Luis A. Sordo Vieira

Theses and Dissertations--Mathematics

The dissertation is divided into two parts. The first part mainly treats a conjecture of Emil Artin from the 1930s. Namely, if f = a_1x_1^d + a_2x_2^d +...+ a_{d^2+1}x^d where the coefficients a_i lie in a finite unramified extension of a rational p-adic field, where p is an odd prime, then f is isotropic. We also deal with systems of quadratic forms over finite fields and study the isotropicity of the system relative to the number of variables. We also study a variant of the classical Davenport constant of finite abelian groups and relate it to the isotropicity of diagonal …

Approximation Of Solutions To The Mixed Dirichlet-Neumann Boundary Value Problem On Lipschitz Domains, Morgan F. Schreffler

Theses and Dissertations--Mathematics

We show that solutions to the mixed problem on a Lipschitz domain Ω can be approximated in the Sobolev space H¹(Ω) by solutions to a family of related mixed Dirichlet-Robin boundary value problems which converge in H¹(Ω), and we give a rate of convergence. Further, we propose a method of solving the related problem using layer potentials.

The Partition Lattice In Many Guises, Dustin G. Hedmark

Theses and Dissertations--Mathematics

This dissertation is divided into four chapters. In Chapter 2 the equivariant homology groups of upper order ideals in the partition lattice are computed. The homology groups of these filters are written in terms of border strip Specht modules as well as in terms of links in an associated complex in the lattice of compositions. The classification is used to reproduce topological calculations of many well-studied subcomplexes of the partition lattice, including the d-divisible partition lattice and the Frobenius complex. In Chapter 3 the box polynomial B_{m,n}(x) is defined in terms of all integer partitions that fit in an m …

Colorings Of Hamming-Distance Graphs, Isaiah H. Harney

Theses and Dissertations--Mathematics

Hamming-distance graphs arise naturally in the study of error-correcting codes and have been utilized by several authors to provide new proofs for (and in some cases improve) known bounds on the size of block codes. We study various standard graph properties of the Hamming-distance graphs with special emphasis placed on the chromatic number. A notion of robustness is defined for colorings of these graphs based on the tolerance of swapping colors along an edge without destroying the properness of the coloring, and a complete characterization of the maximally robust colorings is given for certain parameters. Additionally, explorations are made into …

Some Take-Away Games On Discrete Structures, Kristen M. Barnard

Theses and Dissertations--Mathematics

The game of Subset Take-Away is an impartial combinatorial game posed by David Gale in 1974. The game can be played on various discrete structures, including but not limited to graphs, hypergraphs, polygonal complexes, and partially ordered sets. While a universal winning strategy has yet to be found, results have been found in certain cases. In 2003 R. Riehemann focused on Subset Take-Away on bipartite graphs and produced a complete game analysis by studying nim-values. In this work, we extend the notion of Take-Away on a bipartite graph to Take-Away on particular hypergraphs, namely oddly-uniform hypergraphs and evenly-uniform hypergraphs whose …

Positive Solutions Of Boundary Value Problems For Ordinary Differential Equations With Dependence On Higher Order Derivatives, Ahlam Abid, Paul Eloe

Mathematics Faculty Publications

In this paper, the compression contraction fixed point theorem is applied to a right focal boundary value problem for a second order ordinary differential equation to provide sufficient conditions for existence of solutions in a cone. The nonlinear term is a function of three variables and singularities are allowed. A cone is defined in the Banach space C1[0, 1] and concavity of derivatives of solutions plays a key role. A family of examples is provided in which explicit sufficient conditions are exhibited.

An Updated Survey On Rainbow Connections Of Graphs - A Dynamic Survey, Xueliang Li, Yuefang Sun

Theory & Applications of Graphs

The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is a book on this topic by Li and Sun in 2012, and a survey paper by Li, Shi and Sun in 2013. More and more researchers are working in this field, and many new papers have been published in journals. In this survey we attempt to bring together most of the new results and papers that deal with this topic. We begin with an introduction, and then try to organize the …

Application Of An Extremal Result Of Erdős And Gallai To The (N,K,T) Problem, Matt Noble, Peter Johnson, Dean Hoffman, Jessica Mcdonald

Theory & Applications of Graphs

An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prove the following: If n, k, and t are integers satisfying n ≥ k ≥ t ≥ 3 and k ≤ 2t - 2, and G is a graph with the minimum number of edges among graphs on n vertices with the property that every induced subgraph on k vertices contains a complete subgraph on t vertices, then every component of G is complete.

Adaptive Orthonormal Systems For Matrix-Valued Functions, Daniel Alpay, Fabrizio Colombo, Tao Qian, Irene Sabadini, Tao Qian

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we consider functions in the Hardy space Hp×q2 defined in the unit disc of matrix-valued. We show that it is possible, as in the scalar case, to decompose those functions as linear combinations of suitably modified matrix-valued Blaschke product, in an adaptive way. The procedure is based on a generalization to the matrix-valued case of the maximum selection principle which involves not only selections of suitable points in the unit disc but also suitable orthogonal projections. We show that the maximum selection principle gives rise to a convergent algorithm. Finally, we discuss the case of real-valued signals.

Computational Methods For Prediction And Classification Of G Protein-Coupled Receptors, Khodeza Begum

Open Access Theses & Dissertations

G protein-coupled receptors (GPCRs) constitute the largest group of membrane receptor proteins in eukaryotes. Due to their significant roles in many physiological processes such as vision, smell, and inflammation, GPCRs are the targets of many prescribed drugs. However, the functional and structural diversity of GPCRs has kept their prediction and classification based on amino acid sequence data as a challenging bioinformatics problem. As existing computational methods to predict and classify GPCRs are focused on mammalian (mostly human) data, the ultimate goal of our project is to establish an ensemble approach and implement a web-based software that can be used reliably …

Combining Interval, Probabilistic, And Other Types Of Uncertainty In Engineering Applications, Andrew Martin Pownuk

Open Access Theses & Dissertations

In many practical application, we process measurement results and expert estimates. Measurements and expert estimates are never absolutely accurate, their result are slightly different from the actual (unknown) values of the corresponding quantities. It is therefore desirable to analyze how this measurement and estimation inaccuracy affects the results of data processing.

There exist numerous methods for estimating the accuracy of the results of data processing under different models of measurement and estimation inaccuracies: probabilistic, interval, and fuzzy. To be useful in engineering applications, these methods should provide accurate estimate for the resulting uncertainty, should not take too much computation time, …

Triple Non-Negative Matrix Factorization Technique For Sentiment Analysis And Topic Modeling, Alexander A. Waggoner

CMC Senior Theses

Topic modeling refers to the process of algorithmically sorting documents into categories based on some common relationship between the documents. This common relationship between the documents is considered the “topic” of the documents. Sentiment analysis refers to the process of algorithmically sorting a document into a positive or negative category depending whether this document expresses a positive or negative opinion on its respective topic. In this paper, I consider the open problem of document classification into a topic category, as well as a sentiment category. This has a direct application to the retail industry where companies may want to scour …

Nidus Idearum. Scilogs, Iii: Viva La Neutrosophia!, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Welcome into my scientific lab! My lab[oratory] is a virtual facility with noncontrolled conditions in which I mostly perform scientific meditation and chats: a nest of ideas (nidus idearum, in Latin). I called the jottings herein scilogs (truncations of the words scientific, and gr. Λόγος – appealing rather to its original meanings "ground", "opinion", "expectation"), combining the welly of both science and informal (via internet) talks (in English, French, and Romanian). * In this third book of scilogs collected from my nest of ideas, one may find new and old questions and solutions, referring to topics on NEUTROSOPHY – email …

Curiozităţi Ale Funcţiilor Supermatematice, Florentin Smarandache, Mircea Eugen Selariu

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

The Qq–Bit (Ii): Functional Central Limits And Monotone Representation Of The Azema Martingale, Luigi Accardi, Yun-Gang Lu

Communications on Stochastic Analysis

No abstract provided.

The Subcritical Phase For A Homopolymer Model, Iddo Ben-Ari, Hugo Panzo

Communications on Stochastic Analysis

No abstract provided.

Near-Martingale Property Of Anticipating Stochastic Integration, C R. Hwang, Hui-Hsiung Kuo, Kimiaki Saitô, Jiayu Zhai

Communications on Stochastic Analysis

No abstract provided.

An Option Pricing Model With Memory, Flavia Sancier, Salah Mohammed

Communications on Stochastic Analysis

No abstract provided.