Digital Commons Network^™

Harmonious Labelings Via Cosets And Subcosets, Jared L. Painter, Holleigh C. Landers, Walker M. Mattox

Theory & Applications of Graphs

In [Abueida, A. and Roblee, K., More harmonious labelings of families of disjoint unions of an odd cycle and certain trees, J. Combin. Math. Combin. Comput., 115 (2020), 61-68] it is shown that the disjoint union of an odd cycle and certain paths is harmonious, and that certain starlike trees are harmonious using properties of cosets for a particular subgroup of the integers modulo m, where m is the number of edges of the graph. We expand upon these results by first exploring the numerical properties when adding values from cosets and subcosets in the integers modulo m. …

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

Theory & Applications of Graphs

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) …

Total Colouring Of New Classes Of Subcubic Graphs, Sethuraman G, Velankanni Anthonymuthu

Theory & Applications of Graphs

The total chromatic number of a graph G, denoted χ”(G), is the least number of colours needed to colour the vertices and the edges of G such that no incident or adjacent elements (vertices or edges) receive the same colour. The popular Total Colouring Conjecture (TCC) posed by Behzad states that, for every simple graph G, χ”(G) ≤ Δ(G)+2. In this paper, we prove that the total chromatic number for a family of subcubic graphs called cube connected paths and also for a class of subcubic graphs having the property that the vertices are covered by independent …

Geodesic Bipancyclicity Of The Cartesian Product Of Graphs, Amruta V. Shinde, Y.M. Borse

Theory & Applications of Graphs

A cycle containing a shortest path between two vertices u and v in a graph G is called a (u,v)-geodesic cycle. A connected graph G is geodesic 2-bipancyclic, if every pair of vertices u,v of it is contained in a (u,v)-geodesic cycle of length l for each even integer l satisfying 2d + 2 ≤ l ≤ |V(G)|, where d is the distance between u and v. In this paper, we prove that the Cartesian product of two geodesic hamiltonian graphs is a geodesic 2-bipancyclic graph. As a consequence, we show that for n …

Quantization Of The Poisson Type Central Limit Theorem (1), Yungang Lu

Journal of Stochastic Analysis

No abstract provided.

Finding Approximate Pythagorean Triples (And Applications To Lego Robot Building), Ronald I. Greenberg, Matthew Fahrenbacher, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

This assignment combines programming and data analysis to determine good combinations of side lengths that approximately satisfy the Pythagorean Theorem for right triangles. This can be a standalone exercise using a wide variety of programming languages, but the results are useful for determining good ways to assemble LEGO pieces in robot construction, so the exercise can serve to integrate three different units of the Exploring Computer Science high school curriculum: "Programming", "Computing and Data Analysis", and "Robotics". Sample assignment handouts are provided for both Scratch and Java programmers. Ideas for several variants of the assignment are also provided.

A Method For Estimating Songbird Abundance With Drones, Andrew M. Wilson, Darren Glass, Marisa A. Immordino, Precious S. Ozoh, Lauren Sherman, Mckenzie D. Somers

Environmental Studies Faculty Publications

Using drones to conduct airborne bioacoustics surveys is a potentially useful new way to estimate the abundance of vocal bird species. Here we show that by using two audio recorders suspended from a quadcopter drone it is possible to estimate distances to birds with precision. In an experimental test, the mean error of our estimated distances to a broadcast song across 11 points between 0 and 100 m away was just 3.47 m. In field tests, we compared 1 min airborne counts with 5 min terrestrial counts at 34 count locations. We found that the airborne counts yielded similar data …

Effect Of Phylogeny Misestimation On Estimating Trait Evolution Parameters, Tabytha Ariel Perez

Mathematics & Statistics ETDs

Biologists are interested in estimating trait evolution models from phylogenies. However, phylogenies are imperfectly estimated, generally from DNA sequence data. In this study, true phylogenies are simulated to understand whether errors in phylogeny estimation affect inference of the trait evolution model. Given the tree, DNA sequences as well as traits are then simulated from the true phylogeny; both are simulated independently from the other. After the simulation, the DNA sequences were used to estimate trees using the UPGMA method without utilizing the trait information. The estimated trees combined with the traits are used to infer the evolutionary trait models, specifically …

On A Relation Between Ado And Links-Gould Invariants, Nurdin Takenov

LSU Doctoral Dissertations

