Discrete Mathematics and Combinatorics Commons^™

I Don't Play Chess: A Study Of Chess Piece Generating Polynomials, Stephen R. Skoch

Senior Independent Study Theses

This independent study examines counting problems of non-attacking rook, and non-attacking bishop placements. We examine boards for rook and bishop placement with restricted positions and varied dimensions. In this investigation, we discuss the general formula of a generating function for unrestricted, square bishop boards that relies on the Stirling numbers of the second kind. We discuss the maximum number of bishops we can place on a rectangular board, as well as a brief investigation of non-attacking rook placements on three-dimensional boards, drawing a connection to latin squares.

Domination Numbers Of Semi-Strong Products Of Graphs, Stephen R. Cheney

Theses and Dissertations

This thesis examines the domination number of the semi-strong product of two graphs G and H where both G and H are simple and connected graphs. The product has an edge set that is the union of the edge set of the direct product of G and H together with the cardinality of V(H), copies of G. Unlike the other more common products (Cartesian, direct and strong), the semi-strong product is neither commutative nor associative.

The semi-strong product is not supermultiplicative, so it does not satisfy a Vizing like conjecture. It is also not submultiplicative so it shares these two …

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 …

Graphs Of Classroom Networks, Rebecca Holliday

College of Graduate Studies: Theses & 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 …

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

College of Graduate Studies: Theses & 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.

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.

Special Type Of Topological Spaces Using [0, N), Florentin Smarandache, W.B Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of special type of topological spaces using the interval [0, n). They are very different from the usual topological spaces. Algebraic structure using the interval [0, n) have been systemically dealt by the authors. Now using those algebraic structures in this book authors introduce the notion of special type of topological spaces. Using the super subset interval semigroup special type of super interval topological spaces are built. Several interesting results in this direction are obtained. Next six types of topological spaces using subset interval pseudo ring semiring of type …

Mod Functions: A New Approach To Function Theory, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the notion of MOD functions are defined on MOD planes. This new concept of MOD functions behaves in a very different way. Even very simple functions like y = nx has several zeros in MOD planes where as they are nice single line graphs with only (0, 0) as the only zero. Further polynomials in MOD planes do not in general follows the usual or classical laws of differentiation or integration. Even finding roots of MOD polynomials happens to be very difficult as they do not follow the fundamental theorem of algebra, viz a nth degree polynomial …

Mod Planes: A New Dimension To Modulo Theory, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

In this book for the first time authors study mod planes using modulo intervals [0, m); 2 ≤ m ≤ ∞. These planes unlike the real plane have only one quadrant so the study is carried out in a compact space but infinite in dimension. We have given seven mod planes viz real mod planes (mod real plane) finite complex mod plane, neutrosophic mod plane, fuzzy mod plane, (or mod fuzzy plane), mod dual number plane, mod special dual like number plane and mod special quasi dual number plane. These mod planes unlike real plane or complex plane or neutrosophic …

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 …

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.

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 …

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.

Realizations Of Infinite Products, Ruelle Operators And Wavelet Filters, Daniel Alpay, Palle Jorgensen, Izchak Lewkowicz

Mathematics, Physics, and Computer Science Faculty Articles and Research

Using the system theory notion of state-space realization of matrix-valued rational functions, we describe the Ruelle operator associated with wavelet filters. The resulting realization of infinite products of rational functions have the following four features: 1) It is defined in an infinite-dimensional complex domain. 2) Starting with a realization of a single rational matrix-function M, we show that a resulting infinite product realization obtained from M takes the form of an (infinitedimensional) Toeplitz operator with the symbol that is a reflection of the initial realization for M. 3) Starting with a subclass of rational matrix functions, including scalar-valued ones corresponding …

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.

Wiener-Chaos Approach To Optimal Prediction, Daniel Alpay, Alon Kipnis

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this work we combine Wiener chaos expansion approach to study the dynamics of a stochastic system with the classical problem of the prediction of a Gaussian process based on part of its sample path. This is done by considering special bases for the Gaussian space G generated by the process, which allows us to obtain an orthogonal basis for the Fock space of G such that each basis element is either measurable or independent with respect to the given samples. This allows us to easily derive the chaos expansion of a random variable conditioned on part of the sample …

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 …

