Other Mathematics Commons^™

Domain Of Exotic Laplacian Constructed By Wiener Integrals Of Exponential White Noise Distributions, Luigi Accardi, Un Cig Ji, Kimiaki Saitô

Journal of Stochastic Analysis

No abstract provided.

Symmetric Generations And An Algorithm To Prove Relations, Diddier Andrade

Electronic Theses, Projects, and Dissertations

In this thesis we have discovered homomorphic images of several progenitors such as 3^(*56):(23:(3:7), 3^(*14):(23:(3:7)), 5^(∗24) : S5, 2^(∗10) : (10 : 2), 56^(∗24) : (A5 : 2), and 11^(∗12) :m L2(11). We give isomorphism types of each image that we have found.
We then create a monomial representation of L2(11) by lifting 5:11 onto it.
We manually perform Double Coset Enumeration of 3:(2×S5) over D12
to create its Cayley graph. This is achieved by solving many word problems. The
Cayley graph is used to find a permutation representation of 3:(2×S5). We also
perform Double Coset Enumeration S3 × A5 …

Academic Hats And Ice Cream: Two Optimization Problems, Valery F. Ochkov, Yulia V. Chudova

Journal of Humanistic Mathematics

This article describes the use of computer software to optimize the design of an academic hat and an ice cream cone!

The Construction And Estimation Of Hidden Semi-Markov Models, Kurdstan Abdullah, John Van Der Hoek

Journal of Stochastic Analysis

No abstract provided.

Propuestas Y Resultados De Investigación Transmoderna, Translocal Y Digital Desde Jóvenes Semilleristas, Xiomara Gonzalez Gaitan

Institucional

En el presente libro se recopilan las propuestas, avances y resultados de los proyectos en curso de los Semilleros de Investigación de la Universidad de Cundinamarca (Colombia), que se presentaron en el «II Encuentro de Semilleros de Investigación: ciencia, tecnología e innovación en la era digital» en su versión de 2020. Publicamos estos proyectos con la intención de difundir el conocimiento y como muestra del esfuerzo y del alcance de la labor investigadora de los semilleristas de la Universidad de Cundinamarca. Esperamos que los lectores encuentren en estas propuestas caminos para resolver problemas o inspiración para construir nuevas propuestas de …

On Superoscillations And Supershifts In Several Variables, Yakir Aharonov, Fabrizio Colombo, Andrew N. Jordan, Irene Sabadini, Tomer Shushi, Daniele C. Struppa, Jeff Tollaksen

Mathematics, Physics, and Computer Science Faculty Articles and Research

The aim of this paper is to study a class of superoscillatory functions in several variables, removing some restrictions on the functions that we introduced in a previous paper. Since the tools that we used with our approach are not common knowledge we will give detailed proof for the case of two variables. The results proved for superoscillatory functions in several variables can be further extended to supershifts in several variables.

The Thermodynamics Of A Stochastic Geometry Model With Applications To Non-Extensive Statistics, O.K. Kazemi, A. Pourdarvish, J. Sadeghi

Journal of Stochastic Analysis

No abstract provided.

Artificial Neural Network Concepts And Examples, Harcharan Kabbay

Theses

Artificial Neural Networks have gained much media attention in the last few years. Every day, numer- ous articles on Artificial Intelligence, Machine Learning, and Deep Learning exist. Both academics and business are becoming increasingly interested in deep learning. Deep learning has innumerable uses, in- cluding autonomous driving, computer vision, robotics, security and surveillance, and natural language processing. The recent development and focus have primarily been made possible by the convergence of related research efforts and the introduction of APIs like Keras. The availability of high-speed compute resources such as GPUs and TPUs has also been instrumental in developing deep learning …

Quantization Of The Poisson Type Central Limit Theorem (1), Yungang Lu

Journal of Stochastic Analysis

No abstract provided.

A Closed Form Formula For The Stochastic Exponential Of A Matrix-Valued Semimartingale, Peter Kern, Christian Müller

Journal of Stochastic Analysis

No abstract provided.

Ultrametrics And Complete Multipartite Graphs, Viktoriia Viktorivna Bilet, Oleksiy Dovgoshey, Yuriy Nikitovich Kononov

Theory & Applications of Graphs

Let (X, d) be a semimetric space and let G be a graph. We say that G is the diametrical graph of (X, d) if X is the vertex set of G and the adjacency of vertices x and y is equivalent to the equality diam X = d(x, y). It is shown that a semimetric space (X, d) with diameter d* is ultrametric if the diametrical graph of (X, d _ε) with d _ε (x, y) = min{d(x, y), ε} is complete multipartite for every ε ∈ (0, d* …

Self-Repelling Elastic Manifolds With Low Dimensional Range, Carl Mueller, Eyal Neumann

Journal of Stochastic Analysis

No abstract provided.

Induced Matrices: Recurrences And Markov Chains, Philip Feinsilver

Journal of Stochastic Analysis

No abstract provided.

Using Graph Theoretical Methods And Traceroute To Visually Represent Hidden Networks, Jordan M. Sahs

UNO Student Research and Creative Activity Fair

Within the scope of a Wide Area Network (WAN), a large geographical communication network in which a collection of networking devices communicate data to each other, an example being the spanning communication network, known as the Internet, around continents. Within WANs exists a collection of Routers that transfer network packets to other devices. An issue pertinent to WANs is their immeasurable size and density, as we are not sure of the amount, or the scope, of all the devices that exists within the network. By tracing the routes and transits of data that traverses within the WAN, we can identify …

Unomaha Problem Of The Week (2021-2022 Edition), Brad Horner, Jordan M. Sahs

UNO Student Research and Creative Activity Fair

The University of Omaha math department's Problem of the Week was taken over in Fall 2019 from faculty by the authors. The structure: each semester (Fall and Spring), three problems are given per week for twelve weeks, with each problem worth ten points - mimicking the structure of arguably the most well-regarded university math competition around, the Putnam Competition, with prizes awarded to top-scorers at semester's end. The weekly competition was halted midway through Spring 2020 due to COVID-19, but relaunched again in Fall 2021, with massive changes.

Now there are three difficulty tiers to POW problems, roughly corresponding to …

Exploring The Numerical Range Of Block Toeplitz Operators, Brooke Randell

Master's Theses

We will explore the numerical range of the block Toeplitz operator with symbol function \(\phi(z)=A_0+zA_1\), where \(A_0, A_1 \in M_2(\mathbb{C})\). A full characterization of the numerical range of this operator proves to be quite difficult and so we will focus on characterizing the boundary of the related set, \(\{W(A_0+zA_1) : z \in \partial \mathbb{D}\}\), in a specific case. We will use the theory of envelopes to explore what the boundary looks like and we will use geometric arguments to explore the number of flat portions on the boundary. We will then make a conjecture as to the number of flat …

On The Numerical Range Of Compact Operators, Montserrat Dabkowski

Master's Theses

One of the many characterizations of compact operators is as linear operators which
can be closely approximated by bounded finite rank operators (theorem 25). It is
well known that the numerical range of a bounded operator on a finite dimensional
Hilbert space is closed (theorem 54). In this thesis we explore how close to being
closed the numerical range of a compact operator is (theorem 56). We also describe
how limited the difference between the closure and the numerical range of a compact
operator can be (theorem 58). To aid in our exploration of the numerical range of
a compact …

Van Kampen Diagrams And Small Cancellation Theory, Kelsey N. Lowrey

Master's Theses

Given a presentation of G, the word problem asks whether there exists an algorithm to determine which words in the free group, F(A), represent the identity in G. In this thesis, we study small cancellation theory, developed by Lyndon, Schupp, and Greendlinger in the mid-1960s, which contributed to the resurgence of geometric group theory. We investigate the connection between Van Kampen diagrams and the small cancellation hypotheses. Groups that have a presentation satisfying the small cancellation hypotheses C'(1/6), or C'(1/4) and T(4) have a nice solution to the word problem known as Dehn’s Algorithm.

Implementation Of A Least Squares Method To A Navier-Stokes Solver, Jada P. Lytch, Taylor Boatwright, Ja'nya Breeden

Rose-Hulman Undergraduate Mathematics Journal

The Navier-Stokes equations are used to model fluid flow. Examples include fluid structure interactions in the heart, climate and weather modeling, and flow simulations in computer gaming and entertainment. The equations date back to the 1800s, but research and development of numerical approximation algorithms continues to be an active area. To numerically solve the Navier-Stokes equations we implement a least squares finite element algorithm based on work by Roland Glowinski and colleagues. We use the deal.II academic library , the C++ language, and the Linux operating system to implement the solver. We investigate convergence rates and apply the least squares …

Estimating Glutamate Transporter Surface Density In Mouse Hippocampal Astrocytes, Anca R. Radulescu, Annalisa Scimemi

Biology and Medicine Through Mathematics Conference

No abstract provided.