Mathematics Commons^™

Spacetime Geometry Of Acoustics And Electromagnetism, Lucas Burns, Tatsuya Daniel, Stephon Alexander, Justin Dressel

Mathematics, Physics, and Computer Science Faculty Articles and Research

Both acoustics and electromagnetism represent measurable fields in terms of dynamical potential fields. Electromagnetic force-fields form a spacetime bivector that is represented by a dynamical energy–momentum 4-vector potential field. Acoustic pressure and velocity fields form an energy–momentum density 4-vector field that is represented by a dynamical action scalar potential field. Surprisingly, standard field theory analyses of spin angular momentum based on these traditional potential representations contradict recent experiments, which motivates a careful reassessment of both theories. We analyze extensions of both theories that use the full geometric structure of spacetime to respect essential symmetries enforced by vacuum wave propagation. The …

Pseudo-Differential Operators On The Circle, Bernoulli Polynomials, Roger Gay, Ahmed Sebbar

Mathematics, Physics, and Computer Science Faculty Articles and Research

We show how the classical polylogarithm function Li_s (z) and its relatives, the Hurwitz zeta function and the Lerch function are all of a spectral nature, and can explain many properties of the complex powers of the Laplacian on the circle and of the distribution (x +i0)^s .We also make a relation with a result of Keiper [Fractional Calculus and its relationship to Riemann’s zeta function, Master of Science, Ohio State University, Mathematics (1975)].

Gauss Circle Problem Over Smooth Integers, Ankush Goswami

School of Mathematical & Statistical Sciences Faculty Publications

For a positive integer 𝑛, let 𝑟2(𝑛) be the number of representations of 𝑛 as sums of two squares (of integers), where the convention is that different signs and different orders of the summands yield distinct representations. A famous result of Gauss shows that 𝑅(𝑥) ∶= ∑ 𝑛≤𝑥 𝑟2(𝑛) ∼ 𝜋𝑥. Let 𝑃(𝑛) denote the largest prime factor of 𝑛 and let 𝑆(𝑥, 𝑦) ∶= {𝑛 ≤ 𝑥 ∶ 𝑃(𝑛) ≤ 𝑦}. In this paper, we study the asymptotic behavior of 𝑅(𝑥, 𝑦) ∶= ∑ 𝑛∈𝑆(𝑥,𝑦) 𝑟2(𝑛) for various ranges of 2 ≤ 𝑦 ≤ 𝑥. For 𝑦 in a …

An Icosahedron For Two: A Many-Sided Look At Making A Duet, Colleen T. Wahl

LASER Journal

The space around our bodies is not empty or neutral. In fact, the space around our bodies is loaded with meaning and important. When we move through it, whether it be in our daily lives or a choreographer making specific choices in order to convey a message, we activate new understandings in our lives. As a dancer and choreographer, I created a duet from improvisational climbs on an icosahedron. This article discusses choreographing from the form icosahedron and connects Laban's theories of space harmony with the activation of meaning in my life.

Two Non–*–Isomorphic *–Lie Algebra Structures On Sl(2,R) And Their Physical Origins, Luigi Accardi, Irina Ya. ArefʹEva, Yungang Lu, Igorʹ VasilʹEvich Volovich

Journal of Stochastic Analysis

No abstract provided.

Deep Neural Network-Oriented Indicator Method For Inverse Scattering Problems Using Partial Data, Yule Lin, Xiaoyi Yan, Jiguang Sun, Juan Liu

Michigan Tech Publications

We consider the inverse scattering problem to reconstruct an obstacle using partial far-field data due to one incident wave. A simple indicator function, which is negative inside the obstacle and positive outside of it, is constructed and then learned using a deep neural network (DNN). The method is easy to implement and effective as demonstrated by numerical examples. Rather than developing sophisticated network structures for the classical inverse operators, we reformulate the inverse problem as a suitable operator such that standard DNNs can learn it well. The idea of the DNN-oriented indicator method can be generalized to treat other partial …

Session 8: Machine Learning Based Behavior Of Non-Opec Global Supply In Crude Oil Price Determinism, Mofe Jeje

SDSU Data Science Symposium

Abstract

While studies on global oil price variability, occasioned by OPEC crude oil supply, is well documented in energy literature; the impact assessment of non-OPEC global oil supply on price variability, on the other hand, has not received commensurate attention. Given this gap, the primary objective of this study, therefore, is to estimate the magnitude of oil price determinism that is explained by the share of non-OPEC’s global crude oil supply. Using secondary sources of data collection method, data for target variable will be collected from the US Federal Reserve, as it relates to annual crude oil price variability, while …

Fuzzy Ideas Explain Fechner Law And Help Detect Relation Between Objects In Video, Olga Kosheleva, Vladik Kreinovich, Ahnaf Farhan

Departmental Technical Reports (CS)

