Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 8 of 8
Full-Text Articles in Physical Sciences and Mathematics
An Alternate Approach To Alternating Sums: A Method To Die For, Arthur T. Benjamin, Jennifer J. Quinn
An Alternate Approach To Alternating Sums: A Method To Die For, Arthur T. Benjamin, Jennifer J. Quinn
Jennifer J. Quinn
No abstract provided in this article.
Fibonacci Deteminants - A Combinatorial Approach, Arthur T. Benjamin, Naiomi T. Cameron, Jennifer J. Quinn
Fibonacci Deteminants - A Combinatorial Approach, Arthur T. Benjamin, Naiomi T. Cameron, Jennifer J. Quinn
Jennifer J. Quinn
In this paper, we provide combinatorial interpretations for some determinantal identities involving Fibonacci numbers. We use the method due to Lindström-Gessel-Viennot in which we count nonintersecting n-routes in carefully chosen digraphs in order to gain insight into the nature of some well-known determinantal identities while allowing room to generalize and discover new ones.
Connectivity Bounds And S-Partitions For Triangulated Manifolds, Alexandru Ilarian Papiu
Connectivity Bounds And S-Partitions For Triangulated Manifolds, Alexandru Ilarian Papiu
Arts & Sciences Electronic Theses and Dissertations
Two of the fundamental results in the theory of convex polytopes are Balinski’s Theorem on connectivity and Bruggesser and Mani’s theorem on shellability. Here we present results that attempt to generalize both results to triangulated manifolds. We obtain new connectivity bounds for complexes with certain missing faces and introduce a way to measure how far a manifold is from being shellable using S-partitions and the Stanley-Reisner Ring.
From Simplest Recursion To The Recursion Of Generalizations Of Cross Polytope Numbers, Yutong Yang
From Simplest Recursion To The Recursion Of Generalizations Of Cross Polytope Numbers, Yutong Yang
KSU Journey Honors College Capstones and Theses
My research project involves investigations in the mathematical field of combinatorics. The research study will be based on the results of Professors Steven Edwards and William Griffiths, who recently found a new formula for the cross-polytope numbers. My topic will be focused on "Generalizations of cross-polytope numbers". It will include the proofs of the combinatorics results in Dr. Edwards and Dr. Griffiths' recently published paper. $E(n,m)$ and $O(n,m)$, the even terms and odd terms for Dr. Edward's original combinatorial expression, are two distinct combinatorial expressions that are in fact equal. But there is no obvious algebraic evidence to show that …
Tropical Derivation Of Cohomology Ring Of Heavy/Light Hassett Spaces, Shiyue Li
Tropical Derivation Of Cohomology Ring Of Heavy/Light Hassett Spaces, Shiyue Li
HMC Senior Theses
The cohomology of moduli spaces of curves has been extensively studied in classical algebraic geometry. The emergent field of tropical geometry gives new views and combinatorial tools for treating these classical problems. In particular, we study the cohomology of heavy/light Hassett spaces, moduli spaces of heavy/light weighted stable curves, denoted as $\calm_{g, w}$ for a particular genus $g$ and a weight vector $w \in (0, 1]^n$ using tropical geometry. We survey and build on the work of \citet{Cavalieri2014}, which proved that tropical compactification is a \textit{wonderful} compactification of the complement of hyperplane arrangement for these heavy/light Hassett spaces. For $g …
Combinatorial Polynomial Hirsch Conjecture, Sam Miller
Combinatorial Polynomial Hirsch Conjecture, Sam Miller
HMC Senior Theses
The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the graph of the polytope is at most n-d. This conjecture was disproven in 2010 by Francisco Santos Leal. However, a polynomial bound in n and d on the diameter of a polytope may still exist. Finding a polynomial bound would provide a worst-case scenario runtime for the Simplex Method of Linear Programming. However working only with polytopes in higher dimensions can prove challenging, so other approaches are welcome. There are many equivalent formulations of the Hirsch Conjecture, one of which is the …
Gallai-Ramsey Numbers For C7 With Multiple Colors, Dylan Bruce
Gallai-Ramsey Numbers For C7 With Multiple Colors, Dylan Bruce
Honors Undergraduate Theses
The core idea of Ramsey theory is that complete disorder is impossible. Given a large structure, no matter how complex it is, we can always find a smaller substructure that has some sort of order. One view of this problem is in edge-colorings of complete graphs. For any graphs G, H1, ..., Hk, we write G → (H1, ..., Hk), or G → (H)k when H1 = ··· = Hk = H, if every k-edge-coloring of G contains a monochromatic Hi in color i for some i ∈ …
Distribution Of Permutation Statistics Across Pattern Avoidance Classes, And The Search For A Denert-Associated Condition Equivalent To Pattern Avoidance, Joshua Thomas Agustin Davies
Distribution Of Permutation Statistics Across Pattern Avoidance Classes, And The Search For A Denert-Associated Condition Equivalent To Pattern Avoidance, Joshua Thomas Agustin Davies
Dissertations, Master's Theses and Master's Reports
We begin with a discussion of the symmetricity of $\maj$ over $\des$ in pattern avoidance classes, and its relationship to $\maj$-Wilf equivalence. From this, we explore the distribution of permutation statistics across pattern avoidance for patterns of length 3 and 4.
We then begin discussion of Han's bijection, a bijection on permutations which sends the major index to Denert's statistic and the descent number to the (strong) excedance number. We show the existence of several infinite families of fixed points for Han's bijection.
Finally, we discuss the image of pattern avoidance classes under Han's bijection, for the purpose of finding …