Mathematics Commons^™

Mathematics And Society, Mark Huber, Gizem Karaali

Journal of Humanistic Mathematics

No abstract provided.

Front Matter

Journal of Humanistic Mathematics

No abstract provided.

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.

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.

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 …

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 …

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 …

A Novel Regularized Orthonormalized Partial Least Squares Model For Multi-View Learning, Ce Bian

Mathematics Dissertations - Archive

Over the past few years, the size of data dimensions or features has been increasing in various fields of science and engineering, owing to the rapid pace of data collection and the development of more advanced storage methods. However, to handle high-dimensional data, dimensionality reduction is essential before performing classification or regression tasks to eliminate noisy features. There are several numerical methods available for reducing data dimensionality, such as Canonical Correlation Analysis (CCA), Principal Component Analysis (PCA), and Linear Discriminant Analysis (LDA). While these methods offer valuable approaches to data dimensionality reduction, they do come with certain limitations. CCA, for …

A Machine Learning Approach To Constructing Ramsey Graphs Leads To The Trahtenbrot-Zykov Problem., Emily Hawboldt

Electronic Theses and Dissertations

Attempts at approaching the well-known and difficult problem of constructing Ramsey graphs via machine learning lead to another difficult problem posed by Zykov in 1963 (now commonly referred to as the Trahtenbrot-Zykov problem): For which graphs F does there exist some graph G such that the neighborhood of every vertex in G induces a subgraph isomorphic to F? Chapter 1 provides a brief introduction to graph theory. Chapter 2 introduces Ramsey theory for graphs. Chapter 3 details a reinforcement learning implementation for Ramsey graph construction. The implementation is based on board game software, specifically the AlphaZero program and its …

Optimal Control Frameworks For Modeling Dynamics And Androgen Deprivation Therapies In Prostate Cancer, Hussein Ed Duweh

Mathematics Dissertations - Archive

In this work, we present an optimal control approach for the assessment of treatments in prostate cancer. For this purpose, we use two different approaches, based on differential equations, to model the dynamics of prostate cancer. For the first approach, we use a system of ordinary differential equations (ODE) that model androgen-dependent and independent prostate cancer cell mechanisms. Given some synthetic patient data, we then performed a parameter estimation process by formulating an optimization problem to obtain the coefficients in this model. A second optimal control problem was formulated to obtain optimal androgen suppression therapies. A theoretical analysis of both …

Constructing Hyperbolic Polygons In The Poincaré Disk, Akram Zakaria Samweil

Electronic Theses, Projects, and Dissertations

The Poincaré Disk plays a significant role in non-Euclidean geometry. Inverting points, segments, or polygons through a circle provides us with a deep vision of the link between Euclidean and non-Euclidean geometry; especially when we try to prove lemmas, constructions, or conjectures. All points inside a circle, c, represent a Poincaré Disk denoted D_c, and all "lines" in a Poincaré Disk are d-lines, which are circles orthogonal to the circle's boundary. The question that motivated my research is: how can we use the properties of the disk, its boundary, and its d-lines to construct hyperbolic polygons? We will …

Association Of Lockdown Policies With Covid-19 Early Case Growth Rates In The United States, Anna Barefield

Boise State University Theses and Dissertations

The COVID-19 pandemic has impacted essentially the entire globe, infecting over 755 million people worldwide and resulting in over 6.8 million deaths to date. Different countries have had varying levels of success in managing the spread of the pandemic, and the success or lack thereof could be explained by the impact of government intervention, such as lockdown policies, mask mandates, and social distancing advisories. The United States responded particularly poorly to the early pandemic outbreak as compared to other similar countries, due to its lack of coordinated planning to implement effective policies, with large variations in action taken by each …

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 …

A History Of The Hurwitz Problem Concerning Branched Coverings, James Alexander Byars

Boise State University Theses and Dissertations

From a d-sheeted branched covering f : M → N, where M and N are surfaces, one can read off the branch datum

D(f) = {M, N, d, (A₁, . . . , A_r)},

where A_i = [e_i1, . . . , e_{in_i}] is a partition of d. Furthermore, a relationship between the Euler characteristics between M and N is known, called the Riemann-Hurwitz formula

��(M) = d��(N) − v(D(f …

Large Eddy Simulation By Using Wang’S Liutex-Based Subgrid Model, Vishwa Shah

Mathematics Dissertations - Archive

Turbulent flows and vortex structures in fluid dynamics have been captivating researchers for decades, owing to their intrinsic complexity and significance in various industrial and natural processes. Despite their fundamental importance, the definition and identification of vortices in turbulent flows continue to pose challenges, and to date, no universally accepted approach exists. This pursuit dates to the pioneering work of Hermann von Helmholtz in the 19th century, when the concept of vortices was first introduced. In 2019, Liu et al. introduced a novel physical quantity termed "Liutex" in scalar, vector, and tensor forms, providing a promising avenue for understanding and …

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 …

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.