How to find relation between objects in a video? If two objects are closely related -- e.g., a computer and it mouse -- then they almost always appear together, and thus, their numbers of occurrences are close. However, simply computing the differences between numbers of occurrences is not a good idea: objects with 100 and 110 occurrences are most probably related, but objects with 1 and 5 occurrences probably not, although 5 − 1 is smaller than 110 − 100. A natural idea is, instead, to compute the difference between re-scaled numbers of occurrences, for an appropriate nonlinear re-scaling. In …

Modifed Playfair For Text File Encryption And Meticulous Decryption With Arbitrary Fillers By Septenary Quadrate Pattern, N. Sugirtham, R. Sherine Jenny, B. Thiyaneswaran, S. Kumarganesh, C. Venkatesan, K. Martin Sagayam, Lam Dang, Linh Dinh, Helen Dang

Mathematics and Computer Studies: Faculty Publications

Cryptography secures data and serves to ensure the confidentiality of records. Playfair is a cryptographic symmetrical algorithm that encrypts statistics based on key costs. This secret is shared with an authorized person to retrieve data. In the conventional pattern, there is an area complexity and deficiency in letters, numbers, and special characters. This hassle has been overcome in previous studies by editing pattern dimensions. The fillers used throughout the enciphering were not eliminated during the retrieval process, which resulted in the indiscrimination of the retrieved statistics. The proposed method uses a separate quadrate pattern that strengthens the Playfair cipher and …

There Is Still Plenty Of Room At The Bottom: Feynman's Vision Of Quantum Computing 65 Years Later, Alexis Lupo, Vladik Kreinovich, Victor L. Timchenko, Yuriy P. Kondratenko

Departmental Technical Reports (CS)

In 1959, Nobelist Richard Feynman gave a talk titled "There's plenty of room at the bottom", in which he emphasized that, to drastically speed up computations, we need to make computer components much smaller -- all the way to the size of molecules, atoms, and even elementary particles. At this level, physics is no longer described by deterministic Newton's mechanics, it is described by probabilistic quantum laws. Because of this, computer designers started thinking how to design a reliable computer based on non-deterministic elements -- and this thinking eventually led to the modern ideas and algorithms of quantum computing. So, …

From Quantifying And Propagating Uncertainty To Quantifying And Propagating Both Uncertainty And Reliability: Practice-Motivated Approach To Measurement Planning And Data Processing, Niklas R. Winnewisser, Vladik Kreinovich, Olga Kosheleva

Departmental Technical Reports (CS)

When we process data, it is important to take into account that data comes with uncertainty. There exist techniques for quantifying uncertainty and propagating this uncertainty through the data processing algorithms. However, most of these techniques do not take into account that in real world, measuring instruments are not 100% reliable -- they sometimes malfunction and produce values which are far off from the measured values of the corresponding quantities. How can we take into account both uncertainty and reliability? In this paper, we consider several possible scenarios, and we show, for each scenario, what is the natural way to …

Low Shear In Short-Term Impacts Endothelial Cell Traction And Alignment In Long-Term, Mohanish K. Chandurkar, Nikhil Mittal, Shaina P. Royer-Weeden, Steven D. Lehmann, Yeonwoo Rho, Sangyoon J. Han

Michigan Tech Publications

Within the vascular system, endothelial cells (ECs) are exposed to fluid shear stress (FSS), a mechanical force exerted by blood flow that is critical for regulating cellular tension and maintaining vascular homeostasis. The way ECs react to FSS varies significantly; while high, laminar FSS supports vasodilation and suppresses inflammation, low or disturbed FSS can lead to endothelial dysfunction and increase the risk of cardiovascular diseases. Yet, the adaptation of ECs to dynamically varying FSS remains poorly understood. This study focuses on the dynamic responses of ECs to brief periods of low FSS, examining its impact on endothelial traction—a measure of …

Low Shear In Short-Term Impacts Endothelial Cell Traction And Alignment In Long-Term, Mohanish Chandurkar, Nikhil Mittal, Shaina P. Royer-Weeden, Steven D. Lehmann, Yeonwoo Rho, Sangyoon J. Han

Michigan Tech Publications

Within the vascular system, endothelial cells (ECs) are exposed to fluid shear stress (FSS), a mechanical force exerted by blood flow that is critical for regulating cellular tension and maintaining vascular homeostasis. The way ECs react to FSS varies significantly; while high, laminar FSS supports vasodilation and suppresses inflammation, low or disturbed FSS can lead to endothelial dysfunction and increase the risk of cardiovascular diseases. Yet, the adaptation of ECs to dynamically varying FSS remains poorly understood. This study focuses on the dynamic responses of ECs to brief periods of low FSS, examining its impact on endothelial traction-a measure of …

Cognitive Load Scale In Learning Formal Definition Of Limit: A Rasch Model Approach, Rina Oktaviyanthi, Ria Noviana Agus, Mark Lester B. Garcia, Kornkanok Lertdechapat

