Digital Commons Network^™

Counting Nilpotent Pairs, Jason Fulman, Michael Galloy, Jeffery Vanderkam

Mathematical Sciences Technical Reports (MSTR)

In this paper , we consider the probability that two elements chosen at random from a finite group G generate a subgroup of a given nilpotency class. It is shown that in solvable non­-nilpotent groups, the probability that two elements generate a nilpotent subgroup is <= l/p,, where p, is the smallest prime dividing the order of the group, and it is also shown that there exist groups such that the probability of two elements generating a subgroup of class i approaches one (and other groups for which it approaches zero) for all i =>2. It is also shown …

Simultaneous Rational Approximations And Related Diophantine Equations, John Rickert

Mathematical Sciences Technical Reports (MSTR)

In this paper we consider simultaneous approximations to algebraic numbers a₁,...,a_m .

An Average Per Capita Formula For The Shapely Value, Irinel C. Dragan

Mathematics Technical Papers - Archive

A new formula for the Shapley value is given which does not require the storage of the [see pdf for notation] values of the characteristic function in the computer, and avoids the search in the memory for such data.

The 2/3 Bound For Rewritable N-Tuples, Lawren Smithline, Catherine Sugar

Mathematical Sciences Technical Reports (MSTR)

We study the number of rewritings of an n-tuple in a finite a group, for certain classes of groups.

Some Upper Bounds For Commutativity And Cyclicity Measures In Finite Groups, David Patrick, Catherine Sugar, Eric Wepsic

Mathematical Sciences Technical Reports (MSTR)

The number of commuting and cyclic n-tuples in a group are enumerated for certain classes of groups.

Another Way Of Counting Nᴺ, Arthur T. Benjamin, Fritz Juhnke

All HMC Faculty Publications and Research

An original combinatorial proof of a combinatorial identity is presented.

Inverse Problems For Metal Oxide Semiconductor Field-Effect Transistor Contact Resistivity, Weifu Fang, Ellis Cumberbatch

Mathematics and Statistics Faculty Publications

Inverse problems arising from the identification of transistor contact resistivity and contact window location are studied. A one-point boundary measurement of the potential is shown to be sufficient to identify each from a one-parameter monotone family, and such identification is both stable and continuously dependent on the parameter. For a nonmonotone family of locations with resistivity given, similar results are obtained for measurement made on almost all boundary points.

On The Game Of Googol, Theodore P. Hill, Ulrich Krengel

Research Scholars in Residence

In the classical secretary problem the decision maker can only observe the relative ranks of the items presented. Recently, Ferguson — building on ideas of Stewart — showed that, in a game theoretic sense, there is no advantage if the actual values of the random variables underlying the relative ranks can be observed (game of googol). We extend this to the case where the number of items is unknown with a known upper bound. Corollary 3 extends one of the main results in [HK] to all randomized stopping times. We also include a modified, somewhat more formal argument for Ferguson's …

Planning For Basic Needs In India: A Supplement., Monoj Kumar Panda Dr.

Doctoral Theses

Problems of economic development have received a great deal of attention in the last four decades. This has led to the evolution of several development goals like growth, redistribution, poverty alleviation and basic needs satiafac- tion. Initially, development atrategies e eared to were achieve maximum feasible growth rates. It was generally felt that the benefits of growth would spread widely to different sections of the population and in particular would percolate to the lower income groups. Judged by growth in national income, the development efforts have been successful, though to varying ext ent in different countries. But the percola- tion …

Construction Of Relative Difference Sets In P-Groups, James A. Davis

Department of Math & Statistics Faculty Publications

Jungnickel (1982) and Elliot and Butson (1966) have shown that (p^j+1,p,p^j+1,p^j) relative difference sets exist in the elementary abelian p-group case (p an odd prime) and many 2-groups for the case p = 2. This paper provides two new constructions of relative difference sets with these parameters; the first handles any p-group (including non-abelian) with a special subgroup if j is odd, and any 2-group with that subgroup if j is even. The second construction shows that if j is odd, every abelian group …

On The Construction Of Prime Desert N-Tuplets, Derek M. Marusarz '92

Honors Projects

If we were able to show that there is an infinite number of prime desert n-tuplets of length k, for any appropriate odd k, then we would have solved the twin prime conjecture because then we would know that there would be an infinite number of prime desert 1-tuplets of length k =1, i.e., an infinite number of twin primes.

