Dynamical Systems Commons^™

Gliders On The Sca Model, Alexa Renner

Mathematical Sciences Technical Reports (MSTR)

The Stranded Cellular Automata (SCA) model consists of a grid of cells which can each contain between zero and two strands apiece and two turning rules that control when strands turn and when they cross. While patterns on this model have been studied previously, such research has not needed an algebraic description of the model. We provide a formal algebraic definition of patterns on the model, define gliders on the model in a way which is semi-compatible with definitions of gliders in other cellular automata models, and classify all 1- and 2-stranded gliders on this model. In addition, we prove …

Irreversible K-Threshold Number Ck(G) And Saturation Probability P[G] For Corona Product And Double Corona Product Graphs, Eric J. Moon, Soumya Bhoumik, Paul Flesher

SACAD: Scholarly Activities

We discuss the Irreversible k-conversion process for graphs, where a vertex becomes saturated and remains saturated indefinitely if at least k of its neighbors are saturated. We investigate sets S₀, which when initially saturated, lead to complete graph saturation. We are interested in the minimum |S₀| = C_k(G), called the k-threshold number. We consider the construction of the Corona Product Graphs (of C_n and K_p). Additionally, we extend our analysis by defining and exploring Double Corona Product Graphs (of C_n and K_p). Then we incorporate …

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 …

Categorical Chain Conditions For Étale Groupoid Algebras, Sunil Philip

Dissertations, Theses, and Capstone Projects

Let R be a unital commutative ring and G an ample groupoid. Using the topology of the groupoid G, Steinberg defined an étale groupoid algebra RG. These étale groupoid algebras generalize various algebras, including group algebras, commutative algebras over a field generated by idempotents, traditional groupoid algebras, Leavitt path algebras, higher-rank graph algebras, and inverse semigroup algebras. Steinberg later characterized the classical chain conditions for étale groupoid algebras. In this work, we characterize categorically noetherian and artinian, locally noetherian and artinian, and semisimple étale groupoid algebras, thereby generalizing existing results for Leavitt path algebras and introducing new results for inverse …

Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia

Journal of Nonprofit Innovation

Urban farming can enhance the lives of communities and help reduce food scarcity. This paper presents a conceptual prototype of an efficient urban farming community that can be scaled for a single apartment building or an entire community across all global geoeconomics regions, including densely populated cities and rural, developing towns and communities. When deployed in coordination with smart crop choices, local farm support, and efficient transportation then the result isn’t just sustainability, but also increasing fresh produce accessibility, optimizing nutritional value, eliminating the use of ‘forever chemicals’, reducing transportation costs, and fostering global environmental benefits.

Imagine Doris, who is …

Modularity And Boolean Network Decomposition, Matthew Wheeler

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Contributions To The Teaching And Learning Of Fluid Mechanics, Ashwin Vaidya

Department of Mathematics Faculty 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 …

Analyzing Network Topology For Ddos Mitigation Using The Abelian Sandpile Model, Bhavana Panchumarthi, Monroe Ame Stephenson

altREU Projects

A Distributed Denial of Service (DDoS) is a cyber attack, which is capable of triggering a cascading failure in the victim network. While DDoS attacks come in different forms, their general goal is to make a network's service unavailable to its users. A common, but risky, countermeasure is to blackhole or null route the source, or the attacked destination. When a server becomes a blackhole, or referred to as the sink in the paper, the data that is assigned to it "disappears" or gets deleted. Our research shows how mathematical modeling can propose an alternative blackholing strategy that could improve …

The Game Of Life On The Hyperbolic Plane, Yuncong Gu

Mathematical Sciences Technical Reports (MSTR)

In this paper, we work on the Game of Life on the hyperbolic plane. We are interested in different tessellations on the hyperbolic plane and different Game of Life rules. First, we show the exponential growth of polygons on the pentagon tessellation. Moreover, we find that the Group of 3 can keep the boundary of a set not getting smaller. We generalize the existence of still lifes by computer simulations. Also, we will prove some propositions of still lifes and cycles. There exists a still life under rules B1, B2, and S3.