In this thesis we consider two knot invariants: Akutsu-Deguchi-Ohtsuki(ADO) invariant and Links-Gould invariant. They both are based on Reshetikhin-Turaev construction and as such share a lot of similarities. Moreover, they are both related to the Alexander polynomial and may be considered generalizations of it. By experimentation we found that for many knots, the third order ADO invariant is a specialization of the Links-Gould invariant. The main result of the thesis is a proof of this relation for a large class of knots, specifically closures of braids with five strands.

Commutative C*-Algebras Generated By Toeplitz Operators On The Fock Space, Vishwa Nirmika Dewage

LSU Doctoral Dissertations

The Fock space $\mathcal{F}(\mathbb{C}^n)$ is the space of holomorphic functions on $\mathbb{C}^n$ that are square-integrable with respect to the Gaussian measure on $\mathbb{C}^n$. This space plays an essential role in several subfields of analysis and representation theory. In particular, it has for a long time been a model to study Toeplitz operators. Grudsky and Vasilevski showed in 2002 that radial Toeplitz operators on $\mathcal{F}(\mathbb{C})$ generate a commutative $C^*$-algebra $\mathcal{T}^G$, while Esmeral and Maximenko showed that $C^*$-algebra $\mathcal{T}^G$ is isometrically isomorphic to the $C^*$-algebra $C_{b,u}(\mathbb{N}_0,\rho_1)$. In this thesis, we extend the result to $k$-quasi-radial symbols acting on the Fock space $\mathcal{F}(\mathbb{C}^n)$. …

Reference Database Of Teeth Images From The Family Bovidae, Juliet K. Brophy, Gregory J. Matthews

Mathematics and Statistics: Faculty Publications and Other Works

Researchers typically rely on fossils from the Family Bovidae to generate African paleoenvironmental reconstructions due to their strict ecological tendencies. Bovids have dominated the southern African fauna for the past four million years and, therefore, dominate the fossil faunal assemblages, especially isolated teeth. Traditionally, researchers reference modern and fossil comparative collections to identify teeth. However, researchers are limited by the specific type and number of bovids at each institution. B.O.V.I.D. (Bovidae Occlusal Visual IDentification) is a repository of images of the occlusal surface of bovid teeth. The dataset currently includes extant bovids from 7 tribes and 20 species (~3900). B.O.V.I.D. …

A Closed Form Formula For The Stochastic Exponential Of A Matrix-Valued Semimartingale, Peter Kern, Christian Müller

Journal of Stochastic Analysis

No abstract provided.

Magpies: Math & Girls + Inspiration = Success: Creating And Implementing A Virtual Math Circle For Girls, Lauren L. Rose, Amanda Landi, Jazmin Zamora Flores, Cathy Zhang, Shea Roccaforte, Julia Crager

Journal of Math Circles

During the academic year 2020-2021, we ran a virtual math outreach program for upper elementary and middle school girls, MAGPIES: Math & Girls + Inspiration = Success. Monthly sessions were held over Zoom, beginning with a short introduction by a guest presenter, followed by breakout rooms led by undergraduates paired with more experienced facilitators (upper division and graduated math majors and volunteer math educators). The online community was created purposefully to be an inclusive and collaborative environment for the attending girls, and the lessons were designed to provide a learning experience for all levels of participants. Examples of sessions include …

Characterization Of Outerplanar Graphs With Equal 2-Domination And Domination Numbers, Naoki Matsumoto

Theory & Applications of Graphs

A k-domination number of a graph G is minimum cardinality of a k-dominating set of G, where a subset S ⊆ V(G) is a k-dominating set if each vertex v ∈ V(G) \ S is adjacent to at least k vertices in S. It is known that for any graph G with Δ(G) ≥ k ≥ 2, γ_k(G) ≥ γ(G) + k – 2, and then γk(G) > γ(G) for any k ≥ 3, where γ(G) = γ1(G) is the usual domination number. Thus, it is the most interesting problem to characterize graphs G with …

One-Factorizations Of The Complete Graph $K_{P+1}$ Arising From Parabolas, György Kiss, Nicola Pace, Angelo Sonnino

Theory & Applications of Graphs

