Mathematics Commons^™

Macrocausality Implies Lorenz Group: A Physics-Related Comment On Guts's Results, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

It is known that, in the space-time of Special Relativity, causality implies Lorenz group, i.e., if we know which events can causally influence each other, then, based on this information, we can uniquely reconstruct the affine structure of space-time. When the two events are very close, quantum effects, with their probabilistic nature, make it difficult to detect causality. So, the following question naturally arises: can we uniquely reconstruct the affine structure if we only know causality for events which are sufficiently far away from each other? Several positive answers to this question were provided in a recent paper by Alexander …

On Loop Commutators, Quaternionic Automorphic Loops, And Related Topics, Mariah Kathleen Barnes

Electronic Theses and Dissertations

This dissertation deals with three topics inside loop and quasigroup theory. First, as a continuation of the project started by David Stanovský and Petr Vojtĕchovský, we study the commutator of congruences defined by Freese and McKenzie in order to create a more pleasing, equivalent definition of the commutator inside of loops. Moreover, we show that the commutator can be characterized by the generators of the inner mapping group of the loop. We then translate these results to characterize the commutator of two normal subloops of any loop.

Second, we study automorphic loops with the desire to find more examples of …

Local-Global Results On Discrete Structures, Alexander Lewis Stevens

Electronic Theses and Dissertations

Local-global arguments, or those which glean global insights from local information, are central ideas in many areas of mathematics and computer science. For instance, in computer science a greedy algorithm makes locally optimal choices that are guaranteed to be consistent with a globally optimal solution. On the mathematical end, global information on Riemannian manifolds is often implied by (local) curvature lower bounds. Discrete notions of graph curvature have recently emerged, allowing ideas pioneered in Riemannian geometry to be extended to the discrete setting. Bakry- Émery curvature has been one such successful notion of curvature. In this thesis we use combinatorial …

Guide To The Dr. L.S. Dederick Papers, 1908-1956, Undated, Orson Kingsley, Patrick Koetsch

Archives & Special Collections Finding Aids

Louis Serle (L.S.) Dederick was born in Chicago in 1883. He received his Ph.D. in Mathematics from Harvard University in 1909. From 1909 – 1917 he was a professor at Princeton University. From 1917 – 1924 he was professor at the U.S. Naval Academy in Annapolis, Maryland. In 1926 Dederick began working for the U.S. Army, Ordnance. During his time there he was the Associate Director of the Ballistic Research Laboratory at the Aberdeen Proving Grounds in Aberdeen, Maryland where he focused on ballistics research.

While Dederick worked as a mathematician at the Aberdeen Proving Grounds, he was involved with …

A New Non-Inheriting Homogeneous Solution Of The Einstein-Maxwell Equations With Cosmological Term, Charles G. Torre

Research Vignettes

No abstract provided.

Reductions Of 2 -Dimensional Semistable Representations With Large L -Invariant, John Bergdall, Brandon Levin, Tong Liu

Mathematics Faculty Research and Scholarship

We determine reductions of 2 -dimensional, irreducible, semistable, and non-crystalline representations of Gal(ℚ𝑝/ℚ𝑝) with Hodge–Tate weights 0<𝑘−1 and with L -invariant whose p-adic norm is sufficiently large, depending on k. Our main result provides the first systematic examples of the reductions for 𝑘≥𝑝 .

A Predictive Model To Predict Cyberattack Using Self-Normalizing Neural Networks, Oluwapelumi Eniodunmo

Theses, Dissertations and Capstones

Cyberattack is a never-ending war that has greatly threatened secured information systems. The development of automated and intelligent systems provides more computing power to hackers to steal information, destroy data or system resources, and has raised global security issues. Statistical and Data mining tools have received continuous research and improvements. These tools have been adopted to create sophisticated intrusion detection systems that help information systems mitigate and defend against cyberattacks. However, the advancement in technology and accessibility of information makes more identifiable elements that can be used to gain unauthorized access to systems and resources. Data mining and classification tools …

Results On The Generalized Covering Radius Of Error Correcting Codes, Benjamin Langton

HMC Senior Theses

