Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

2021

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 871 - 900 of 1314

Full-Text Articles in Mathematics

Boxes, Extended Boxes And Sets Of Positive Upper Density In The Euclidean Space, Polona Durcik, Vjekoslav Kovač Jan 2021

Boxes, Extended Boxes And Sets Of Positive Upper Density In The Euclidean Space, Polona Durcik, Vjekoslav Kovač

Mathematics, Physics, and Computer Science Faculty Articles and Research

We prove that sets with positive upper Banach density in sufficiently large dimensions contain congruent copies of all sufficiently large dilates of three specific higher-dimensional patterns. These patterns are: 2n vertices of a fixed n-dimensional rectangular box, the same vertices extended with n points completing three-term arithmetic progressions, and the same vertices extended with n points completing three-point corners. Our results provide common generalizations of several Euclidean density theorems from the literature.


On Subshifts With Slow Forbidden Word Growth, Ronnie Pavlov Jan 2021

On Subshifts With Slow Forbidden Word Growth, Ronnie Pavlov

Mathematics: Faculty Scholarship

In this work, we treat subshifts, defined in terms of an alphabet A and (usually infinite) forbidden list F, where the number of n-letter words in F has ‘slow growth rate’ in n. We show that such subshifts are well behaved in several ways; for instance, they are boundedly supermultiplicative in the sense of Baker and Ghenciu [Dynamical properties of S-gap shifts and other shift spaces. J. Math. Anal. Appl.430(2) (2015), 633–647] and they have unique measures of maximal entropy with the K-property and which satisfy Gibbs bounds on large (measure-theoretically) sets. The main tool in our proofs is a …


Review Of Social Workers Count: Numbers And Social Issues By Michael Anthony Lewis, Michael T. Catalano Jan 2021

Review Of Social Workers Count: Numbers And Social Issues By Michael Anthony Lewis, Michael T. Catalano

Numeracy

Lewis, Michael Anthony. 2017. Social Workers Count: Numbers and Social Issues. 2019. New York: Oxford University Press. 223 pp. ISBN 978-019046713-5

The numeracy movement, although largely birthed within the mathematics community, is an outside-the-box endeavor which has always sought to break down or at least transgress traditional disciplinary boundaries. Michael Anthony Lewis’s book is a testament that this effort is succeeding. Lewis is a social worker and sociologist with an impressive resume, author of Economics for Social Workers, co-editor of The Ethics and Economics of the Basic Income Guarantee, and member of the faculty at the Silberman School …


A Conjecture On The Irregularity Function For Local Geometric Langlands Parameters And The Formal Frenkel-Gross Connection, Andrew Alaniz Jan 2021

A Conjecture On The Irregularity Function For Local Geometric Langlands Parameters And The Formal Frenkel-Gross Connection, Andrew Alaniz

LSU Doctoral Dissertations

For a simple complex algebraic group $G$, M. Kamgarpour and D. Sage have shown that the adjoint irregularity of an irregular singular flat $G$-bundle on the formal punctured disc is bounded from below by the rank of $G$, moreover the rank is realized by the formal Frenkel-Gross connection. This is a geometric analog of a conjecture of Gross and Reeder on the swan conductor of arithmetic local Langlands parameters. In this work, we explore an interesting combinatorial problem which arises when trying to consider the minimal value of the irregularity function with respect to an arbitrary representation of $G$.


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

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 Jan 2021

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.


Exponents Of Jacobians Of Graphs And Regular Matroids, Hahn Lheem, Deyuan Li, Carl Joshua Quines, Jessica Zhang Jan 2021

Exponents Of Jacobians Of Graphs And Regular Matroids, Hahn Lheem, Deyuan Li, Carl Joshua Quines, Jessica Zhang

Rose-Hulman Undergraduate Mathematics Journal

