Mathematics Commons^™

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 …

Green's Function For The Schrodinger Equation With A Generalized Point Interaction And Stability Of Superoscillations, Yakir Aharonov, Jussi Behrndt, Fabrizio Colombo, Peter Schlosser

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we study the time dependent Schrödinger equation with all possible self-adjoint singular interactions located at the origin, which include the δ and δ'-potentials as well as boundary conditions of Dirichlet, Neumann, and Robin type as particular cases. We derive an explicit representation of the time dependent Green's function and give a mathematical rigorous meaning to the corresponding integral for holomorphic initial conditions, using Fresnel integrals. Superoscillatory functions appear in the context of weak measurements in quantum mechanics and are naturally treated as holomorphic entire functions. As an application of the Green's function we study the stability …

Numerical Integration Through Concavity Analysis, Daniel J. Pietz

Rose-Hulman Undergraduate Mathematics Journal

We introduce a relationship between the concavity of a C2 func- tion and the area bounded by its graph and secant line. We utilize this relationship to develop a method of numerical integration. We then bound the error of the approximation, and compare to known methods, finding an improvement in error bound over methods of comparable computational complexity.

Analyzing And Creating Playing Card Cryptosystems, Isaac A. Reiter

Honors Student Research

Before computers, military tacticians and government agents had to rely on pencil-and-paper methods to encrypt information. For agents that want to use low-tech options in order to minimize their digital footprint, non-computerized ciphers are an essential component of their toolbox. Still, the presence of computers limits the pool of effective hand ciphers. If a cipher is not unpredictable enough, then a computer will easily be able to break it. There are 52! ≈ 2^225.58 ways to mix a deck of cards. If each deck order is a key, this means that there are 52! ≈ 2^225.58 different ways to encrypt …

Multicomponent Fokas-Lenells Equations On Hermitian Symmetric Spaces, Vladimir Gerdjikov, Rossen Ivanov

Articles

Multi-component integrable generalizations of the Fokas-Lenells equation, associated with each irreducible Hermitian symmetric space are formulated. Description of the underlying structures associated to the integrability, such as the Lax representation and the bi-Hamiltonian formulation of the equations is provided. Two reductions are considered as well, one of which leads to a nonlocal integrable model. Examples with Hermitian symmetric spaces of all classical series of types A.III, BD.I, C.I and D.III are presented in details, as well as possibilities for further reductions in a general form.

Fractals, Fractional Derivatives, And Newton-Like Methods, Eleanor Byrnes

HMC Senior Theses

Inspired by the fractals generated by the discretizations of the Continuous Newton Method and the notion of a fractional derivative, we ask what it would mean if such a fractional derivative were to replace the derivatives in Newton's Method. This work, largely experimental in nature, examines these new iterative methods by generating their Julia sets, computing their fractal dimension, and in certain tractable cases examining the behaviors using tools from dynamical systems.

Exploring Winning Strategies For The Game Of Cycles, Kailee Lin

HMC Senior Theses

This report details my adventures exploring the Game of Cycles in search of winning strategies. I started by studying combinatorial game theory with hopes to use the Sprague-Grundy Theorem and the structure of Nimbers to gain insight for the Game of Cycles. In the second semester, I pivoted to studying specific types of boards instead. In this thesis I show that variations of the mirror-reverse strategy developed by Alvarado et al. in the original Game of Cycles paper can be used to win on additional game boards with special structure, such as lollipops, steering wheel locks, and 3-spoke trees. Additionally …

A Unified Approach For Constructing Confidence Intervals And Hypothesis Tests Using H-Function, Weizhen Wang

Mathematics and Statistics Faculty Publications

We introduce a general method, named the h-function method, to unify the constructions of level-a exact test and 1-a exact confidence interval. Using this method, any confidence interval is improved as follows: i) an approximate interval, including a point estimator, is modified to an exact interval; ii) an exact interval is refined to be an interval that is a subset of the previous one. Two real datasets are used to illustrate the method.

Measuring Machine Learning Model Uncertainty With Applications To Aerial Segmentation, Kevin James Cotton

CGU Theses & Dissertations

Machine learning model performance on both validation data and new data can be better measured and understood by leveraging uncertainty metrics at the time of prediction. These metrics can improve the model training process by indicating which training data need to be corrected and what part of the domain needs further annotation. The methods described have yet to reach mainstream adoption, and show great potential. Here, we survey the field of uncertainty metrics and provide a robust framework for its application to aerial segmentation. Uncertainty is divided into two types: aleatoric and epistemic. Aleatoric uncertainty arises from variations in training …

