Applied Mathematics Commons^™

Approximate 2-Dimensional Pexider Quadratic Functional Equations In Fuzzy Normed Spaces And Topological Vector Space, Mohammad A. Abolfathi, Ali Ebadian

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, we prove the Hyers-Ulam stability of the 2-dimensional Pexider quadratic functional equation in fuzzy normed spaces. Moreover, we prove the Hyers-Ulam stability of this functional equation, where f, g are functions defined on an abelian group with values in a topological vector space.

Two Temperature Dual-Phase-Lag Fractional Thermal Investigation Of Heat Flow Inside A Uniform Rod, Vinayak Kulkarni, Gaurav Mittal

Applications and Applied Mathematics: An International Journal (AAM)

A non-classical, coupled, fractionally ordered, dual-phase-lag (DPL) heat conduction model has been presented in the framework of the two-temperature theory in the bounded Cartesian domain. Due to the application of two-temperature theory, the governing heat conduction equation is well-posed and satisfying the required stability criterion prescribed for a DPL model. The mathematical formulation has been applied to a uniform rod of finite length with traction free ends considered in a perfectly thermoelastic homogeneous isotropic medium. The initial end of the rod has been exposed to the convective heat flux and energy dissipated by convection into the surrounding medium through the …

Chudnovsky's Conjecture And The Stable Harbourne-Huneke Containment, Sankhaneel Bisui, Eloísa Grifo, Huy Tài Hà, Thái Thành Nguyên

Department of Mathematics: Faculty Publications

We investigate containment statements between symbolic and ordinary powers and bounds on the Waldschmidt constant of defining ideals of points in projective spaces. We establish the stable Harbourne conjecture for the defining ideal of a general set of points. We also prove Chudnovsky’s Conjecture and the stable version of the Harbourne–Huneke containment conjectures for a general set of sufficiently many points.

The “Knapsack Problem” Workbook: An Exploration Of Topics In Computer Science, Steven Cosares

Open Educational Resources

This workbook provides discussions, programming assignments, projects, and class exercises revolving around the “Knapsack Problem” (KP), which is widely a recognized model that is taught within a typical Computer Science curriculum. Throughout these discussions, we use KP to introduce or review topics found in courses covering topics in Discrete Mathematics, Mathematical Programming, Data Structures, Algorithms, Computational Complexity, etc. Because of the broad range of subjects discussed, this workbook and the accompanying spreadsheet files might be used as part of some CS capstone experience. Otherwise, we recommend that individual sections be used, as needed, for exercises relevant to a course in …

On Higher-Order Duality In Nondifferentiable Minimax Fractional Programming, S. Al-Homidan, Vivek Singh, I. Ahmad

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, we consider a nondifferentiable minimax fractional programming problem with continuously differentiable functions and formulate two types of higher-order dual models for such optimization problem. Weak, strong and strict converse duality theorems are derived under higher- order generalized invexity.

Demailly's Conjecture And The Containment Problem, Sankhaneel Bisui, Eloisa Grifo, Huy Tài Hà, Thái Thành Nguyên

Department of Mathematics: Faculty Publications

We investigate Demailly’s Conjecture for a general set of sufficiently many points. Demailly’s Conjecture generalizes Chudnovsky’s Conjecture in providing a lower bound for the Waldschmidt constant of a set of points in projective space. We also study a containment between symbolic and ordinary powers conjectured by Harbourne and Huneke that in particular implies Demailly’s bound, and prove that a general version of that containment holds for generic determinantal ideals and defining ideals of star configurations.

Dominating Functions In Graphs, Maria Talanda-Fisher

Dissertations

Domination in graphs has become one of the most popular areas of graph the- ory, no doubt due to its many fascinating problems and applications to modern society, as well as the sheer mathematical beauty of the subject. While this area evidently began with the work by the French mathematician Claude Berge in 1958 and the Norwegian-American mathematician Oystein Ore in 1962, domination did not become an active area of research until 1977 with the appearance of the survey paper by Ernest Cockayne and Stephen Hedetniemi. Since then a large number of variations of domination have surfaced and provided numerous …

Compare And Contrast Maximum Likelihood Method And Inverse Probability Weighting Method In Missing Data Analysis, Scott Sun

Mathematical Sciences Technical Reports (MSTR)

