Mathematics Commons^™

On Some New Constructions Of Difference Sets, Sarah Agnes Spence

Honors Theses

Difference sets are mathematical structures which arise in algebra and combinatorics, with applications in coding theory. The fundamental question is when and how one can construct difference sets. This largely expository paper looks at standard construction methods and describes recent findings that resulted in new families of difference sets. This paper provides explicit examples of difference sets that arise from the recent constructions. By gaining a thorough understanding of these new techniques, it may be possible to generalize the results to find additional new families of difference sets. The paper also introduces partial and relative difference sets and discusses how …

The Link Between Scrambling Numbers And Derangements, Barry Balof, Eric Farmer, Jamie Kawabata

Mathematical Sciences Technical Reports (MSTR)

The group equation abcdef = dabecf can be reduced to the equation xcde = dxec. In general, we are interested in how many variables are needed to represent group equations in which the right side is a permutation of the variables on the left side. Scrambling numbers capture this information about a permutation. In this paper we present several facts about scrambling numbers, and expose a striking relationship between permutations that cannot be reduced and derangements.

Σary, Moorhead State University, Mathematics Department

Math Department Newsletters

No abstract provided.

Was Newton's Calculus A Dead End? The Continental Influence Of Maclaurin's Treatise Of Fluxions, Judith V. Grabiner

Pitzer Faculty Publications and Research

We will show that Maclaurin's Treatise of Fluxions did develop important ideas and techniques and that it did influence the mainstream of mathematics. The Newtonian tradition in calculus did not come to an end in Maclaurin's Britain. Instead, Maclaurin's Treatise served to transmit Newtonian ideas in calculus, improved and expanded, to the Continent. We will look at what these ideas were, what Maclaurin did with them, and what happened to this work afterwards. Then, we will ask what by then should be an interesting question: why has Maclaurin's role been so consistently underrated? Thse questions will involve general matters of …

Putting The Pieces Together: Understanding Robinson’S Nonperiodic Tilings, Aimee S. A. Johnson, K. M. Madden

Mathematics & Statistics Faculty Works

A discussion of Robinson's nonperiodic tilings and nonperiodic tilings with nonsquare tiles (Penrose and pinwheel).

Geometric Aspects Of Second-Order Scalar Hyperbolic Partial Differential Equations In The Plane, Martin Jurás

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The purpose of this dissertation is to address various geometric aspects of second-order scalar hyperbolic partial differential equations in two independent variables and one dependent variable

F(x, y, u, u_x, u_y, u_xx, u_xy, u_yy) = 0

We find a characterization of hyperbolic Darboux integrable equations at level k (1) in terms of the vanishing of the generalized Laplace invariants and provide an invariant characterization of various cases in the Goursat general classification of hyperbolic Darboux integrable equations (1). In particular we give a contact invariant characterization of equations integrable by …

Ua66/10/2 Alumni Newsletter, Wku Mathematics

WKU Administration Documents

Alumni newsletter created by and about the WKU Mathematics department.

Temporal Flocking And Cacophony Simulating Agent Communication In A Noisy Environment, Jessica R. Crawford

Honors Theses

Realistic communication is one of the most difficult aspects of simulating group behavior because the patterns produced by group communication are complex and not easily definable. In this paper, we present a model, developed using artificial life methodology, for creating simulations of group communication. Our model employs autonomous, artificial agents to produce emergent group behavior that resembles the communication patterns of a group, specifically, a flock of birds. Each agent collects information about its environment and its neighbors and follows a set of rules designed to meet both group goals and individual agent goals. Because we seek to establish emergent …

On The Automatic Generation Of Network Protocol Simulators, Andrew Chen

Honors Theses

Computers communicate with each other over various communication networks via a language known as a protocol. The design of the protocol can have a significant impact on the efficiency (and effectiveness) of the network. Because building an actual network to test the performance (and reliability) of a new protocol is rather expensive and time consuming, there is an interest in simulating network protocols in order to determine how efficient the communication network is. We are therefore interested in automatically generating simulators that could measure the performance of the new protocols. There are two main parts to this project. The first …

Parallel Programming, Peter Dailey

Honors Theses

The speed of technology is always increasing, especially in the field of computing. Unfortunately, the size of the problems needing to be solved are also growing in many areas. In order to keep up with this, parallel computing has become an important research area. The term parallel computing essentially refers to using multiple processors cooperating to solve a problem. For certain problems this can speed up the solution by a factor ofN, the number of processors being used. There are algorithms, for which there is no speed increase due to certain dependencies.

Circles Of The Gods: Copernicus, Kepler, And The Ellipse, Owen Gingerich

ACMS Conference Proceedings 1997

No abstract provided.

On Some Problems Related To Hermite And Laguerre Expansions., P. K. Ratnakumar Dr.

