Physical Sciences and Mathematics Commons^™

Responsible Data Science For Genocide Prevention, Victor Piercey

Journal of Humanistic Mathematics

The term "genocide" emerged out of an effort to describe mass atrocities committed in the first half of the 20th century. Despite a convention of the United Nations outlawing genocide as a matter of international law, the problem persists. Some organizations (including the United Nations) are developing indicator frameworks and “early-warning” systems that leverage data science to produce risk assessments of countries where conflict is present. These tools raise questions about responsible data use, specifically regarding the data sources and social biases built into algorithms through their training data. This essay seeks to engage mathematicians in discussing these concerns.

#Disruptjmm: Online Social Justice Advocacy And Community Building In Mathematics, Rachel Roca, Carrie Diaz Eaton, Drew Lewis, Joseph Hibdon, Stefanie Marshall

Journal of Humanistic Mathematics

In 2019, \#DisruptJMM, a Twitter hashtag, began circulating after an Inclusion/Exclusion blog by Dr. Piper H pointing to the need to make commonplace conversations about human suffering in the Joint Mathematics Meetings (JMM). While the \#DisruptJMM hashtag has been used since 2019, the vast majority of use was in the JMM 2020 meetings. Twitter hashtags are used by activists to push forward conversations, join communities around a single idea, and create change. In this article, we draw on frameworks from community building seen in other equity and inclusion advocacy hashtags such as \#GirlsLikeUs [7] to qualitatively code and analyze tweets …

On Definitions Of "Mathematician", Ron Buckmire, Carrie Diaz Eaton, Joseph Hibdon, Katherine M. Kinnaird, Drew Lewis, Jessica Libertini, Omayra Ortega, Rachel Roca, Andrés R. Vindas Meléndez

Journal of Humanistic Mathematics

The definition of who is or what makes a “mathematician” is an important issue to be addressed in the mathematics community. Too often, a narrower definition of who is considered a mathematician (and what is considered mathematics) is used to exclude people from the discipline—both explicitly and implicitly. However, using a narrow definition of a mathematician allows us to highlight, examine, and challenge systemic barriers that exist in certain spaces of the community. This paper analyzes and illuminates tensions between narrow and broad definitions and how they can be used to promote both inclusion and exclusion simultaneously. In this article, …

Mathematics And Society: Towards Critical Mathematics Research And Education, Tian An Wong, Carrie Diaz Eaton, Rachel Roca, Nancy Rodriguez

Journal of Humanistic Mathematics

No abstract provided.

Mathematics And Society, Mark Huber, Gizem Karaali

Journal of Humanistic Mathematics

No abstract provided.

Front Matter

Journal of Humanistic Mathematics

No abstract provided.

Enumerative Problems Of Doubly Stochastic Matrices And The Relation To Spectra, Julia A. Vandenlangenberg

Theses and Dissertations

This work concerns the spectra of doubly stochastic matrices whose entries are rational numbers with a bounded denominator. When the bound is fixed, we consider the enumeration of these matrices and also the enumeration of the orbits under the action of the symmetric group.

In the case where the bound is two, we investigate the symmetric case. Such matrices are in fact doubly stochastic, and have a nice characterization when we are in the special case where the diagonal is zero. As a central tool to this investigation, we utilize Birkhoff's theorem that asserts that the doubly stochastic matrices are …

Probabilistic Modeling Of Social Media Networks, Distinguishing Phylogenetic Networks From Trees, And Fairness In Service Queues, Md Rashidul Hasan

Mathematics & Statistics ETDs

In this dissertation, three primary issues are explored. The first subject exposes who-saw-from-whom pathways in post-specific dissemination networks in social media platforms. We describe a network-based approach for temporal, textual, and post-diffusion network inference. The conditional point process method discovers the most probable diffusion network. The tool is capable of meaningful analysis of hundreds of post shares. Inferred diffusion networks demonstrate disparities in information distribution between user groups (confirmed versus unverified, conservative versus liberal) and local communities (political, entrepreneurial, etc.). A promising approach for quantifying post-impact, we observe discrepancies in inferred networks that indicate the disproportionate amount of automated bots. …