Data can be lost for different reasons, but sometimes the missingness is a part of the data collection process. Unbiased and efficient estimation of the parameters governing the response mean model requires the missing data to be appropriately addressed. This paper compares and contrasts the Maximum Likelihood and Inverse Probability Weighting estimators in an Outcome-Dependendent Sampling design that deliberately generates incomplete observations. WE demonstrate the comparison through numerical simulations under varied conditions: different coefficient of determination, and whether or not the mean model is misspecified.

Application Of Randomness In Finance, Jose Sanchez, Daanial Ahmad, Satyanand Singh

Publications and Research

Brownian Motion which is also considered to be a Wiener process and can be thought of as a random walk. In our project we had briefly discussed the fluctuations of financial indices and related it to Brownian Motion and the modeling of Stock prices.

A Component-Wise Approach To Smooth Extension Embedding Methods, Vivian Montiforte

Dissertations

Krylov Subspace Spectral (KSS) Methods have demonstrated to be highly scalable methods for PDEs. However, a current limitation of these methods is the requirement of a rectangular or box-shaped domain. Smooth Extension Embedding Methods (SEEM) use fictitious domain methods to extend a general domain to a simple, rectangular or box-shaped domain. This dissertation describes how these methods can be combined to extend the applicability of KSS methods, while also providing a component-wise approach for solving the systems of equations produced with SEEM.

Applications Of Evidence Theory To High-Consequence Systems Safety, Christina Marie Deffenbaugh

Mathematics & Statistics ETDs

Issues linked to abnormal environments (like high-consequence systems safety, e.g., nuclear weapon components, bridges, apartment buildings, etc.) may have insufficient information to use either classical statistical methods or Bayesian approaches for calculating associated probabilistic risks, so there is often a requirement for another method that can deal with a low-information situation to obtain a risk assessment. Belief/plausibility measures of uncertainty from A. P. Dempster and G. Shafer’s Evidence Theory is one such method. This thesis has two goals. First, a brief discussion on belief/plausibility measures as an application of Evidence Theory will familiarize the audience with its history and how …

Constructing Non-Proxy Small Test Modules For The Complete Intersection Property, Benjamin Briggs, Eloísa Grifo, Josh Pollitz

Department of Mathematics: Faculty Publications

A local ring R is regular if and only if every finitely generated R-module has finite projective dimension. Moreover, the residue field k is a test module: R is regular if and only if k has finite projective dimension. This characterization can be extended to the bounded derived category Df(R), which contains only small objects if and only if R is regular. Recent results of Pollitz, completing work initiated by Dwyer-Greenlees-Iyengar, yield an analogous characterization for complete intersections: R is a complete intersection if and only if every object in Df(R) is proxy small. In this paper, we study a …

Zeta Function Regularization And Its Relationship To Number Theory, Stephen Wang

Electronic Theses and Dissertations

While the "path integral" formulation of quantum mechanics is both highly intuitive and far reaching, the path integrals themselves often fail to converge in the usual sense. Richard Feynman developed regularization as a solution, such that regularized path integrals could be calculated and analyzed within a strictly physics context. Over the past 50 years, mathematicians and physicists have retroactively introduced schemes for achieving mathematical rigor in the study and application of regularized path integrals. One such scheme was introduced in 2007 by the mathematicians Klaus Kirsten and Paul Loya. In this thesis, we reproduce the Kirsten and Loya approach to …

Construct Linear Quasi-Interpolants On Infinite Intervals, Johara Farah Albaliwi

Dissertations

In solving the data interpolation problem, which is fundamental in data analysis, we typically deal with the data samples spread in a finite interval [a, b], which results in the operations involving finite-dimensional matrices. There are many interesting results developed under this framework. However, when the data samples are given from an infinite interval [a, ∞) (for certain special types of real-world applications), many existing results would not work anymore due to the special properties of the infinite data samples. A new framework should be established to support the infinite data samples.

In this dissertation, we develop a special tool …

Lecture 08: Partial Eigen Decomposition Of Large Symmetric Matrices Via Thick-Restart Lanczos With Explicit External Deflation And Its Communication-Avoiding Variant, Zhaojun Bai

Mathematical Sciences Spring Lecture Series

There are continual and compelling needs for computing many eigenpairs of very large Hermitian matrix in physical simulations and data analysis. Though the Lanczos method is effective for computing a few eigenvalues, it can be expensive for computing a large number of eigenvalues. To improve the performance of the Lanczos method, in this talk, we will present a combination of explicit external deflation (EED) with an s-step variant of thick-restart Lanczos (s-step TRLan). The s-step Lanczos method can achieve an order of s reduction in data movement while the EED enables to compute eigenpairs in batches along with a number …