Let G be a finite undirected multigraph with no self-loops. The Jacobian Jac (G) is a finite abelian group associated with G whose cardinality is equal to the number of spanning trees of G. There are only a finite number of biconnected graphs G such that the exponent of Jac (G) equals 2 or 3. The definition of a Jacobian can also be extended to regular matroids as a generalization of graphs. We prove that there are finitely many connected regular matroids M such that Jac (M) has exponent 2 and characterize all such matroids.


Gordian Adjacency For Positive Braid Knots, Tolson H. Bell, David C. Luo, Luke Seaton, Samuel P. Serra Jan 2021

Gordian Adjacency For Positive Braid Knots, Tolson H. Bell, David C. Luo, Luke Seaton, Samuel P. Serra

Rose-Hulman Undergraduate Mathematics Journal

A knot $K_1$ is said to be Gordian adjacent to a knot $K_2$ if $K_1$ is an intermediate knot on an unknotting sequence of $K_2$. We extend previous results on Gordian adjacency by showing sufficient conditions for Gordian adjacency between classes of positive braid knots through manipulations of braid words. In addition, we explore unknotting sequences of positive braid knots and give a proof that there are only finitely many positive braid knots for a given unknotting number.


Linear Combinations Of Harmonic Univalent Mappings, Dennis Nguyen Jan 2021

Linear Combinations Of Harmonic Univalent Mappings, Dennis Nguyen

Rose-Hulman Undergraduate Mathematics Journal

Many properties are known about analytic functions, however the class of harmonic functions which are the sum of an analytic function and the conjugate of an analytic function is less understood. We wish to find conditions such that linear combinations of univalent harmonic functions are univalent. We focus on functions whose image is convex in one direction i.e. each line segment in that direction between points in the image is contained in the image. M. Dorff proved sufficient conditions such that the linear combination of univalent harmonic functions will be univalent on the unit disk. The conditions are: the mappings …


A Case Study On Hooley's Conditional Proof Of Artin's Primitive Root Conjecture, Shalome Kurian Jan 2021

A Case Study On Hooley's Conditional Proof Of Artin's Primitive Root Conjecture, Shalome Kurian

Rose-Hulman Undergraduate Mathematics Journal

Artin’s Primitive Root Conjecture represents one of many famous problems in elementary number theory that has resisted complete solution thus far. Significant progress was made in 1967, when Christopher Hooley published a conditional proof of the conjecture under the assumption of a certain case of the Generalised Riemann Hypothesis. In this survey we present a description of the conjecture and the underlying algebraic theory, and provide a detailed account of Hooley’s proof which is intended to be accessible to those with only undergraduate level knowledge. We also discuss a result concerning the qx+1 problem, whose proof requires similar techniques to …


A Card Trick Based On Error-Correcting Codes, Luis A. Perez Jan 2021

A Card Trick Based On Error-Correcting Codes, Luis A. Perez

Rose-Hulman Undergraduate Mathematics Journal

Error-correcting codes (ECC), found in coding theory, use methods to handle possible errors that may arise from electronic noise, to a scratch of a CD in a way where they are detected and corrected. Recently, ECC have gone beyond their traditional use. ECC can be used in applications from performing magic tricks to detecting and repairing mutations in DNA sequencing. This paper investigates an application of the Hamming Code, a type of ECC, in the form of a magic trick which uses Andy Liu's description of the Hamming Code through set theory and a known card trick. Finally, connections between …


Mathematical Magic: A Study Of Number Puzzles, Nicasio M. Velez Jan 2021

Mathematical Magic: A Study Of Number Puzzles, Nicasio M. Velez

Rose-Hulman Undergraduate Mathematics Journal

Within this paper, we will briefly review the history of a collection of number puzzles which take the shape of squares, polygons, and polyhedra in both modular and nonmodular arithmetic. Among other results, we develop construction techniques for solutions of both Modulo and regular Magic Squares. For other polygons in nonmodular arithmetic, specifically of order 3, we present a proof of why there are only four Magic Triangles using linear algebra, disprove the existence of the Magic Tetrahedron in two ways, and utilizing the infamous 3-SUM combinatorics problem we disprove the existence of the Magic Octahedron.


