Mathematics Commons^™

How To Find A Levi Decomposition Of A Lie Algebra, Ian M. Anderson

How to... in 10 minutes or less

We show how to compute the Levi decomposition of a Lie algebra in Maple using the command LeviDecomposition. A worksheet and corresponding PDF can be found below.

How To Create A Jordan Algebra, Ian M. Anderson, Thomas J. Apedaile

How to... in 10 minutes or less

We show how to create a Jordan algebra in Maple using the commands AlgebraLibraryData and AlgebraData.

How To Create The Quaternion & Octonion Algebras, Ian M. Anderson, Thomas J. Apedaile

How to... in 10 minutes or less

We show how to create the quaternion and octonion algebras with the DifferentialGeometry software. For each algebra, there is a split-form also available.

On Contemplation In Mathematics, Frank Lucas Wolcott

Journal of Humanistic Mathematics

In a section about research, we make the case that intentional, structured reflection on the mathematical research process, by mathematical researchers themselves, would result in better mathematicians doing better mathematics. As supporting evidence, we describe the Flavors and Seasons project. In a section about teaching, we describe the contemplative education movement and share personal experiences using meditation in the math classroom. We conclude with an explicit proposal for elucidating the experiential context of mathematics, in both research and teaching environments.

The Complexity Of Linear Algebra, Leann Kay Christensen

Theses Digitization Project

This study examines the complexity of linear algebra. Complexity means how much work, or the number of calculations or time it takes to perform a task. As linear algebra is used more and more in different fields, it becomes useful to study ways of reducing the amount of work required to complete basic procedures.

A Study Of Finite Symmetrical Groups, Patrick Kevin Martinez

Theses Digitization Project

This study discovered several important groups that involve the classical and sporadic groups. These groups appeared as finite homomorphic images of the progenitors 3*8 : PGL₂(7), 2*¹⁴ : L₃ (2), 5*³ : S₃ and 7*2 : m S₃.

Nominal Regular Expressions For Languages Over Infinite Alphabets, Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto

Engineering Faculty Articles and Research

We propose regular expressions to abstractly model and study properties of resource-aware computations. Inspired by nominal techniques – as those popular in process calculi – we extend classical regular expressions with names (to model computational resources) and suitable operators (for allocation, deallocation, scoping of, and freshness conditions on resources). We discuss classes of such nominal regular expressions, show how such expressions have natural interpretations in terms of languages over infinite alphabets, and give Kleene theorems to characterise their formal languages in terms of nominal automata.

Relation Lifting, With An Application To The Many-Valued Cover Modality, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jirí Velebil

Engineering Faculty Articles and Research

We introduce basic notions and results about relation liftings on categories enriched in a commutative quantale. We derive two necessary and sufficient conditions for a 2-functor T to admit a functorial relation lifting: one is the existence of a distributive law of T over the “powerset monad” on categories, one is the preservation by T of “exactness” of certain squares. Both characterisations are generalisations of the “classical” results known for set functors: the first characterisation generalises the existence of a distributive law over the genuine powerset monad, the second generalises preservation of weak pullbacks.

The results presented in this paper …

Polynomial Knot And Link Invariants From The Virtual Biquandle, Alissa S. Crans, Allison Henrich, Sam Nelson

Mathematics, Statistics and Data Science Faculty Works

The Alexander biquandle of a virtual knot or link is a module over a 2-variable Laurent polynomial ring which is an invariant of virtual knots and links. The elementary ideals of this module are then invariants of virtual isotopy which determine both the generalized Alexander polynomial (also known as the Sawollek polynomial) for virtual knots and the classical Alexander polynomial for classical knots. For a fixed monomial ordering <, the Gr\"obner bases for these ideals are computable, comparable invariants which fully determine the elementary ideals and which generalize and unify the classical and generalized Alexander polynomials. We provide examples to illustrate the usefulness of these invariants and propose questions for future work.

Oddification Of The Cohomology Of Type A Springer Varieties, Heather M. Russell, Aaron D. Lauda

Department of Math & Statistics Faculty Publications

We identify the ring of odd symmetric functions introduced by Ellis and Khovanov as the space of skew polynomials fixed by a natural action of the Hecke algebra at q = −1. This allows us to define graded modules over the Hecke algebra at q = −1 that are ‘odd’ analogs of the cohomology of type A Springer varieties. The graded module associated to the full flag variety corresponds to the quotient of the skew polynomial ring by the left ideal of nonconstant odd symmetric functions. The top degree component of the odd cohomology of Springer varieties is identifiedwith the …

An Extremal Problem For Characteristic Functions, William T. Ross, Isabelle Chalendar, Stephan Ramon Garcia, Dan Timotin

Department of Math & Statistics Faculty Publications

Suppose E is a subset of the unit circle T and H^∞C L^∞ is the Hardy subalgebra. We examine the problem of Finding the distance from the characteristic function of E to zⁿ H^∞. This admits an alternate description as a dual extremal problem. Precise solutions are given in several important cases. The techniques used involve the theory of Toeplitz and Hankel operators as well as the construction of certain conformal mappings.

