Mathematics Commons^™

Support Varieties And Representation Type Of Small Quantum Groups, Jorg Feldvoss, Sarah Witherspoon

University Faculty and Staff Publications

In this paper, we provide a wildness criterion for any finite dimensional Hopf algebra with finitely generated cohomology. This generalizes a result of Farnsteiner to not necessarily cocommutative Hopf algebras over ground fields of arbitrary characteristic. Our proof uses the theory of support varieties for modules, one of the crucial ingredients being a tensor product property for some special modules. As an application, we prove a conjecture of Cibils stating that small quantum groups of rank at least two are wild.

Curve Interpolation And Coding Theory, Darren B. Glass

Math Faculty Publications

Whether it is downloading files from the Internet, having conversations between cell phones, or sending information from a laptop to a printer, we often want to transmit data in situations where we need to worry about interference from other signals that may cause errors in the transmission. The branch of mathematics known as coding theory is dedicated to finding ways to tell when these are errors in transmission and, when possible, how to correct those errors. The goal of coding theory is to build as much redundancy as possible into a message without greatly increasing its length. [excerpt]

Review: Nontangential Limits In Pt(Μ)-Spaces And The Index Of Invariant Subgroups, Stephan Ramon Garcia

Pomona Faculty Publications and Research

No abstract provided.

Review: Common Cyclic Vectors For Unitary Operators, Stephan Ramon Garcia

Pomona Faculty Publications and Research

No abstract provided.

Recognizing Graph Theoretic Properties With Polynomial Ideals, Jesus A. De Loera, Christopher J. Hillar, Peter N. Malkin, Mohamed Omar

All HMC Faculty Publications and Research

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polynomial method and show how the algorithmic theory of polynomial ideals can be used to detect k-colorability, unique Hamiltonicity, and automorphism rigidity of graphs. Our techniques are diverse and involve Nullstellensatz certificates, linear algebra over finite fields, Gröbner bases, toric algebra, convex programming, and real algebraic geometry.

The Marshall Differential Analyzer: A Visual Interpretation Of Mathematics, Bonita A. Lawrence, Richard P. Merritt, Devon A. Tivener

Undergraduate Mathematics Day: Past Content

Mechanical integration is an idea dating back to the late 1800's discovered by James Thomson, brother of Lord Kelvin. This idea was then expanded to build a calculating machine, called a differential analyzer, by Vannevar Bush (M.I.T) in 1929. The Marshall University Differential Analyzer Team has followed in the footsteps of Dr. Bush and a gentleman named Dr. Arthur Porter, who was the first to build a differential analyzer in England when he was a student of Dr. Douglas Hartree. He built his machine of Meccano components, the British version of Erector Set. In the early days of Arthur Porter's …

Lifting Module Maps Between Different Noncommutative Domain Algebras, Jonathan Von Stroh

Electronic Theses and Dissertations

The classical Carathéodory interpolation problem is the following: let n be a natural number, a₀, a₁, . . . , a_N be complex numbers, and D the unit disk. When does there exist an analytic function F : D → C and complex numbers a_N+1, a_N+2, . . . such that F(z) = a₀ + a₁z + a₂z² + . . . + a_Nz^N + a_N+1z^N+1 + . . . and ||F||_∞ < 1? In 1967, Sarason used operator theory techniques to give an elegant solution to the Carathéodory interpolation problem. In 1968, Sz.-Nagy and Foias extended Sarason's approach into a commutant lifting theorem. Both the theorem and the technique of the proof have become standard tools in control theory. In particular, the commutant lifting theorem approach lends itself to a wide range of generalizations. This thesis concerns one such generalization.

Arias presented generalizations of the original …

Snort: A Combinatorial Game, Keiko Kakihara

Theses Digitization Project

This paper focuses on the game Snort, which is a combinatorial game on graphs. This paper will explore the characteristics of opposability through examples. More fully, we obtain some neccessary conditions for a graph to be opposable. Since an opposable graph guarantees a second player win, we examine graphs that result in a first player win.

Symmetric Generators Of Order 3, Stewart Contreras

Theses Digitization Project

The main purpose of this project is to construct finite homomorphic images of infinite semi-direct products.

Symmetric Generation, Dung Hoang Tri

Theses Digitization Project

In this thesis we construct finite homorphic images of infinite semi-direct products, 2*n : N, where 2*n is a free product of n copies the cyclic group of permutations on n letter.

An Investigation Of Kurosh's Theorem, Keith Anthony Earl

Theses Digitization Project

The purpose of this project will be an exposition of the Kurosh Theorem and the necessary and suffcient condition that A must be algebraic and satisfy a P.I. to be locally finite.

U-Singularity And T-Topos Theoretic Entropy, Goro C. Kato

Mathematics

We will give descriptions of u-singularities as we introduce the notion of t-topos theoretic entropies. The unifying methodology for a u-singularity is the universal mapping property of an inverse or direct limit. The qualitative, conceptual, and structural analyses of u-singularities are given in terms of inverse and direct limits of micro decompositions of a presheaf and coverings of an object in t-site in the theory of temporal topos.