Quantum Statistical Learning Via Quantum Wasserstein Natural Gradient, Simon Becker, Wuchen Li Jan 2021

Quantum Statistical Learning Via Quantum Wasserstein Natural Gradient, Simon Becker, Wuchen Li

Faculty Publications

In this article, we introduce a new approach towards the statistical learning problem argminρ(θ )∈Pθ W2 Q(ρ*, ρ(θ )) to approximate a target quantum state ρ* by a set of parametrized quantum states ρ(θ ) in a quantum L2-Wasserstein metric. We solve this estimation problem by considering Wasserstein natural gradient flows for density operators on finite-dimensional C∗ algebras. For continuous parametric models of density operators, we pull back the quantum Wasserstein metric such that the parameter space becomes a Riemannian manifold with quantum Wasserstein information matrix. Using a quantum analogue …


Analyzing And Creating Playing Card Cryptosystems, Isaac A. Reiter Jan 2021

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 …


Numerical Analysis Of Coupled Systems Of Odes And Applications Toenzymatic Competitive Inhibition By Product, Vinh Quang Mai, Thái Ahn Nhan Jan 2021

Numerical Analysis Of Coupled Systems Of Odes And Applications Toenzymatic Competitive Inhibition By Product, Vinh Quang Mai, Thái Ahn Nhan

Mathematics and Computer Science

Enzymatic inhibition is one of the key regulatory mechanisms in cellular metabolism, especially the enzymatic competitive inhibition by product. This inhibition process helps the cell regulate enzymatic activities. In this paper, we derive a mathematical model describing the enzymatic competitive inhibition by product. The model consists of a coupled system of nonlinear ordinary di erential equations for the species of interest. Using nondimensionalization analysis, a formula for product formation rate for this mechanism is obtained in a transparent manner. Further analysis for this formula yields qualitative insights into the maximal reaction velocity and apparent Michaelis-Menten constant. Integrating the model numerically, …


Stokes-Darcy System, Small-Darcy-Number Behaviour And Related Interfacial Conditions, Wenqi Lyu, Xiaoming Wang Jan 2021

Stokes-Darcy System, Small-Darcy-Number Behaviour And Related Interfacial Conditions, Wenqi Lyu, Xiaoming Wang

Mathematics and Statistics Faculty Research & Creative Works

We show that the Stokes-Darcy system, which governs flows through adjacent porous and pure-fluid domains in the two-domain approach without forced filtration, can be recovered from the Helmholtz minimal dissipation principle. While the continuity of normal velocity across the interface is imposed explicitly for mass conservation, only the Beavers-Joseph-Saffman-Jones (BJSJ) interface boundary condition is imposed implicitly, and the balance of the normal-force interface boundary condition appears naturally in the variational process. This set of interface boundary conditions is well-accepted in the mathematics community. We show that these interfacial boundary conditions, at the physically important small-Darcy-number regime, are consistent with continuity …


Cassie Dibenedetti's Portfolio, Cassie Dibenedetti Jan 2021

Cassie Dibenedetti's Portfolio, Cassie Dibenedetti

Honors College Portfolios

The Data Science B.S. curriculum surpasses bare collection and interpretation of data. An expansion of these applications are foundational courses that include critical thinking, articulate translation, and data immersion. The mathematical pillar of the Data Science program teaches students fundamental calculus and statistical skills, and the computer science pillar teaches students the utilization of software when working with data. Most importantly, the data science pillar intertwines the two and teaches students to provide practical solutions to problems involving data.

This portfolio serves as a glimpse into the Data Science student’s curriculum. Viewers can observe the varying skills required of a …


Σ-Ary, Minnesota State University Moorhead, Mathematics Department Jan 2021

Σ-Ary, Minnesota State University Moorhead, Mathematics Department

