Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Georgia Southern University (14)
- Rose-Hulman Institute of Technology (8)
- Claremont Colleges (4)
- City University of New York (CUNY) (3)
- Illinois State University (3)
-
- Kutztown University (3)
- Marshall University (3)
- Western University (3)
- California State University, San Bernardino (2)
- Michigan Technological University (2)
- The University of Akron (2)
- University of Kentucky (2)
- University of Nebraska - Lincoln (2)
- West Virginia University (2)
- Binghamton University (1)
- Bucknell University (1)
- Central Washington University (1)
- Colby College (1)
- DePaul University (1)
- East Tennessee State University (1)
- Louisiana State University (1)
- Ministry of Higher and Secondary Specialized Education of the Republic of Uzbekistan (1)
- Missouri State University (1)
- Montclair State University (1)
- Nova Southeastern University (1)
- Prairie View A&M University (1)
- Rollins College (1)
- University of Louisville (1)
- University of Montana (1)
- University of Nebraska at Omaha (1)
- Keyword
-
- Combinatorics (6)
- Mathematics (5)
- Graph theory (4)
- Matroids (3)
- Cryptanalysis (2)
-
- Cryptography (2)
- Edge-coloring (2)
- Graph (2)
- Graph labeling (2)
- Graphs (2)
- Group theory (2)
- Number Theory (2)
- Playing cards (2)
- 05A19 Combinatorial identities (1)
- 05C57 Games on graphs (1)
- 05D40 Probabilistic methods in extremal combinatorics (1)
- 1-Nested Networks (1)
- 11B37 Recurrences (1)
- 11B39 Fibonacci and Lucas numbers and polynomials and generalizations (1)
- 13F60 Cluster algebras (1)
- 15A69 Multilinear algebra (1)
- 2-Nested Networks (1)
- 2-tree (1)
- 91A43 Games involving graphs (1)
- 91A46 Combinatorial games (1)
- <p>Graph theory.</p> <p>Decomposition (Mathematics)</p> (1)
- Academic -- UNF -- Master of Science in Mathematical Science; Dissertations (1)
- Academic -- UNF -- Mathematics; reaction systems; biochemical process model; resource-minimal; minimizing; RS Tools; state transition systems (1)
- Algebra (1)
- Algorithms (1)
- Publication
-
- Theory and Applications of Graphs (14)
- Rose-Hulman Undergraduate Mathematics Journal (8)
- HMC Senior Theses (4)
- Annual Symposium on Biomathematics and Ecology Education and Research (3)
- Communications on Number Theory and Combinatorial Theory (2)
-
- Department of Mathematics: Dissertations, Theses, and Student Research (2)
- Dissertations, Master's Theses and Master's Reports (2)
- Electronic Theses and Dissertations (2)
- Graduate Theses, Dissertations, and Problem Reports (2)
- Mathematics Faculty Research (2)
- Open Educational Resources (2)
- Theses and Dissertations--Mathematics (2)
- Undergraduate Student Research Internships Conference (2)
- Williams Honors College, Honors Research Projects (2)
- Applications and Applied Mathematics: An International Journal (AAM) (1)
- Central Asian Problems of Modern Science and Education (1)
- Department of Mathematics Facuty Scholarship and Creative Works (1)
- Dissertations (1)
- Electronic Theses, Projects, and Dissertations (1)
- Electronic Thesis and Dissertation Repository (1)
- Faculty Journal Articles (1)
- Graduate Student Theses, Dissertations, & Professional Papers (1)
- Honors Program Theses (1)
- Honors Student Research (1)
- Honors Theses (1)
- Journal of Math Circles (1)
- LSU Doctoral Dissertations (1)
- MSU Graduate Theses (1)
- Mako: NSU Undergraduate Student Journal (1)
- Mathematics Faculty Publications (1)
- Publication Type
Articles 1 - 30 of 71
Full-Text Articles in Physical Sciences and Mathematics
Hurwitz Actions On Reflection Factorizations In Complex Reflection Group G₆, Gaurav Gawankar, Dounia Lazreq, Mehr Rai, Seth Sabar
Hurwitz Actions On Reflection Factorizations In Complex Reflection Group G₆, Gaurav Gawankar, Dounia Lazreq, Mehr Rai, Seth Sabar
Rose-Hulman Undergraduate Mathematics Journal
We show that in the complex reflection group G6, reflection factorizations of a Coxeter element that have the same length and multiset of conjugacy classes are in the same Hurwitz orbit. This confirms one case of a conjecture of Lewis and Reiner.
Decisive Neutrality, Restricted Decisive Neutrality, And Split Decisive Neutrality On Median Semilattices And Median Graphs., Ulf Högnäs
Electronic Theses and Dissertations
Consensus functions on finite median semilattices and finite median graphs are studied from an axiomatic point of view. We start with a new axiomatic characterization of majority rule on a large class of median semilattices we call sufficient. A key axiom in this result is the restricted decisive neutrality condition. This condition is a restricted version of the more well-known axiom of decisive neutrality given in [4]. Our theorem is an extension of the main result given in [7]. Another main result is a complete characterization of the class of consensus on a finite median semilattice that satisfies the axioms …
A Complete Characterisation Of Vertex-Multiplications Of Trees With Diameter 5, Willie Han Wah Wong, Eng Guan Tay
A Complete Characterisation Of Vertex-Multiplications Of Trees With Diameter 5, Willie Han Wah Wong, Eng Guan Tay
Theory and Applications of Graphs
For a connected graph G, let D(G) be the family of strong orientations of G; and for any D ∈ D(G), we denote by d(D) the diameter of D. The orientation number of G is defined as d(G)=min{d(D) | D ∈ D(G)}. In 2000, Koh and Tay introduced a new family of graphs, G vertex-multiplications, and extended the results on the orientation number of complete n-partite graphs. Suppose G has the vertex set V(G)={v1,v2,… vn}. For any sequence of n positive integers (s …
Rippled Almost Periodic Behavior In An Epilepsy Model, David Chan, Candace Kent
Rippled Almost Periodic Behavior In An Epilepsy Model, David Chan, Candace Kent
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Identification Of Control Targets In Boolean Networks Via Computational Algebra, Alan Veliz-Cuba
Identification Of Control Targets In Boolean Networks Via Computational Algebra, Alan Veliz-Cuba
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Building Model Prototypes From Time-Course Data, David Murrugarra, Alan Veliz-Cuba
Building Model Prototypes From Time-Course Data, David Murrugarra, Alan Veliz-Cuba
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Distribution Of The P-Torsion Of Jacobian Groups Of Regular Matroids, Sergio R. Zapata Ceballos
Distribution Of The P-Torsion Of Jacobian Groups Of Regular Matroids, Sergio R. Zapata Ceballos
Electronic Thesis and Dissertation Repository
Given a regular matroid $M$ and a map $\lambda\colon E(M)\to \N$, we construct a regular matroid $M_\lambda$. Then we study the distribution of the $p$-torsion of the Jacobian groups of the family $\{M_\lambda\}_{\lambda\in\N^{E(M)}}$. We approach the problem by parameterizing the Jacobian groups of this family with non-trivial $p$-torsion by the $\F_p$-rational points of the configuration hypersurface associated to $M$. In this way, we reduce the problem to counting points over finite fields. As a result, we obtain a closed formula for the proportion of these groups with non-trivial $p$-torsion as well as some estimates. In addition, we show that the …
Discrete Hypergeometric Legendre Polynomials, Tom Cuchta
Discrete Hypergeometric Legendre Polynomials, Tom Cuchta
Mathematics Faculty Research
A discrete analog of the Legendre polynomials defined by discrete hypergeometric series is investigated. The resulting polynomials have qualitatively similar properties to classical Legendre polynomials. We derive their difference equations, recurrence relations, and generating function.
Introduction To Discrete Mathematics: An Oer For Ma-471, Mathieu Sassolas
Introduction To Discrete Mathematics: An Oer For Ma-471, Mathieu Sassolas
Open Educational Resources
The first objective of this book is to define and discuss the meaning of truth in mathematics. We explore logics, both propositional and first-order , and the construction of proofs, both formally and human-targeted. Using the proof tools, this book then explores some very fundamental definitions of mathematics through set theory. This theory is then put in practice in several applications. The particular (but quite widespread) case of equivalence and order relations is studied with detail. Then we introduces sequences and proofs by induction, followed by number theory. Finally, a small introduction to combinatorics is …
Upper Bounds For Inverse Domination In Graphs, Elliot Krop, Jessica Mcdonald, Gregory J. Puleo
Upper Bounds For Inverse Domination In Graphs, Elliot Krop, Jessica Mcdonald, Gregory J. Puleo
Theory and Applications of Graphs
In any graph G, the domination number \gamma(G) is at most the independence number \alpha(G). The Inverse Domination Conjecture says that, in any isolate-free G, there exists pair of vertex-disjoint dominating sets D, D' with |D|=\gamma(G) and |D'| \leq \alpha(G). Here we prove that this statement is true if the upper bound \alpha(G) is replaced by \frac{3}{2}\alpha(G) – 1 (and G is not a clique). We also prove that the conjecture holds whenever \gamma(G)\leq 5 or |V(G)|\leq 16.
Skolem Number Of Cycles And Grid Graphs, Braxton Carrigan, John Asplund
Skolem Number Of Cycles And Grid Graphs, Braxton Carrigan, John Asplund
Theory and Applications of Graphs
A Skolem sequence can be thought of as a labelled path where two vertices with the same label are that distance apart. This concept has naturally been generalized to labellings of other graphs, but always using at most two of any integer label. Given that more than two vertices can be mutually distance d apart, we define a new generalization of a Skolem sequences on graphs that we call proper Skolem labellings. This brings rise to the question; ``what is the smallest set of consecutive positive integers we can use to proper Skolem label a graph?'' This will be known …
Domino Circles, Lauren L. Rose, A. Gwinn Royal, Amanda Serenevy, Anna Varvak
Domino Circles, Lauren L. Rose, A. Gwinn Royal, Amanda Serenevy, Anna Varvak
Journal of Math Circles
Creating a circle with domino pieces has a connection with complete graphs in Graph Theory. We present a hands-on activity for all ages, using dominoes to explore problem solving, pattern recognition, parity, graph theory, and combinatorics. The activities are suitable for elementary school students, the graph theory interpretations are suitable for middle and high school students, and the underlying mathematical structures will be of interest to college students and beyond.
An Upper Bound On The Spectral P-Norms Of Tensors And Matrix Permanent, Killian J. Hitsman, Vehbi E. Paksoy
An Upper Bound On The Spectral P-Norms Of Tensors And Matrix Permanent, Killian J. Hitsman, Vehbi E. Paksoy
Mako: NSU Undergraduate Student Journal
No abstract provided.
Categorical Aspects Of Graphs, Jacob D. Ender
Categorical Aspects Of Graphs, Jacob D. Ender
Undergraduate Student Research Internships Conference
In this article, we introduce a categorical characterization of directed and undirected graphs, and explore subcategories of reflexive and simple graphs. We show that there are a number of adjunctions between such subcategories, exploring varying combinations of graph types.
Spectral Graph Theory And Research, Nathan H. Kershaw, Lewis Glabush
Spectral Graph Theory And Research, Nathan H. Kershaw, Lewis Glabush
Undergraduate Student Research Internships Conference
Our topic of study was Spectral Graph Theory. We studied the algebraic methods used to study the properties of graphs (networks) and became familiar with the applications of network analysis. We spent a significant amount of time studying the way virus’s spread on networks, with particular applications to Covid-19. We also investigated the relationship between graph spectra and structural properties.
On \Delta^(K)-Colouring Of Powers Of Paths And Cycles, Merlin Thomas Ellumkalayil Ms, Sudev Naduvath
On \Delta^(K)-Colouring Of Powers Of Paths And Cycles, Merlin Thomas Ellumkalayil Ms, Sudev Naduvath
Theory and Applications of Graphs
In an improper vertex colouring of a graph, adjacent vertices are permitted to receive same colours. An edge of an improperly coloured graph is said to be a bad edge if its end vertices have the same colour. A near-proper colouring of a graph is a colouring which minimises the number of bad edges by restricting the number of colour classes that can have adjacency among their own elements. The δ (k) - colouring is a near-proper colouring of G consisting of k given colours, where 1 ≤ k ≤ χ(G) – 1, which minimises the number of bad …
On Graphs With Proper Connection Number 2, Jill Faudree, Leah Berman, Glenn Chappell, Chris Hartman, John Gimbel, Gordon Williams
On Graphs With Proper Connection Number 2, Jill Faudree, Leah Berman, Glenn Chappell, Chris Hartman, John Gimbel, Gordon Williams
Theory and Applications of Graphs
An edge-colored graph is properly connected if for every pair of vertices u and v there exists a properly colored uv-path (i.e. a uv-path in which no two consecutive edges have the same color). The proper connection number of a connected graph G, denoted pc(G), is the smallest number of colors needed to color the edges of G such that the resulting colored graph is properly connected. An edge-colored graph is flexibly connected if for every pair of vertices u and v there exist two properly colored paths between them, say P and Q, such …
A Combinatorial Formula For Kazhdan-Lusztig Polynomials Of Sparse Paving Matroids, George Nasr
A Combinatorial Formula For Kazhdan-Lusztig Polynomials Of Sparse Paving Matroids, George Nasr
Department of Mathematics: Dissertations, Theses, and Student Research
We present a combinatorial formula using skew Young tableaux for the coefficients of Kazhdan-Lusztig polynomials for sparse paving matroids. These matroids are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids. We also show the positivity of these coefficients using our formula. In special cases, such as for uniform matroids, our formula has a nice combinatorial interpretation.
Advisers: Kyungyong Lee and Jamie Radclie
Partially Oriented 6-Star Decomposition Of Some Complete Mixed Graphs, Kazeem A. Kosebinu
Partially Oriented 6-Star Decomposition Of Some Complete Mixed Graphs, Kazeem A. Kosebinu
Electronic Theses and Dissertations
Let $M_v$ denotes a complete mixed graph on $v$ vertices, and let $S_6^i$ denotes the partial orientation of the 6-star with twice as many arcs as edges. In this work, we state and prove the necessary and sufficient conditions for the existence of $\lambda$-fold decomposition of a complete mixed graph into $S_6^i$ for $i\in\{1,2,3,4\}$. We used the difference method for our proof in some cases. We also give some general sufficient conditions for the existence of $S_6^i$-decomposition of the complete bipartite mixed graph for $i\in\{1,2,3,4\}$. Finally, this work introduces the decomposition of a complete mixed graph with a hole into …
Bootstrap Percolation On Random Geometric Graphs, Alyssa Whittemore
Bootstrap Percolation On Random Geometric Graphs, Alyssa Whittemore
Department of Mathematics: Dissertations, Theses, and Student Research
Bootstrap Percolation is a discrete-time process that models the spread of information or disease across the vertex set of a graph. We consider the following version of this process:
Initially, each vertex of the graph is set active with probability p or inactive otherwise. Then, at each time step, every inactive vertex with at least k active neighbors becomes active. Active vertices will always remain active. The process ends when it reaches a stationary state. If all the vertices eventually become active, then we say we achieve percolation.
This process has been widely studied on many families of graphs, deterministic …
Partial Representations For Ternary Matroids, Ebony Perez
Partial Representations For Ternary Matroids, Ebony Perez
Electronic Theses, Projects, and Dissertations
In combinatorics, a matroid is a discrete object that generalizes various notions of dependence that arise throughout mathematics. All of the information about some matroids can be encoded (or represented) by a matrix whose entries come from a particular field, while other matroids cannot be represented in this way. However, for any matroid, there exists a matrix, called a partial representation of the matroid, that encodes some of the information about the matroid. In fact, a given matroid usually has many different partial representations, each providing different pieces of information about the matroid. In this thesis, we investigate when a …
The Color Number Of Cubic Graphs Having A Spanning Tree With A Bounded Number Of Leaves, Analen A. Malnegro, Gina A. Malacas, Kenta Ozeki
The Color Number Of Cubic Graphs Having A Spanning Tree With A Bounded Number Of Leaves, Analen A. Malnegro, Gina A. Malacas, Kenta Ozeki
Theory and Applications of Graphs
The color number c(G) of a cubic graphG is the minimum cardinality of a color class of a proper 4-edge-coloring of G. It is well-known that every cubic graph G satisfies c(G) = 0 if G
Contributions To The Teaching And Learning Of Fluid Mechanics, Ashwin Vaidya
Contributions To The Teaching And Learning Of Fluid Mechanics, Ashwin Vaidya
Department of Mathematics Facuty Scholarship and Creative Works
This issue showcases a compilation of papers on fluid mechanics (FM) education, covering different sub topics of the subject. The success of the first volume [1] prompted us to consider another follow-up special issue on the topic, which has also been very successful in garnering an impressive variety of submissions. As a classical branch of science, the beauty and complexity of fluid dynamics cannot be overemphasized. This is an extremely well-studied subject which has now become a significant component of several major scientific disciplines ranging from aerospace engineering, astrophysics, atmospheric science (including climate modeling), biological and biomedical science …
On Communication For Distributed Babai Point Computation, Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I.R. Costa
On Communication For Distributed Babai Point Computation, Maiara F. Bollauf, Vinay A. Vaishampayan, Sueli I.R. Costa
Publications and Research
We present a communication-efficient distributed protocol for computing the Babai point, an approximate nearest point for a random vector X∈Rn in a given lattice. We show that the protocol is optimal in the sense that it minimizes the sum rate when the components of X are mutually independent. We then investigate the error probability, i.e. the probability that the Babai point does not coincide with the nearest lattice point, motivated by the fact that for some cases, a distributed algorithm for finding the Babai point is sufficient for finding the nearest lattice point itself. Two different probability models for X …
Irreducibility And Galois Groups Of Random Polynomials, Hanson Hao, Eli Navarro, Henri Stern
Irreducibility And Galois Groups Of Random Polynomials, Hanson Hao, Eli Navarro, Henri Stern
Rose-Hulman Undergraduate Mathematics Journal
In 2015, I. Rivin introduced an effective method to bound the number of irreducible integral polynomials with fixed degree d and height at most N. In this paper, we give a brief summary of this result and discuss the precision of Rivin's arguments for special classes of polynomials. We also give elementary proofs of classic results on Galois groups of cubic trinomials.
Repeat Length Of Patterns On Weaving Products, Zhuochen Liu
Repeat Length Of Patterns On Weaving Products, Zhuochen Liu
Rose-Hulman Undergraduate Mathematics Journal
On weaving products such as fabrics and silk, people use interlacing strands to create artistic patterns. Repeated patterns form aesthetically pleasing products. This research is a mathematical modeling of weaving products in the real world by using cellular automata. The research is conducted by observing the evolution of the model to better understand products in the real world. Specifically, this research focuses on the repeat length of a weaving pattern given the rule of generating it and the configuration of the starting row. Previous studies have shown the range of the repeat length in specific situations. This paper will generalize …
New Results On Subtractive Magic Graphs, Matthew J. Ko, Jason Pinto, Aaron Davis
New Results On Subtractive Magic Graphs, Matthew J. Ko, Jason Pinto, Aaron Davis
Rose-Hulman Undergraduate Mathematics Journal
For any edge xy in a directed graph, the subtractive edge-weight is the sum of the label of xy and the label of y minus the label of x. Similarly, for any vertex z in a directed graph, the subtractive vertex-weight of z is the sum of the label of z and all edges directed into z and all the labels of edges that are directed away from z. A subtractive magic graph has every subtractive edge and vertex weight equal to some constant k. In this paper, we will discuss variations of subtractive magic labelings on …
Directed Graphs Of The Finite Tropical Semiring, Caden G. Zonnefeld
Directed Graphs Of The Finite Tropical Semiring, Caden G. Zonnefeld
Rose-Hulman Undergraduate Mathematics Journal
The focus of this paper lies at the intersection of the fields of tropical algebra and graph theory. In particular the interaction between tropical semirings and directed graphs is investigated. Originally studied by Lipvoski, the directed graph of a ring is useful in identifying properties within the algebraic structure of a ring. This work builds off research completed by Beyer and Fields, Hausken and Skinner, and Ang and Shulte in constructing directed graphs from rings. However, we will investigate the relationship (x, y)→(min(x, y), x+y) as defined by the operations of tropical algebra and applied to tropical semirings.
The Structure Of Functional Graphs For Functions From A Finite Domain To Itself For Which A Half Iterate Exists, Paweł Marcin Kozyra
The Structure Of Functional Graphs For Functions From A Finite Domain To Itself For Which A Half Iterate Exists, Paweł Marcin Kozyra
Theory and Applications of Graphs
The notion of a replica of a nontrivial in-tree is defined. A result enabling to determine whether an in-tree is a replica of another in-tree employing an injective mapping between some subsets of sources of these in-trees is presented. There are given necessary and sufficient conditions for the existence of a functional square root of a function from a finite set to itself through presenting necessary and sufficient conditions for the existence of a square root of a component of the functional graph for the function and for the existence of a square root of the union of two components …
The “Knapsack Problem” Workbook: An Exploration Of Topics In Computer Science, Steven Cosares
The “Knapsack Problem” Workbook: An Exploration Of Topics In Computer Science, Steven Cosares
Open Educational Resources
This workbook provides discussions, programming assignments, projects, and class exercises revolving around the “Knapsack Problem” (KP), which is widely a recognized model that is taught within a typical Computer Science curriculum. Throughout these discussions, we use KP to introduce or review topics found in courses covering topics in Discrete Mathematics, Mathematical Programming, Data Structures, Algorithms, Computational Complexity, etc. Because of the broad range of subjects discussed, this workbook and the accompanying spreadsheet files might be used as part of some CS capstone experience. Otherwise, we recommend that individual sections be used, as needed, for exercises relevant to a course in …