Mathematics Commons^™

Modeling The Clonal Rosette Composition Of A Bromeliaceae Genet: A Combinatorial Approach, Layla K. Lammers, Erin N. Bodine

Spora: A Journal of Biomathematics

Bromeliaceae, a neo-tropical plant family encompassing over 3,000 species, exhibit two modes of reproduction: sexual reproduction via flowers and seeds, and asexual reproduction via genetically identical clonal rosettes. The vegetative bodies of bromeliads form rosettes with new leaves emerging from the center and clonal rosettes emerging above a single leaf in the rosette, resulting in a genetic individual consisting of a seed-grown rosette and multiple iterations of clonal rosettes. This research develops a combinatorial model of probability that a single genetic individual will include at least n clonal rosettes when a single rosette can produce at most 1 or 2 …

Asymptotic Enumeration Of K-Bounded Functions Using Toeplitz Matrices, Tiago Cavalcante Trindade, Pedro Martineli

Rose-Hulman Undergraduate Mathematics Journal

We introduce the concept of $(\alpha, \lambda)$-bounded functions, characterized by limited local variation, which is especially useful in discrete sets. Initially, we formally define these functions and investigate their fundamental properties, highlighting significant differences from continuous functions. The main result obtained is the asymptotic estimate of $a(n, k)$, representing the number of functions from $[n]$ to $[n]$ that are $k$-bounded with respect to the Manhattan distance. The proof of this result combines Toeplitz matrices with a well-known inequality from graph theory.

Underclosed Posets, Richard Ngo

McNair Summer Research Program

Underclosed complexes are a recent generalization of interval graphs to higher dimensions. Motivated by underclosed complexes, we define and study underclosed posets. Order ideals of these posets correspond to pure underclosed complexes. We classify which principal order ideals are rank-symmetric (and in fact are self-dual).

Waiting For The Magic: A Historical And Mathematical Study Of Queues In Disney Theme Parks, Nina E. Becket

Journal of Humanistic Mathematics

This paper, written as part of an honors research project in high school, provides an introduction to the line and queuing systems at Disney theme parks. We begin with a brief history of Disney World and its creators. We then introduce the basics of queuing theory and queuing notation. Finally, we examine modern line systems at Disney (as of 2023) and the future of its different queue systems.

The Edge-Distinguishing Game, Nathaniel Benjamin, Elisa Benthem, Cooper Burkel, Marissa E. Chesser, Mike Janssen

Communications on Number Theory and Combinatorial Theory

In this paper, we introduce a graph coloring game called the Edge-Distinguishing Game (EDGe). The edge-distinguishing chromatic number of a graph is used to determine the moves each player can make. We determine which player has a winning strategy for particular graphs and graph families. Additionally, utilizing principles from game theory as well as previous work on a computational solution for the Game of Cycles.

(R2139) Italian Domination Number For Some Classes Of Trees, Amritha Prakash, Ragukumar Pandurangan

Applications and Applied Mathematics: An International Journal (AAM)

For a graph G with vertex set V , an Italian dominating function is a function f from V to {0, 1, 2} which has the property that for every vertex which is assigned 0, it must either adjacent to a vertex assigned 2 under f or adjacent to at least two vertices assigned 1 under f. The weight of an Italian dominating function is the sum of all weights assigned to the vertices. The minimum weight of an Italian dominating function f is the Italian domination number. Finding a graph’s Italian domination number is a well-known NP-Complete problem. Even …

(R2175) Application Of Similarity Measures On Bipolar Complex Neutrosophic Matrices In United Nations’ Sdg-17 Using Python, T. Muthuraji, N. Krishnapraveen

Applications and Applied Mathematics: An International Journal (AAM)

The increasing complexity of decision-making environments demands mathematical frameworks capable of modeling bipolar, indeterminate, and phase-dependent uncertainty simultaneously. Bipolar Complex Neutrosophic theory provides such a structure, but the extension of similarity measures to matrix-based environments remains largely unexplored. In this study, we formally develop cosine, Dice, Jaccard, and hybrid vector similarity measures for Bipolar Complex Neutrosophic Matrices (BCNMs). Each matrix element is represented by a Bipolar Complex Neutrosophic Number (BCNN), enabling structured representation of multidimensional uncertainty within a matrix framework. We also design and implement efficient Python-based computational tools to automate similarity evaluation for BCNMs. The proposed algorithms reduce computational …