Math Department Newsletters

No abstract provided.


On The Equivalence Between Weak Bmo And The Space Of Derivatives Of The Zygmund Class, Eddy Kwessi Jan 2021

On The Equivalence Between Weak Bmo And The Space Of Derivatives Of The Zygmund Class, Eddy Kwessi

Mathematics Faculty Research

In this paper, we will discuss the space of functions of weak bounded mean oscillation. In particular, we will show that this space is the dual space of the special atom space, whose dual space was already known to be the space of derivative of functions (in the sense of distribution) belonging to the Zygmund class of functions. We show, in particular, that this proves that the Hardy space H1 strictly contains the special atom space.


On Hamilton Cycle Decompositions Of Complete Multipartite Graphs Which Are Both Cyclic And Symmetric, Fatima A. Akinola Jan 2021

On Hamilton Cycle Decompositions Of Complete Multipartite Graphs Which Are Both Cyclic And Symmetric, Fatima A. Akinola

Theses, Dissertations and Capstones

Let G be a graph with v vertices. A Hamilton cycle of a graph is a collection of edges which create a cycle using every vertex. A Hamilton cycle decomposition is cyclic if the set of cycle is invariant under a full length permutation of the vertex set. We say a decomposition is symmetric if all the cycles are invariant under an appropriate power of the full length permutation. Such decompositions are known to exist for complete graphs and families of other graphs. In this work, we show the existence of cyclic n-symmetric Hamilton cycle decompositions of a family …


On Bakhvalov-Type Meshes For A Linear Convection-Diffusion Problem In 2d, Thái Ahn Nhan, Vinh Quang Mai Jan 2021

On Bakhvalov-Type Meshes For A Linear Convection-Diffusion Problem In 2d, Thái Ahn Nhan, Vinh Quang Mai

Mathematics and Computer Science

For singularly perturbed two-dimensional linear convection-diffusion problems, although optimal error estimates of an upwind finite difference scheme on Bakhvalov-type meshes are widely known, the analysis remains unanswered (Roos and Stynes in Comput. Meth. Appl. Math. 15 (2015), 531--550). In this short communication, by means of a new truncation error and barrier function based analysis, we address this open question for a generalization of Bakhvalov-type meshes in the sense of Boglaev and Kopteva. We prove that the upwind scheme on these mesh modifications is optimal first-order convergence, uniformly with respect to the perturbation parameter, in the discrete maximum norm. Furthermore, we …


The Adams Spectral Sequence For Topological Modular Forms, Robert Bruner, John Rognes Jan 2021

The Adams Spectral Sequence For Topological Modular Forms, Robert Bruner, John Rognes

Mathematics Faculty Research Publications

The connective topological modular forms spectrum, 𝑡𝑚𝑓, is in a sense initial among elliptic spectra, and as such is an important link between the homotopy groups of spheres and modular forms. A primary goal of this volume is to give a complete account, with full proofs, of the homotopy of 𝑡𝑚𝑓 and several 𝑡𝑚𝑓-module spectra by means of the classical Adams spectral sequence, thus verifying, correcting, and extending existing approaches. In the process, folklore results are made precise and generalized. Anderson and Brown-Comenetz duality, and the corresponding dualities in homotopy groups, are carefully proved. The volume also includes an account …


Program: 2021 Undergraduate Mathematics Day, University Of Dayton. Department Of Mathematics Jan 2021

Program: 2021 Undergraduate Mathematics Day, University Of Dayton. Department Of Mathematics

Undergraduate Mathematics Day: Past Content

Schedule and general information about the event.

21st Annual Kenneth C. Schraut Memorial Lecture: "One Health: Connecting Humans, Animals and the Environment" (Suzanne Lenhart, University of Tennessee)

Plenary talk: "The Crossings of Art, History, and Mathematics" (Jennifer White, St. Vincent College)


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

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.


