Mathematics Commons^™

Mod Pseudo Linear Algebras, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time elaborately study the notion of MOD vector spaces and MOD pseudo linear algebras. This study is new, innovative and leaves several open conjectures. In the first place as distributive law is not true we can define only MOD pseudo linear algebras. Secondly most of the classical theorems true in case of linear algebras are not true in case of MOD pseudo linear algebras. Finding even eigen values and eigen vectors happens to be a challenging problem. Further the notion of multidimensional MOD pseudo linear algebras are defined using the notion of MOD …

Multidimensional Mod Planes, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors name the interval [0, m); 2 ≤ m ≤ ∞ as mod interval. We have studied several properties about them but only here on wards in this book and forthcoming books the interval [0, m) will be termed as the mod real interval, [0, m)I as mod neutrosophic interval, [0,m)g; g2 = 0 as mod dual number interval, [0, m)h; h2 = h as mod special dual like number interval and [0, m)k, k2 = (m − 1) k as mod special quasi dual number interval. However there is only one real interval (∞, ∞) but …

Fuzzy Abel Grassmann Groupoids, Florentin Smarandache, Madad Khan, Tariq Aziz

Branch Mathematics and Statistics Faculty and Staff Publications

Usually the models of real world problems in almost all disciplines like engineering, medical sciences, mathematics, physics, computer science, management sciences, operations research and articial intelligence are mostly full of complexities and consist of several types of uncertainties while dealing them in several occasion. To overcome these di¢ culties of uncertainties, many theories have been developed such as rough sets theory, probability theory, fuzzy sets theory, theory of vague sets, theory of soft ideals and the theory of intuitionistic fuzzy sets, theory of neutrosophic sets, Dezert-Smarandache Theory (DSmT), etc. Zadeh introduced the degree of membership/truth (t) in 1965 and dened …

Theory Of Abel Grassmann's Groupoids, Florentin Smarandache, Madad Khan

Branch Mathematics and Statistics Faculty and Staff Publications

It is common knowledge that common models with their limited boundaries of truth and falsehood are not su¢ cient to detect the reality so there is a need to discover other systems which are able to address the daily life problems. In every branch of science problems arise which abound with uncertainties and impaction. Some of these problems are related to human life, some others are subjective while others are objective and classical methods are not su¢ cient to solve such problems because they can not handle various ambiguities involved. To overcome this problem, Zadeh [67] introduced the concept of …

Coloring The Square Of Planar Graphs Without 4-Cycles Or 5-Cycles, Robert Jaeger

Theses and Dissertations

The famous Four Color Theorem states that any planar graph can be properly colored using at most four colors. However, if we want to properly color the square of a planar graph (or alternatively, color the graph using distinct colors on vertices at distance up to two from each other), we will always require at least \Delta + 1 colors, where \Delta is the maximum degree in the graph. For all \Delta, Wegner constructed planar graphs (even without 3-cycles) that require about \frac{3}{2} \Delta colors for such a coloring.

To prove a stronger upper bound, we consider only planar graphs …

Polyhedral Problems In Combinatorial Convex Geometry, Liam Solus

Theses and Dissertations--Mathematics

In this dissertation, we exhibit two instances of polyhedra in combinatorial convex geometry. The first instance arises in the context of Ehrhart theory, and the polyhedra are the central objects of study. The second instance arises in algebraic statistics, and the polyhedra act as a conduit through which we study a nonpolyhedral problem.

In the first case, we examine combinatorial and algebraic properties of the Ehrhart h*-polynomial of the r-stable (n,k)-hypersimplices. These are a family of polytopes which form a nested chain of subpolytopes within the (n,k)-hypersimplex. We show that a well-studied unimodular triangulation of the (n,k)-hypersimplex restricts to a …

Bounds For The Zero Forcing Number Of Graphs With Large Girth, Randy Davila, Franklin Kenter

Theory and Applications of Graphs

The zero-forcing number, Ζ(G) is an upper bound for the maximum nullity of all symmetric matrices with a sparsity pattern described by the graph. A simple lower bound is δ ≤ Ζ(G) where δ is the minimum degree. An improvement of this bound is provided in the case that G has girth of at least 5. In particular, it is shown that 2δ − 2 ≤ Ζ(G) for graphs with girth of at least 5; this can be further improved when G has a small cut set. Lastly, a conjecture is made regarding a lower bound for Ζ(G) as a …