The recently proposed generalized covering radius is a fundamental property of error correcting codes. This quantity characterizes the trade off between time and space complexity of certain algorithms when a code is used in them. However, for the most part very little is known about the generalized covering radius. My thesis seeks to expand on this field in several ways. First, a new upper bound on this quantity is established and compared to previous bounds. Second, this bound is used to derive a new algorithm for finding codewords within the generalized covering radius of a given vector, and also to …

Beta Invariant And Chromatic Uniqueness Of Wheels, Sooyeon Lee, Haidong Wu

Faculty and Student Publications

A graph G is chromatically unique if its chromatic polynomial completely determines the graph. An n-spoked wheel, Wn, is shown to be chromatically unique when n ≥ 4 is even [S.-J. Xu and N.-Z. Li, The chromaticity of wheels, Discrete Math. 51 (1984) 207–212]. When n is odd, this problem is still open for n ≥ 15 since 1984, although it was shown by di erent researchers that the answer is no for n = 5, 7, yes for n = 3, 9, 11, 13, and unknown for other odd n. We use the beta invariant of matroids to prove …

Banach Spaces On Topological Ramsey Structures, Cheng-Chih Ko

Electronic Theses and Dissertations

A Banach space T₁(d, θ) with a Tsirelson-type norm is constructed on the top of the topological Ramsey space T₁ defined by Dobrinen and Todorcevic [6]. Finite approximations of the isomorphic subtrees are utilised in constructing the norm. The subspace on each “branch” of the tree is shown to resemble the structure of an ℓ_∞ⁿ⁺¹ -space where the dimension corresponds to the number of terminal nodes on that branch. The Banach space T₁(d, θ) is isomorphic to (∑_n∊ℕ⊕ℓ_∞ⁿ⁺¹)_p , where d ∈ ℕ with d ≥ 2, …

On The Total Set Chromatic Number Of Graphs, Mark Anthony C. Tolentino, Gerone Russel J. Eugenio, Mari-Jo P. Ruiz

Mathematics Faculty Publications

Given a vertex coloring c of a graph, the neighborhood color set of a vertex is defined to be the set of all of its neighbors’ colors. The coloring c is called a set coloring if any two adjacent vertices have different neighborhood color sets. The set chromatic number χs(G) of a graph G is the minimum number of colors required in a set coloring of G. In this work, we investigate a total analog of set colorings, that is, we study set colorings of the total graph of graphs. Given a graph G = (V; E); its total graph …

Algebraic Invariants Of Knot Diagrams On Surfaces, Ryan Martinez

HMC Senior Theses

In this thesis we first give an introduction to knots, knot diagrams, and algebraic structures defined on them accessible to anyone with knowledge of very basic abstract algebra and topology. Of particular interest in this thesis is the quandle which "colors" knot diagrams. Usually, quandles are only used to color knot diagrams in the plane or on a sphere, so this thesis extends quandles to knot diagrams on any surface and begins to classify the fundamental quandles of knot diagrams on the torus.

This thesis also breifly looks into Niebrzydowski Tribrackets which are a different algebraic structure which, in future …

An Exploration Of Voting With Partial Orders, Mason Acevedo

HMC Senior Theses

In this thesis, we discuss existing ideas and voting systems in social choice theory. Specifically, we focus on the Kemeny rule and the Borda count. Then, we begin trying to understand generalizations of these voting systems in a setting where voters can submit partial rankings on their ballot, instead of complete rankings.

Exploring The Complex Relationship Between Engineering Students Math Experiences And Identity Formation, Jill Davishahl, Joseph Brobst, Elizabeth Litzler, Andrew Klein, Sura Alqudah

Division of Research and Economic Development Faculty & Staff Publications

This paper shares the experiences of a group of S-STEM scholarship students as they progressed through their first year of undergraduate mathematics education including a math placement exam, a math focused bridge program, and calculus course(s). In addition, connections between student experiences and their math identity development were investigated with the goal of better understanding math identity formation. The authors used a mixed-methods approach to explore the math-related experiences of 12 students over the first year of participation in an NSF-funded S-STEM program. Data includes answers to select survey questions and transcripts of student focus groups. First, each student case …

On The Finiteness Of Quantum K-Theory Of A Homogeneous Space, D. Anderson, Linda Chen, H.-H. Tseng

Mathematics & Statistics Faculty Works