Model Spaces: A Survey, William T. Ross, Stephan Ramon Garcia

Department of Math & Statistics Faculty Publications

This is a brief and gentle introduction, aimed at graduate students, to the subject of model subspaces of the Hardy space.

An Explicit Bijection Between Semistandard Tableaux And Non-Elliptic Sl3 Webs, Heather M. Russell

Department of Math & Statistics Faculty Publications

The sl₃ spider is a diagrammatic category used to study the representation theory of the quantum group U_q(sl₃). The morphisms in this category are generated by a basis of non-elliptic webs. Khovanov- Kuperberg observed that non-elliptic webs are indexed by semistandard Young tableaux. They establish this bijection via a recursive growth algorithm. Recently, Tymoczko gave a simple version of this bijection in the case that the tableaux are standard and used it to study rotation and joins of webs. We build on Tymoczko’s bijection to give a simple and explicit algorithm for constructing all …

The Gordon Game, Anthony Frenk

EWU Masters Thesis Collection

In 1992, about 30 years after Gordon introduced group sequencings to construct row-complete Latin squares, John Isbell introduced the idea of competitive sequencing, the Gordon Game. Isbell investigated the Gordon Game and found solutions for groups of small order. The purpose of this thesis is to analyze the Gordon Game and develop a brute force method of determining solutions to the game for all groups of order 12 (up to isomorphism) as well as for abelian groups of order less than 20. The method used will be a depth first search program written in MATLAB. Consequently, group representation using matrices …

Endomorphisms Of Abelian Groups With Small Algebraic Entropy, D. Dikranjan, Ketao Gong, P. Zanardo

Articles

We study the endomorphisms ϕ of abelian groups G having a “small” algebraic entropy h (where “small” usually means ). Using essentially elementary tools from linear algebra, we show that this study can be carried out in the group , where an automorphism ϕ with must have all eigenvalues in the open circle of radius 2, centered at 0 and ϕ must leave invariant a lattice in , i.e., be essentially an automorphism of . In particular, all eigenvalues of an automorphism ϕ with must be roots of unity. This is a particular case of a more general fact known …

On Discrete Analytic Functions: Products, Rational Functions, And Reproducing Kernels, Daniel Alpay, Palle Jorgensen, Ron Seager, Dan Volok

Mathematics, Physics, and Computer Science Faculty Articles and Research

We introduce a family of discrete analytic functions, called expandable discrete analytic functions, which includes discrete analytic polynomials, and define two products in this family. The first one is defined in a way similar to the Cauchy-Kovalevskaya product of hyperholomorphic functions, and allows us to define rational discrete analytic functions. To define the second product we need a new space of entire functions which is contractively included in the Fock space. We study in this space some counterparts of Schur analysis.

Recent Progress On Truncated Toeplitz Operators, William T. Ross, Stephan Ramon Garcia

Department of Math & Statistics Faculty Publications

This paper is a survey on the emerging theory of truncated Toeplitz operators. We begin with a brief introduction to the subject and then highlight the many recent developments in the field since Sarason’s seminal paper [88] from 2007.

Special Type Of Subset Topological Spaces, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book we construct special subset topological spaces using subsets from semigroups or groups or rings or semirings. Such study is carried out for the first time and it is both interesting and innovative. Suppose P is a semigroup and S is the collection of all subsets of P together with the empty set, then S can be given three types of topologies and all the three related topological spaces are distinct and results in more types of topological spaces. When the semigroup is finite, S gives more types of finite topological spaces. The same is true in case …

Subset Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors introduce the new notion of constructing non associative algebraic structures using subsets of a groupoid. Thus subset groupoids are constructed using groupoids or loops. Even if we use subsets of loops still the algebraic structure we get with it is only a groupoid. However we can get a proper subset of it to be a subset loop which will be isomorphic with the loop which was used in the construction of the subset groupoid. To the best of the authors’ knowledge this is the first time non associative algebraic structures are constructed using subsets. We get …

Cohomology Of Frobenius Algebras And The Yang-Baxter Equation, J. Scott Carter, Alissa S. Crans, Mohamed Elhamdadi, Enver Karadayi, Masahico Saito

Mathematics, Statistics and Data Science Faculty Works

A cohomology theory for multiplications and comultiplications of Frobenius algebras is developed in low dimensions in analogy with Hochschild cohomology of bialgebras based on deformation theory. Concrete computations are provided for key examples. Skein theoretic constructions give rise to solutions to the Yang-Baxter equation using multiplications and comultiplications of Frobenius algebras, and 2-cocycles are used to obtain deformations of R-matrices thus obtained.

Full Newton Step Interior Point Method For Linear Complementarity Problem Over Symmetric Cones, Andrii Berdnikov

College of Graduate Studies: Theses & Dissertations