Domination Integrity Of Some Path Related Graphs, S. K. Vaidya, N. H. Shah

Applications and Applied Mathematics: An International Journal (AAM)

The stability of a communication network is one of the important parameters for network designers and users. A communication network can be considered to be highly vulnerable if the destruction of a few elements cause large damage and only few members are able to communicate. In a communication network several vulnerability measures like binding number, toughness, scattering number, integrity, tenacity, edge tenacity and rupture degree are used to determine the resistance of network to the disruption after the failure of certain nodes (vertices) or communication links (edges). Domination theory also provides a model to measure the vulnerability of a graph …

Private Out-Domination Number Of Generalized De Bruijn Digraphs, G. Marimuthu, B. Johnson

Applications and Applied Mathematics: An International Journal (AAM)

Dominating sets are widely applied in the design and efficient use of computer networks. They can be used to decide the placement of limited resources, so that every node has access to the resource through neighbouring node. The most efficient solution is one that avoids duplication of access to the resources. This more restricted version of minimum dominating set is called an private dominating set. A vertex v in a digraph D is called a private out-neighbor of the vertex u in S (subset of V(D)) if u is the only element in the intersection of in-neighborhood set of v …

Difference Cordial Labeling Of Graphs Obtained From Triangular Snakes, R. Ponraj, S. S. Narayanan

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, we investigate the difference cordial labeling behavior of corona of triangular snake with the graphs of order one and order two and also corona of alternative triangular snake with the graphs of order one and order two.

A Study Of Graphical Permutations, Jessica Thune

UNLV Theses, Dissertations, Professional Papers, and Capstones

A permutation π on a set of positive integers {a_1,a_2,...,a_n} is said to be graphical if there exists a graph containing exactly a_i vertices of degree (a_i) for each i. It has been shown that for positive integers with a_1

A Potential Foundation For Emergent Space-Time, Kevin H. Knuth, Newshaw Bahreyni

Physics Faculty Scholarship

We present a novel derivation of both the Minkowski metric and Lorentz transformations from the consistent quantification of a causally ordered set of events with respect to an embedded observer. Unlike past derivations, which have relied on assumptions such as the existence of a 4-dimensional manifold, symmetries of space-time, or the constant speed of light, we demonstrate that these now familiar mathematics can be derived as the unique means to consistently quantify a network of events. This suggests that space-time need not be physical, but instead the mathematics of space and time emerges as the unique way in which an …

The Lp Relaxation Orthogonal Array Polytope And Its Permutation Symmetries, Andrew J. Geyer, Dursun A. Bulutoglu, Steven J. Rosenberg

Faculty Publications

Symmetry plays a fundamental role in design of experiments. In particular, symmetries of factorial designs that preserve their statistical properties are exploited to find designs with the best statistical properties. By using a result proved by Rosenberg [6], the concept of the LP relaxation orthogonal array polytope is developed and studied. A complete characterization of the permutation symmetry group of this polytope is made. Also, this characterization is verified computationally for many cases. Finally, a proof is provided.

Physics: Rethinking The Foundations, Kevin H. Knuth

Physics Faculty Scholarship

Physics is traditionally conceived of as a set of laws that universally governs the behavior of physical systems. These laws, however they are decreed, are believed to govern the behavior of not only everything in the universe, but the form of the universe itself. However, this traditional concept of physics as a universal governance is at odds with our modern theories of quantum mechanics and relativity, which place the observer and information in a central role. In this talk, I aim to rethink the foundations and attempt to build physics from the bottom up based on a very simple foundational …

Fibonacci Number Of The Tadpole Graph, Joe Demaio, John Jacobson

Faculty Articles

In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2) and the Fibonacci number of the cycle graph Cn is the Lucas number Ln. The tadpole graph Tn,k is the graph created by concatenating Cn and Pk with an edge from any vertex of Cn to a pendant of Pk for integers n=3 and k=0. This paper establishes formulae and identities for the Fibonacci number of the tadpole graph …