Why Unit Two-Variable-Per-Inequality (Utvpi) Constraints Are So Efficient To Handle: Intuitive Explanation, Saeid Tizpaz-Niari, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In general, integer linear programming is NP-hard. However, there exists a class of integer linear programming problems for which an efficient algorithm is possible: the class of so-called unit two-variable-per-inequality (UTVPI) constraints. In this paper, we provide an intuitive explanation for why an efficient algorithm turned out to be possible for this class. Namely, the smaller the class, the more probable it is that a feasible algorithm is possible for this class, and the UTVPI class is indeed the smallest -- in some reasonable sense described in this paper.

Industry-Academia Collaboration: Main Challenges And What Can We Do, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

How can we bridge the gap between industry and academia? How can we make them collaborate more effectively? In this essay, we try to come up with answers to these important questions.

Why Attitudes Are Usually Mutual: A Possible Mathematical Explanation, Julio C. Urenda, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we provide a possible mathematical explanation of why people's attitude to each other is usually mutual: we usually have good attitude who those who have good feelings towards us, and we usually have negative attitudes towards those who have negative feelings towards, Several mathematical explanations of this mutuality have been proposed, but they are based on specific approximate mathematical models of human (and animal) interaction. It is desirable to have a solid mathematical explanation that would not depend on such approximate models. In this paper, we show that a recent mathematical result about relation algebras can lead …

Towards A Psychologically Natural Relation Between Colors And Fuzzy Degrees, Victor L. Timchenko, Yuriy P. Kondratenko, Olga Kosheleva, Vladik Kreinovich, Nguyen Hoang Phuong

Departmental Technical Reports (CS)

A natural way to speed up computations -- in particular, computations that involve processing fuzzy data -- is to use the fastest possible communication medium: light. Light consists of components of different color. So, if we use optical color computations to process fuzzy data, we need to associate fuzzy degrees with colors. One of the main features -- and of the main advantages -- of fuzzy technique is that the corresponding data has intuitive natural meaning: this data comes from words from natural language. It is desirable to preserve this naturalness as much as possible. In particular, it is desirable …

Algebraic Product Is The Only "And-Like"-Operation For Which Normalized Intersection Is Associative: A Proof, Thierry Denœx, Vladik Kreinovich

Departmental Technical Reports (CS)

For normalized fuzzy sets, intersection is, in general, not normalized. So, if we want to limit ourselves to normalized fuzzy sets, we need to normalize the intersection. It is known that for algebraic product, the normalized intersection is associative, and that for many other "and"-operations (t-norms), normalized intersection is not associative. In this paper, we prove that algebraic product is the only "and"-operation (even the only "and-like" operation) for which normalized intersection is associative.

How To Select A Model If We Know Probabilities With Interval Uncertainty, Vladik Kreinovich

Departmental Technical Reports (CS)

Purpose: When we know the probability of each model, a natural idea is to select the most probable model. However, in many practical situations, we do not know the exact values of these probabilities, we only know intervals that contain these values. In such situations, a natural idea is to select some probabilities from these intervals and to select a model with the largest selected probabilities. The purpose of this study is to decide how to most adequately select these probabilities.

Design/methodology/approach: We want the probability-selection method to preserve independence: If, according to the probability intervals, the two …

If Everything Is A Matter Of Degree, Why Do Crisp Techniques Often Work Better?, Miroslav Svitek, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Numerous examples from different application domain confirm the statement of Lotfi Zadeh -- that everything is a matter of degree. Because of this, one would expect that in most -- if not all -- practical situations taking these degrees into account would lead to more effective control, more effective prediction, etc. In practice, while in many cases, this indeed happens, in many other cases, "crisp" methods -- methods that do not take these degrees into account -- work better. In this paper, we provide two possible explanations for this discrepancy: an objective one -- explaining that the optimal (best-fit) model …

The Vanishing Discount Method For Stochastic Control: A Linear Programming Approach, Brian Hospital

Theses and Dissertations

Under consideration are convergence results between optimality criteria for two infinite-horizon stochastic control problems: the long-term average problem and the $\alpha$-discounted problem, where $\alpha \in (0,1]$ is a given discount rate. The objects under control are those stochastic processes that arise as (relaxed) solutions to a controlled martingale problem; and such controlled processes, subject to a given budget constraint, comprise the feasible sets for the two stochastic control problems.

In this dissertation, we define and characterize the expected occupation measures associated with each of these stochastic control problems, and then reformulate each problem as an equivalent linear program over a …