(R2185) Operations On Bipolar Complex Neutrosophic Matrices And Its Application In Un’S Sdg-14 & Sdg-3 Using Python, N. Krishnapraveen, T. Muthuraji

Applications and Applied Mathematics: An International Journal (AAM)

Decision-making in sustainability oriented environments frequently involves bipolar evaluations, indeterminate information and phase dependent uncertainty that cannot be adequately represented by existing neutrosophic matrix models. To address this limitation, this study introduces a Bipolar Complex Neutrosophic Matrix (BCNM) framework that integrates bipolar semantics with complex valued uncertainty in a coherent algebraic structure. Fundamental operations and structural properties are rigorously established to ensure mathematical consistency. To facilitate practical multi criteria decision analysis (MCDA), novel score, accuracy, and hybrid aggregation operators are developed. The computational feasibility of the proposed approach is analyzed, demonstrating linear complexity with respect to the number of alternatives …

Qualitative Analysis Of Solutions To A General Class Of Nonlinear Difference Equations With Applications, Osama Moaaz, Mohamed F. Abouelenein, Mona Anis

Mathematical Modelling and Numerical Simulation with Applications

This work examines the qualitative behavior of a general class of difference equations. We establish criteria guaranteeing the stability, periodicity, and boundedness of the solutions of the equation under consideration. In addition, we identify its invariant intervals. The theoretical results are subsequently applied to various special cases, among them the May--Host model. Numerical simulations are presented to demonstrate the dynamics of the solutions and to validate the theoretical analysis.

Some Results In Maximal Pattern Complexity, Casey Schlortt

Electronic Theses and Dissertations

For a finite alphabet 𝒜 and a sequence 𝑥 ∈ 𝒜^ℕ_⊬ , Kamae and Zamboni combined the ideas of block complexity and topological sequence entropy to define the maximal pattern complexity, 𝑝^∗_𝑛 (𝑥). They defined an aperiodic sequence 𝑥 over two letters as pattern Sturmian if it had the lowest possible maximal pattern complexity, 2𝑛. Later, Kamae and Rao extended their definition of pattern Sturmian sequences to be sequences over ℓ ≥ 2 letters which are not periodic by projection and have maximal pattern complexity ℓ𝑛.

This dissertation answers a question posed by Kamae and Zamboni …

Obstructions To Some Injective Oriented Colourings, Russell J. Campbell, Nancy E. Clarke, Gary Macgillivray

Theory & Applications of Graphs

Each of several possible definitions of local injectivity for a homomorphism of an oriented graph $G$ to an oriented graph $H$ leads to an injective oriented colouring problem. For each case in which such a problem is solvable in polynomial time, we identify a set $\mathcal{F}$ of oriented graphs such that an oriented graph $G$ has an injective oriented colouring with the given number of colours if and only if there is no $F \in \mathcal{F}$ for which there is a locally-injective homomorphism of $F$ to $G$.

The Connected Vertex Cover In Graphs, Kamran Mirasheh, Elham Mirashe, Ebrahim Vatandoost

Theory & Applications of Graphs

This paper presents tight bounds and characterizations for the vertex cover number and the connected vertex cover number of graphs. In particular, we identify all graphs for which βc(G) = |V (G)| − 1, proving that these are exactly the cycles and complete graphs. The analysis employs tools such as the degree matrix and the Rayleigh quotient to derive new and sharp upper bounds.

The $K$-Total Bondage Number Of A Graph, Jean-Pierre Appel, Gabrielle Fischberg, Kyle Kelley, Nathan B. Shank, Eliel Sosis

Theory & Applications of Graphs

Let \(G=(V,E)\) be a connected, finite undirected graph. A set \(S \subseteq V\) is said to be a total dominating set of \(G\) if every vertex in \(V\) is adjacent to some vertex in \(S\). The total domination number, \(\gamma_{t}(G)\), is the minimum cardinality of a total dominating set in \(G\). We define the \(k\)-total bondage of $G$ to be the minimum number of edges to remove from \(G\) so that the resulting graph has a total domination number at least \(k\) more than \(\gamma_{t}(G)\). In this work we establish general properties of \(k\)-total bondage and find exact values for …

