Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Algebra (13)
- Logic and Foundations (8)
- Applied Mathematics (6)
- Number Theory (6)
- Other Mathematics (6)
-
- Set Theory (6)
- Algebraic Geometry (5)
- Analysis (5)
- Computer Sciences (3)
- Engineering (2)
- Geometry and Topology (2)
- Information Security (2)
- Other Applied Mathematics (2)
- Other Physics (2)
- Physics (2)
- Computer Engineering (1)
- Control Theory (1)
- Data Storage Systems (1)
- Dynamical Systems (1)
- Elementary Particles and Fields and String Theory (1)
- Operational Research (1)
- Operations Research, Systems Engineering and Industrial Engineering (1)
- Other Computer Engineering (1)
- Probability (1)
- Quantum Physics (1)
- Statistics and Probability (1)
- Institution
-
- University of New Mexico (8)
- Claremont Colleges (5)
- Georgia Southern University (4)
- Prairie View A&M University (4)
- Chapman University (3)
-
- San Jose State University (3)
- East Tennessee State University (2)
- Portland State University (2)
- Rose-Hulman Institute of Technology (2)
- University at Albany, State University of New York (2)
- University of Nebraska - Lincoln (2)
- Air Force Institute of Technology (1)
- Bucknell University (1)
- California State University, San Bernardino (1)
- Kennesaw State University (1)
- Loyola Marymount University and Loyola Law School (1)
- Marshall University (1)
- The University of Southern Mississippi (1)
- University of Connecticut (1)
- University of Kentucky (1)
- University of Nevada, Las Vegas (1)
- Keyword
-
- Neutrosophic logic (7)
- Algebra (4)
- Combinatorics (3)
- Algebraic structures (2)
- Cycles (2)
-
- Discrete exponential (2)
- Discrete logarithm (2)
- Dynamic coloring (2)
- Fixed points (2)
- Graph theory (2)
- Hensel's lemma (2)
- P-adic interpolation (2)
- Partially-ordered sets (2)
- Permutations (2)
- Welch equation (2)
- 05A05 (1)
- 05B15 (1)
- 05C21 (1)
- 05C99 Graph theory (1)
- 11D07 The Frobenius problem (1)
- 14T05 Tropical geometry (1)
- 52B15 (1)
- 60C05 (1)
- 90C35 (1)
- 94C15 (1)
- Anti-Ramsey (1)
- Applications of graph theory (1)
- Bipartite (1)
- Bipartite graphs (1)
- Boij-Söderberg Decomposition (1)
- Publication
-
- Branch Mathematics and Statistics Faculty and Staff Publications (8)
- Faculty Publications (5)
- Applications and Applied Mathematics: An International Journal (AAM) (4)
- HMC Senior Theses (4)
- Mathematics, Physics, and Computer Science Faculty Articles and Research (3)
-
- Theory & Applications of Graphs (3)
- Department of Mathematics: Dissertations, Theses, and Student Research (2)
- Electronic Theses and Dissertations (2)
- Mathematics and Statistics Faculty Publications and Presentations (2)
- Physics Faculty Scholarship (2)
- College of Graduate Studies: Theses & Dissertations (1)
- Electronic Theses, Projects, and Dissertations (1)
- Faculty Articles (1)
- Faculty Journal Articles (1)
- Honors Scholar Theses (1)
- Journal of Humanistic Mathematics (1)
- Mathematical Sciences Technical Reports (MSTR) (1)
- Mathematics Faculty Research (1)
- Mathematics, Statistics and Data Science Faculty Works (1)
- Rose-Hulman Undergraduate Research Publications (1)
- Theses and Dissertations--Mathematics (1)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (1)
- Publication Type
Articles 31 - 47 of 47
Full-Text Articles in Discrete Mathematics and Combinatorics
Special Pseudo Linear Algebras Using [0,N), Florentin Smarandache, W.B. Vasantha Kandasamy
Special Pseudo Linear Algebras Using [0,N), Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book we introduce some special type of linear algebras called pseudo special linear algebras using the interval [0, n). These new types of special pseudo interval linear algebras has several interesting properties. Special pseudo interval linear algebras are built over the subfields in Zn where Zn is a S-ring. We study the substructures of them. The notion of Smarandache special interval pseudo linear algebras and Smarandache strong special pseudo interval linear algebras are introduced. The former Sspecial interval pseudo linear algebras are built over the Sring itself. Study in this direction has yielded several interesting results. S-strong special …
Groupoids Of Type I And Ii Using [0, N), Florentin Smarandache, W.B. Vasantha Kandasamy
Groupoids Of Type I And Ii Using [0, N), Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
Study of algebraic structures built using [0, n) happens to be one of an interesting and innovative research. Here in this book authors define non associative algebraic structures using the interval [0, n). Here we define two types of groupoids using [0, n) both of them are of infinite order. It is an open conjecture to find whether these new class of groupoids satisfy any of the special identities like Moufang identity or Bol identity or Bruck identity or so on. We know on [0, n) we cannot build rings only pseudo rings, however in this book we use these …
Algebraic Structures On Finite Complex Modulo Integer Interval C([0, N)), Florentin Smarandache, W.B. Vasantha Kandasamy
Algebraic Structures On Finite Complex Modulo Integer Interval C([0, N)), Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors introduce the notion of finite complex modulo integer intervals. Finite complex modulo integers was introduced by the authors in 2011. Now using this finite complex modulo integer intervals several algebraic structures are built. Further the concept of finite complex modulo integers itself happens to be new and innovative for in case of finite complex modulo integers the square value of the finite complex number varies with varying n of Zn. In case of finite complex modulo integer intervals also we can have only pseudo ring as the distributive law is not true, in general in C([0, …
Soft Neutrosophic Algebraic Structures And Their Generalization - Vol. 1, Florentin Smarandache, Mumtaz Ali, Muhammad Shabir
Soft Neutrosophic Algebraic Structures And Their Generalization - Vol. 1, Florentin Smarandache, Mumtaz Ali, Muhammad Shabir
Branch Mathematics and Statistics Faculty and Staff Publications
In this book the authors introduced the notions of soft neutrosophic algebraic structures. These soft neutrosophic algebraic structures are basically defined over the neutrosophic algebraic structures which means a parameterized collection of subsets of the neutrosophic algebraic structure. For instance, the existence of a soft neutrosophic group over a neutrosophic group or a soft neutrosophic semigroup over a neutrosophic semigroup, or a soft neutrosophic field over a neutrosophic field, or a soft neutrosophic LA-semigroup over a neutrosophic LAsemigroup, or a soft neutosophic loop over a neutrosophic loop. It is interesting to note that these notions are defined over finite and …
Pseudo Lattice Graphs And Their Applications To Fuzzy And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Pseudo Lattice Graphs And Their Applications To Fuzzy And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
In this book for the first time authors introduce the concept of merged lattice, which gives a lattice or a graph. The resultant lattice or graph is defined as the pseudo lattice graph of type I. Here we also merge a graph with a lattice or two or more graphs which call as the pseudo lattice graph of type II. We merge either edges or vertices or both of a lattice and a graph or a lattice and a lattice or graph with itself. Such study is innovative and these mergings are adopted on all fuzzy and neutrosophic models which …
Distance In Matrices And Their Applications To Fuzzy Models And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Distance In Matrices And Their Applications To Fuzzy Models And Neutrosophic Models, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time introduce the notion of distance between any two m n matrices. If the distance is 0 or m n there is nothing interesting. When the distance happens to be a value t; 0 < t < m n the study is both innovating and interesting. The three cases of study which is carried out in this book are 1. If the difference between two square matrices is large, will it imply the eigen values and eigen vectors of those matrices are distinct? Several open conjectures in this direction are given. 2. The difference between parity check matrix and the generator matrix for the same C(n, k) code is studied. This will help in detecting errors in storage systems as well as in cryptography.
Interpolation By Polynomials With Symmetries, Daniel Alpay, Izchak Lewkowicz
Interpolation By Polynomials With Symmetries, Daniel Alpay, Izchak Lewkowicz
Mathematics, Physics, and Computer Science Faculty Articles and Research
We here specialize the standard matrix-valued polynomial interpolation to the case where on the imaginary axis the interpolating polynomials admit various symmetries: Positive semidefinite, Skew-Hermitian, J- Hermitian, Hamiltonian and others.
The procedure is comprized of three stages, illustrated through the case where on $i\R$ the interpolating polynomials are to be positive semidefinite. We first, on the expense of doubling the degree, obtain a minimal degree interpolating polynomial P(s) which on $i\R$ is Hermitian. Then we find all polynomials Ψ(s), vanishing at the interpolation points which are positive semidefinite on $i\R$. Finally, using the fact that the set of positive semidefinite …
On Free Stochastic Processes And Their Derivatives, Daniel Alpay, Palle Jorgensen, Guy Salomon
On Free Stochastic Processes And Their Derivatives, Daniel Alpay, Palle Jorgensen, Guy Salomon
Mathematics, Physics, and Computer Science Faculty Articles and Research
We study a family of free stochastic processes whose covariance kernels K may be derived as a transform of a tempered measure σ. These processes arise, for example, in consideration non-commutative analysis involving free probability. Hence our use of semi-circle distributions, as opposed to Gaussians. In this setting we find an orthonormal bases in the corresponding noncommutative L2 of sample-space. We define a stochastic integral for our family of free processes.
Krein-Langer Factorization And Related Topics In The Slice Hyperholomorphic Setting, Daniel Alpay, Fabrizio Colombo, Irene Sabadini
Krein-Langer Factorization And Related Topics In The Slice Hyperholomorphic Setting, Daniel Alpay, Fabrizio Colombo, Irene Sabadini
Mathematics, Physics, and Computer Science Faculty Articles and Research
We study various aspects of Schur analysis in the slice hyperholomorphic setting. We present two sets of results: first, we give new results on the functional calculus for slice hyperholomorphic functions. In particular, we introduce and study some properties of the Riesz projectors. Then we prove a Beurling-Lax type theorem, the so-called structure theorem. A crucial fact which allows to prove our results, is the fact that the right spectrum of a quaternionic linear operator and the point S-spectrum coincide. Finally, we study the Krein-Langer factorization for slice hyperholomorphic generalized Schur functions. Both the Beurling-Lax type theorem and the Krein-Langer …
Algebraic Structures On Fuzzy Unit Square And Neutrosophic Unit Square, Florentin Smarandache, W.B. Vasantha Kandasamy
Algebraic Structures On Fuzzy Unit Square And Neutrosophic Unit Square, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors build algebraic structures on fuzzy unit semi open square UF = {(a, b) | a, b [0, 1)} and on the fuzzy neutrosophic unit semi open square UN = {a + bI | a, b [0, 1)}. This study is new and we define, develop and describe several interesting and innovative theories about them. We cannot build ring on UN or UF. We have only pseudo rings of infinite order. We also build pseudo semirings using these semi open unit squares. We construct vector spaces, S-vector spaces and strong pseudo special vector space using …
Rainbow Generalizations Of Ramsey Theory - A Dynamic Survey, Shinya Fujita, Colton Magnant, Yaping Mao, Kenta Ozeki
Rainbow Generalizations Of Ramsey Theory - A Dynamic Survey, Shinya Fujita, Colton Magnant, Yaping Mao, Kenta Ozeki
Theory & Applications of Graphs
In this work, we collect Ramsey-type results concerning rainbow edge colorings of graphs.
Note On Rainbow Connection In Oriented Graphs With Diameter 2, Rebecca Holliday, Colton Magnant, Pouria Salehi Nowbandegani
Note On Rainbow Connection In Oriented Graphs With Diameter 2, Rebecca Holliday, Colton Magnant, Pouria Salehi Nowbandegani
Theory & Applications of Graphs
In this note, we provide a sharp upper bound on the rainbow connection number of tournaments of diameter 2. For a tournament Τ of diameter 2, we show 2 ≤ → rc (Τ) ≤ 3. Furthermore, we provide a general upper bound on the rainbow κ-connection number of tournaments as a simple example of the probabilistic method. Finally, we show that an edge-colored tournament of κthdiameter 2 has rainbow κ-connection number at most approximately κ2.
Comparing Skew Schur Functions: A Quasisymmetric Perspective, Peter R. W. Mcnamara
Comparing Skew Schur Functions: A Quasisymmetric Perspective, Peter R. W. Mcnamara
Faculty Journal Articles
Reiner, Shaw and van Willigenburg showed that if two skew Schur functions sA and sB are equal, then the skew shapes $A$ and $B$ must have the same "row overlap partitions." Here we show that these row overlap equalities are also implied by a much weaker condition than Schur equality: that sA and sB have the same support when expanded in the fundamental quasisymmetric basis F. Surprisingly, there is significant evidence supporting a conjecture that the converse is also true.
In fact, we work in terms of inequalities, showing that if the F-support of sA …
On The Dynamic Coloring Of Strongly Regular Graphs, Saieed Akbari, Maryam Ghanbari, Sogol Jahanbekam
On The Dynamic Coloring Of Strongly Regular Graphs, Saieed Akbari, Maryam Ghanbari, Sogol Jahanbekam
Faculty Publications
No abstract provided.
Precise Partitions Of Large Graphs, Pouria Salehi Nowbandegani
Precise Partitions Of Large Graphs, Pouria Salehi Nowbandegani
College of Graduate Studies: Theses & Dissertations
First by using an easy application of the Regularity Lemma, we extend some known results about cycles of many lengths to include a specified edge on the cycles. The results in this chapter will help us in rest of this thesis. In 2000, Enomoto and Ota posed a conjecture on the existence of path decomposition of graphs with fixed start vertices and fixed lengths. We prove this conjecture when |G| is large. Our proof uses the Regularity Lemma along with several extremal lemmas, concluding with an absorbing argument to retrieve misbehaving vertices. Furthermore, sharp minimum degree and degree sum conditions …
Regularity Of Mediatrices In Surfaces, Pilar Herreros, Mario Ponce, J. J. P. Veerman
Regularity Of Mediatrices In Surfaces, Pilar Herreros, Mario Ponce, J. J. P. Veerman
Mathematics and Statistics Faculty Publications and Presentations
For distinct points p and q in a two-dimensional Riemannian manifold, one defines their mediatrix Lpq as the set of equidistant points to p and q. It is known that mediatrices have a cell decomposition consisting of a finite number of branch points connected by Lipschitz curves. This paper establishes additional geometric regularity properties of mediatrices. We show that mediatrices have the radial linearizability property, which implies that at each point they have a geometrically defined derivative in the branching directions. Also, we study the particular case of mediatrices on spheres, by showing that they are Lipschitz simple closed curves …
Hamiltonicity And Sigma-Hypergraphs, Christina Zarb
Hamiltonicity And Sigma-Hypergraphs, Christina Zarb
Theory & Applications of Graphs
We define and study a special type of hypergraph. A σ-hypergraph Η= Η(n,r,q |σ), where σ is a partition of r, is an r-uniform hypergraph having nq vertices partitioned into n classes of q vertices each. If the classes are denoted by V1, V2,...,Vn, then a subset Κ of V(Η) of size r is an edge if the partition of r formed by the non-zero cardinalities |Κ ∩ Vi |, 1 ≤ i ≤ n, is σ. The non-empty intersections Κ ∩ Vi are called the parts of Κ, and s(σ) …