Collapsibility And Z-Compactifications Of Cat(0) Cube Complexes, Daniel L. Gulbrandsen

Theses and Dissertations

We extend the notion of collapsibility to non-compact complexes and prove collapsibility of locally-finite CAT(0) cube complexes. Namely, we construct such a cube complex $X$ out of nested convex compact subcomplexes $\{C_i\}_{i=0}^\infty$ with the properties that $X=\cup_{i=0}^\infty C_i$ and $C_i$ collapses to $C_{i-1}$ for all $i\ge 1$.

We then define bonding maps $r_i$ between the compacta $C_i$ and construct an inverse sequence yielding the inverse limit space $\varprojlim\{C_i,r_i\}$. This will provide a new way of Z-compactifying $X$. In particular, the process will yield a new Z-boundary, called the cubical boundary.

Non-Hyperbolic Right-Angled Coxeter Groups With Menger Curve Boundary, Cong He

Theses and Dissertations

We find a class of simplicial complexes as nerves of non-hyperbolic right-angled Coxetergroups, with boundary homeomorphic to the Menger curve. The nerves are triangulations of compact orientable surfaces with boundary. In particular, the nerves are non-graphs.

Zeros Of Modular Forms, Daozhou Zhu

All Dissertations

Let $E_k(z)$ be the normalized Eisenstein series of weight $k$ for the full modular group $\text{SL}(2, \mathbb{Z})$. It is conjectured that all the zeros of the weight $k+\ell$ cusp form $E_k(z)E_\ell(z)-E_{k+\ell}(z)$ in the standard fundamental domain lie on the boundary. Reitzes, Vulakh and Young \cite{Reitzes17} proved that this statement is true for sufficiently large $k$ and $\ell$. Xue and Zhu \cite{Xue} proved the cases when $\ell=4,6,8$ with $k\geq\ell$, all the zeros of $E_k(z)E_\ell(z)-E_{k+\ell}(z)$ lie on the arc $|z|=1$. For all $k\geq\ell\geq10$, we will use the same method as \cite{Reitzes17} to locate these zeros on the arc $|z|=1$, and improve the …

Dna Self-Assembly Of Trapezohedral Graphs, Hytham Abdelkarim

Electronic Theses, Projects, and Dissertations

Self-assembly is the process of a collection of components combining to form an organized structure without external direction. DNA self-assembly uses multi-armed DNA molecules as the component building blocks. It is desirable to minimize the material used and to minimize genetic waste in the assembly process. We will be using graph theory as a tool to find optimal solutions to problems in DNA self-assembly. The goal of this research is to develop a method or algorithm that will produce optimal tile sets which will self-assemble into a target DNA complex. We will minimize the number of tile and bond-edge types …

Stressor: An R Package For Benchmarking Machine Learning Models, Samuel A. Haycock

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Many discipline specific researchers need a way to quickly compare the accuracy of their predictive models to other alternatives. However, many of these researchers are not experienced with multiple programming languages. Python has recently been the leader in machine learning functionality, which includes the PyCaret library that allows users to develop high-performing machine learning models with only a few lines of code. The goal of the stressor package is to help users of the R programming language access the advantages of PyCaret without having to learn Python. This allows the user to leverage R’s powerful data analysis workflows, while simultaneously …

An Interval-Valued Random Forests, Paul Gaona Partida

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

There is a growing demand for the development of new statistical models and the refinement of established methods to accommodate different data structures. This need arises from the recognition that traditional statistics often assume the value of each observation to be precise, which may not hold true in many real-world scenarios. Factors such as the collection process and technological advancements can introduce imprecision and uncertainty into the data.

For example, consider data collected over a long period of time, where newer measurement tools may offer greater accuracy and provide more information than previous methods. In such cases, it becomes crucial …

Random Quotients Of Hyperbolic Groups And Property (T), Prayagdeep Parija

Theses and Dissertations

What does a typical quotient of a group look like? Gromov looked at the density model of quotients of free groups. The density parameter $d$ measures the rate of exponential growth of the number of relators compared to the size of the Cayley ball. Using this model, he proved that for $d<1/2$, the typical quotient of a free group is non-elementary hyperbolic. Ollivier extended Gromov's result to show that for $d<1/2$, the typical quotient of many hyperbolic groups is also non-elementary hyperbolic.