Hyper Face-Magic Graphs, Ross Belgram, Donald Mcginn

Theory & Applications of Graphs

For a planar graph G of order n, let F(G) be the set of all faces of G embedded into R 2 , including the exterior face. A bijective vertex labeling f : V (G) → {1, 2, ..., n} induces a face labeling f ∗ : F(G) → N defined by setting f ∗ (F) equal to the sum of all labels of the boundary vertices of F. The graph G is said to be hyper face-magic if there exists a vertex labeling whose induced face labeling is constant. In this paper, we state properties of hyper face-magic graphs …

On The Number Of Ways To Express A Set As A Union Of Individually Interesting Sets, Alison Watson

Master's Theses

In a dataset that contains what ought rightly to be several distinct datasets placed in juxtaposition with each other, grouping datapoints based on observed similarities can be done in many ways. Topological Data Analysis (TDA) is a field of math that seeks to impose geometric structure onto datasets, thereby translating problems in statistics to problems in geometry or topology. A common truism in this field is “Data has shape and shape has meaning.” In this thesis, we use combinatorial and categorical arguments to demonstrate some shortcomings of a TDA approach on a class of inverse problems inspired by marine wildlife …

Quiver Of Affine Monoid Of A Vector Space Over Finite Field, James Junie Chen Cleary

Dissertations, Theses, and Capstone Projects

In this paper, we study the quiver of the complex monoid algebra CAFF(n, q). There are n + 1 maximal subgroups of AFF(n, q), each isomorphic to AGL(k, q) for some 0 ≤ k ≤ n. Every irreducible representation of CAFF(n, q) arises from a character of CAGL(k, q) for a suitable k. Thus, we study two different approaches to classifying the characters of CAGL(k, q). Next, we compute the full quiver Q(CAFF(n, q)). Finally, we show that this quiver is a disjoint union of straight-line paths and that its basic algebra has radical square zero. Hence, it has finite …

Comparing The Sensitivity And Degree Of Boolean Functions Via The Hypercube, Anne-Caroline Rupp

University Honors Theses

This thesis studies three complexity measures of total Boolean functions f:{0,1}ⁿ → {0,1}: maximum sensitivity s(f), polynomial degree deg(f), and spectral sensitivity λ(f), where λ(f) is defined as the spectral norm of the adjacency matrix of the sensitivity graph. Building on the results of Aaronson et al., we examine the inequality chain √s(f) ≤ λ(f) ≤ deg(f) and investigate whether all three quantities can be simultaneously equal.

The first part of the thesis reverse engineers the equality cases of the two known inequalities to isolate necessary extremal conditions on both the Fourier structure of f and the local geometry …

From Total Domination To Graph Coloring, Sawyer Isaac Osborn

Dissertations

A question involving a chess piece called a prince on the 8×8 chessboard leads to a concept in graph theory involving total domination. We say a vertex u in a graph G totally dominates a vertex v if u is adjacent to v. A subset S of the vertex set of a graph G is a total dominating set for G if every vertex in G is totally dominated by at least one vertex of S. If S is a total dominating set of G, then σ_S(v) denotes the number of …

Equitable Decompositions: A Gateway To Spectral Theory Through Graph Automorphisms, Daniel Ford

Master's Theses

Graphs with symmetry appear throughout mathematics and its applications, from the structure of molecules and network design to combinatorial game theory. A central question in spectral graph theory is how to compute or characterise the eigenvalues of the matrices associated with such graphs. Classical decomposition methods, such as diagonalisation or Jordan normal form, accomplish this but only once some spectral information is already known. A different approach, introduced by Barrett et al. (2015), uses the automorphisms of a graph to block-diagonalise its adjacency matrix without any prior spectral information. Because one of the resulting summands is always the quotient matrix …

Relation Subspaces In Vertex Operator Algebras: Residue Generators For O_N^\Circ(V) And Intersections With (L(−1) +L(0))V, Junghyun Kim