Self-Mappings Of The Quaternionic Unit Ball: Multiplier Properties, Schwarz-Pick Inequality, And Nevanlinna-Pick Interpolation Problem, Daniel Alpay, Vladimir Bolotnikov, Fabrizio Colombo, Irene Sabadini, Fabrizio Colombo

Mathematics, Physics, and Computer Science Faculty Articles and Research

We study several aspects concerning slice regular functions mapping the quaternionic open unit ball B into itself. We characterize these functions in terms of their Taylor coefficients at the origin and identify them as contractive multipliers of the Hardy space H2(B). In addition, we formulate and solve the Nevanlinna-Pick interpolation problem in the class of such functions presenting necessary and sufficient conditions for the existence and for the uniqueness of a solution. Finally, we describe all solutions to the problem in the indeterminate case.

An Extension Of Herglotz's Theorem To The Quaternions, Daniel Alpay, Fabrizio Colombo, David P. Kimsey, Irene Sabadini, David P. Kimsey

Mathematics, Physics, and Computer Science Faculty Articles and Research

A classical theorem of Herglotz states that a function n↦r(n) from Z into Cs×s is positive definite if and only there exists a Cs×s-valued positive measure dμ on [0,2π] such that r(n)=∫2π0eintdμ(t)for n∈Z. We prove a quaternionic analogue of this result when the function is allowed to have a number of negative squares. A key tool in the argument is the theory of slice hyperholomorphic functions, and the representation of such functions which have a positive real part in the unit ball of the quaternions. We study in great detail the case of positive definite functions.

Boundary Interpolation For Slice Hyperholomorphic Schur Functions, Khaled Abu-Ghanem, Daniel Alpay, Fabrizio Colombo, David P. Kimsey, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

A boundary Nevanlinna-Pick interpolation problem is posed and solved in the quaternionic setting. Given nonnegative real numbers κ1,…,κN, quaternions p1,…,pN all of modulus 1, so that the 2-spheres determined by each point do not intersect and pu≠1 for u=1,…,N, and quaternions s1,…,sN, we wish to find a slice hyperholomorphic Schur function s so that
limr→1r∈(0,1)s(rpu)=suforu=1,…,N,
and
limr→1r∈(0,1)1−s(rpu)su¯¯¯¯¯1−r≤κu,foru=1,…,N.
Our arguments relies on the theory of slice hyperholomorphic functions and reproducing kernel Hilbert spaces.

A New Resolvent Equation For The S-Functional Calculus, Daniel Alpay, Fabrizio Colombo, Jonathan Gantner, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

The S-functional calculus is a functional calculus for (n + 1)-tuples of non necessarily commuting operators that can be considered a higher dimensional version of the classical Riesz-Dunford functional calculus for a single operator. In this last calculus, the resolvent equation plays an important role in the proof of several results. Associated with the S-functional calculus there are two resolvent operators: the left S−1 L (s, T ) and the right one S−1 R (s, T ), where s = (s0, s1, . . . , sn) ∈ Rn+1 and T = (T0, T1, . . . , Tn) is …

Infinite Product Representations For Kernels And Iteration Of Functions, Daniel Alpay, Palle Jorgensen, Izchak Lewkowicz, Itzik Marziano

Mathematics, Physics, and Computer Science Faculty Articles and Research

We study infinite products of reproducing kernels with view to their use in dynamics (of iterated function systems), in harmonic analysis, and in stochastic processes. On the way, we construct a new family of representations of the Cuntz relations. Then, using these representations we associate a fixed filled Julia set with a Hilbert space. This is based on analysis and conformal geometry of a fixed rational mapping R in one complex variable, and its iterations.

Inner Product Spaces And Krein Spaces In The Quaternionic Setting, Daniel Alpay, Fabrizio Colombo, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we provide a study of quaternionic inner product spaces. This includes ortho-complemented subspaces, fundamental decompositions as well as a number of results of topological nature. Our main purpose is to show that a closed uniformly positive subspace in a quaternionic Krein space is ortho-complemented, and this leads to our choice of the results presented in the paper.