Żuk and Kotowski--Kotowski proved that for $d>1/3$, a typical quotient of a free group has Property (T). We show that (in a closely related density model) for $1/3

An Optimal Decay Estimation Of The Solution To The Airy Equation, Ashley Scherf

Theses and Dissertations

In this thesis, we investigate the initial value problem to the Airy equation \begin{align} \partial_t u + \partial_{x}^3 u &= 0\\ u(0,x) &= f(x). \end{align}

An Exploration Of Absolute Minimal Degree Lifts Of Hyperelliptic Curves, Justin A. Groves

Doctoral Dissertations

For any ordinary elliptic curve E over a field with non-zero characteristic p, there exists an elliptic curve E over the ring of Witt vectors W(E) for which we can lift the Frobenius morphism, called the canonical lift. Voloch and Walker used this theory of canonical liftings of elliptic curves over Witt vectors of length 2 to construct non-linear error-correcting codes for characteristic two. Finotti later proved that for longer lengths of Witt vectors there are better lifts than the canonical. He then proved that, more generally, for hyperelliptic curves one can construct a lifting over …

Algebraic And Integral Closure Of A Polynomial Ring In Its Power Series Ring, Joseph Swanson

All Dissertations

Let R be a domain. We look at the algebraic and integral closure of a polynomial ring, R[x], in its power series ring, R[[x]]. A power series α(x) ∈ R[[x]] is said to be an algebraic power series if there exists F (x, y) ∈ R[x][y] such that F (x, α(x)) = 0, where F (x, y) ̸ = 0. If F (x, y) is monic, then α(x) is said to be an integral power series. We characterize the units of algebraic and integral power series. We show that the only algebraic power series with infinite radii of convergence are …

Matrix Completion Problems For The Positiveness And Contraction Through Graphs, Louis C. Christopher

Theses and Dissertations

In this work, we study contractive and positive real matrix completion problems which are motivated in part by studies on sparce (or dense) matrices for weighted sparse recovery problems and rating matrices with rating density in recommender systems. Matrix completions problems also have many applications in probability and statistics, chemistry, numerical analysis (e.g. optimization), electrical engineering, and geophysics. In this paper we seek to connect the contractive and positive completion property to a graph theoretic property. We then answer whether the graphs of real symmetric matrices having loops at every vertex have the contractive completion property if and only if …

Concentration Theorems For Orthonormal Sequences In A Reproducing Kernel Hilbert Space, Travis Alvarez

All Dissertations

Let H be a reproducing kernel Hilbert space with reproducing kernel elements {Kx} indexed by a measure space {X,mu}. If H can be embedded in L2(X,mu), then H can be viewed as a framed Hilbert space. We study concentration of orthonormal sequences in such reproducing kernel Hilbert spaces.

Defining different versions of concentration, we find quantitative upper bounds on the number of orthonormal functions that can be classified by such concentrations. Examples are shown to prove sharpness of the bounds. In the cases that we can add "concentrated" orthonormal vectors indefinitely, the growth rate of doing so is shown.

Asymptotic Cones Of Quadratically Defined Sets And Their Applications To Qcqps, Alexander Joyce

All Dissertations

Quadratically constrained quadratic programs (QCQPs) are a set of optimization problems defined by a quadratic objective function and quadratic constraints. QCQPs cover a diverse set of problems, but the nonconvexity and unboundedness of quadratic constraints lead to difficulties in globally solving a QCQP. This thesis covers properties of unbounded quadratic constraints via a description of the asymptotic cone of a set defined by a single quadratic constraint. A description of the asymptotic cone is provided, including properties such as retractiveness and horizon directions.

Using the characterization of the asymptotic cone, we generalize existing results for bounded quadratically defined regions with …

Recovering Coefficients Of Second-Order Hyperbolic And Plate Equations Via Finite Measurements On The Boundary, Scott Randall Scruggs

All Dissertations

Abstract In this dissertation, we consider the inverse problem for a second-order hyperbolic equation of recovering n + 3 unknown coefficients defined on an open bounded domain with a smooth enough boundary. We also consider the inverse problem of recovering an unknown coefficient on the Euler- Bernoulli plate equation on a lower-order term again defined on an open bounded domain with a smooth enough boundary. For the second-order hyperbolic equation, we show that we can uniquely and (Lipschitz) stably recover all these coefficients from only using half of the corresponding boundary measurements of their solutions, and for the plate equation, …