Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Mathematics and Statistics (29)
- Effect sparsity (4)
- Positive solutions (4)
- Factorial design (3)
- Principal components (3)
-
- AUTOMORPHISMS (2)
- Abstracts (2)
- Asymptotic behavior (2)
- Brownian motion (2)
- Coefficient changes sign (2)
- Conference (2)
- Delay-Differential Equations (2)
- Derivation (2)
- Differential Equations (2)
- Differential equations (2)
- Dimension theory (2)
- Elliptical distributions (2)
- Epidemiology (2)
- Euler flows (2)
- Existence (2)
- Fourier basis (2)
- Gain Graph (2)
- Hopf bifurcation (2)
- Infectious Diseases (2)
- Integral relation (2)
- K-means algorithm (2)
- Models (2)
- Multifractal analysis (2)
- Multiple solutions; Critical exponents; Elliptic equations (2)
- Navier-Stokes flows (2)
- Publication Year
- Publication
- Publication Type
Articles 1 - 30 of 173
Full-Text Articles in Physical Sciences and Mathematics
Festival Of Research Abstracts, 2024, College Of Science And Mathematics, Wright State University
Festival Of Research Abstracts, 2024, College Of Science And Mathematics, Wright State University
Festival of Research
The collection of abstracts accepted for the 2024 Festival of Research hosted by the Wright State University College of Science and Mathematics.
On Colorings And Orientations Of Signed Graphs, Daniel Slilaty
On Colorings And Orientations Of Signed Graphs, Daniel Slilaty
Mathematics and Statistics Faculty Publications
A classical theorem independently due to Gallai and Roy states that a graph G has a proper k-coloring if and only if G has an orientation without coherent paths of length k. An analogue of this result for signed graphs is proved in this article.
Festival Of Research Abstracts, 2023, College Of Science And Mathematics, Wright State University
Festival Of Research Abstracts, 2023, College Of Science And Mathematics, Wright State University
Festival of Research
The collection of abstracts accepted for the 2023 Festival of Research hosted by the Wright State University College of Science and Mathematics.
Graphs Without A 2c3-Minor And Bicircular Matroids Without A U3,6-Minor, Daniel Slilaty
Graphs Without A 2c3-Minor And Bicircular Matroids Without A U3,6-Minor, Daniel Slilaty
Mathematics and Statistics Faculty Publications
In this note we characterize all graphs without a 2C3-minor. A consequence of this result is a characterization of the bicircular matroids with no U3,6-minor.
Odd Solutions To Systems Of Inequalities Coming From Regular Chain Groups, Daniel Slilaty
Odd Solutions To Systems Of Inequalities Coming From Regular Chain Groups, Daniel Slilaty
Mathematics and Statistics Faculty Publications
Hoffman’s theorem on feasible circulations and Ghouila-Houry’s theorem on feasible tensions are classical results of graph theory. Camion generalized these results to systems of inequalities over regular chain groups. An analogue of Camion’s result is proved in which solutions can be forced to be odd valued. The obtained result also generalizes the results of Pretzel and Youngs as well as Slilaty. It is also shown how Ghouila-Houry’s result can be used to give a new proof of the graph- coloring theorem of Minty and Vitaver.
Hamilton Cycles In Bidirected Complete Graphs, Arthur Busch, Mohammed A. Mutar, Daniel Slilaty
Hamilton Cycles In Bidirected Complete Graphs, Arthur Busch, Mohammed A. Mutar, Daniel Slilaty
Mathematics and Statistics Faculty Publications
Zaslavsky observed that the topics of directed cycles in directed graphs and alternating cycles in edge 2-colored graphs have a common generalization in the study of coherent cycles in bidirected graphs. There are classical theorems by Camion, Harary and Moser, Häggkvist and Manoussakis, and Saad which relate strong connectivity and Hamiltonicity in directed "complete" graphs and edge 2-colored "complete" graphs. We prove two analogues to these theorems for bidirected "complete" signed graphs.
Characterization Of A Family Of Rotationally Symmetric Spherical Quadrangulations, Lowell Abrams, Daniel Slilaty
Characterization Of A Family Of Rotationally Symmetric Spherical Quadrangulations, Lowell Abrams, Daniel Slilaty
Mathematics and Statistics Faculty Publications
A spherical quadrangulation is an embedding of a graph G in the sphere in which each facial boundary walk has length four. Vertices that are not of degree four in G are called curvature vertices. In this paper we classify all spherical quadrangulations with n-fold rotational symmetry (n ≥ 3) that have minimum degree 3 and the least possible number of curvature vertices, and describe all such spherical quadrangulations in terms of nets of quadrilaterals. The description reveals that such rotationally symmetric quadrangulations necessarily also have a pole-exchanging symmetry.
A Unified Approach For Constructing Confidence Intervals And Hypothesis Tests Using H-Function, Weizhen Wang
A Unified Approach For Constructing Confidence Intervals And Hypothesis Tests Using H-Function, Weizhen Wang
Mathematics and Statistics Faculty Publications
We introduce a general method, named the h-function method, to unify the con- structions of level- exact test and 1− exact confidence interval. Using this method, any confidence interval is improved as follows: i) an approximate interval, including a point estimator, is modified to an exact interval; ii) an exact interval is refined to be an interval that is a subset of the previous one. Two real datasets are used to illustrate the method.
Coloring Permutation-Gain Graphs, Daniel Slilaty
Coloring Permutation-Gain Graphs, Daniel Slilaty
Mathematics and Statistics Faculty Publications
Correspondence colorings of graphs were introduced in 2018by Dvoˇr ́ak and Postle as a generalization of list colorings of graphswhich generalizes ordinary graph coloring. Kim and Ozeki observed thatcorrespondence colorings generalize various notions of signed-graph col-orings which again generalizes ordinary graph colorings. In this notewe state how correspondence colorings generalize Zaslavsky’s notionof gain-graph colorings and then formulate a new coloring theory ofpermutation-gain graphs that sits between gain-graph coloring and cor-respondence colorings. Like Zaslavsky’s gain-graph coloring, our newnotion of coloring permutation-gain graphs has well defined chromaticpolynomials and lifts to colorings of the regular covering graph of apermutation-gain graph
The Family Of Bicircular Matroids Closed Under Duality, Vaidy Sivaraman, Daniel Slilaty
The Family Of Bicircular Matroids Closed Under Duality, Vaidy Sivaraman, Daniel Slilaty
Mathematics and Statistics Faculty Publications
We characterize the 3-connected members of the intersection of the class of bicircular and cobi- circular matroids. Aside from some exceptional matroids with rank and corank at most 5, this class consists of just the free swirls and their minors.
Describing Quasi-Graphic Matroids, Nathan Bowler, Daryl Funk, Dan Slilaty
Describing Quasi-Graphic Matroids, Nathan Bowler, Daryl Funk, Dan Slilaty
Mathematics and Statistics Faculty Publications
The class of quasi-graphic matroids recently introduced by Geelen, Gerards, and Whittle generalises each of the classes of frame matroids and liftedgraphic matroids introduced earlier by Zaslavsky. For each biased graph (G, B) Zaslavsky defined a unique lift matroid L(G, B) and a unique frame matroid F(G, B), each on ground set E(G). We show that in general there may be many quasi-graphic matroids on E(G) and describe them all: for each graph G and partition (B, L, F) of its cycles such that B satisfies the theta property and each cycle in L meets each cycle in F, there …
Finding Pythagoras In The Pythagoreans, Brandon Barnes
Finding Pythagoras In The Pythagoreans, Brandon Barnes
Classics Ancient Science Fair
This presentation for the Ancient Science Fair deals with the Pythagorean Theorem. Since Pythagoras himself did not write down his work, early scholars had to work to find the knowledge and unify it among differing sources.
The Graphs That Have Antivoltages Using Groups Of Small Order, Vaidy Sivaraman, Dan Slilaty
The Graphs That Have Antivoltages Using Groups Of Small Order, Vaidy Sivaraman, Dan Slilaty
Mathematics and Statistics Faculty Publications
Given a group Γ of order at most six, we characterize the graphs that have Γ-antivoltages and also determine the list of minor-minimal graphs that have no Γ-antivoltage. Our characterizations yield polynomial-time recognition algorithms for such graphs.
10. Corrections To Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
10. Corrections To Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
Design and Analysis of Experiments
Corrections for the provided by the authors for Design and Analysis of Experiments.
Investigating Problems With Mathematical Proof Skills, Samantha Collier
Investigating Problems With Mathematical Proof Skills, Samantha Collier
The University Honors Program
This research paper is focused on identifying and exploring problems that high school students have with the mathematical proof process. The study described in this report was designed to answer the question, do students who tend to struggle with mathematical proofs also struggle with understanding what is known and unknown in a proof, making assumptions about figures, and understanding mathematical converses? To answer these questions, students at three Dayton area high schools completed tasks relating to proofs and converse statements as well as a questionnaire. Contrary to the initial hypothesis, students who were perceived to have greater proof abilities did …
02. Preface Of Design And Analysis Of Experiments - 2nd Edition, Angela Dean, Dan Voss, Danel Draguljic
02. Preface Of Design And Analysis Of Experiments - 2nd Edition, Angela Dean, Dan Voss, Danel Draguljic
Design and Analysis of Experiments
Preface of the second edition of Design and Analysis of Experiments.
04. Chapters - Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
04. Chapters - Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
Design and Analysis of Experiments
A list of the chapters from Design and Analysis of Experiments.
05. Table Of Contents - Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
05. Table Of Contents - Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
Design and Analysis of Experiments
The table of content of Design and Analysis of Experiments.
06. Sas Program Files For Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
06. Sas Program Files For Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
Design and Analysis of Experiments
SAS program files for use with Design and Analysis of Experiments.
08. R Program Files For Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
08. R Program Files For Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
Design and Analysis of Experiments
R program files for use with Design and Analysis of Experiments.
09. R Data Files For Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
09. R Data Files For Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
Design and Analysis of Experiments
R Data files for Design and Analysis of Experiments.
07. Sas Data Files For Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
07. Sas Data Files For Design And Analysis Of Experiments, Angela Dean, Dan Voss, Danel Draguljic
Design and Analysis of Experiments
SAS Data files for use with Design and Analysis of Experiments.
Flexibility Of Projective-Planar Embeddings, John Maharry, Neil Robertson, Vaidy Sivaraman, Dan Slilaty
Flexibility Of Projective-Planar Embeddings, John Maharry, Neil Robertson, Vaidy Sivaraman, Dan Slilaty
Mathematics and Statistics Faculty Publications
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a collection of maneuvers on projective-planar embeddings that can be used to take σ1 to σ2
Bounding And Stabilizing Realizations Of Biased Graphs With A Fixed Group, Nancy Ann Neudauer, Dan Slilaty
Bounding And Stabilizing Realizations Of Biased Graphs With A Fixed Group, Nancy Ann Neudauer, Dan Slilaty
Mathematics and Statistics Faculty Publications
Given a group Γ and a biased graph (G, B), we define a what is meant by a Γ-realization of (G, B) and a notion of equivalence of Γ-realizations. We prove that for a finite group Γ and t ≥ 3, that there are numbers n(Γ) and n(Γ, t) such that the number of Γ-realizations of a vertically 3-connected biased graph is at most n(Γ) and that the number of Γ-realizations of a nonseparable biased graph without a (2Ct , ∅)-minor is at most n(Γ, t). Other results pertaining to contrabalanced biased graphs are presented as well as an analogue …
Projective-Planar Graphs With No K3,4-Minor. Ii., John Maharry, Dan Slilaty
Projective-Planar Graphs With No K3,4-Minor. Ii., John Maharry, Dan Slilaty
Mathematics and Statistics Faculty Publications
The authors previously published an iterative process to generate a class of projectiveplanar K3,4-free graphs called ‘patch graphs’. They also showed that any simple, almost 4-connected, nonplanar, and projective-planar graph that is K3,4-free is a subgraph of a patch graph. In this paper, we describe a simpler and more natural class of cubic K3,4- free projective-planar graphs which we call M¨obius hyperladders. Furthermore, every simple, almost 4-connected, nonplanar, and projective-planar graph that is K3,4-free is a minor of a M¨obius hyperladder. As applications of these structures we determine the page number of patch graphs and of M¨obius hyperladders.
Wright State University Math And Statistics Department History, Joanne Dombrowski, David Miller
Wright State University Math And Statistics Department History, Joanne Dombrowski, David Miller
Mathematics and Statistics Faculty Publications
No abstract provided.
The Minimal Zn-Symmetric Graphs That Are Not Zn-Spherical, Lowell Abrams, Dan Slilaty
The Minimal Zn-Symmetric Graphs That Are Not Zn-Spherical, Lowell Abrams, Dan Slilaty
Mathematics and Statistics Faculty Publications
Given a graph G equipped with faithful and fixed-point-free Γ-action (Γ a finite group) we define an orbit minor H of G to be a minor of G for which the deletion and contraction sets are closed under the Γ-action. The orbit minor H inherits a Γ-symmetry from G, and when the contraction set is acyclic the action inherited by H remains faithful and fixed-point free. When G embeds in the sphere and the Γ-action on G extends to a Γ-action on the entire sphere, we say that G is Γ-spherical. In this paper we determine for every odd value …
Unavoidable Minors Of Large 4-Connected Bicircular Matroids, Deborah Chun, Tyler Moss, Dan Slilaty, Xiangqian Zhou
Unavoidable Minors Of Large 4-Connected Bicircular Matroids, Deborah Chun, Tyler Moss, Dan Slilaty, Xiangqian Zhou
Mathematics and Statistics Faculty Publications
It is known that any 3-connected matroid that is large enough is certain to contain a minor of a given size belonging to one of a few special classes of matroids. This paper proves a similar unavoidable minor result for large 4-connected bicircular matroids. The main result follows from establishing the list of unavoidable minors of large 4-biconnected graphs, which are the graphs representing the 4-connected bicircular matroids. This paper also gives similar results for internally 4-connected and vertically 4-connected bicircular matroids.
Multi-Peak Solutions To Two Types Of Free Boundary Problems, Yi Li, Shuangjie Peng
Multi-Peak Solutions To Two Types Of Free Boundary Problems, Yi Li, Shuangjie Peng
Mathematics and Statistics Faculty Publications
We consider the existence of multi-peak solutions to two types of free boundary problems arising in confined plasma and steady vortex pair under conditions on the nonlinearity we believe to be almost optimal. Our results show that the “core” of the solution has multiple connected components, whose boundary called free boundary of the problems consists approximately of spheres which shrink to distinct single points as the parameter tends to zero.
Some Minor-Closed Classes Of Signed Graphs, Dan Slilaty, Xiangqian Zhou
Some Minor-Closed Classes Of Signed Graphs, Dan Slilaty, Xiangqian Zhou
Mathematics and Statistics Faculty Publications
We define four minor-closed classes of signed graphs in terms of embeddability in the annulus, projective plane, torus, and Klein bottle. We give the full list of 20 excluded minors for the smallest class and make a conjecture about the largest class.