Undergraduate Research Journal

We study the relation subspace 𝑂◦𝑛 (𝑉) that appears in the definition o f the level-𝑛 Zhu algebra 𝐴𝑛 (𝑉) = 𝑉/𝑂𝑛 (𝑉), where 𝑂𝑛 (𝑉) = 𝑂𝐿 (𝑉) + 𝑂◦𝑛 (𝑉) and 𝑂𝐿 (𝑉) =(𝐿(−1) + 𝐿(0))𝑉. Using residue calculus, we introduce operators 𝑅𝑛,𝑘 that encode the circle products 𝑢◦𝑛 𝑣 and prove explicit change-of-generators formulas between the standard generators (𝑢−𝑚1)◦𝑛 𝑣 and the residue generators 𝑢 𝑅𝑛,0𝑣, together with a binomial inversion. These identities provide a practical framework for computing 𝑂◦𝑛 (𝑉), especially in strongly generated VOAs. As progress toward understanding the overlap 𝑂◦𝑛 (𝑉) ∩ 𝑂𝐿 (𝑉), …

Greedy Algorithms And Matroids, Kiri M. Strack

LSU Master's Theses

In a connected graph with weights on the edges, a minimum-weight spanning tree can be obtained by repeatedly choosing minimum-weight edges while avoiding choosing the edge set of any cycle. This algorithm is known as Kruskal’s Algorithm, although it was first introduced by Boruvka in 1926. Prim introduced an alternative algorithm in which, at each step, the chosen set of edges forms a connected graph. Both of these algorithms make locally optimal choices that eventually yield a global optimum. This thesis considers how these algorithms can be extended to matroids. In particular, it is shown that matroids are exactly the …

Largest 2-Regular Subgraphs In Complete S-Partite Graphs, Yiyang Jiang

McKelvey School of Engineering Graduate Student Theses & Dissertations

In this thesis, we focus on the class of complete $S$-partite graphs, for $S$ an undirected graph possibly with self-loops, and address the problem of finding largest $2$-regular subgraphs of these graphs, which can be formulated as an integer linear program. Roughly speaking, a complete $S$-partite graph is obtained by replacing every single node of $S$ with a number of nodes, preserving the edge/non-edge relations of $S$. Our motivation in studying largest $2$-regular subgraphs is rooted in the structural systems theory, particularly in the problem of finding largest subnetworks that can sustain controllability or asymptotic stability of the corresponding subsystems. …

Numerical And Harmonic Analysis Of Simplex Number Parity, Hunter Dm Hannula

All NMU Master's Theses

The primary object of this thesis is the study of periodicity in the parity of simplex numbers by number-theoretic and harmonic methods. The regular d-simplex numbers are introduced geometrically, arithmetically, and combinatorially. We demonstrate that all sequences indexing even d-simplex numbers are defined by finitely many congruences in a single modulus, and are thus quasiperiodic. We therefore show that these "even index-sequences" are  particular elements in an affine space of functions, providing a natural decomposition result. We then introduce the discrete Fourier transform to construct the periodic parts of each index sequence, enabling the development of explicit forms for the …

A New Approach To Generate Combinatorial Patterns In Logical Analysis Of Data And Its Application To Predict College Retention, Salihah Ahmed E. Jaafari

Theses and Dissertations

Student retention and degree completion remain central challenges for higher-education institutions, with significant implications for student success, institutional effectiveness, and public accountability. While advances in predictive analytics have enabled earlier identification of students at risk of withdrawal, many commonly used machine learning approaches suffer from limited interpretability, constraining their practical usefulness for advising, intervention, and policy decision making. This dissertation addresses the problem of predicting student persistence by developing and evaluating optimization based, interpretable classification models within the Logical Analysis of Data (LAD) framework. Building on existing LAD formulations, this research introduces two novel pattern generation models, the Best Term …

Sumset Lower Bounds In Abelian Groups, Van T. Huynh

Honors Theses