There are three types of affine regular polygons in AG(2, q): ellipse, hyperbola and parabola. The first two cases have been investigated in previous papers. In this note, a particular class of geometric one-factorizations of the complete graph Kn arising from parabolas is constructed and described in full detail. With the support of computer aided investigation, it is also conjectured that up to isomorphisms this is the only one-factorization where each one-factor is either represented by a line or a parabola.

Using Magic To Teach Computer Programming, Dale F. Reed, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

Magic can be used in project-based instruction to motivate students and provide a meaningful context for learning computer programming. This work describes several magic programs of the “Choose a Number” and “Pick a Card” varieties, making connections to underlying computing concepts.

Magic tricks presented as demonstrations and programming assignments elicit wonder and captivate students’ attention, so that students want to understand and replicate the work to show it to friends and family members. Capturing student interest and curiosity motivates them to learn the underlying programming concepts.

Two “Choose a Number” programs are shown where the computer is able to identify …

Many Cliques In Bounded-Degree Hypergraphs, Rachel Kirsch, J. Radcliffe

Department of Mathematics: Faculty Publications

Recently Chase determined the maximum possible number of cliques of size t in a graph on n vertices with given maximum degree. Soon afterward, Chakraborti and Chen answered the version of this question in which we ask that the graph have m edges and fixed maximum degree (without imposing any constraint on the number of vertices). In this paper we address these problems on hypergraphs. For s-graphs with s ≥ 3 a number of issues arise that do not appear in the graph case. For instance, for general s-graphs we can assign degrees to any i-subset of the vertex set …

The Obata First Eigenvalue Theorem On A Seven Dimensional Quaternionic Contact Manifold, Abdelrahman Mohamed

Mathematics & Statistics ETDs

We prove an Obata-type rigidity result for the first eigenvalue of the sub-Laplacian on a compact seven dimensional quaternionic contact (QC) manifold which satisfies a Lichnerowicz-type bound on its QC-Ricci tensor, and has a non-negative Paneitz P -function. In particular, under the stated conditions, the lowest possible eigenvalue of the sub-Laplacian is achieved if and only if the manifold is QC-equivalent to the standard 3-Sasakian sphere.

Understanding Compactness Through Primary Sources: Early Work Uniform Continuity To The Heine-Borel Theorem, Naveen Somasunderam

Analysis

No abstract provided.

How To Detect The Fundamental Frequency: Approach Motivated By Soft Computing And Computational Complexity, Eric Freudenthal, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Psychologists have shown that most information about the mood and attitude of a speaker is carried by the lowest (fundamental) frequency. Because of this frequency's importance, even when the corresponding Fourier component is weak, the human brain reconstruct this frequency based on higher harmonics. The problems is that many people lack this ability. To help them better understand moods and attitudes in social interaction, it is therefore desirable to come up with devices and algorithms that would reconstruct the fundamental frequency. In this paper, we show that ideas from soft computing and computational complexity can be used for this purpose.

Why Time Seems To Pass Slowly For Unpleasant Experiences And Quickly For Pleasant Experiences: An Explanation Based On Decision Theory, Laxman Bokati, Vladik Kreinovich

Departmental Technical Reports (CS)

It is known that our perception of time depends on our level of happiness: time seems to pass slower when we have unpleasant experiences and faster if our experiences are pleasant. Several explanations have been proposed for this effect. However, these explanations are based on specific features of human memory and/or human perception, features that, in turn, need explaining. In this paper, we show that this effect can be explained on a much more basic level of decision theory, without utilizing any specific features of human memory or perception.

Monotonic Bit-Invariant Permutation-Invariant Metrics On The Set Of All Infinite Binary Sequences, Irina Padilla, Vladik Kreinovich

Departmental Technical Reports (CS)

In a computer, all the information about an object is described by a sequence of 0s and 1s. At any given moment of time, we only have partial information, but as we perform more measurements and observations, we get longer and longer sequence that provides a more and more accurate description of the object. In the limit, we get a perfect description by an infinite binary sequence. If the objects are similar, measurement results are similar, so the resulting binary sequences are similar. Thus, to gauge similarity of two objects, a reasonable idea is to define an appropriate metric on …

Physical Trajectories Are Smooth, With Velocities At Least As Continuous As Brownian Motion, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

The fact that the kinetic energy of a particle cannot exceed its overall energy implies that the velocity -- i.e. the derivative of the trajectory -- should be bounded. This means, in effect, that all the trajectories are differentiable (smooth). However, at first glance, there seems to be no direct requirement that the velocities continuously depend on time. In this paper, we show that the properties of electromagnetic field necessitate that the velocities are continuous functions of time -- moreover, that they are at least as continuous as the Brownian motion.

