Mathematics Commons^™

Minimal Circuits For Very Incompletely Specified Boolean Functions, Richard Strong Bowen

HMC Senior Theses

In this report, asymptotic upper and lower bounds are given for the minimum number of gates required to compute a function which is only partially specified and for which we allow a certain amount of error. The upper and lower bounds match. Hence, the behavior of these minimum circuit sizes is completely (asymptotically) determined.

A Multistage Incidence Estimation Model For Diseases With Differential Mortality, Alyssa W. Dray

HMC Senior Theses

According to theWorld Health Organization, surgically removable cataract remains the leading cause of blindness worldwide. In sub-Saharan Africa, cataract surgical rate targets should ideally be set based on cataract incidence (the number of new cataracts developed each year). Unfortunately, the longitudinal studies necessary to measure incidence have not yet been feasible in these areas. Our research instead proposes a method for estimating incidence based on available cataract prevalence data. We extend a method proposed by Podgor and Leske (1986) to estimate age-specific incidence from age-specific prevalence in single diseases with differential mortality. A two-stage disease extension is created in order …

A Comparison Of Probe-Level And Probeset Models For Small-Sample Gene Expression Data, John R. Stevens, Jason L. Bell, Kenneth I. Aston, Kenneth L. White

Mathematics and Statistics Faculty Publications

Background: Statistical methods to tentatively identify differentially expressed genes in microarray studies typically assume larger sample sizes than are practical or even possible in some settings.

Results: The performance of several probe-level and probeset models was assessed graphically and numerically using three spike-in datasets. Based on the Affymetrix GeneChip, a novel nested factorial model was developed and found to perform competitively on small-sample spike-in experiments.

Conclusions: Statistical methods with test statistics related to the estimated log fold change tend to be more consistent in their performance on small-sample gene expression data. For such small-sample experiments, the nested factorial model can …

A Lift Of Cohomology Eigenclasses Of Hecke Operators, Brian Francis Hansen

Theses and Dissertations

A considerable amount of evidence has shown that for every prime p &neq; N observed, a simultaneous eigenvector v_0 of Hecke operators T(l,i), i=1,2, in H^3(Γ_0(N),F(0,0,0)) has a “lift” v in H^3(Γ_0(N),F(p−1,0,0)) — i.e., a simultaneous eigenvector v of Hecke operators having the same system of eigenvalues that v_0 has. For each prime p>3 and N=11 and 17, we construct a vector v that is in the cohomology group H^3(Γ_0(N),F(p−1,0,0)). This is the first construction of an element of infinitely many different cohomology groups, other than modulo p reductions of characteristic zero objects. We proceed to show that v …

Geometry, Greed, Games, And 'Roids, James Oxley

Dalrymple Lecture Series

A three-legged stool doesn’t wobble. But four-legged stools often teeter because the tips of their legs don’t lie in the same plane.

This phenomenon of dependent sets, first theorized 75 years ago, is the focus of the 16th Dalrymple Lecture in Mathematics, set for 5:30 p.m. Friday (May 21) at the University of Mississippi. James Oxley, who holds an alumni professorship at Louisiana State University, is to deliver the address, which is free and open to the public in the Student Union Ballroom.

“There is some beautiful and intriguing mathematics that arises from some natural problems in geometry and network …

An Exponentially Convergent Nonpolynomial Finite Element Method For Time-Harmonic Scattering From Polygons, A. H. Barnett, T. Betcke

Dartmouth Scholarship

In recent years nonpolynomial finite element methods have received increasing attention for the efficient solution of wave problems. As with their close cousin the method of particular solutions, high efficiency comes from using solutions to the Helmholtz equation as basis functions. We present and analyze such a method for the scattering of two-dimensional scalar waves from a polygonal domain that achieves exponential convergence purely by increasing the number of basis functions in each element. Key ingredients are the use of basis functions that capture the singularities at corners and the representation of the scattered field towards infinity by a combination …

Results From Electrostatic Calibrations For Measuring The Casimir Force In The Cylinder-Plane Geometry, Q. Wei, D. A. R. Dalvit, F. C. Lombardo, F. D. Mazzitelli, R. Onofrio

Dartmouth Scholarship

We report on measurements performed on an apparatus aimed to study the Casimir force in the cylinder-plane configuration. The electrostatic calibrations evidence anomalous behaviors in the dependence of the electrostatic force and the minimizing potential upon distance. We discuss analogies and differences of these anomalies with respect to those already observed in the sphere-plane configuration. At the smallest explored distances we observe frequency shifts of non-Coulombian nature preventing the measurement of the Casimir force in the same range. We also report on measurements performed in the parallel-plane configuration, showing that the dependence on distance of the minimizing potential, if present …

Noncommutative Topology And The World’S Simplest Index Theorem, Erik Van Erp

Dartmouth Scholarship

In this article we outline an approach to index theory on the basis of methods of noncommutative topology. We start with an explicit index theorem for second-order differential operators on 3-manifolds that are Fredholm but not elliptic. This low-brow index formula is expressed in terms of winding numbers. We then proceed to show how it is derived as a special case of an index theorem for hypoelliptic operators on contact manifolds. Finally, we discuss the noncommutative topology that is employed in the proof of this theorem. The article is intended to illustrate that noncommutative topology can be a powerful tool …

Explicit And Implicit Methods In Solving Differential Equations, Timothy Bui

Honors Scholar Theses

Differential equations are equations that involve an unknown function and derivatives. Euler's method are efficient methods to yield fairly accurate approximations of the actual solutions. By manipulating such methods, one can find ways to provide good approximations compared to the exact solution of parabolic partial differential equations and nonlinear parabolic differential equations.

A Predictive Model For Secondary Rna Structure Using Graph Theory And A Neural Network., Denise Renee Koessler

