Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Mathematics (2)
- Algebra (1)
- Almost complex manifolds (1)
- Almost complex structure (1)
- Analysis (1)
-
- Bernoulli (1)
- Bott Chern cohomology (1)
- CART (1)
- CV (1)
- Classification and regression trees (1)
- Classification trees (1)
- Cohomology groups (1)
- College of Natual Science and Mathematics (1)
- Complex manifolds (1)
- Cross validation (1)
- Discrepancy inequality (1)
- Discrete curvature (1)
- Disjoint cycles (1)
- FFT (1)
- Fast fourier transforms (1)
- Faulhaber (1)
- Fourier series (1)
- Integers (1)
- Iwasawa manifold (1)
- K-fold cross validation (1)
- Kadaira Thurston manifold (1)
- Kahler Manifolds (1)
- Knot polynomials (1)
- Knot theory (1)
- Knots (1)
Articles 1 - 6 of 6
Full-Text Articles in Other Mathematics
Sum Of Cubes Of The First N Integers, Obiamaka L. Agu
Sum Of Cubes Of The First N Integers, Obiamaka L. Agu
Electronic Theses, Projects, and Dissertations
In Calculus we learned that Sum^{n}_{k=1} k = [n(n+1)]/2 , that Sum^{n}_{k=1} k^2 = [n(n+1)(2n+1)]/6 , and that Sum^{n}_{k=1} k^{3} = (n(n+1)/2)^{2}. These formulas are useful when solving for the area below quadratic or cubic function over an interval [a, b]. This tedious process, solving for areas under a quadratic or a cubic, served as motivation for the introduction of Riemman integrals. For the overzealous math student, these steps were replaced by a simpler method of evaluating antiderivatives at the endpoints a and b. From my recollection, a former instructor informed us to do the value of memorizing these formulas. …
Spectral Sequences For Almost Complex Manifolds, Qian Chen
Spectral Sequences For Almost Complex Manifolds, Qian Chen
Dissertations, Theses, and Capstone Projects
In recent work, two new cohomologies were introduced for almost complex manifolds: the so-called J-cohomology and N-cohomology [CKT17]. For the case of integrable (complex) structures, the former cohomology was already considered in [DGMS75], and the latter agrees with de Rham cohomology. In this dissertation, using ideas from [CW18], we introduce spectral sequences for these two cohomologies, showing the two cohomologies have natural bigradings. We show the spectral sequence for the J-cohomology converges at the second page whenever the almost complex structure is integrable, and explain how both fit in a natural diagram involving Bott-Chern cohomology and the Frolicher spectral sequence. …
An Analysis And Comparison Of Knot Polynomials, Hannah Steinhauer
An Analysis And Comparison Of Knot Polynomials, Hannah Steinhauer
Senior Honors Projects, 2020-current
Knot polynomials are polynomial equations that are assigned to knot projections based on the mathematical properties of the knots. They are also invariants, or properties of knots that do not change under ambient isotopy. In other words, given an invariant α for a knot K, α is the same for any projection of K. We will define these knot polynomials and explain the processes by which one finds them for a given knot projection. We will also compare the relative usefulness of these polynomials.
Evaluating An Ordinal Output Using Data Modeling, Algorithmic Modeling, And Numerical Analysis, Martin Keagan Wynne Brown
Evaluating An Ordinal Output Using Data Modeling, Algorithmic Modeling, And Numerical Analysis, Martin Keagan Wynne Brown
Murray State Theses and Dissertations
Data and algorithmic modeling are two different approaches used in predictive analytics. The models discussed from these two approaches include the proportional odds logit model (POLR), the vector generalized linear model (VGLM), the classification and regression tree model (CART), and the random forests model (RF). Patterns in the data were analyzed using trigonometric polynomial approximations and Fast Fourier Transforms. Predictive modeling is used frequently in statistics and data science to find the relationship between the explanatory (input) variables and a response (output) variable. Both approaches prove advantageous in different cases depending on the data set. In our case, the data …
Discrepancy Inequalities In Graphs And Their Applications, Adam Purcilly
Discrepancy Inequalities In Graphs And Their Applications, Adam Purcilly
Electronic Theses and Dissertations
Spectral graph theory, which is the use of eigenvalues of matrices associated with graphs, is a modern technique that has expanded our understanding of graphs and their structure. A particularly useful tool in spectral graph theory is the Expander Mixing Lemma, also known as the discrepancy inequality, which bounds the edge distribution between two sets based on the spectral gap. More specifically, it states that a small spectral gap of a graph implies that the edge distribution is close to random. This dissertation uses this tool to study two problems in extremal graph theory, then produces similar discrepancy inequalities based …
Analysis On Sharp And Smooth Interface, Elizabeth V. Hawkins
Analysis On Sharp And Smooth Interface, Elizabeth V. Hawkins
Electronic Theses and Dissertations
In biology, minimizing a free energy functional gives an equilibrium shape that is the most stable in nature. The formulation of these functionals can vary in many ways, in particular they can have either a smooth or sharp interface. Minimizing a functional can be done through variational calculus or can be proved to exist using various analysis techniques. The functionals investigated here have a smooth and sharp interface and are analyzed using analysis and variational calculus respectively. From the former we find the condition for extremum and its second variation. The second variation is commonly used to analyze stability of …