Emergency Communications Deficiency Locator, Austin Collins

Undergraduate Journal of Mathematical Modeling: One + Two

The Bi-Directional Amplifier (BDA) is the newest edition to Life Safety in the state of Florida. The Florida Fire Prevention Code (NFPA 1) section 11.10.1 states that “In all new and existing buildings, minimum radio signal strength for fire department communications shall be maintained at a level determined by the authority having jurisdiction (Committee NFPA 1: Fire Code 2018). That authority having jurisdiction for our local Tampa Bay area is the Hillsborough County Fire Rescue department and they have posted their own requirements along with the Florida Senate for emergency communication standards. All existing “Hi-rise” buildings, 75 feet tall …

Coloring Permutation-Gain Graphs, Daniel Slilaty

Mathematics and Statistics Faculty Publications

Correspondence colorings of graphs were introduced in 2018by Dvoˇr ́ak and Postle as a generalization of list colorings of graphswhich generalizes ordinary graph coloring. Kim and Ozeki observed thatcorrespondence colorings generalize various notions of signed-graph col-orings which again generalizes ordinary graph colorings. In this notewe state how correspondence colorings generalize Zaslavsky’s notionof gain-graph colorings and then formulate a new coloring theory ofpermutation-gain graphs that sits between gain-graph coloring and cor-respondence colorings. Like Zaslavsky’s gain-graph coloring, our newnotion of coloring permutation-gain graphs has well defined chromaticpolynomials and lifts to colorings of the regular covering graph of apermutation-gain graph

A Generalized Polar-Coordinate Integration Formula, Oscillatory Integral Techniques, And Applications To Convolution Powers Of Complex-Valued Functions On $\Mathbb{Z}^D$, Huan Q. Bui

Honors Theses

In this thesis, we consider a class of function on $\mathbb{R}^d$, called positive homogeneous functions, which interact well with certain continuous one-parameter groups of (generally anisotropic) dilations. Generalizing the Euclidean norm, positive homogeneous functions appear naturally in the study of convolution powers of complex-valued functions on $\mathbb{Z}^d$. As the spherical measure is a Radon measure on the unit sphere which is invariant under the symmetry group of the Euclidean norm, to each positive homogeneous function $P$, we construct a Radon measure $\sigma_P$ on $S=\{\eta \in \mathbb{R}^d:P(\eta)=1\}$ which is invariant under the symmetry group of $P$. With this measure, we prove …

Neither “Post-War” Nor Post-Pregnancy Paranoia: How America’S War On Drugs Continues To Perpetuate Disparate Incarceration Outcomes For Pregnant, Substance-Involved Offenders, Becca S. Zimmerman

Pitzer Senior Theses

This thesis investigates the unique interactions between pregnancy, substance involvement, and race as they relate to the War on Drugs and the hyper-incarceration of women. Using ordinary least square regression analyses and data from the Bureau of Justice Statistics’ 2016 Survey of Prison Inmates, I examine if (and how) pregnancy status, drug use, race, and their interactions influence two length of incarceration outcomes: sentence length and amount of time spent in jail between arrest and imprisonment. The results collectively indicate that pregnancy decreases length of incarceration outcomes for those offenders who are not substance-involved but not evenhandedly -- benefitting white …

Optimal Tile-Based Dna Self-Assembly Designs For Lattice Graphs And Platonic Solids, Leyda Almodovar, Joanna Ellis-Monaghan, Amanda Harsy, Cory Johnson, Jessica Sorrells

Mathematics Faculty Publications

A design goal in self-assembly of DNA nanostructures is to find minimal sets of branched junction molecules that will self-assemble into targeted structures. This process can be modeled using techniques from graph theory. This paper is a collection of proofs for a set of DNA complexes which can be represented by specific graphs, namely Platonic solids, square lattice graphs, and triangular lattice graphs. This work supplements the results presented in https://arxiv.org/abs/2108.00035

Some Proofs Regarding Minami Estimates And Local Eigenvalue Statistics For Some Random Schrödinger Operator Models, Samuel Herschenfeld

Theses and Dissertations--Mathematics

We provide three proofs on different, but related models in the field of random Schrödinger operators. All three results are motivated by the desire to extend results and techniques on eigenvalue statistics or Minami estimates (an essential ingredient Poisson eigenvalue statistics).