Controllability And Observability Of Linear Nabla Discrete Fractional Systems, Tilekbek Zhoroev

Masters Theses & Specialist Projects

The main purpose of this thesis to examine the controllability and observability of the linear discrete fractional systems. First we introduce the problem and continue with the review of some basic definitions and concepts of fractional calculus which are widely used to develop the theory of this subject. In Chapter 3, we give the unique solution of the fractional difference equation involving the Riemann-Liouville operator of real order between zero and one. Additionally we study the sequential fractional difference equations and describe the way to obtain the state-space repre- sentation of the sequential fractional difference equations. In Chapter 4, we …

Periodicity And Invertibility Of Lattice Gas Cellular Automata, Jiawen Wang

Mathematical Sciences Technical Reports (MSTR)

A cellular automaton is a type of mathematical system that models the behavior of a set of cells with discrete values in progressing time steps. The often complicated behaviors of cellular automata are studied in computer science, mathematics, biology, and other science related fields. Lattice gas cellular automata are used to simulate the movements of particles. This thesis aims to discuss the properties of lattice gas models, including periodicity and invertibility, and to examine their accuracy in reflecting the physics of particles in real life. Analysis of elementary cellular automata is presented to introduce the concept of cellular automata and …

Mathematical Models: The Lanchester Equations And The Zombie Apocalypse, Hailey Bauer

Undergraduate Theses and Capstone Projects

This research study used mathematical models to analyze and depicted specific battle situations and the outcomes of the zombie apocalypse. The original models that predicted warfare were the Lanchester models, while the zombie apocalypse models were fictional expansions upon mathematical models used to examine infectious diseases. In this paper, I analyzed and compared different mathematical models by examining each model’s set of assumptions and the impact of the change in variables on the population classes. The purpose of this study was to understand the basics of the discrete dynamical systems and to determine the similarities between imaginary and realistic models. …

How Many Points Are There In A Line Segment? A New Answer From Discrete Cellular Space Viewpoint, Florentin Smarandache, Victor Christianto

Branch Mathematics and Statistics Faculty and Staff Publications

While it is known that Euclid’s five axioms include a proposition that a line consists at least of two points, modern geometry avoid consistently any discussion on the precise definition of point, line, etc. It is our aim to clarify one of notorious question in Euclidean geometry: how many points are there in a line segment? – from discrete-cellular space (DCS) viewpoint. In retrospect, it may offer an alternative of quantum gravity, i.e. by exploring discrete gravitational theories. To elucidate our propositions, in the last section we will discuss some implications of discrete cellular-space model in several areas of interest: …

Ideals, Big Varieties, And Dynamic Networks, Ian H. Dinwoodie

Mathematics and Statistics Faculty Publications and Presentations

The advantage of using algebraic geometry over enumeration for describing sets related to attractors in large dynamic networks from biology is advocated. Examples illustrate the gains.

Extensions Of The Morse-Hedlund Theorem, Eben Blaisdell

Honors Theses

Bi-infinite words are sequences of characters that are infinite forwards and backwards; for example "...ababababab...". The Morse-Hedlund theorem says that a bi-infinite word f repeats itself, in at most n letters, if and only if the number of distinct subwords of length n is at most n. Using the example, "...ababababab...", there are 2 subwords of length 3, namely "aba" and "bab". Since 2 is less than 3, we must have that "...ababababab..." repeats itself after at most 3 letters. In fact it does repeat itself every two letters. …

On The Three Dimensional Interaction Between Flexible Fibers And Fluid Flow, Bogdan Nita, Ryan Allaire

Department of Mathematics Faculty Scholarship and Creative Works

In this paper we discuss the deformation of a flexible fiber clamped to a spherical body and immersed in a flow of fluid moving with a speed ranging between 0 and 50 cm/s by means of three dimensional numerical simulation developed in COMSOL . The effects of flow speed and initial configuration angle of the fiber relative to the flow are analyzed. A rigorous analysis of the numerical procedure is performed and our code is benchmarked against well established cases. The flow velocity and pressure are used to compute drag forces upon the fiber. Of particular interest is the behavior …

