Robust Spacecraft Autonomy For Deep Space Exploration In Special Euclidean Group Se(3),
2025
Embry-Riddle Aeronautical University
Robust Spacecraft Autonomy For Deep Space Exploration In Special Euclidean Group Se(3), Matthew Wittal
Doctoral Dissertations and Master's Theses
Over the past half-century, humanity has gained extensive experience conducting manned spaceflight near Earth. Arguably, "near Earth" could even include the Moon — the most distant destination humans have reached. However, "near" in this work primarily refers low Earth orbit (LEO). One could argue that we have not truly left Earth since the Apollo, as spacecraft in some LEOs remain subject to atmospheric drag thus emphasizing their continued connection to Earth's immediate environment. Reflecting on this, it becomes clear that humanity has largely remained bound to Earth’s immediate vicinity since the Apollo missions reached the Moon. However, that is set …
On Unavoidable Infinite Hypergraphs,
2025
Louisiana State University and Agricultural and Mechanical College
On Unavoidable Infinite Hypergraphs, Samuel Weiner
LSU Doctoral Dissertations
Ramsey's Theorem states that every infinite graph contains either K∞ or $\overline{K∞}$ as an induced subgraph. For this reason, K∞ and $\overline{K∞}$ are often referred to as the unavoidable infinite graphs. Many similar results have characterized the unavoidable members for various classes of infinite graphs; perhaps the most notable of these is König's Infinity Lemma, which states that every infinite, connected, locally finite graph contains a ray as an induced subgraph. From these findings, one can easily deduce that every infinite, connected graph contains an infinite clique, star, or ray as an induced subgraph; …
New View Of Some Propositions On Hesitant Fuzzy Set And Its Application In Selecting The Best Person In Any Job,
2025
Tanta University - Faculty of Engineering
New View Of Some Propositions On Hesitant Fuzzy Set And Its Application In Selecting The Best Person In Any Job, Manar Mohamed Omran Dr., Arafa A. Nasef A.Dr, Reham Abd El-Aziz Abo Khadra Dr., Mahmoud Arafa Nasef Dr.
Journal of Engineering Research
An essential part of uncertainty is played by the hesitant fuzzy set (HFS). So, it can be utilized when making decisions. The suggested use of HFS to choose the best candidate for any post is thoroughly discussed and introduces new HFS concepts
Component Order Edge Connectivity, Vertex Degrees, And Integer Partitions,
2025
Pennsylvania State University - Brandywine
Component Order Edge Connectivity, Vertex Degrees, And Integer Partitions, Michael R. Yatauro
Theory & Applications of Graphs
Given a finite, simple graph G, the k-component order connectivity (resp. edge connectivity) of G is the minimum number of vertices (resp. edges) whose removal results in a subgraph in which every component has an order of at most k − 1. In general, determining the k-component order edge connectivity of a graph is NP-hard. We identify conditions on the vertex degrees of G that can be used to imply a lower bound on the k-component order edge connectivity of G. We will discuss the process for generating such conditions for a lower bound of 1 or 2, and we …
Induced-Minor-Closed Classes Of Matroids,
2025
Louisiana State University and Agricultural and Mechanical College
Induced-Minor-Closed Classes Of Matroids, James Dylan Douthitt
LSU Doctoral Dissertations
A graph is chordal if every cycle of length at least four has a chord. In 1961, Dirac characterized chordal graphs as those graphs that can be built from complete graphs by repeated clique-sums. Generalizing this, we consider the class of simple GF(q)-representable matroids that can be built from projective geometries over GF(q) by repeated generalized parallel connections across projective geometries. We show that this class of matroids is closed under induced minors and characterize the class by its forbidden induced minors, noting that the case when q=2 is distinctive. Additionally, we show that the class of GF(2)-chordal matroids coincides …
The Intricacies Of Pairwise Modular Multiplicative Inverse In Lucas Numbers,
2025
Pullman High School
The Intricacies Of Pairwise Modular Multiplicative Inverse In Lucas Numbers, Charles Liu
Rose-Hulman Undergraduate Mathematics Journal
Let (p,q) be a pair of relatively prime integers greater than 1. The pairwise modular multiplicative inverse (PMMI) of (p,q) is defined as the unique pair of positive integers (p′, q′) such that p p′ ≡ 1 (mod q), p′ < q, qq′ ≡ 1 (mod p), q′ < p. In this paper, we determine all pairs of Lucas numbers such that their PMMIs are pairs of Lucas numbers.
Discrete Math For Computer Science - Chapter 8: Union And Intersection And Complement: Set Identities,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 8: Union And Intersection And Complement: Set Identities, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 15: Mathematical Induction,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 15: Mathematical Induction, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 13: Sequences: Recurrence Relations,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 13: Sequences: Recurrence Relations, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 26: Introduction To Graphs: Graph Representations,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 26: Introduction To Graphs: Graph Representations, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 2: Logical Equivalence: Laws Of Propositional Logic,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 2: Logical Equivalence: Laws Of Propositional Logic, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 11: Inverse Of A Function: Composition Of Functions,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 11: Inverse Of A Function: Composition Of Functions, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 16: Recursive Definitions: Recursive Algorithms,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 16: Recursive Definitions: Recursive Algorithms, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science,
2025
University of the Pacific
Discrete Math For Computer Science, Houman Kamran Habibkhani
Pacific Open Texts
Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through extensive applications, expansive discussion, and detailed exercise sets. These themes include mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and enhanced problem-solving skills through modeling. Its intent is to demonstrate the relevance and practicality of discrete mathematics to all students.
Discrete Math For Computer Science - Chapter 4: Logical Reasoning: Rules Of Inference,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 4: Logical Reasoning: Rules Of Inference, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 14: Summations,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 14: Summations, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 19: Number Representation,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 19: Number Representation, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 27: Paths And Cycles: Graph Connectivity,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 27: Paths And Cycles: Graph Connectivity, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 28: Introduction To Trees: Properties Of Trees,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 28: Introduction To Trees: Properties Of Trees, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
Discrete Math For Computer Science - Chapter 29: Tree Traversals: Spanning Trees,
2025
University of the Pacific
Discrete Math For Computer Science - Chapter 29: Tree Traversals: Spanning Trees, Houman Kamran Habibkhani
Pacific Open Videos
See this OER textbook full record by clicking here.
