Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (8)
- Algebra (6)
- Geometry and Topology (4)
- Other Mathematics (4)
- Theory and Algorithms (4)
-
- Algebraic Geometry (2)
- Analysis (2)
- Applied Mathematics (2)
- Education (2)
- Logic and Foundations (2)
- Number Theory (2)
- Physics (2)
- Science and Mathematics Education (2)
- Social and Behavioral Sciences (2)
- Statistics and Probability (2)
- Arts and Humanities (1)
- Biochemistry, Biophysics, and Structural Biology (1)
- Continental Philosophy (1)
- Control Theory (1)
- Economic Theory (1)
- Economics (1)
- Epistemology (1)
- Information Security (1)
- Life Sciences (1)
- Logic and Foundations of Mathematics (1)
- Metaphysics (1)
- Other Physics (1)
- Institution
-
- Claremont Colleges (6)
- Smith College (4)
- East Tennessee State University (3)
- Rose-Hulman Institute of Technology (3)
- University of Nebraska - Lincoln (3)
-
- University of New Mexico (3)
- West Chester University (3)
- Chapman University (2)
- Linfield University (2)
- Prairie View A&M University (2)
- City University of New York (CUNY) (1)
- College of Saint Benedict and Saint John's University (1)
- Marshall University (1)
- University of Kentucky (1)
- University of Nevada, Las Vegas (1)
- Western Kentucky University (1)
- Keyword
-
- Combinatorics (5)
- Cryptography (3)
- Graph theory (3)
- Neutrosophic logic (2)
- Reconstruction (2)
-
- 1-factor (1)
- Affine Symmetric Group (1)
- Ball (1)
- Binomial coefficients (1)
- Bisection (1)
- Cacti graphs (1)
- Characteristic equation (1)
- Clique (1)
- Clique method (1)
- Coalition method (1)
- Collision-free motion (1)
- Combinatorial analysis (1)
- Competitive coloring (1)
- Conditional expectations (1)
- Convex invertible cones (1)
- Degree sequence (1)
- Delannoy number (1)
- Discrete Lambert Map (1)
- Discrete Logarithm (1)
- Discrete Morse Theory (1)
- Efficiency Adjusted Deferred Acceptance Mechanism (1)
- ElGamal Discrete Signature Scheme (1)
- Exact Enumeration Problems (1)
- Excedence (1)
- Extremal Trees (1)
- Publication
-
- All HMC Faculty Publications and Research (4)
- Computer Science: Faculty Publications (4)
- Mathematics Faculty Publications (4)
- Branch Mathematics and Statistics Faculty and Staff Publications (3)
- Electronic Theses and Dissertations (3)
-
- Mathematical Sciences Technical Reports (MSTR) (3)
- Applications and Applied Mathematics: An International Journal (AAM) (2)
- Department of Mathematics: Dissertations, Theses, and Student Research (2)
- Faculty Publications (2)
- Mathematics, Physics, and Computer Science Faculty Articles and Research (2)
- Masters Theses & Specialist Projects (1)
- Mathematics Faculty Research (1)
- Pitzer Senior Theses (1)
- Pomona Faculty Publications and Research (1)
- Publications and Research (1)
- School of Computing: Technical Reports (1)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (1)
- University of Kentucky Doctoral Dissertations (1)
- Publication Type
Articles 31 - 37 of 37
Full-Text Articles in Discrete Mathematics and Combinatorics
The Maximum Rectilinear Crossing Number Of The Wheel Graph, Elie Feder
The Maximum Rectilinear Crossing Number Of The Wheel Graph, Elie Feder
Publications and Research
We find and prove the maximum rectilinear crossing number of the wheel graph. First, we illustrate a picture of the wheel graph with many crossings to prove a lower bound. We then prove that this bound is sharp. The treatment is divided into two cases for n even and n odd.
Algebraic Structures Using Natural Class Of Intervals, Florentin Smarandache, W.B. Vasantha Kandasamy
Algebraic Structures Using Natural Class Of Intervals, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
Authors in this book introduce a new class of intervals called the natural class of intervals, also known as the special class of intervals or as natural intervals. These intervals are built using increasing intervals, decreasing intervals and degenerate intervals. We say an interval [a, b] is an increasing interval if a < b for any a, b in the field of reals R. An interval [a, b] is a decreasing interval if a > b and the interval [a, b] is a degenerate interval if a = b for a, b in the field of reals R. The natural class of intervals consists of the collection of increasing intervals, decreasing intervals and the degenerate intervals. Clearly R is contained in the natural …
Interval Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy
Interval Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book the notion of interval semirings are introduced. The authors study and analyse semirings algebraically. Methods are given for the construction of non-associative semirings using loops and interval semirings or interval loops and semirings. Another type of non-associative semirings are introduced using groupoids and interval semirings or interval groupoids and semirings. Examples using integers and modulo integers are given. Also infinite semirings which are semifields are given using interval semigroups and semirings or semigroups and interval semirings or using groups and interval semirings. Interval groups are introduced to construct interval group interval semirings, and properties related with them …
Interval Semigroups, Florentin Smarandache, W.B. Vasantha Kandasamy
Interval Semigroups, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book we introduce the notion of interval semigroups using intervals of the form [0, a], a is real. Several types of interval semigroups like fuzzy interval semigroups, interval symmetric semigroups, special symmetric interval semigroups, interval matrix semigroups and interval polynomial semigroups are defined and discussed. This book has eight chapters. The main feature of this book is that we suggest 241 problems in the eighth chapter. In this book the authors have defined 29 new concepts and illustrates them with 231 examples. Certainly this will find several applications. The authors deeply acknowledge Dr. Kandasamy for the proof reading …
The Positive Real Lemma And Construction Of All Realizations Of Generalized Positive Rational Functions, Daniel Alpay, Izchak Lewkowicz
The Positive Real Lemma And Construction Of All Realizations Of Generalized Positive Rational Functions, Daniel Alpay, Izchak Lewkowicz
Mathematics, Physics, and Computer Science Faculty Articles and Research
We here extend the well known Positive Real Lemma (also known as the Kalman-Yakubovich-Popov Lemma) to complex matrix-valued generalized positive rational function, when non-minimal realizations are considered. All state space realizations are partitioned into subsets, each is identified with a set of matrices satisfying the same Lyapunov inclusion. Thus, each subset forms a convex invertible cone, cic in short, and is in fact is replica of all realizations of positive functions of the same dimensions. We then exploit this result to provide an easy construction procedure of all (not necessarily minimal) state space realizations of generalized positive functions. As a …
A Class Of Gaussian Processes With Fractional Spectral Measures, Daniel Alpay, Palle Jorgensen, David Levanony
A Class Of Gaussian Processes With Fractional Spectral Measures, Daniel Alpay, Palle Jorgensen, David Levanony
Mathematics, Physics, and Computer Science Faculty Articles and Research
We study a family of stationary increment Gaussian processes, indexed by time. These processes are determined by certain measures σ (generalized spectral measures), and our focus here is on the case when the measure σ is a singular measure. We characterize the processes arising from when σ is in one of the classes of affine self-similar measures. Our analysis makes use of Kondratiev-white noise spaces. With the use of a priori estimates and the Wick calculus, we extend and sharpen (see Theorem 7.1) earlier computations of Ito stochastic integration developed for the special case of stationary increment processes having absolutely …
Combinatorial Aspects Of Excedances And The Frobenius Complex, Eric Logan Clark
Combinatorial Aspects Of Excedances And The Frobenius Complex, Eric Logan Clark
University of Kentucky Doctoral Dissertations
In this dissertation we study the excedance permutation statistic. We start by extending the classical excedance statistic of the symmetric group to the affine symmetric group eSn and determine the generating function of its distribution. The proof involves enumerating lattice points in a skew version of the root polytope of type A. Next we study the excedance set statistic on the symmetric group by defining a related algebra which we call the excedance algebra. A combinatorial interpretation of expansions from this algebra is provided. The second half of this dissertation deals with the topology of the Frobenius complex, that …