Chapters 2 and 4 are explorations of the only two known techniques for proving Minami estimates for continuum Minami estimates. In Chapter 2, we provide an alternative and simplified proof of Klopp that holds in d = 1. Chapter 4 is an application of the techniques of Dietlein and Elgart to prove a Minami estimate for finite rank lattice …

Five-Wave Resonances In Deep Water Gravity Waves: Integrability, Numerical Simulations And Experiments, Dan Lucas, Marc Perlin, Dian-Yong Liu, Shane Walsh, Rossen Ivanov, Miguel D. Bustamante

Articles

In this work we consider the problem of finding the simplest arrangement of resonant deep water gravity waves in one-dimensional propagation, from three perspectives: Theoretical, numerical and experimental. Theoretically this requires using a normal-form Hamiltonian that focuses on 5-wave resonances. The simplest arrangement is based on a triad of wave vectors K₁ + K₂ = K₃ (satisfying specific ratios) along with their negatives, corresponding to a scenario of encountering wave packets, amenable to experiments and numerical simulations. The normal-form equations for these encountering waves in resonance are shown to be non-integrable, but they admit an integrable reduction …

A Mathematical Analysis Of The Wind Triangle Problem And An Inquiry Of True Airspeed Calculations In Supersonic Flight, Leonard T. Huang, Lisa I. Cummings

International Journal of Aviation, Aeronautics, and Aerospace

In the first half of this paper, we present a fresh perspective toward the Wind Triangle Problem in aerial navigation by deriving necessary and sufficient conditions, which we call "go/no-go conditions", for the existence/non-existence of a solution of the problem. Although our derivation is based on simple trigonometry and basic properties of quadratic functions, it is mathematically rigorous. We also offer examples to demonstrate how easy it is to check these conditions graphically. In the second half of this paper, we use function theory to re-examine another problem in aerial navigation, namely, that of computing true airspeed — even in …

An Enumeration Of Nested Networks, Nathan Cornelius

Williams Honors College, Honors Research Projects

Nested networks have several applications in phylogenetics and electrical circuit theory. In many cases, there may exist more than one distinct network which correctly models a given data set. This proposes a combinatorial problem to determine all possible network solutions. In this paper, we partially solve this problem by developing exponential generating functions which enumerate all 1-nested and 2-nested unicyclic networks. We also describe our procedure to directly count all 1-nested and 2-nested networks and provide all 1-nested networks with 7, 8, and 9 terminal nodes.

Obstructive Wiring Patterns To Circular Planarity In Electrical Networks, Hannah Lebo

Williams Honors College, Honors Research Projects

In order for an electrical network to be printed on a flat surface without changing the network’s input or output, it is important to consider if any wires will cross and if this problem can be avoided. If a circular network can be printed so that no wires cross, the network is said to be circular planar. In this paper, we identify a number of wiring patterns that make circular planarity impossible. We find exactly 3 wiring patterns using circular pairs with sets of two nodes, and we find exactly 78 wiring patterns using circular pairs with sets of three …

Cross-Model Parameter Estimation In Epidemiology, Julia R. Fitzgibbons

Honors Theses and Capstones

No abstract provided.

Semiclassical Backreaction On Asymptotically Anti–De Sitter Black Holes, Peter Taylor, Cormac Breen

Articles

We consider a quantum scalar field on the classical background of an asymptotically anti–de Sitter black hole and the backreaction the field’s stress-energy tensor induces on the black hole geometry. The backreaction is computed by solving the reduced-order semiclassical Einstein field equations sourced by simple analytical approximations for the renormalized expectation value of the scalar field stress-energy tensor. When the field is massless and conformally coupled, we adopt Page’s approximation to the renormalized stress-energy tensor, while for massive fields we adopt a modified version of the DeWitt-Schwinger approximation. The latter approximation must be modified so that it possesses the correct …

Solving Neutrosophic Linear Equations Systems Using Symbolic Computation (Resolucion De Sistemas De Ecuaciones Lineales Neutrosóficas Mediante Computación Simbólica), Maykel Leyva-Vazquez, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we apply the concept of neutrosophic numbers to solve a systems of neutrophic linear equations using symbolic computation. Also, we utilize Jupyter, which is supported in Google Colaboratory for performing symbolic computation. The sympy library of Python is used to perform the process of neutrosophic computation. Systems of neutrosophic linear equations are solved through symbolic computation in Python. A case study was developed for the determination of vehicular traffic with indeterminacy. This king of computation opens new ways to deal with indeterminacy in real-world problems.