In this thesis, we present a new Feasible Interior-Point Method (IPM) for Linear Complementarity Problem (LPC) over Symmetric Cones. The advantage of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of parameters we prove the global convergence of iterates which always stay in the the central path neighborhood. A global convergence of the method is proved and an upper bound for the number of iterations necessary to find ε-approximate solution of the problem is presented.

Topological Convolution Algebras, Daniel Alpay, Guy Salomon

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we introduce a new family of topological convolution algebras of the form ⋃p∈NL2(S,μp), where S is a Borel semi-group in a locally compact group G, which carries an inequality of the type ∥f∗g∥p≤Ap,q∥f∥q∥g∥p for p>q+d where d pre-assigned, and Ap,q is a constant. We give a sufficient condition on the measures μp for such an inequality to hold. We study the functional calculus and the spectrum of the elements of these algebras, and present two examples, one in the setting of non commutative stochastic distributions, and the other related to Dirichlet series.

Pontryagin De Branges-Rovnyak Spaces Of Slice Hyperholomorphic Functions, Daniel Alpay, Fabrizio Colombo, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

We study reproducing kernel Hilbert and Pontryagin spaces of slice hyperholomorphic functions which are analogs of the Hilbert spaces of analytic functions introduced by de Branges and Rovnyak. In the first part of the paper we focus on the case of Hilbert spaces, and introduce in particular a version of the Hardy space. Then we define Blaschke factors and Blaschke products and we consider an interpolation problem. In the second part of the paper we turn to the case of Pontryagin spaces. We first prove some results from the theory of Pontryagin spaces in the quaternionic setting and, in particular, …

Singular Value Inequalities: New Approaches To Conjectures, Peter Chilstrom

UNF Graduate Theses and Dissertations

Singular values have been found to be useful in the theory of unitarily invariant norms, as well as many modern computational algorithms. In examining singular value inequalities, it can be seen how these can be related to eigenvalues and how several algebraic inequalities can be preserved and written in an analogous singular value form. We examine the fundamental building blocks to the modern theory of singular value inequalities, such as positive matrices, matrix norms, block matrices, and singular value decomposition, then use these to examine new techniques being used to prove singular value inequalities, and also look at existing conjectures.

Representation Formulas For Hardy Space Functions Through The Cuntz Relations And New Interpolation Problems, Daniel Alpay, Palle Jorgensen, Izchak Lewkowicz, Itzik Marziano

Mathematics, Physics, and Computer Science Faculty Articles and Research

We introduce connections between the Cuntz relations and the Hardy space H2 of the open unit disk D. We then use them to solve a new kind of multipoint interpolation problem in H2, where for instance, only a linear combination of the values of a function at given points is preassigned, rather than the values at the points themselves.

Subset Non Associative Topological Spaces, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

The concept of non associative topological space is new and innovative. In general topological spaces are defined as union and intersection of subsets of a set X. In this book authors for the first time define non associative topological spaces using subsets of groupoids or subsets of loops or subsets of groupoid rings or subsets of loop rings. This study leads to several interesting results in this direction.

Over hundred problems on non associative topological spaces using of subsets of loops or groupoids is suggested at the end of chapter two. Also conditions for these non associative subset topological spaces …

Subset Polynomial Semirings And Subset Matrix Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors introduce the notion of subset polynomial semirings and subset matrix semirings. The study of algebraic structures using subsets were recently carried out by the authors. Here we define the notion of subset row matrices, subset column matrices and subset m × n matrices. Study of this kind is developed in chapter two of this book. If we use subsets of a set X; say P(X), the power set of the set X....

Hence if P(X) is replaced by a group or a semigroup we get the subset matrix to be only a subset matrix semigroup. If …

Subset Interval Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

The study of groupoids is meager and we have recently introduced the new notion of subset groupoids and have studied them. It is interesting to keep on record that interval groupoids have been studied by us in 2010. Further when the subsets of a loop are taken they also form only a subset groupoid and not a subset loop. Thus we do not have the concept of subset interval loop they only form a subset interval groupoid. Special elements like subset interval zero divisors, subset interval idempotents and subset interval units are studied. Concept of subset interval groupoid homomorphism is …

Algebraic Structures Using Subsets, Florentin Smarandache, W.B Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

The study of subsets and giving algebraic structure to these subsets of a set started in the mid 18th century by George Boole. The first systematic presentation of Boolean algebra emerged in 1860s in papers written by William Jevons and Charles Sanders Peirce. Thus we see if P(X) denotes the collection of all subsets of the set X, then P(X) under the op erations of union and intersection is a Boolean algebra. Next the subsets of a set was used in the construction of topological spaces. We in this book consider subsets of a semigroup or a group or a …

Algebraic Structures Using [0,N), Florentin Smarandache, Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce a new method of building algebraic structures on the interval [0, n). This study is interesting and innovative. However, [0, n) is a semigroup under product, × modulo n and a semigroup under min or max operation. Further [0, n) is a group under addition modulo n. We see [0, n) under both max and min operation is a semiring. [0, n) under + and × is not in general a ring. We define S = {[0, n), +, ×} to be a pseudo special ring as the distributive law is …