This thesis investigates sumset lower bounds across discrete and continuous settings. We begin with general inequalities in torsion-free abelian groups and then specialize to the integers modulo prime p, where we present the Cauchy–Davenport Theorem, which establishes the bound ∣A+B∣≥min(p,∣A∣+∣B∣−1). The equality case is further examined via Vosper's Theorem, which characterizes subsets attaining this bound as arithmetic progressions under suitable conditions. The continuous analogue in Euclidean spaces is then considered, where cardinality is replaced by Lebesgue measure. In this setting, the Brunn–Minkowski Inequality provides a sharp lower bound for the Lebesgue measure of A+B and serves as a geometric counterpart …

On The Algebraicity Of The Tic-Tac-Toe Matroid And Homogeneous Mixed Bowtie Systems, Benjamin R. Allen

Electronic Theses and Dissertations

This thesis is presented in two parts. First, we explore whether the class of algebraic matroids is closed under duality, a decades-old open question. We consider the Tic-Tac-Toe matroid as a potential candidate to answer the open question. The Tic-Tac-Toe matroid is known to satisfy many of the necessary conditions for a matroid to be algebraic and has a non-algebraic dual.  Second, we focus on decompositions of the complete mixed graph into mixed bowties. A complete mixed graph has between every pair of vertices an undirected edge and antiparallel arcs. A mixed bowtie is a graph consisting of two 3-cycles …

Counting Hamiltonian Cycles In Quartic Circulant Graphs, Allison Hilliard

Seaver College Research And Scholarly Achievement Symposium

We consider the problem of counting Hamiltonian cycles in circulant graphs $C^K_n$ where $n$ is the number of vertices and $K$ is a set containing elements that correspond to the allowed edges in the circulant graphs. After sorting the cycles by a topological invariant called the winding number, we use a modified transfer matrix method to convert local data into global structures. The result is a generating function that counts the number of Hamiltonian cycles in a circulant graph with $n$ vertices. The results for $K=\{1,2\}$ and $K=\{1,3\}$ have been found by previous authors. We focus on the case where …

Irreversible K-Threshold Dynamics On Corona And Base-B Corona Product Graphs, Eric J. Moon, Soumya Bhoumik, Paul Flesher

SACAD: Scholarly Activities

This poster studies the irreversible k-threshold process on corona-type graph products, where a vertex becomes colored once at least k of its neighbors are colored and then remains colored permanently. We focus on corona, double corona, and base-b corona product graphs built from cycles and complete graphs, with particular attention to how graph structure affects complete activation from a minimum seed set.

A generalized reduction lemma is used to relate threshold dynamics on layered corona graphs to smaller residual graphs, yielding explicit formulas for the irreversible k-threshold conversion number on both corona and double corona families. The …

Extremal Connectivity In Graphs And Matroids, Yiwei Ge

LSU Doctoral Dissertations

Connectivity is a central theme in both graph theory and matroid theory. This dissertation investigates extremal connectivity in graphs and matroids, with emphasis on unavoidable structures and minimal connectivity phenomena.

Chapter 2 introduces cycle-contraction minors of graphs and investigates their structural properties. We establish a connection between cc-minors and induced subgraphs via graph duality. The main result gives an unavoidable-families characterization for cc-minors of sufficiently large loopless $2$-connected graphs.

Chapter 3 studies super-minimally $3$-connected graphs, namely $3$-connected graphs that have no proper $3$-connected subgraphs. We establish extremal bounds on structural parameters of these graphs, including the minimum number of degree-$3$ …

A 4-Dimensional Rubik’S Cube You Can Hold: How It’S Possible And The Math Behind It, Eric J. Moon

SACAD: Scholarly Activities

This poster examines the physical 2x2x2x2, a hand-held realization of a 4-dimensional Rubik’s Cube invented by Melinda Green. Unlike most higher-dimensional twisty puzzles, which exist only as software simulations, this puzzle provides a physical model for exploring 4-dimensional rotation, symmetry, and solving methods. The poster introduces the structure of the puzzle, its canonical move system, and several algebraic ideas that help explain how scrambling and solving work.

From a mathematical perspective, the puzzle can be studied using group actions, commutators, conjugation, and combinatorial counting. In particular, the number of reachable states depends on corner permutations, corner orientations, parity restrictions, twist …