Open Access. Powered by Scholars. Published by Universities.®

Discrete Mathematics and Combinatorics Commons

Open Access. Powered by Scholars. Published by Universities.®

1,316 Full-Text Articles 1,573 Authors 965,643 Downloads 126 Institutions

All Articles in Discrete Mathematics and Combinatorics

Faceted Search

1,316 full-text articles. Page 55 of 55.

Interval Linear Algebra, Florentin Smarandache, W.B. Vasantha Kandasamy 2010 University of New Mexico

Interval Linear Algebra, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

This Interval arithmetic or interval mathematics developed in 1950’s and 1960’s by mathematicians as an approach to putting bounds on rounding errors and measurement error in mathematical computations. However no proper interval algebraic structures have been defined or studies. In this book we for the first time introduce several types of interval linear algebras and study them. This structure has become indispensable for these concepts will find applications in numerical optimization and validation of structural designs. In this book we use only special types of intervals and introduce the notion of different types of interval linear algebras and interval vector …


Rank Distance Bicodes And Their Generalization, Florentin Smarandache, W.B. Vasantha Kandasamy, N. Suresh Babu, R.S. Selvaraj 2010 University of New Mexico

Rank Distance Bicodes And Their Generalization, Florentin Smarandache, W.B. Vasantha Kandasamy, N. Suresh Babu, R.S. Selvaraj

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors introduce the new notion of rank distance bicodes and generalize this concept to Rank Distance n-codes (RD n-codes), n, greater than or equal to three. This definition leads to several classes of new RD bicodes like semi circulant rank bicodes of type I and II, semicyclic circulant rank bicode, circulant rank bicodes, bidivisible bicode and so on. It is important to mention that these new classes of codes will not only multitask simultaneously but also they will be best suited to the present computerised era. Apart from this, these codes are best suited in cryptography. …


Interval Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy, Moon Kumar Chetry 2010 University of New Mexico

Interval Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy, Moon Kumar Chetry

Branch Mathematics and Statistics Faculty and Staff Publications

This book introduces several new classes of groupoid, like polynomial groupoids, matrix groupoids, interval groupoids, polynomial interval groupoids, matrix interval groupoids and their neutrosophic analogues.


On The Characteristics Of A Class Of Gaussian Processes Within The White Noise Space Setting, Daniel Alpay, Haim Attia, David Levanony 2010 Chapman University

On The Characteristics Of A Class Of Gaussian Processes Within The White Noise Space Setting, Daniel Alpay, Haim Attia, David Levanony

Mathematics, Physics, and Computer Science Faculty Articles and Research

Using the white noise space framework, we define a class of stochastic processes which include as a particular case the fractional Brownian motion and its derivative. The covariance functions of these processes are of a special form, studied by Schoenberg, von Neumann and Krein.


Discrete-Time Multi-Scale Systems, Daniel Alpay, Mamadou Mboup 2010 Chapman University

Discrete-Time Multi-Scale Systems, Daniel Alpay, Mamadou Mboup

Mathematics, Physics, and Computer Science Faculty Articles and Research

We introduce multi-scale filtering by the way of certain double convolution systems. We prove stability theorems for these systems and make connections with function theory in the poly-disc. Finally, we compare the framework developed here with the white noise space framework, within which a similar class of double convolution systems has been defined earlier.


Linear Stochastic State Space Theory In The White Noise Space Setting, Daniel Alpay, David Levanony, Ariel Pinhas 2010 Chapman University

Linear Stochastic State Space Theory In The White Noise Space Setting, Daniel Alpay, David Levanony, Ariel Pinhas

Mathematics, Physics, and Computer Science Faculty Articles and Research

We study state space equations within the white noise space setting. A commutative ring of power series in a countable number of variables plays an important role. Transfer functions are rational functions with coefficients in this commutative ring, and are characterized in a number of ways. A major feature in our approach is the observation that key characteristics of a linear, time invariant, stochastic system are determined by the corresponding characteristics associated with the deterministic part of the system, namely its average behavior.


Linear Stochastic Systems: A White Noise Approach, Daniel Alpay, David Levanony 2010 Chapman University

Linear Stochastic Systems: A White Noise Approach, Daniel Alpay, David Levanony

Mathematics, Physics, and Computer Science Faculty Articles and Research

Using the white noise setting, in particular the Wick product, the Hermite transform, and the Kondratiev space, we present a new approach to study linear stochastic systems, where randomness is also included in the transfer function. We prove BIBO type stability theorems for these systems, both in the discrete and continuous time cases. We also consider the case of dissipative systems for both discrete and continuous time systems. We further study ℓ1-ℓ2 stability in the discrete time case, and L2-L∞ stability in the continuous time case.


On Self-Clique Graphs., Ong Poh Hwa 2010 Universiti Malaya

On Self-Clique Graphs., Ong Poh Hwa

Student Works (2010-2019)

The clique graph of a graph G is the graph obtained by taking the cliques of G as vertices, and two vertices are adjacent if and only if the corresponding cliques have non-empty intersection. A graph G is self-clique if it is isomorphic to its clique graph. Clique graphs have been studied for some time. However, not much is known about self-clique graphs. Self-clique graphs were ¯rst introduced and studied by Escalante [Abh. Math. Sem. Univ. Hamburg 39 (1973) 59-68]. Since then, self-clique graphs have been characterized for some classes of graphs. Chia [Discrete Math. 212 (2000) 185-189] gave a …


Digital Commons powered by bepress