Spectral Theory For Gaussian Processes: Reproducing Kernels, Random Functions, Boundaries, And L2-Wavelet Generators With Fractional Scales, Daniel Alpay

Mathematics, Physics, and Computer Science Faculty Articles and Research

A recurrent theme in functional analysis is the interplay between the theory of positive definite functions, and their reproducing kernels, on the one hand, and Gaussian stochastic processes, on the other. This central theme is motivated by a host of applications, e.g., in mathematical physics, and in stochastic differential equations, and their use in financial models. In this paper, we show that, for three classes of cases in the correspondence, it is possible to obtain explicit formulas which are amenable to computations of the respective Gaussian stochastic processes. For achieving this, we first develop two functional analytic tools. They are: …

An Isomorphism Problem In Z2, Matt Noble

Theory and Applications of Graphs

We consider Euclidean distance graphs with vertex set ℚ² or ℤ² and address the possibility or impossibility of finding isomorphisms between such graphs. It is observed that for any distances d₁, d₂ the non-trivial distance graphs G(ℚ², d₁) and G(ℚ², d₂) are isomorphic. Ultimately it is shown that for distinct primes _p1, _p2 the non-trivial distance graphs G(ℤ², √p1) and G(ℤ², √p2) are not isomorphic. We conclude with a few additional questions related to this work.

Second Hamiltonian Cycles In Claw-Free Graphs, Hossein Esfandiari, Colton Magnant, Pouria Salehi Nowbandegani, Shirdareh Haghighi

Theory and Applications of Graphs

Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four contains a second Hamiltonian cycle. We prove that most claw-free Hamiltonian graphs with minimum degree at least 3 have a second Hamiltonian cycle and describe the structure of those graphs not covered by our result. By this result, we show that Sheehan’s conjecture holds for claw-free graphs whose order is not divisible by 6. In addition, we believe that the structure that we introduce can be useful for further studies on claw-free graphs.

Connection And Separation In Hypergraphs, Mohammad A. Bahmanian, Mateja Sajna

Theory and Applications of Graphs

In this paper we study various fundamental connectivity properties of hypergraphs from a graph-theoretic perspective, with the emphasis on cut edges, cut vertices, and blocks. We prove a number of new results involving these concepts. In particular, we describe the exact relationship between the block decomposition of a hypergraph and the block decomposition of its incidence graph.

Properly Colored Notions Of Connectivity - A Dynamic Survey, Xueliang Li, Colton Magnant

Theory and Applications of Graphs

A path in an edge-colored graph is properly colored if no two consecutive edges receive the same color. In this survey, we gather results concerning notions of graph connectivity involving properly colored paths.

Dynamic Approach To K-Forcing, Yair Caro, Ryan Pepper

Theory and Applications of Graphs

The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we give a greedy algorithm to approximate the k-forcing number of a graph. Using this dynamic approach, we give corollaries which improve upon two theorems from a recent paper of Amos, Caro, Davila and Pepper [2], while also answering an open problem posed by Meyer [9].

Scheduling N Burgers For A K-Burger Grill: Chromatic Numbers With Restrictions, Peter Johnson, Xiaoya Zha

Theory and Applications of Graphs

The chromatic number has a well-known interpretation in the area of scheduling. If the vertices of a finite, simple graph are committees, and adjacency of two committees indicates that they must never be in session simultaneously, then the chromatic number of the graph is the smallest number of hours during which the committees/vertices of the graph may all have properly scheduled meetings of one continuous hour each. Slivnik [3] showed that the fractional chromatic number can be similarly characterized. In that characterization, the meetings are allowed to be broken into a finite number of disjoint intervals. Here we consider chromatic …

Decomposing The Blocks Of A Steiner Triple System Of Order 4v-3 Into Partial Parallel Classes Of Size V-1, Leah C. Tollefson

Dissertations, Master's Theses and Master's Reports

In this report we present a summary and our new results on finding partial parallel classes of uniform size of Steiner triple systems, STS(v). We show several results for STS(4v - 3), where v = 3 mod 12 and v = 9 mod 12. In Chapter 1 we provide background knowledge and introduce the problem. In Chapter 2 we discuss some important known results to the problem, introduce the needed ingredients, and explain the methodology of the construction. Finally, in Chapter 3, we conclude with a summary and discuss possibilities for future work.