Why Would Anyone Invest In A High-Risk Low-Profit Enterprise?, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Strangely enough, investors invest in high-risk low-profit enterprises as well. At first glance, this seems to contradict common sense and financial basics. However, we show that such investments make perfect sense as long as the related risks are independent from the risks of other investments. Moreover, we show that an optimal investment portfolio should allocate some investment to this enterprise.

Why Rectified Power (Repu) Activation Functions Are Efficient In Deep Learning: A Theoretical Explanation, Laxman Bokati, Vladik Kreinovich, Joseph Baca, Natasha Rovelli

Departmental Technical Reports (CS)

At present, the most efficient machine learning techniques is deep learning, with neurons using Rectified Linear (ReLU) activation function s(z) = max(0,z), in many cases, the use of Rectified Power (RePU) activation functions (s(z))^p -- for some p -- leads to better results. In this paper, we explain these results by proving that RePU functions (or their "leaky" versions) are optimal with respect that all reasonable optimality criteria.

Derivation And Analysis Of A Discrete Predator–Prey Model, Sabrina H. Streipert, Gail S.K. Wolkowicz, Martin Bohner

Mathematics and Statistics Faculty Research & Creative Works

We derive a discrete predator–prey model from first principles, assuming that the prey population grows to carrying capacity in the absence of predators and that the predator population requires prey in order to grow. The proposed derivation method exploits a technique known from economics that describes the relationship between continuous and discrete compounding of bonds. We extend standard phase plane analysis by introducing the next iterate root-curve associated with the nontrivial prey nullcline. Using this curve in combination with the nullclines and direction field, we show that the prey-only equilibrium is globally asymptotic stability if the prey consumption-energy rate of …

Over-Measurement Paradox: Suspension Of Thermonuclear Research Center And Need To Update Standards, Hector Reyes, Saeid Tizpaz-Niari, Vladik Kreinovich

Departmental Technical Reports (CS)

In general, the more measurements we perform, the more information we gain about the system and thus, the more adequate decisions we will be able to make. However, in situations when we perform measurements to check for safety, the situation is sometimes opposite: the more additional measurements we perform beyond what is required, the worse the decisions will be: namely, the higher the chance that a perfectly safe system will be erroneously classified as unsafe and therefore, unnecessary additional features will be added to the system design. This is not just a theoretical possibility: exactly this phenomenon is one of …

Everyone Is Above Average: Is It Possible? Is It Good?, Vladik Kreinovich, Olga Kosheleva

Departmental Technical Reports (CS)

Starting with the 1980s, a popular US satirical radio show described a fictitious town Lake Wobegon where ``all children are above average'' -- parodying the way parents like to talk about their children. This everyone-above-average situation was part of the fiction since, if we interpret the average in the precise mathematical sense, as average over all the town's children, then such a situation is clearly impossible. However, usually, when parents make this claim, they do not mean town-wise average, they mean average over all the kids with whom their child directly interacts. Somewhat surprisingly, it turns out that if we …

Why Shapley Value And Its Variants Are Useful In Machine Learning (And In Other Applications), Laxman Bokati, Olga Kosheleva, Vladik Kreinovich, Nguye Ngoc Thach

Departmental Technical Reports (CS)

Shapley value -- a useful way to allocate gains in cooperative games -- has been very successful in machine learning (and in other applications beyond cooperative games). This success is somewhat puzzling, since the usual derivation of the Shapley value is based on requirements like additivity that are natural in cooperative games and but not ents like additivity and is, thus, applicable in the machine learning case as well.

Relaxed Wythoff Has All Beatty Solutions, Jon Kay, Geremías Polanco

Mathematics Sciences: Faculty Publications

We find conditions under which the P-positions of three subtraction games arise as pairs of complementary Beatty sequences. The first game is due to Fraenkel and the second is an extension of the first game to non-monotone settings. We show that the P-positions of the second game can be inferred from the recurrence of Fraenkel's paper if a certain inequality is satisfied. This inequality is shown to be necessary if the P-positions are known to be pairs of complementary Beatty sequences, and the family of irrationals for which this inequality holds is explicitly given. We highlight several games in the …