Counting Nilpotent Pairs In Finite Groups: Some Conjectures, H Dubose-Schmidt, Michael D. Galloy, D,L, Wilson

Mathematical Sciences Technical Reports (MSTR)

The number of nilpotent pairs is determined for a number of small groups.

Σary, Moorhead State University, Mathematics Department

Math Department Newsletters

No abstract provided.

A Comparison Of Two Linear Nonparametric Regression Techniques, Sylvain Sardy

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

This thesis presented a useful tool in regression. Nonparametric linear regression techniques were described in the general context of regression. A comparison of two of these techniques, kernel regression and iterative regression, showed various aspects of nonparametric linear regressors.

Effects Of Nonsymmetric Release Times On Rate Monotonic Scheduling, R. G. Karl, T. L. Lo, D. C. St. Clair

Computer Science Technical Reports

This paper discusses problems associated with scheduling periodic tasks in a hard, real-time processing or computing environment using a static-priority, preemptive-resume operating system . The scheduling problems associated with a task set containing a single periodic task which has two fixed release periods of unequal length are examined. Some real-world applications may require task release times which are periodic, but whose tasking periods are not symmetric. A scheduling algorithm for task sets with a single nonsymmetric task has been developed for staticpriority, preemptive-resume operating systems. The nonsymmetric scheduling algorithm is based on the rate monotonic scheduling algorithm which assigns higher …

Design Of Backpropagation Neural Network Architectures Using A Decision Tree Classifier, B. M. Van Horn, D. C. St. Clair

Computer Science Technical Reports

The backpropagation neural network algorithm is a popular machine learning methodology. One difficulty with using the algorithm is that the network architecture must be designed before learning can occur. This includes deciding the number of layers, the number of nodes in each layer, and the number of connections. Traditionally this problem is solved by heuristics gained by an expert through experience.

This paper presents an algorithm for using ID3 decision trees to design the network architecture. Previous approaches rely on binary decision trees. The proposed technique utilizes n-ary trees. These trees are easier to understand, are better suited for continuous-valued …

Optimizing Accuracy And Generalization In Numeric Classification Systems, M. D. Walters, D. C. St. Clair

Computer Science Technical Reports

Classifier systems are knowledge-based learning algorithms that take training instances as input and produce a set of rules as output. The classifier systems focused on in this paper represent the knowledge they learn in the form of decision trees, and are built upon Quinlan's [ 1986] inductive algorithm ID3.

The ID3 algorithm suffers from the inability to easily and effectively handle domains with numeric-valued attributes. Numeric attributes are those whose values are taken from a continuous domain or from a domain with a large number of discrete values. A number of approaches have been developed for extending ID3 to handle …

The Identification And Processing Of Don't-Care Attribute Values In Id3 Decision Tree Construction, P. D. Dorr, D. C. St. Clair

Computer Science Technical Reports

ID3 is most successful when used with sets of training and testing data that contain no missing attribute values. Many times, however, real-world domains have attributes with missing values. Sometimes these attribute values may not be needed to classify an instance. Such attribute values are called don't-care attribute values. In other cases, the values are needed but are unavailable. These values are called unknown attribute values. This paper describes the difference between unknown and don't-care attribute values and discusses several ways of identifying don't-care attribute values in ID3. Numerical results are described which validate the practicality of these approaches.

Network Key Management In A Large Distributed Environment, J. J. Stapleton, D. C. St. Clair

Computer Science Technical Reports

The technique of using encryption for protecting information in a network environment involves managing encryption keys within that same network. In large distributed networks the goal of achieving a secure environment requires a secure method of performing network key management. Network security, system security, and application security by means of data encryption rely on encryption keys remaining secret.

Both international and domestic standards organizations such as the International Organization for Standardization (ISO), the American National Standards Institute (ANSI), and the National Institute of Standards and Technology (NIST) address the issues of encryption through various standards. However, these standards discuss methods …