Mathematics Faculty Publications

Constructing proofs for the limit using the formal definition induces a high cognitive load. Common assessment tools, like cognitive load scales, lack specificity for the concept of limits. This research aims to validate an instrument tailored to assess cognitive load in students focused on the formal definition of limits, addressing the need for diverse strategies in education. The research employs a quantitative survey design with a Rasch model approach, utilizing a data collection instrument in the form of a questionnaire. Subsequently, the data are analyzed by focusing on three aspects: (1) item fit to the Rasch model, (2) unidimensionality, and …

Tight Bounds For The N2-Chromatic Number Of Graphs, Arnold Eniego, Ian June L. Garces, Jose Rosario

Mathematics Faculty Publications

Let G be a connected graph. A vertex coloring of G is an N₂-vertex coloring if, for every vertex v, the number of different colors assigned to the vertices adjacent to v is at most two. The N₂-chromatic number of G is the maximum number of colors that can be used in an N₂vertex coloring of G. In this paper, we establish tight bounds for the N₂-chromatic number of a graph in terms of its maximum degree and its diameter, and characterize those graphs that attain these bounds.

Parameterized Algorithm For The Poset Cover Problem, Ivy D. Ordanel, Proceso L. Fernandez, Richelle Ann B. Juayong, Jhoirene B. Clemente, Henry N. Adorna

Department of Information Systems & Computer Science Faculty Publications

It is already known that the 1-Poset and 2-Poset Cover Problems are in P. In this paper, we extended the previous results and devised an algorithm for the k-Poset Cover Problem, for any k number of posets that cover the input. The algorithm runs in O(m2k n2), where m and n are the input size. With this running time, we can say that the problem belongs to XP (slicewise polynomial). The algorithm runs efficiently for small fixed k but runs exponentially for large k. While the algorithm running time has yet not to be efficient for large k, we have …

New Algorithmic Support For The Fundamental Theorem Of Algebra, Vitaly Zaderman

Dissertations, Theses, and Capstone Projects

Univariate polynomial root-finding is a venerated subjects of Mathematics and Computational Mathematics studied for four millenia. In 1924 Herman Weyl published a seminal root-finder and called it an algorithmic proof of the Fundamental Theorem of Algebra. Steve Smale in 1981 and Arnold Schonhage in 1982 proposed to classify such algorithmic proofs in terms of their computational complexity. This prompted extensive research in 1980s and 1990s, culminated in a divide-and-conquer polynomial root-finder by Victor Pan at ACM STOC 1995, which used a near optimal number of bit-operations. The algorithm approximates all roots of a polynomial p almost as fast as one …

A Finite Element Model For Hydro-Thermal Convective Flow In A Porous Medium: Effects Of Hydraulic Resistivity And Thermal Diffusivity, S. M. Mallikarjunaiah, Dambaru Bhatta

School of Mathematical & Statistical Sciences Faculty Publications

In this article, a finite element model is implemented to analyze hydro-thermal convective flow in a porous medium. The mathematical model encompasses Darcy’s law for incompressible fluid behavior, which is coupled with a convection-diffusion-type energy equation to characterize the temperature in the porous medium. The current investigation presents an efficient, stable, and accurate finite element discretization for the hydro-thermal convective flow model. The well-posedness of the proposed discrete Galerkin finite element formulation is guaranteed due to the decoupling property and the linearity of the numerical method. Computational experiments confirm the optimal convergence rates for a manufactured solution. Several numerical results …

Conditional Optimal Sets And The Quantization Coefficients For Some Uniform Distributions, Evans Nyanney, Megha Pandey, Mrinal Kanti Roychowdhury

School of Mathematical & Statistical Sciences Faculty Publications

Bucklew and Wise (1982) showed that the quantization dimension of an absolutely continuous probability measure on a given Euclidean space is constant and equals the Euclidean dimension of the space, and the quantization coefficient exists as a finite positive number. By giving different examples, in this paper, we have shown that the quantization coefficients for absolutely continuous probability measures defined on the same Euclidean space can be different. We have taken uniform distribution as a prototype of an absolutely continuous probability measure. In addition, we have also calculated the conditional optimal sets of n-points and the nth conditional quantization errors …

New Effective Transformational Computational Methods, Jun Zhang, Ruzong Fan, Fangyang Shen, Junyi Tu

Publications and Research

Mathematics serves as a fundamental intelligent theoretic basis for computation, and mathematical analysis is very useful to develop computational methods to solve various problems in science and engineering. Integral transforms such as Laplace Transform have been playing an important role in computational methods. In this paper, we will introduce Sumudu Transform in a new computational approach, in which effective computational methods will be developed and implemented. Such computational methods are straightforward to understand, but powerful to incorporate into computational science to solve different problems automatically. We will provide computational analysis and essentiality by surveying and summarizing some related recent works, …