Electronic Theses and Dissertations

In this work we use a graph-theoretic representation of secondary RNA structure found in the database RAG: RNA-As-Graphs. We model the bonding of two RNA secondary structures to form a larger structure with a graph operation called merge. The resulting data from each tree merge operation is summarized and represented by a vector. We use these vectors as input values for a neural network and train the network to recognize a tree as RNA-like or not based on the merge data vector.

The network correctly assigned a high probability of RNA-likeness to trees identified as RNA-like in the RAG database, …

Total Domination Dot Critical And Dot Stable Graphs., Stephanie Anne Marie Mcmahon

Electronic Theses and Dissertations

Two vertices are said to be identifed if they are combined to form one vertex whose neighborhood is the union of their neighborhoods. A graph is total domination dot-critical if identifying any pair of adjacent vertices decreases the total domination number. On the other hand, a graph is total domination dot-stable if identifying any pair of adjacent vertices leaves the total domination number unchanged. Identifying any pair of vertices cannot increase the total domination number. Further we show it can decrease the total domination number by at most two. Among other results, we characterize total domination dot-critical trees with total …

Σary, Minnesota State University Moorhead, Mathematics Department

Math Department Newsletters

No abstract provided.

Discrete Fractional Calculus And Its Applications To Tumor Growth, Sevgi Sengul

Masters Theses & Specialist Projects

Almost every theory of mathematics has its discrete counterpart that makes it conceptually easier to understand and practically easier to use in the modeling process of real world problems. For instance, one can take the "difference" of any function, from 1st order up to the n-th order with discrete calculus. However, it is also possible to extend this theory by means of discrete fractional calculus and make n- any real number such that the ½-th order difference is well defined. This thesis is comprised of five chapters that demonstrate some basic definitions and properties of discrete fractional calculus …

An Algorithm To Generate Two-Dimensional Drawings Of Conway Algebraic Knots, Jen-Fu Tung

Masters Theses & Specialist Projects

The problem of finding an efficient algorithm to create a two-dimensional embedding of a knot diagram is not an easy one. Typically, knots with a large number of crossings will not nicely generate two-dimensional drawings. This thesis presents an efficient algorithm to generate a knot and to create a nice two-dimensional embedding of the knot. For the purpose of this thesis a drawing is “nice” if the number of tangles in the diagram consisting of half-twists is minimal. More specifically, the algorithm generates prime, alternating Conway algebraic knots in O(n) time where n is the number of crossings …

Dynamics Groups Of Asynchronous Cellular Automata, Michael Macauley, Jon Mccammond, Henning S. Mortveit

Publications

We say that a finite asynchronous cellular automaton (or more generally, any sequential dynamical system) is π-independent if its set of periodic points are independent of the order that the local functions are applied. In this case, the local functions permute the periodic points, and these permutations generate the dynamics group. We have previously shown that exactly 104 of the possible 2²³ = 256 cellular automaton rules are π-independent. In the article, we classify the periodic states of these systems and describe their dynamics groups, which are quotients of Coxeter groups. The dynamics groups provide information …

Time Series Models For Computing Activation In Fmri, Daniel W. Adrian, Ranjan Maitra, Daniel B. Rowe

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

On The Numerical Range And Spectrum Of The Weighted Shift Operator In [Iota]², Gina-Louise Santamaria

Theses, Dissertations and Culminating Projects

In this paper, we examine the weighted shift operator in l² as described in Yoo & Rho [15], which is an example of what is known as a hyponormal weighted shift. Using the methods of Tam [13], in conjuction with properties of the weighted shift, we determine the numerical range of Yoo &; Rho’s unilateral weighted shift operator.

It is well-established that the spectrum of a bounded linear operator is always included in the closure of the numerical range. In particular, for a bounded linear operator, the point and compression spectra are contained within the numerical range itself [7]. …

Using Matrix Pencils To Solve Discrete Sturm-Liouville Problems With Nonlinear Boundary Conditions, Michael Kofi Wilson

Theses, Dissertations and Culminating Projects

This thesis deals with discrete second order Sturm-Liouville Boundary Value Problems (DSLBVP) where the parameter as part of the Sturm-Liouville difference equation appears nonlinearly in the boundary conditions. We focus on analyzing the case with cubic nonlinearity in the boundary condition. First, we describe the problem by a matrix equation with nonlinear variables such that solving the DSLBVP is equivalent to solving the matrix equation. Second, we formulate the problem as a nonlinear eigenvalue problem. We further reduce the problem to finding eigenvalues of a matrix pencil in the form A - X B . Under certain conditions, such a …

Schubert Polynomials And Classes Of Hessenberg Varieties, Dave Anderson, Julianna Tymoczko

Mathematics Sciences: Faculty Publications

Regular semisimple Hessenberg varieties are a family of subvarieties of the flag variety that arise in number theory, numerical analysis, representation theory, algebraic geometry, and combinatorics. We give a " Giambelli formula" expressing the classes of regular semisimple Hessenberg varieties in terms of Chern classes. In fact, we show that the cohomology class of each regular semisimple Hessenberg variety is the specialization of a certain double Schubert polynomial, giving a natural geometric interpretation to such specializations. We also decompose such classes in terms of the Schubert basis for the cohomology ring of the flag variety. The coefficients obtained are nonnegative, …

On Directionally Dependent Subdifferentials, Ivan Ginchev, Boris S. Mordukhovich

Mathematics Research Reports

In this paper directionally contextual concepts of variational analysis, based on dual-space constructions similar to those in [4, 5], are introduced and studied. As an illustration of their usefulness, necessary and also sufficient optimality conditions in terms of directioual subdifferentials are established, and it is shown that they can be effective in the situations where known optimality conditions in terms of nondirectional subdifferentials fail.