We show that the product in the quantum K-ring of a generalized flag manifold G/P involves only finitely many powers of the Novikov variables. In contrast to previous approaches to this finiteness question, we exploit the finite difference module structure of quantum K-theory. At the core of the proof is a bound on the asymptotic growth of the J-function, which in turn comes from an analysis of the singularities of the zastava spaces studied in geometric representation theory. An appendix by H. Iritani establishes the equivalence between finiteness and a quadratic growth condition on certain shift operators.

On The Polytopal Generalization Of Sperner’S Lemma, Amit Harlev

HMC Senior Theses

We introduce and prove Sperner’s lemma, the well known combinatorial analogue of the Brouwer fixed point theorem, and then attempt to gain a better understanding of the polytopal generalization of Sperner’s lemma conjectured in Atanassov (1996) and proven in De Loera et al. (2002). After explaining the polytopal generalization and providing examples, we present a new, simpler proof of a slightly weaker result that helps us better understand the result and why it is correct. Some ideas for how to generalize this proof to the complete result are discussed. In the last two chapters we provide a brief introduction to …

Search Under Uncertainty Should Be Randomized: A Lesson From The 2021 Nobel Prize In Medicine, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

In many real-life situations, we know that one of several objects has the desired property, but we do not know which one. To find the desired object, we need to test these objects one by one. In situations when we have no additional information, there is no reason to prefer any testing order and thus, a usual recommendation is to test them in any order. This is usually interpreted as ordering the objects in the increasing value of some seemingly unrelated quantity. A possible drawback of this approach is that it may turn out that the selected quantity is correlated …

Topics In Moufang Loops, Riley Britten

Electronic Theses and Dissertations

We will begin by discussing power graphs of Moufang loops. We are able to show that as in groups the directed power graph of a Moufang loop is uniquely determined by the undirected power graph. In the process of proving this result we define the generalized octonion loops, a variety of Moufang loops which behave analogously to the generalized quaternion groups. We proceed to investigate para-F quasigroups, a variety of quasigroups which we show are antilinear over Moufang loops. We briefly depart from the context of Moufang loops to discuss solvability in general loops. We then prove some results on …

Games For One, Games For Two: Computationally Complex Fun For Polynomial-Hierarchical Families, Kye Shi

HMC Senior Theses