Lecture 10: Preconditioned Iterative Methods For Linear Systems, Edmond Chow

Mathematical Sciences Spring Lecture Series

Iterative methods for the solution of linear systems of equations – such as stationary, semi-iterative, and Krylov subspace methods – are classical methods taught in numerical analysis courses, but adapting these methods to run efficiently at large-scale on high-performance computers is challenging and a constantly evolving topic. Preconditioners – necessary to aid the convergence of iterative methods – come in many forms, from algebraic to physics-based, are regularly being developed for linear systems from different classes of problems, and similarly are evolving with high-performance computers. This lecture will cover the background and some recent developments on iterative methods and preconditioning …

Lecture 00: Opening Remarks: 46th Spring Lecture Series, Tulin Kaman

Mathematical Sciences Spring Lecture Series

Opening remarks for the 46th Annual Mathematical Sciences Spring Lecture Series at the University of Arkansas, Fayetteville.

A Direct Method For Modeling And Simulations Of Elliptic And Parabolic Interface Problems, Kumudu Gamage, Yan Peng

College of Sciences Posters

Interface problems have many applications in fluid dynamics, molecular biology, electromagnetism, material science, heat distribution in engines, and hyperthermia treatment of cancer. Mathematically, interface problems commonly lead to partial differential equations (PDE) whose in- put data are discontinuous or singular across the interfaces in the solution domain. Many standard numerical methods designed for smooth solutions poorly work for interface problems as solutions of the interface problems are mostly non-smoothness or discontinuous. Moving interface problems depends on the accuracy of the gradient of the solution at the interface. Therefore, it became essential to derive a method for interface problems that gives …

The Fundamental Limit Theorem Of Countable Markov Chains, Nathanael Gentry

Senior Honors Theses

In 1906, the Russian probabilist A.A. Markov proved that the independence of a sequence of random variables is not a necessary condition for a law of large numbers to exist on that sequence. Markov's sequences -- today known as Markov chains -- touch several deep results in dynamical systems theory and have found wide application in bibliometrics, linguistics, artificial intelligence, and statistical mechanics. After developing the appropriate background, we prove a modern formulation of the law of large numbers (fundamental theorem) for simple countable Markov chains and develop an elementary notion of ergodicity. Then, we apply these chain convergence results …

Lie Groups And Euler-Bernoulli Beam Equation, Medeu Amangeldi

Theses and Dissertations

Lie groups approach in differential equations was a breakthrough subject in the late nineteenth century. Sophus Lie, a Norwegian mathematician, introduced the systematic approach to study the solutions of differential equations. The main goal of this thesis is to study, using Lie's approach, the Euler-Bernoulli beam equation subject to swelling force, the fourth-order nonlinear differential equation used to describe the beam deflection under the swelling force. In particular, we will classify the symmetry groups of this equation, obtain several reductions, and demonstrate both analytical and numerical solutions.

Entropic Dynamics Of Networks, Felipe Xavier Costa, Pedro Pessoa

Northeast Journal of Complex Systems (NEJCS)

Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into account the natural information geometry of probability distributions. We apply this framework to the Gibbs distribution of random graphs obtained with constraints on the node connectivity. The information geometry for this graph ensemble is calculated and the dynamical process is obtained as a diffusion equation. We compare the steady state of this dynamics to degree distributions found on real-world networks.

Emergent Hierarchy Through Conductance-Based Degree Constraints, Christopher Tyler Diggans, Jeremie Fish, Erik M. Bollt

Northeast Journal of Complex Systems (NEJCS)

The presence of hierarchy in many real-world networks is not yet fully understood. We observe that complex interaction networks are often coarse-grain models of vast modular networks, where tightly connected subgraphs are agglomerated into nodes for simplicity of representation and computational feasibility. The emergence of hierarchy in such growing complex networks may stem from one particular property of these ignored subgraphs: their graph conductance. Being a quantification of the main bottleneck of flow through the coarse-grain node, this scalar quantity implies a structural limitation and supports the consideration of heterogeneous degree constraints. The internal conductance values of the subgraphs are …

Innovative Approach To Solving Combinatic Elements And Some Problems Of Newton Binomy In School Mathematics Course, Nilufar Okbayeva