Doctoral Theses

The first three chapters of this thesis are concerned with the spherical means associated to the Hermite and Laguerre expansions. The study of spherical means has a very long history. The classic work of F. John deals with various applications of the spherical means to the theory of partial differential equations. They entered Fourier analysis with the celebrated theorem of E. Stein on spherical analogue of the Lebesgue differentiation theorem. Ever since they have appcared again and again in several areas of analysis like integral geometry, inversion of Fourier transforms and related arcas.

The Fixed Point Index As A Local Lefschetz Number., Neeta Pandey Dr.

Doctoral Theses

In this thesis we defitne a class of self maps of connected compact polyhodza - those which prmserve erpanding directions - and define the fixed point indices of such maps at an isolated set of fixed points of the map as a local Lefschets rumber. Our definition uses simplicial approximations of the given map in the spirit of O Nell (I19| and Fournier (71) and is intrinsic so that it is computable.Let X be a connected compact polyhedron and f:X→ X be a map an X. The Lefscheta number L() of / is then defined to be ([13]),L) -E(-1)jTrace {, …

On Cvt Minimization In Single Machine Scheduling., D. K. Manna Dr.

Doctoral Theses

Scheduling problens are quite common in real life. They arise whenever there is a need to plan execution of various tasks over time and therefore they play very important roles in commercial set-ups concerning manufacturing or service in the optimal use of resources and/or customers satisfaction. The theory of scheduling deals with the construction of suitable models and their analyses. Researchersattention was drawn to the study of scheduling problems using mathematical modeling, probably for the first time when Johnson (1954] published his famous work on flowshop problem. Since then, the study of scheduling problem and its context has gradually attracted …

Fourier Transforms Of Very Rapidly Decreasing Functions On Certain Lie Groups., M. Sundari Dr.

Doctoral Theses

Recall that for a function f ϵ L1(Rn ), its Fourier transform fÌ‚ is definedby: fÌ‚ (ƹ) = ʃ Rnf(x)ei(ƹ,x)dx ( 0.1.1)where (.,.) denotes the standard inner product on Rn and dr the Lebesgue measure on Rn. A celebrated theorem of L. Schwartz asserts that a function f on Rn is rapidly decreasing (or in the Schwartz class ) if and only if its Fourier transform is rapidly decreasing . In sharp contrast to Schwartz s theorem, is a result due to Hardy ([18) which says that ʃ and fÌ‚ cannot both be very rapidly decreasing . More precisely, if …

Recurrence And Transience Of Reflecting Diffusions., S. Balaji Dr.

Doctoral Theses

An attempt to obtain conditions for certain stability properties of reflecting diffusions in unbounded domains with boundary has been made in this thesis. For diffusions in R', such stability properties like recurrence, transience and positive recurrence have been studied extensively; see Bhattacharya (1978), Kliemann (1987), Pinsky (1987). One might see Pinsky (1995) for an up-to-date review of kuown methods and results in this all case. (For corresponding recurrence classification results on Markov chains using martin- gale ideas based on stoxchastic analogues of Lyapunov functions, see Meyn and Tweedie (1993a), (1993b) and the references given therein). The main concern in this …

Peak-To-Mean Power Control And Error Correction For Ofdm Transmission Using Golay Sequences And Reed-Muller Codes, James A. Davis, J Jedwab

Department of Math & Statistics Faculty Publications

A coding scheme for OFDM transmission is proposed, exploiting a previously unrecognised connection between pairs of Golay complementary sequences and second-order Reed-Muller codes. The scheme solves the notorious problem of power control in OFDM systems by maintaining a peak-to-mean envelope power ratio of at most 3dB while allowing simple encoding and decoding at high code rates for binary, quaternary or higher-phase signalling together with good error correction.

Generalized Conjugacy Classes, Pramod N. Achar

Mathematical Sciences Technical Reports (MSTR)

Generalized conjugation is the action of a group on its underlying set given by (g,x) -> p(g)xg^-1, where p is some fixed endomorphism of G. Here we study combinatorial properties of the sizes of the orbits of the preceding action. In particular, we reduce the problem to a simpler case if p has nontrivial kernel, or if it is an inner automorphism, and we give a construction that allows a partial analysis in the general case.

Absorption Processes: Models For Q-Identities, Don Rawlings

Mathematics

Several extensions of Blomqvist's absorption process are presented. Inherent in some of the associated distributions is a method for establishingq-identities ranging from properties of Gaussian polynomials to product expansions of basic hypergeometric series to extensions of results on Mahonian statistics. One process links the comajor index to Russian roulette. Also given are examples involving the Rogers–Ramanujan identities that demonstrate howq-expressions may be modeled with absorption processes.

On A Proximal Point Method For Optimization In Banach Spaces, Alfredo N. Iusem, Dan Butnariu

Mathematics Technical Papers - Archive

We analyze the behavior of a parallel proximal point method for solving convex optimization problems in reflexive Banach spaces. Similar algorithms were known to converge under the implicit assumption that the norm of the space is Hilbertian. We extend the area of applicability of the proximal point method to solving convex optimization problems in Banach spaces on which totally convex functions can be found. This includes the class of all smooth uniformly convex Banach spaces. Also, our convergence results leave more flexibility for the choice of the penalty function involved in the algorithm and, in this way, allow simplification of …

On Power Bounded Operators., Eugen J. Ionascu

Faculty Bibliography

In this paper we generalize the following consequence of a wellknown result of Nagy: if T and T −1 are power bounded operators, then T is a polynomially bounded operator.

Random Processes With Convex Coordinates On Triangular Graphs, J. N. Boyd, P. N. Raychowdhury

Mathematics and Applied Mathematics Publications

Probabilities for reaching specified destinations and expectation values for lengths for random walks on triangular arrays of points and edges are computed. Probabilities and expectation values are given as functions of the convex (barycentric) coordinates of the starting point.

Elimination Of Supply Harmonics, Stephen L. Clark, P. Famouri, W. L. Cooley

Mathematics and Statistics Faculty Research & Creative Works

The price of the extensive use of power electronic devices is becoming clear: increasing harmonic "pollution." The greater amount of harmonics being introduced into power distribution systems is of concern to both power consumers and power companies. First, a brief look is taken at background information which describes harmonic sources, effects, and characteristics. Then the evolution of the harmonics elimination approaches of current compensation and active filtering are discussed to give some insight into the directions that research is taking.

On The Behavior Of The Solutions Of The Navier-Stokes Equations At Vanishing Viscosity, Roger Temam, Xiaoming Wang

Mathematics and Statistics Faculty Research & Creative Works

In this article we establish partial results concerning the convergence of the solutions of the Navier-Stokes equations to that of the Euler equations. Namely, we prove convergence on any finite interval of time, in space dimension two, under a physically reasonable assumption. We consider the flow in a channel or the flow in a general bounded domain.

Time Averaged Energy Dissipation Rate For Shear Driven Flows In ℝⁿ, Xiaoming Wang

Mathematics and Statistics Faculty Research & Creative Works

We drive an upper bound of the time averaged energy dissipation rate for boundary driven flows directly from the Navier-Stokes equations in ℝⁿ. the upper bound is independent of the kinematic viscosity in accordance with Kolomogorov's scaling result. Copyright © 1997 Elsevier Science B.V. All rights reserved.

Disconjugacy And Transformations For Symplectic Systems, Martin Bohner, Ondřej Došlý

Mathematics and Statistics Faculty Research & Creative Works

We examine transformations and diconjugacy for general symplectic systems which include as special cases linear Hamiltonian difference systems and Sturm-Liouville difference equations of higher order. We give a Reid roundabout theorem for these systems and also for reciprocal symplectic systems. Particularly, we investigate a connection between eventual disconjugacy of linear Hamiltonian difference systems and their reciprocals. Finally, we present a dinsconjugacy-preserving transformation of a Sturm-Liouville equation of higher order which transforms this equation into another one of the same order.

Combinatorics Of Open Covers (Iii): Games, CP(X), Marion Scheepers

Mathematics Faculty Publications and Presentations

Some of the covering properties of spaces as defined in Parts I and II are here characterized by games. These results, applied to function spaces C_p(X) of countable tightness, give new characterizations of countable fan tightness and countable strong fan tightness. In particular, each of these properties is characterized by a Ramseyan theorem.

The Use Of Prime Numbers As An Effective Method Of Cryptology, Joshua Flynn

Honors Theses, 1963-2015

With the increasing amount of information transmitted over networks, there is a need to be able to keep this information from falling into the wrong hands. The method that has been used for the past couple of decades is that of cryptography. This paper gives an explanation of cryptography, as well as different alogorithms that are used to solve the problem. One unique thing about a couple of the algorithms is that they use properties provided by prime numbers. In particular, the RSA model, invented by Rivest, Shamir and Adelman, is one model which utilizes the theory that it is …

A Boundary Value Problem For A System Of Ordinary Differential Equations With Impulse Effects, Paul W. Eloe, Johnny Henderson

Mathematics Faculty Publications

A two-point boundary value problem for a system of first-order ordinary differential equations with impulse effects is studied. The method of upper and lower solutions is employed to obtain the existence of a solution and a method of forced monotonicity is employed to obtain iterative improvement. The main result is illustrated with an application to the Liénard equation with periodic boundary conditions.

Differential Geometry Of Surfaces And Minimal Surfaces, James Joseph Duran

Theses Digitization Project

No abstract provided.