In the first half of this thesis, we explore the polynomial-time hierarchy, emphasizing an intuitive perspective that associates decision problems in the polynomial hierarchy to combinatorial games with fixed numbers of turns. Specifically, problems in �� are thought of as 0-turn games, ���� as 1-turn “puzzle” games, and in general ��ₖ�� as ��-turn games, in which decision problems answer the binary question, “can the starting player guarantee a win?” We introduce the formalisms of the polynomial hierarchy through this perspective, alongside definitions of ��-turn CIRCUIT SATISFIABILITY games, whose ��ₖ��-completeness is assumed from prior work (we briefly justify this assumption …

What's New In Differentialgeometry Release Dg2022, Ian M. Anderson, Charles G. Torre

Tutorials on... in 1 hour or less

This Maple worksheet demonstrates the salient new features and functionalities of the 2022 release of the DifferentialGeometry software package.

Integral Representations Of Sl_2(Z/Nz), Yatin Dinesh Patel

Wayne State University Dissertations

The aim of this work is to determine for which commutative rings integral representations of SL_2(Z/nZ) exist and to explicitly compute them. We start with R = Z/pZ and then consider Z=p^\lambda Z. A new approach will be used to do this based on the Weil representation. We then consider general finite rings Z/nZ by extending methods described in [26]. We make extensive use of group theory, linear representations of finite groups, ring theory, algebraic geometry, and number theory. From number theory we will employ results regarding modular forms, Legendre symbols, Hilbert symbols, and quadratic forms. We consider the works …

Finding Optimal Cayley Map Embeddings Using Genetic Algorithms, Jacob Buckelew

Honors Program Theses

Genetic algorithms are a commonly used metaheuristic search method aimed at solving complex optimization problems in a variety of fields. These types of algorithms lend themselves to problems that can incorporate stochastic elements, which allows for a wider search across a search space. However, the nature of the genetic algorithm can often cause challenges regarding time-consumption. Although the genetic algorithm may be widely applicable to various domains, it is not guaranteed that the algorithm will outperform other traditional search methods in solving problems specific to particular domains. In this paper, we test the feasibility of genetic algorithms in solving a …

Finding Triangular Cayley Maps With Graph Touring, Hannah Hendrickson

Honors Program Theses

We develop a method for determining whether certain kinds of Cayley maps can exist by using multi-digraph representations of the data in the Cayley maps. Euler tours of these multi-digraphs correspond exactly to the permutations which define Cayley maps. We also begin to classify which 3-regular multi-digraphs have "non-backtracking" Euler tours in general.

Why Physical Power Laws Usually Have Rational Exponents, Edgar Daniel Rodriguez Velasquez, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Many physical dependencies are described by power laws y=A*xa, for some exponent a. This makes perfect sense: in many cases, there are no preferred measuring units for the corresponding quantities, so the form of the dependence should not change if we simply replace the original unit with a different one. It is known that such invariance implies a power law. Interestingly, not all exponents are possible in physical dependencies: in most cases, we have power laws with rational exponents. In this paper, we explain the ubiquity of rational exponents by taking into account that in many case, there is also …

Can Physics Attain Its Goals: Extending D'Agostino's Analysis To 21st Century And Beyond, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In his 2000 seminal book, Silvo D'Agostino provided the detailed overview of the history of ideas underlying 19th and 20th century physics. Now that we are two decades into the 21st century, a natural question is: how can we extend his analysis to the 21st century physics -- and, if possible, beyond, to try to predict how physics will change? To perform this analysis, we go beyond an analysis of what happened and focus more on why para-digm changes happened in the history of physics. To better understand these paradigm changes, we analyze now only what were the main ideas …

How To Elicit Complex-Valued Fuzzy Degrees, Laxman Bokati, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In the traditional fuzzy logic, an expert's degree of certainty in a statement is described by a single number from the interval [0,1]. However, there are situations when a single number is not sufficient: e.g., a situation when we know nothing and a situation in which we have a lot of arguments for a given statement and an equal number of arguments against it are both described by the same number 0.5. Several techniques have been proposed to distinguish between such situations. The most widely used is interval-valued technique, where we allow the expert to describe his/her degree of certainty …

Towards Optimal Techniques Intermediate Between Interval And Affine, Affine And Taylor, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In data processing, it is important to gauge how input uncertainty affects the results of data processing. Several techniques have been proposed for this gauging, from interval to affine to Taylor techniques. Some of these techniques result in more accurate estimates but require longer computation time, others' results are less accurate but can be obtained faster. Sometimes, we do not have enough time to use more accurate (but more time-consuming) techniques, but we have more time than needed for less accurate ones. In such cases, it is desirable to come up with intermediate techniques that would utilize the available additional …

Discrete Causality Implies Lorenz Group: Case Of 2-D Space-Times, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

It is known that for Minkowski space-times of dimension larger than 2, any causality-preserving transformation is linear. It is also known that in a 2-D space-time, there are many nonlinear causality-preserving transformations. In this paper, we show that for 2-D space-times, if we restrict ourselves to discrete space-times, then linearity is retained: only linear transformation preserve causality.

There From The Beginning: The Women Of Los Alamos National Laboratory Supporting National And International Nuclear Security, Olga Martin, Laura Mcclellan, Octavio Ramos, Heather Quinn

International Journal of Nuclear Security

From the beginning of the Manhattan Project in the early 1940s, the women of what would become Los Alamos National Laboratory (LANL) worked in technical positions alongside their male counterparts, played a key role as computers, and worked in administrative jobs as secretaries, phone operators, bookkeepers, and on behalf of the U.S. Army in the Women’s Army Corps.

Throughout the history of the Laboratory, women experts at LANL helped establish and lead important national and international security programs, with careers in science, technology, engineering, and mathematics. Over time, the women of Los Alamos have come together under various Employee Resource …

Don’T Beep At Me: Using Google Maps Apis To Reduce Driving Anxiety, Daniel Chechelnitsky

Mathematics, Statistics, and Computer Science Honors Projects

Stress while driving is a significant issue that causes automobile incidents. Along with the physical injuries, there is often baggage and trauma associated with these accidents. Wearable health monitoring technology, like Smartwatches, has a real possibility to help people further understand the stress inducing processes of driving. Thus to help with this issue, I propose a Google Maps app extension called: "Don't Beep At Me". This project creates a map that is layered by heart rate instead of speed limit and has great potential to be useful for reducing driving anxiety.