How To Estimate Time Needed For Software Migration, Francisco Zapata, Olga Kosheleva, Vladik Kreinovich Jan 2021

How To Estimate Time Needed For Software Migration, Francisco Zapata, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, we need to migrate the existing software package to a new programming language and/or a new operating system. In such a migration, it is important to be able to accurately estimate time needed for this migration: if we underestimate this time, we will lose money and may go bankrupt; if we overestimate this time, other companies who estimate more accuracy will outbid us, and we will lose the contract. The formulas currently used for estimating migration time often lead to underestimation. In this paper, we start with the main ideas behind the existing formulas, and show …


Distributions On An Interval As A Scale-Invariant Combination Of Scale-Invariant Functions: Theoretical Explanation Of Empirical Marchenko-Pastur-Type Distributions, Vladik Kreinovich, Kevin Alvarez, Chon Van Le Jan 2021

Distributions On An Interval As A Scale-Invariant Combination Of Scale-Invariant Functions: Theoretical Explanation Of Empirical Marchenko-Pastur-Type Distributions, Vladik Kreinovich, Kevin Alvarez, Chon Van Le

Departmental Technical Reports (CS)

In many practical situations, we know the lower and upper bounds L and U on possible values of a quantity x. In such situations, the probability distribution of this quantity is also located on the corresponding interval [L, U]. In many such cases, the empirical probability distribution has the form d(x) = const * (x − L)α− * (U − x)α+ * xα. In the particular case α− = α+ = 0.5 and α = −1, we get the Marchenko-Pastur distribution that describes the distribution of the eigenvalues of a random matrix. However, in some cases, the empirical distribution corresponds …


How To Gauge Reliability Of A Binary Classification Result: A Simple Case, Olga Kosheleva, Vladik Kreinovich Jan 2021

How To Gauge Reliability Of A Binary Classification Result: A Simple Case, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, we need to make a binary decision based on the available data: whether an incoming email is a spam or not, whether to give a bank loan to a company, etc. In many such situations, we can (and do) use machine learning to come up with such a decision. The problem is that while the results of a machine learning model are not 100% reliable, the existing machine learning algorithms do not allow us to decide how reliable is each result. In this paper, for simple examples, we provide a technique for gauging this reliability.


On Rank-Two And Affine Cluster Algebras, Feiyang Lin Jan 2021

On Rank-Two And Affine Cluster Algebras, Feiyang Lin

HMC Senior Theses

Motivated by existing results about the Kronecker cluster algebra, this thesis is concerned with two families of cluster algebras, which are two different ways of generalizing the Kronecker case: rank-two cluster algebras, and cluster algebras of type An,1. Regarding rank-two cluster algebras, our main result is a conjectural bijection that would prove the equivalence of two combinatorial formulas for cluster variables of rank-two skew-symmetric cluster algebras. We identify a technical result that implies the bijection and make partial progress towards its proof. We then shift gears to study certain power series which arise as limits of ratios of …


An Axiomatic Construction Of The Real Number System, Leonard Van Wyk Jan 2021

An Axiomatic Construction Of The Real Number System, Leonard Van Wyk

Libraries

Starting from the Peano Axioms, we construct the natural numbers, the integers, the rationals, and the reals.


On The Evolution Equation For Modelling The Covid-19 Pandemic, Jonathan Blackledge Jan 2021

On The Evolution Equation For Modelling The Covid-19 Pandemic, Jonathan Blackledge

Books/Book chapters

The paper introduces and discusses the evolution equation, and, based exclusively on this equation, considers random walk models for the time series available on the daily confirmed Covid-19 cases for different countries. It is shown that a conventional random walk model is not consistent with the current global pandemic time series data, which exhibits non-ergodic properties. A self-affine random walk field model is investigated, derived from the evolutionary equation for a specified memory function which provides the non-ergodic fields evident in the available Covid-19 data. This is based on using a spectral scaling relationship of the type 1/ωα where ω …