The Wright Message, 2010, University Of Northern Iowa. Department Of Mathematics.

The Wright Message

Inside this issue:

-- Dear Department Alumni and Friends
-- 2010 - 2011 Tenure-Stream Faculty
-- Spotlight on Undergraduates
-- Projects and Grants
-- Secondary Mathematics Education Programs
-- UNI I-Teach
-- Crane Scholarship
-- Actuarial Science and the Actuarial Science Fund
-- Alliance Project
-- Mathematics Contribution Form
-- Additional Mathematics Funds
-- Around Wright Hall
-- In Memoriam
-- Dr. Ridenhour Retires

Gronwall-Ouiang-Type Integral Inequalities On Time Scales, Ailian Liu, Martin Bohner

Mathematics and Statistics Faculty Research & Creative Works

We present several Gronwall-OuIang-type integral inequalities on time scales. Firstly, an OuIang inequality on time scales is discussed. Then we extend the Gronwall-type inequalities to multiple integrals. Some special cases of our results contain continuous Gronwall-type inequalities and their discrete analogues. Several examples are included to illustrate our results at the end.

Weyl-Titchmarsh Theory For Hamiltonian Dynamic Systems, Shurong Sun, Shaozhu Chen, Martin Bohner

Mathematics and Statistics Faculty Research & Creative Works

We establish the Weyl-Titchmarsh theory for singular linear Hamiltonian dynamic systems on a time scale T , which allows one to treat both continuous and discrete linear Hamiltonian systems as special cases for T= ℝ and T= ℤ within one theory and to explain the discrepancies between these two theories. This paper extends the Weyl-Titchmarsh theory and provides a foundation for studying spectral theory of Hamiltonian dynamic systems. These investigations are part of a larger program which includes the following: (i) M(λ) theory for singular Hamiltonian systems, (ii) on the spectrum of Hamiltonian systems, (iii) on boundary value problems for …

Urcohomologies And Cohomologies Of N -Complexes, Naoya Hiramatsu, Goro Kato

Mathematics

For a general sequence of objects and morphisms, we construct two N-complexes. Then we can define cohomologies (i, k)-type of the N-complexes not only on a diagonal region but also in the triangular region. We obtain an invariant defined on a general sequence of objects and morphisms. For a short exact sequence of N-complexes, we get the associated long exact sequence generalizing the classical long exact sequence. Lastly, several properties of the vanishing cohomologies of N-complexes are given.

Conformal Classification Of (K, Μ)-Contact Manifolds, Ramesh Sharma, Luc Vrancken

Mathematics Faculty Publications

First we improve a result of Tanno that says "If a conformal vector field on a contact metric manifold M is a strictly infinitesimal contact transformation, then it is an infinitesimal automorphism of M" by waiving the "strictness" in the hypothesis. Next, we prove that a (k, μ)-contact manifold admitting a non-Killing conformal vector field is either Sasakian or has k = –n – 1, μ = 1 in dimension > 3; and Sasakian or flat in dimension 3. In particular, we show that (i) among all compact simply connected (k, μ)-contact manifolds of dimension > 3, only the unit sphere S2n+1 …

Mathematical Biology At An Undergraduate Liberal Arts College, Stephen C. Adolph, Lisette G. De Pillis

All HMC Faculty Publications and Research

Since 2002 we have offered an undergraduate major in Mathematical Biology at Harvey Mudd College. The major was developed and is administered jointly by the mathematics and biology faculty. In this paper we describe the major, courses, and faculty and student research and discuss some of the challenges and opportunities we have experienced.

Stability And Dynamics Of Self-Similarity In Evolution Equations, Andrew J. Bernoff, Thomas P. Witelski

All HMC Faculty Publications and Research

A methodology for studying the linear stability of self-similar solutions is discussed. These fundamental ideas are illustrated on three prototype problems: a simple ODE with finite-time blow-up, a second-order semi-linear heat equation with infinite-time spreading solutions, and the fourth-order Sivashinsky equation with finite-time self-similar blow-up. These examples are used to show that self-similar dynamics can be studied using many of the ideas arising in the study of dynamical systems. In particular, the use of dimensional analysis to derive scaling invariant similarity variables is discussed, as well as the role of symmetries in the context of stability of self-similar dynamics. The …

Two-Player Envy-Free Multi-Cake Division, John Cloutier '03, Kathryn L. Nyman, Francis E. Su

All HMC Faculty Publications and Research

We introduce a generalized cake-cutting problem in which we seek to divide multiple cakes so that two players may get their most-preferred piece selections: a choice of one piece from each cake, allowing for the possibility of linked preferences over the cakes. For two players, we show that disjoint envy-free piece selections may not exist for two cakes cut into two pieces each, and they may not exist for three cakes cut into three pieces each. However, there do exist such divisions for two cakes cut into three pieces each, and for three cakes cut into four pieces each. The …