On Algebras Which Are Inductive Limits Of Banach Spaces, Daniel Alpay, Guy Salomon

Mathematics, Physics, and Computer Science Faculty Articles and Research

We introduce algebras which are inductive limits of Banach spaces and carry inequalities which are counterparts of the inequality for the norm in a Banach algebra. We then define an associated Wiener algebra, and prove the corresponding version of the well-known Wiener theorem. Finally, we consider factorization theory in these algebra, and in particular, in the associated Wiener algebra.

Modeling Human Gaming Playing Behavior And Reward/Penalty Mechanism Using Discrete Event Simulation (Des), Christina M. Frederick, Michael Fitzgerald, Dahai Liu, Yolanda Ortiz, Christopher Via, Shawn Doherty, Jason P. Kring

Publications

Humans are remarkably complex and unpredictable; however, while predicting human behavior can be problematic, there are methods such as modeling and simulation that can be used to predict probable futures of human decisions. The present study analyzes the possibility of replacing human subjects with data resulting from pure models. Decisions made by college students in a multi-level mystery-solving game under 3 different gaming conditions are compared with the data collected from a predictive sequential Markov-Decision Process model. In addition, differences in participants’ data influenced by the three different conditions (additive, subtractive, control) were analyzed. The test results strongly suggest that …

Labeled Trees And Spanning Trees: Computational Discrete Mathematics And Applications, Demet Yalman

Electronic Theses and Dissertations

In this thesis, we examine two topics. In the first part, we consider Leech tree which is a tree of order n with positive integer edge weights such that the weighted distances between pairs of vertices are exactly from 1 to n choose 2. Only five Leech trees are known and some non-existence results have been presented through the years. Variations of Leech trees such as the minimal distinct distance trees and modular Leech trees have been considered in recent years. In this thesis, such Leech-type questions on distances between leaves are studied as well as some other labeling questions …

Combinatorial Game Theory: An Introduction To Tree Topplers, John S. Ryals Jr.

Electronic Theses and Dissertations

The purpose of this thesis is to introduce a new game, Tree Topplers, into the field of Combinatorial Game Theory. Before covering the actual material, a brief background of Combinatorial Game Theory is presented, including how to assign advantage values to combinatorial games, as well as information on another, related game known as Domineering. Please note that this document contains color images so please keep that in mind when printing.

Graphs Of Classroom Networks, Rebecca Holliday

Electronic Theses and Dissertations

In this work, we use the Havel-Hakimi algorithm to visualize data collected from students to investigate classroom networks. The Havel-Hakimi algorithm uses a recursive method to create a simple graph from a graphical degree sequence. In this case, the degree sequence is a representation of the students in a classroom, and we use the number of peers with whom a student studied or collaborated to determine the degree of each. We expand upon the Havel-Hakimi algorithm by coding a program in MATLAB that generates random graphs with the same degree sequence. Then, we run another algorithm to find the isomorphism …

Community Detection Detailed For Online Social Networks, Christopher J. Hogan

Theses and Dissertations (Comprehensive)

Ever since the internet became publicly available it has allowed users to interact with each other across virtual networks. With this large amounts of data being collected the clustering of this information has become an even more powerful tool for recognize patterns and trends in a network. In this research we look build a model for Community Detection in these online social networks. We combine the ideas from both discrete mathematics and sociology, to build an algorithm with the specific intent on discovering communities that exist in an online social network. We present many of the sociology theories behind the …

Modeling The Progress And Retention Of International Students Using Markov Chains, Lucas Gagne

Williams Honors College, Honors Research Projects

International students are a small and diverse student population present in any sizable American university. One of the greatest obstacles in their path is the acquisition of the English language. English for Academic Purposes (EAP) programs, such as the English Language Institute (ELI) at the University of Akron, attempt to address this problem. By studying how this student population progresses in their academic studies, EAP programs and their associated universities can make well-informed decisions on how best to serve their English Language Learners. One way to study International students is through the use of a Markov model based on university …