On The Perfect Reconstruction Of The Structure Of Dynamic Networks, Alan Veliz-Cuba

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Two Generalizations Of The Filippov Operation, Menevse Eryuzlu

Masters Theses & Specialist Projects

The purpose of this thesis is to generalize Filippov's operation, and to get more useful results. It includes two main parts: The C-Filippov operation for the finite and countable cases and the Filippov operation with different measures. In the first chapter, we give brief information about the importance of Filippov's operation, our goal and the ideas behind our generalizations. In the second chapter, we give some sufficient background notes. In the third chapter, we introduce the Filippov operation, explain how to calculate the Filippov of a function and give some sufficient properties of it. In the fourth chapter, we introduce …

Tridiagonal Matrices And Boundary Conditions, J. J. P. Veerman, David K. Hammond

Mathematics and Statistics Faculty Publications and Presentations

We describe the spectra of certain tridiagonal matrices arising from differential equations commonly used for modeling flocking behavior. In particular we consider systems resulting from allowing an arbitrary boundary condition for the end of a one-dimensional flock. We apply our results to demonstrate how asymptotic stability for consensus and flocking systems depends on the imposed boundary condition.

Special Type Of Fixed Points Of Mod Matrix Operators, 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 a special type of fixed points using MOD square matrix operators. These special type of fixed points are different from the usual classical fixed points. A study of this is carried out in this book. Several interesting properties are developed in this regard. The notion of these fixed points find many applications in the mathematical models which are dealt systematically by the authors in the forth coming books. These special type of fixed points or special realized limit cycles are always guaranteed as we use only MOD matrices as operators with …

A Posteriori Eigenvalue Error Estimation For The Schrödinger Operator With The Inverse Square Potential, Hengguang Li, Jeffrey S. Ovall

Mathematics and Statistics Faculty Publications and Presentations

We develop an a posteriori error estimate of hierarchical type for Dirichlet eigenvalue problems of the form (−∆ + (c/r) 2 )ψ = λψ on bounded domains Ω, where r is the distance to the origin, which is assumed to be in Ω. This error estimate is proven to be asymptotically identical to the eigenvalue approximation error on a family of geometrically-graded meshes. Numerical experiments demonstrate this asymptotic exactness in practice.

Sandpiles, Spanning Trees, And Plane Duality, Melody Chan, Darren B. Glass, Matthew Macauley, David Perkinson, Caryn Werner, Qiaoyu Yang

Math Faculty Publications

Let G be a connected, loopless multigraph. The sandpile group of G is a finite abelian group associated to G whose order is equal to the number of spanning trees in G. Holroyd et al. used a dynamical process on graphs called rotor-routing to define a simply transitive action of the sandpile group of G on its set of spanning trees. Their definition depends on two pieces of auxiliary data: a choice of a ribbon graph structure on G, and a choice of a root vertex. Chan, Church, and Grochow showed that if G is a planar ribbon graph, it …

Exact Tests For Singular Network Data, Ian H. Dinwoodie, Kruti Pandya

Mathematics and Statistics Faculty Publications and Presentations

We propose methodology for exact statistical tests of hypotheses for models of network dynamics. The methodology formulates Markovian exponential families, then uses sequential importance sampling to compute expectations within basins of attraction and within level sets of a sufficient statistic for an over-dispersion model. Comparisons of hypotheses can be done conditional on basins of attraction. Examples are presented.

Special Dual Like Numbers And Lattices, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors introduce a new type of dual numbers called special dual like numbers. These numbers are constructed using idempotents in the place of nilpotents of order two as new element. That is x = a + bg is a special dual like number where a and b are reals and g is a new element such that g2 =g. The collection of special dual like numbers forms a ring. Further lattices are the rich structures which contributes to special dual like numbers. These special dual like numbers x = a + bg; when a and b …

Ergodic And Combinatorial Proofs Of Van Der Waerden's Theorem, Matthew Samuel Rothlisberger

CMC Senior Theses

Followed two different proofs of van der Waerden's theorem. Found that the two proofs yield important information about arithmetic progressions and the theorem. van der Waerden's theorem explains the occurrence of arithmetic progressions which can be used to explain such things as the Bible Code.