Central Asian Problems of Modern Science and Education

This article provides information on the elements of combinatorics in the school mathematics course and solutions to some problems related to the Newtonian binomial. This article is also aimed at solving problems related to the indepth study of the elements of combinatorics in the school course, the creation of a sufficient basis for the study of probability theory and mathematical statistics in the future.

On The Bounded Negativity Conjecture And Singular Plane Curves, Alexandru Dimca, Brian Harbourne, Gabriel Sticlaru

Department of Mathematics: Faculty Publications

There are no known failures of Bounded Negativity in characteristic 0. In the light of recent work showing the Bounded Negativity Conjecture fails in positive characteristics for rational surfaces, we propose new characteristic free conjectures as a replacement. We also develop bounds on numerical characteristics of curves constraining their negativity. For example, we show that the H-constant of a rational curve C with at most 9 singular points satisfies H(C) > -2 regardless of the characteristic.

Stochastic Navier-Stokes Equations With Markov Switching, Po-Han Hsu

LSU Doctoral Dissertations

This dissertation is devoted to the study of three-dimensional (regularized) stochastic Navier-Stokes equations with Markov switching. A Markov chain is introduced into the noise term to capture the transitions from laminar to turbulent flow, and vice versa. The existence of the weak solution (in the sense of stochastic analysis) is shown by studying the martingale problem posed by it. This together with the pathwise uniqueness yields existence of the unique strong solution (in the sense of stochastic analysis). The existence and uniqueness of a stationary measure is established when the noise terms are additive and autonomous. Certain exit time estimates …

The Encyclopedia Of Neutrosophic Researchers - 4th Volume (2021), Florentin Smarandache, Maykel Leyva-Vazquez

Branch Mathematics and Statistics Faculty and Staff Publications

Este es el cuarto volumen de la Enciclopedia de Investigadores Neutróficos, editados a partir de materiales ofrecidos por los autores que respondieron a la invitación del editor. Los autores se enumeran alfabéticamente. La introducción contiene una breve historia de la neutrosófica, y en especial se su impacto en Latinoamérica junto con enlaces a los principales artículos y libros. Los conjuntos neutrosóficos, la lógica neutrosófica, la probabilidad neutrosófica, la estadística neutrosófica, el precálculo neutrosófico, el cálculo neutrosófico, la psicología neutrosófica, la sociología neutrosófica etc., están ganando una atención significativa en resolver muchos problemas de la vida real que implican incertidumbre, imprecisión, …

Symbolic Rees Algebras, Eloísa Grifo, Alexandra Seceleanu

Department of Mathematics: Faculty Publications

We survey old and new approaches to the study of symbolic powers of ideals. Our focus is on the symbolic Rees algebra of an ideal, viewed both as a tool to investigate its symbolic powers and as a source of challenging problems in its own right. We provide an invitation to this area of investigation by stating several open questions.

Principles For Determining The Motion Of Blood Through Arteries, Sylvio R. Bistafa

Euleriana

Translation of Principia pro motu sanguinis per arterias determinando (E855). This work of 1775 by L. Euler is considered to be the first mathematical treatment of circulatory physiology and hemodynamics.

Symbolic Rees Algebras, Eloísa Grifo, Alexandra Seceleanu

Department of Mathematics: Faculty Publications

We survey old and new approaches to the study of symbolic powers of ideals. Our focus is on the symbolic Rees algebra of an ideal, viewed both as a tool to investigate its symbolic powers and as a source of challenging problems in its own right. We provide an invitation to this area of investigation by stating several open questions.

Theory And Application Of Hypersoft Set, Florentin Smarandache, Muhammad Saeed, Muhammad Saqlain, Mohamed Abdel-Baset

Branch Mathematics and Statistics Faculty and Staff Publications

Aims and Scope Florentin Smarandache generalize the soft set to the hypersoft set by transforming the function �� into a multi-argument function. This extension reveals that the hypersoft set with neutrosophic, intuitionistic, and fuzzy set theory will be very helpful to construct a connection between alternatives and attributes. Also, the hypersoft set will reduce the complexity of the case study. The Book “Theory and Application of Hypersoft Set” focuses on theories, methods, algorithms for decision making and also applications involving neutrosophic, intuitionistic, and fuzzy information. Our goal is to develop a strong relationship with the MCDM solving techniques and to …