Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Applied Mathematics (2854)
- Computer Sciences (2379)
- Education (2193)
- Statistics and Probability (2019)
- Other Mathematics (1912)
-
- Arts and Humanities (1643)
- Analysis (1618)
- Algebra (1406)
- Science and Mathematics Education (1332)
- Discrete Mathematics and Combinatorics (1313)
- Geometry and Topology (1060)
- Physics (812)
- Higher Education (770)
- Teacher Education and Professional Development (726)
- Engineering (710)
- Social and Behavioral Sciences (618)
- History (602)
- Life Sciences (565)
- Logic and Foundations (563)
- Number Theory (558)
- History of Science, Technology, and Medicine (501)
- Algebraic Geometry (465)
- Medicine and Health Sciences (395)
- Applied Statistics (340)
- Dynamical Systems (325)
- Curriculum and Instruction (291)
- Biology (269)
- Set Theory (255)
- Institution
-
- TÜBİTAK (2581)
- Claremont Colleges (1981)
- University of New Mexico (956)
- University of the Pacific (807)
- Louisiana State University (799)
-
- University of Texas Rio Grande Valley (779)
- University of Texas at El Paso (659)
- Missouri University of Science and Technology (626)
- University of Texas at Arlington (550)
- Utah State University (525)
- Georgia Southern University (486)
- Taylor University (480)
- Marquette University (478)
- Indian Statistical Institute (466)
- University of Montana (426)
- University of South Florida (425)
- University of Nebraska - Lincoln (395)
- City University of New York (CUNY) (380)
- Old Dominion University (371)
- Technological University Dublin (356)
- Prairie View A&M University (340)
- University of Dayton (323)
- Chapman University (319)
- Smith College (294)
- Portland State University (292)
- University of Richmond (274)
- Brigham Young University (255)
- Rose-Hulman Institute of Technology (254)
- California State University, San Bernardino (242)
- Wayne State University (238)
- Keyword
-
- Mathematics (1165)
- Technical Reports (367)
- UTEP Computer Science Department (367)
- Algebra (276)
- Geometry (246)
-
- Statistics (205)
- Mathematics Research (196)
- Calculus (193)
- Graph theory (180)
- Math (175)
- Algorithms (151)
- Combinatorics (148)
- Differential equations (126)
- Optimization (125)
- Computer science (122)
- Neutrosophic logic (116)
- Probability (106)
- Stability (106)
- Education (105)
- Pure sciences (105)
- Number theory (99)
- Topology (99)
- Number Theory (97)
- Machine learning (85)
- Polynomials (85)
- Mathematics education (81)
- Mathematical modeling (69)
- Teaching (69)
- Cryptography (67)
- Department of Mathematical Sciences (66)
- Publication Year
- Publication
-
- Turkish Journal of Mathematics (2581)
- Branch Mathematics and Statistics Faculty and Staff Publications (748)
- Journal of Humanistic Mathematics (708)
- All Works by Eneström Number (654)
- School of Mathematical & Statistical Sciences Faculty Publications (618)
-
- Mathematics Faculty Publications (562)
- Departmental Technical Reports (CS) (553)
- Theses and Dissertations (542)
- Doctoral Theses (460)
- Mathematics and Statistics Faculty Research & Creative Works (443)
- Communications on Stochastic Analysis (429)
- Mathematics and Statistics Faculty Publications (418)
- The Mathematics Enthusiast (411)
- Humanistic Mathematics Network Journal (409)
- Electronic Theses and Dissertations (371)
- All HMC Faculty Publications and Research (352)
- Mathematics Technical Papers - Archive (343)
- Applications and Applied Mathematics: An International Journal (AAM) (339)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (323)
- Articles (320)
- Dissertations (290)
- Faculty Publications (288)
- Department of Mathematics: Faculty Publications (223)
- Mathematics, Physics, and Computer Science Faculty Articles and Research (216)
- Mathematical Sciences: Faculty Publications (194)
- Mathematics Sciences: Faculty Publications (192)
- Mathematics (188)
- Honors Theses (187)
- Undergraduate Journal of Mathematical Modeling: One + Two (182)
- Mathematics and Statistics Faculty Publications and Presentations (171)
- Publication Type
- File Type
Articles 2551 - 2580 of 26863
Full-Text Articles in Mathematics
Slₖ-Tilings And Paths In ℤᵏ, Zachery T. Peterson
Slₖ-Tilings And Paths In ℤᵏ, Zachery T. Peterson
Theses and Dissertations--Mathematics
An SLₖ-frieze is a bi-infinite array of integers where adjacent entries satisfy a certain diamond rule. SL₂-friezes were introduced and studied by Conway and Coxeter. Later, these were generalized to infinite matrix-like structures called tilings as well as higher values of k. A recent paper by Short showed a bijection between bi-infinite paths of reduced rationals in the Farey graph and SL₂-tilings. We extend this result to higher k by constructing a bijection between SLₖ-tilings and certain pairs of bi-infinite strips of vectors in ℤᵏ called paths. The key ingredient in the proof is the relation to Plucker friezes and …
A Multiple-Case Study On The Impact Of An Introductory Real Analysis Course On Undergraduate Students' Understanding Of Function Continuity, Ryan Joseph Rogers
A Multiple-Case Study On The Impact Of An Introductory Real Analysis Course On Undergraduate Students' Understanding Of Function Continuity, Ryan Joseph Rogers
Theses and Dissertations--Mathematics
Undergraduate students' understanding of function continuity has not been explored broadly in previous research. The relevant findings in the literature are predominantly concerned with calculus students' understanding and misconceptions of continuity. Many of these misunderstandings are tied to the relationships which continuity has with limits and differentiability. This multiple-case study explores how, if at all, an introductory real analysis course impacts undergraduate students' understanding of function continuity and its connections to the notions of limits and differentiability. We embed our findings within the theoretical framework of Tall's three worlds of mathematics, namely, the embodied, symbolic, and formal worlds.
The cases …
Advanced Mathematical Graph-Based Machine Learning And Deep Learning Models For Drug Design, Farjana Tasnim Mukta
Advanced Mathematical Graph-Based Machine Learning And Deep Learning Models For Drug Design, Farjana Tasnim Mukta
Theses and Dissertations--Mathematics
Drug discovery is a highly complicated and time-consuming process. One of the main challenges in drug development is predicting whether a drug-like molecule will interact with a specific target protein. This prediction accelerates target validation and drug development. Recent research in biomolecular sciences has shown significant interest in algebraic graph-based models for representing molecular complexes and predicting drug-target binding affinity. In this thesis, we present algebraic graph-based molecular representations to create data-driven scoring functions (SF) using extended atom types to capture wide-range interactions between targets and drug candidates. Our model employs multiscale weighted colored subgraphs for the protein-ligand complex, colored …
Self-Exciting Point Processes In Real Estate, Ian Fraser
Self-Exciting Point Processes In Real Estate, Ian Fraser
Theses and Dissertations (Comprehensive)
This thesis introduces a novel approach to analyzing residential property sales through the lens of stochastic processes by employing point processes. Herein, property sales are treated as point patterns, using self-exciting point process models and a variety of statistical tools to uncover underlying patterns in the data. Key findings include the identification and explanation of clustering in both space and time, and the efficacy of a temporal Hawkes process with a sinusoidal background in predicting home sale occurrences. The temporal analysis starts by employing the state of art techniques for time series data like regression, autoregressive, and autoregressive integrated moving …
The Atiyah-Hitchin-Singer Theorem And An 8-Dimensional Generalization, Timothy Ponepal
The Atiyah-Hitchin-Singer Theorem And An 8-Dimensional Generalization, Timothy Ponepal
Theses and Dissertations (Comprehensive)
The Atiyah-Hitchin-Singer theorem states that the twistor almost complex structure on a certain S2 bundle over an oriented Riemannian 4-manifold (M, g) is integrable if and only if the Weyl curvature tensor of g is self-dual. These ideas were developed by Roger Penrose connecting 4-dimensional Riemannian geometry with complex geometry. We present a new approach to the Atiyah-Hitchin-Singer theorem using horizontal lifts and their respective flows, cross products and the quaternions to show that the Nijenhuis tensor vanishes if and only if the Weyl curvature tensor of g is anti-self-dual. An eight dimensional generalization is presented when the …
Advanced Techniques In Time Series Forecasting: From Deterministic Models To Deep Learning, Xue Bai
Advanced Techniques In Time Series Forecasting: From Deterministic Models To Deep Learning, Xue Bai
Graduate Theses, Dissertations, and Problem Reports (ETD)
This dissertation discusses three instances of temporal prediction, applied to population dynamics and deep learning.
In population modeling, dynamic processes are frequently represented by systems of differential equations, allowing for the analysis of various phenomena. The first application explores modeling cloned hematopoiesis in chronic myeloid leukemia (CML) via a nonlinear system of differential equations. By tracking the evolution of different cell compartments, including cycling and quiescent stem cells, progenitor cells, differentiated cells, and terminally differentiated cells, the model captures the transition from normal hematopoiesis to the chronic and accelerated-acute phases of CML. Three distinct non-zero steady states are identified, representing …
Reducing Generalization Error In Multiclass Classification Through Factorized Cross Entropy Loss, Oleksandr Horban
Reducing Generalization Error In Multiclass Classification Through Factorized Cross Entropy Loss, Oleksandr Horban
CMC Senior Theses
This paper introduces Factorized Cross Entropy Loss, a novel approach to multiclass classification which modifies the standard cross entropy loss by decomposing its weight matrix W into two smaller matrices, U and V, where UV is a low rank approximation of W. Factorized Cross Entropy Loss reduces generalization error from the conventional O( sqrt(k / n) ) to O( sqrt(r / n) ), where k is the number of classes, n is the sample size, and r is the reduced inner dimension of U and V.
Centers Of N-Degree Poncelet Circles, Georgia Corbett
Centers Of N-Degree Poncelet Circles, Georgia Corbett
Honors Theses
Given a circle inscribed in a polygon inscribed in the unit circle, if one connects all the vertices with line segments we get a family of circles called a package of Poncelet circles, due to its connection to a theorem of Poncelet. We are interested in where the centers of the Poncelet circles can be. Specifically, we have shown that if one of the circles in the Poncelet package is centered at 0, then all of the circles must be centered at 0 as well. This was proven by Spitkovsky and Wegert in 2021 using elliptic integrals but we …
Applications And Analysis Of Nlp Deep Learning Models For Antibiotic's Side Effects Classifications, An Ly
Applications And Analysis Of Nlp Deep Learning Models For Antibiotic's Side Effects Classifications, An Ly
CGU Theses & Dissertations
I introduce a novel recursive modification to the classical Goemans-Williamson MaxCut algorithm, offering improved performance in vectorized data clustering tasks. Focusing on the clustering of medical publications, I suggest to employ recursive iterations in conjunction with a dimension relaxation method to enhance density of clustering results. Furthermore, I propose a new vectorization technique for articles, leveraging conditional probabilities for more effective clustering. I believe that these methods will provide advantages in both computational efficiency and clustering accuracy. I will analyze the effectiveness of recursive iterations and higher-dimensional generalizations of the GWA in the hopes of achieving more accurate dissimilarity-based clustering. …
Unveiling The Power Of Shor's Algorithm: Cryptography In A Post Quantum World, Dylan Phares
Unveiling The Power Of Shor's Algorithm: Cryptography In A Post Quantum World, Dylan Phares
CMC Senior Theses
Shor's Algorithm is an extremely powerful tool, in utilizing this tool it is important to understand how it works and why it works. As well as the vast implications it could have for cryptography
Berglund–Hübsch Transpose Rule And Sasakian Geometry, Ralph R. Gomez
Berglund–Hübsch Transpose Rule And Sasakian Geometry, Ralph R. Gomez
Mathematics & Statistics Faculty Works
We apply the Berglund–Hübsch transpose rule from BHK mirror symmetry to show that to an n−1-dimensional Calabi–Yau orbifold in weighted projective space defined by an invertible polynomial, we can associate four (possibly) distinct Sasaki manifolds of dimension 2n+1 which are n−1-connected and admit a metric of positive Ricci curvature. We apply this theorem to show that for a given K3 orbifold, there exist four seven-dimensional Sasakian manifolds of positive Ricci curvature, two of which are actually Sasaki–Einstein.
The Computational Search For Unidentified Central Configurations Of The Newtonian N-Body Problem, Hannah G. Havel
The Computational Search For Unidentified Central Configurations Of The Newtonian N-Body Problem, Hannah G. Havel
CURE Proceedings
The N-body problem is a field of study in mathematics and physics that involves predicting the motion of particles moving under their mutual gravitational attraction. It is vital in celestial mechanics, such as planning collision-free satellite orbit trajectories. When beginning to understand the N-body problem, we can start by looking at equal masses of these particles or celestial bodies. As particles move, their position and velocity change, both energy and angular momentum are conserved. Sets of constant energy and angular momentum, known as integral manifolds, are higher-dimensional figures that represent constraints of movement to a system. Integral manifolds are described …
The Independence Polynomial Of A Graph At −1, Phoebe Rose Zielonka
The Independence Polynomial Of A Graph At −1, Phoebe Rose Zielonka
Theses, Dissertations and Culminating Projects
No abstract provided.
Echolocation On Manifolds, Kerong Wang
Echolocation On Manifolds, Kerong Wang
Honors Theses
We consider the question asked by Wyman and Xi [WX23]: ``Can you hear your location on a manifold?” In other words, can you locate a unique point x on a manifold, up to symmetry, if you know the Laplacian eigenvalues and eigenfunctions of the manifold? In [WX23], Wyman and Xi showed that echolocation holds on one- and two-dimensional rectangles with Dirichlet boundary conditions using the pointwise Weyl counting function. They also showed echolocation holds on ellipsoids using Gaussian curvature.
In this thesis, we provide full details for Wyman and Xi's proof for one- and two-dimensional rectangles and we show that …
The Effect Of The Expanded Child And Dependent Care Tax Credit On Maternal Labor Supply, Abby Letocha
The Effect Of The Expanded Child And Dependent Care Tax Credit On Maternal Labor Supply, Abby Letocha
Honors Theses
Policies that subsidize childcare have many potential economic benefits such as mitigating the high cost of childcare, incentivizing families to have more children, increasing paid childcare participation, and increasing parental labor supply. In this paper, I focus on the effect of childcare subsidies on maternal labor supply through a tax policy expansion. The Child and Dependent Care Tax Credit (CDCTC) is the primary federal childcare subsidy in the United States, and it was temporarily expanded in 2021 under the American Rescue Plan Act. This expansion increased the generosity of the credit and made it fully refundable for the 2021 tax …
The Impact Of U.S. News And World Report College Rankings On Prospective Students’ Decisions And Enrollment Outcomes, Camilla Schneider
The Impact Of U.S. News And World Report College Rankings On Prospective Students’ Decisions And Enrollment Outcomes, Camilla Schneider
Honors Theses
The following paper further expands on previous research using more recent data which is important given changes in the last decade. This paper will answer the question: How do U.S. News and World Report college rankings impact college application and enrollment decisions for prospective students within American public and private colleges and universities? Application decisions refer to the choice to apply to a school while enrollment decisions refer to the choice to attend a school after being accepted. This paper analyzes Integrated Postsecondary Education Data System (IPEDs) admissions/applicant, fall enrollment, and financial data alongside historical USNWR rankings lists to investigate …
On Cyclically 4-Connected Cubic Graphs, R. J. Kingan, S. R. Kingan
On Cyclically 4-Connected Cubic Graphs, R. J. Kingan, S. R. Kingan
Publications and Research
A 3-connected cubic graph is cyclically 4-connected if it has at least n ≥ 8 vertices and when removal of a set of three edges results in a disconnected graph, only one component has cycles. By introducing the notion of cycle spread to quantify the distance between pairs of edges, we get a new characterization of cyclically 4-connected graphs. Let Qn and Vn denote the ladder and Möbius ladder on n ≥ 8 vertices, respectively. We prove that a 3-connected cubic graph G is cyclically 4-connected if and only if G is either the Petersen graph, Q …
Recoloring In Hereditary Graph Classes: Structure And Decomposition, Manoj Belavadi
Recoloring In Hereditary Graph Classes: Structure And Decomposition, Manoj Belavadi
Theses and Dissertations (Comprehensive)
In this thesis we study reconfiguration problems in graph theory. A reconfiguration problem is generally defined on the solution space of a problem for which a configuration can be defined as a feasible solution, for example, a coloring of a graph. In Chapters 1 through 4 we study the reconfiguration of vertex colorings. The reconfiguration graph of the k-colorings, denoted Rk(G), is the graph whose vertices are the k-colorings of G and two colorings are adjacent in Rk(G) if they differ on exactly one vertex. The basic question investigated here …
A Generalization Of The Graham-Pollak Tree Theorem To Even-Order Steiner Distance, Joshua Cooper, Gabrielle Tauscheck
A Generalization Of The Graham-Pollak Tree Theorem To Even-Order Steiner Distance, Joshua Cooper, Gabrielle Tauscheck
Faculty Publications
Graham and Pollak showed in 1971 that the determinant of a tree’s distance matrix depends only on its number of vertices, and, in particular, it is always nonzero. The Steiner distance of a collection of k vertices in a graph is the fewest number of edges in any connected subgraph containing those vertices; for k = 2, this reduces to the ordinary definition of graphical distance. Here we show that the hyperdeterminant of the kth order Steiner distance hypermatrix is always nonzero if k is even, extending their result beyond k = 2. Previously, the authors showed that the k-Steiner …
On Graph Decompositions And Designs: Exploring The Hamilton-Waterloo Problem With A Factor Of 6-Cycles And Projective Planes Of Order 16, Zazil Santizo Huerta
On Graph Decompositions And Designs: Exploring The Hamilton-Waterloo Problem With A Factor Of 6-Cycles And Projective Planes Of Order 16, Zazil Santizo Huerta
Dissertations, Master's Theses and Master's Reports
This dissertation tackles the challenging graph decomposition problem of finding solutions to the uniform case of the Hamilton-Waterloo Problem (HWP). The HWP seeks decompositions of complete graphs into cycles of specific lengths. Here, we focus on cases with a single factor of 6-cycles. The dissertation then delves into the construction of 1-rotational designs, a concept from finite geometry. It explores the connection between these designs and finite projective planes, which are specific geometric structures. Finally, the dissertation proposes a potential link between these seemingly separate areas. It suggests investigating whether 1-rotational designs might hold the key to solving unsolved instances …
Constacyclic Codes Of Length With Three Prime Factors And Primitive Idempotents, Supakarn Rakphon
Constacyclic Codes Of Length With Three Prime Factors And Primitive Idempotents, Supakarn Rakphon
Chulalongkorn University Theses and Dissertations (Chula ETD)
Let Fq be a finite field of order q and t be a prime such that q t − 1 = l v1 1 l v2 2 l v3 3 c where l1, l2, l3 are distinct odd primes with gcd(l1l2l3, q(q−1)) = 1 and c is a positive integer with gcd(l1l2l3, c) = 1. In this thesis, we find all irreducible divisors of x l m1 1 l m2 2 l m3 3 −a over Fq and all generator polynomials for constructing a-constacyclic codes of length l m1 1 l m2 2 l m3 3 . In addition, we …
Spatial Data Analysis For Household Income And Expenditure In Thailand, Jirayut Rattana
Spatial Data Analysis For Household Income And Expenditure In Thailand, Jirayut Rattana
Chulalongkorn University Theses and Dissertations (Chula ETD)
Poverty has been a serious problem for many countries throughout the world, particularly during the COVID-19 pandemic. Due to the pandemic, many people lost their jobs and encountered economic. Therefore, the government and policy planners need an effective strategy to improve the country's economy. An essential component of these strategies involves analyzing socio-economic indicators, a field extensively explored by statisticians, economists, and policymakers. In Thailand, methodologies such as the World Bank method, Empirical Bayes, and Hierarchical Bayes have been applied to tackle poverty. However, these approaches often overlook the integration of spatial information in their analyses. In this study, we …
Homotopy Conjugate Of Continuous Map, Thitipon Phuksawad
Homotopy Conjugate Of Continuous Map, Thitipon Phuksawad
Chulalongkorn University Theses and Dissertations (Chula ETD)
In this thesis, we introduce the concept of homotopy conjugate, which is weaker than topological conjugate, for continuous maps. We study the properties of a homotopy conjugate related to the fixed space, the orbit space, and the mapping cylinder. Moreover, we prove that affine maps on R™ with at least one fixed point are all homotopy conjugate.
Fixed Point And Periodic Cycle Of Sequence Arises From Number Of Factors, Thanapong Jaitrakoon
Fixed Point And Periodic Cycle Of Sequence Arises From Number Of Factors, Thanapong Jaitrakoon
Chulalongkorn University Theses and Dissertations (Chula ETD)
Let. {an} and {bn} be sequences of positive integers. For each positive integer n., define an+1 to be the eube of the number of positive factors of an and define bn+1 to be the forth power of the number of positive factors of bn. This thesis proves that (i) if a1 > 1, then (an) eventually becomes the fixed point, namely 21952 or 64000, or {an}eventually becomes a sequence having periodie cycle of prime period 2, namely (64, 343) or (343, 64); (ii) if b1 > 1, then {bn} is eventually the fixed point, namely 625, 6561 or 4100625.
Some Properties Of S-Multiplication Modules And S-Comultiplication Modules, Kanrop Hukaew
Some Properties Of S-Multiplication Modules And S-Comultiplication Modules, Kanrop Hukaew
Chulalongkorn University Theses and Dissertations (Chula ETD)
Let R be an associative ring with identity, and all modules be unitary right R- modules. In 2020, D. D. Anderson et al. introduced the concept of S-multiplication modules, which is a generalization of multiplication modules. Two years later, E. Yildiz et al. introduced the dual notion of S-multiplication modules called S- comultiplication modules. Moreover, S-comultiplication modules are also a gen- eralization of comultiplication modules. In this thesis, we will explore several properties of both S-multiplication modules and S-comultiplication modules. We will provide examples of S-multiplication modules and S-comultiplication modules. Additionally, we demonstrate that the concepts of S-multiplication modules, sim- …
Contrastive Learning, With Application To Forensic Identification Of Source, Cole Ryan Patten
Contrastive Learning, With Application To Forensic Identification Of Source, Cole Ryan Patten
Electronic Theses and Dissertations
Forensic identification of source problems often fall under the category of verification problems, where recent advances in deep learning have been made by contrastive learning methods. Many forensic identification of source problems deal with a scarcity of data, an issue addressed by few-shot learning. In this work, we make specific what makes a neural network a contrastive network. We then consider the use of contrastive neural networks for few-shot learning classification problems and compare them to other statistical and deep learning methods. Our findings indicate similar performance between models trained by contrastive loss and models trained by cross-entropy loss. We …
Extending Natural Mates In Euclidean 3-Space And Applications To Bertrand Pairs, Yun Myung Oh, Alexander Navarro
Extending Natural Mates In Euclidean 3-Space And Applications To Bertrand Pairs, Yun Myung Oh, Alexander Navarro
Faculty Publications
In Euclidean 3-space, a family of curves, the co-successor, is motivated and then introduced in relation to the natural mate. A complete characterization of co-successors is proved, followed by an application of the co-successor towards describing Bertrand curves and their mates.
Legendrian Torus And Cable Links, Jennifer Dalton,, John B. Etnyre, Lisa Traynor
Legendrian Torus And Cable Links, Jennifer Dalton,, John B. Etnyre, Lisa Traynor
Mathematics Faculty Research and Scholarship
We give a classification of Legendrian torus links. Along the way, we give the first classification of infinite families of Legendrian links where some smooth symmetries of the link cannot be realized by Legendrian isotopies. We also give the first family of links that are non-destabilizable but do not have maximal Thurston-Bennequin invariant and observe a curious distribution of Legendrian torus knots that can be realized as the components of a Legendrian torus link. This classification of Legendrian torus links leads to a classification of transversal torus links.
We also give a classification of Legendrian and transversal cable links of …
Development Of Probabilistic Dynamic Model Building And Bayesian Machine Learning Approaches, Samuel Oladayo Adeyemo
Development Of Probabilistic Dynamic Model Building And Bayesian Machine Learning Approaches, Samuel Oladayo Adeyemo
Graduate Theses, Dissertations, and Problem Reports (ETD)
Abstract
Development of Probabilistic Dynamic Model Building and Bayesian Machine Learning Approaches
Samuel Adeyemo
The recent years have seen a tremendous increase in the use of artificial intelligence (AI) and machine learning (ML) for the development of data-driven mathematical models needed for performing real-time optimization, model-based control, performance optimization, dynamic data reconciliation, and process performance monitoring. However, the development of data-driven models is faced with some challenges including lack of model interpretability, sensitivity of algorithm to noise in training data, limited extrapolation capabilities and violation of conservation laws. Drawing motivation from these existing gaps, this work aims to develop robust …
Modeling Inflation Using A Fast Fourier Transform (Fft), Blake Smith
Modeling Inflation Using A Fast Fourier Transform (Fft), Blake Smith
Williams Honors College, Honors Research Projects
This paper utilizes a Fast Fourier Transform (FFT) algorithm to construct a trigonometric interpolant for the Consumer Price Index (CPI), which is then differentiated and used to obtain a continuous function for “instantaneous” (i.e., month-wise) inflation, as opposed to a 12-month percent-change. Fourier coefficients are analyzed to investigate underlying periodicities in the newly constructed function. This metric does not hold significant predictive value but it may prove helpful in retroactive analysis of inflation trends.