A Maple Package For The Variational Calculus, Cinnamon Hillyard

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The HELMHOLTZ package, written in Maple V, is a collection of commands to support research in the variational calculus. These commands include the standard operators on differential forms, Euler-Lagrange operators, homotopy operators, Lie bracket, Lie derivatives, and the prolongation of a vector field. We give a brief introduction to the variational calculus. We describe each of the commands in the HELMHOLTZ package completely along with numerous examples of each. Applications of the package include verification of symmetry groups for differential equations, solving the inverse problem of the calculus of variations, computing generalized symmetries, and finding variational integrating factors. A complete …

Inverse Problem In Porous Medium Using Homogenization, Helen Alkes

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The problem under consideration is that of obtaining a representation of the permeability of a porous medium which is heterogeneous and anisotropic from limited information. To solve this inverse problem we propose the use of two different pieces that work together. A simulated annealing algorithm is presented and coupled with an homogenization technique; together these solve the problem which was posed. Further, numerical simulation results are presented illustrating the use of the simulated annealing algorithm as well as a coupling with the homoginization technique. This study illustrates that the performance of the annealing algorithm is enhanced with usage of homogenization.

Disconjugacy And Oscillation Theory Of Linear Differential And Difference Equations, Yuhua Xu

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

This dissertation is both a literature survey and a presentation of new and independent results.

The survey gives an overview of disconjugacy and oscillation theory for linear differential and difference equations with an emphasis on comparing the theory of difference equations to the theory of differential equations. Second order scalar equations, higher order scalar equations, matrix equations (systems) and Hamiltonian systems are discussed. A chapter on three-term recurrences of systems is also included. Both similarities and differences between differential and difference equations are described.

The new and independent results are for Hamiltonian systems of difference equations. Those results include the …

Hopf Bifurcation In A Parabolic Free Boundary Problem, Yoon-Mee Lee

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

We deal with a free boundary problem for a nonlinear parabolic equation, which includes a parameter in the free boundary condition. This type of system has been used in models of ecological systems, in chemical reactor theory and other kinds of propagation phenomena involving reactions and diffusion.

The main purpose of this dissertation is to show the global existence, uniqueness of solutions and that a Hopf bifurcation occurs at a critical value of the parameter r. The existence and uniqueness of the solution for this problem are shown by finding an equivalent regular free boundary problem to which existence …

Logical "Paradox": A Response To Fallacies, Flaws, And Flimflam #36, Calvin Jongsma

Faculty Work Comprehensive List

Response to "Fallacies, Flaws, and Flimflam" by Ed Barbeau in The College Mathematics Journal, Vol. 23, No. 3 (May, 1992), pp. 203-206. Fallacies, Flaws, and Flimflam is a column in The College Mathematics Journal edited by Ed Barbeau of the Department of Mathematics at the University of Toronto.

Shooting Method Solutions Of Eigenvalue Problems, Xi Chen

Opportunities for Undergraduate Research Experience Program (OURE)

A shooting method was developed to study eigenvalue problems derived from Schrodinger equation. The challenging problem, the two-dimensional hydrogen system with the logarithmic potential function, was successfully solved by the shooting method. But no complete proof was given for its rationale and correctness. This paper not only gives the complete proof for the shooting method, but also generalizes it to solve a large class of eigenvalue problems. In a certain sense, the shooting method proves more effective numerically and more powerful theoretically than the classical functional analysis approach.

Mielnik Probability Spaces And Functional Equations, J. J. Mitchell

Opportunities for Undergraduate Research Experience Program (OURE)

The invariance properties of the solutions of those functional equations naturally occurring in the construction of Mielnik probability spaces are studied, and in turn are related to one another. In particular, the possibilities for fixed points of these solutions are found, and the relationships between these results are discussed. The two functional equations studied include a representation of the generalized parallelogram law and an equation used in the modeling of polarization phenomena. The main result of the paper lies in the extention of previous research on Mielnik probability spaces to a higher dimension, as well as a discussion of their …

Some Facts About Cycels And Tidy Groups, Kevin O'Bryant, D. Patrick, Lawren Smithline, Eric Wepsic

Mathematical Sciences Technical Reports (MSTR)

No abstract provided.

Letter To Professor Joanne S. Growney, John S. Lew

Humanistic Mathematics Network Journal

No abstract provided.

Poems Taken From "An Evening Of Mathematical Poetry"

Humanistic Mathematics Network Journal

No abstract provided.

Mathematics As A Humanistic Discipline, Elena Anne Corie Marchisotto

Humanistic Mathematics Network Journal

No abstract provided.