Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Keyword
-
- Algebra (2)
- Cwatset (2)
- Algebraic connectivity (1)
- Algebraic problems (1)
- Algebraic topology (1)
-
- Binary trees (1)
- Combinatorial optimization (1)
- Geometry (1)
- Graph theory (1)
- Hyperbolic geometry (1)
- Laplacian matrix (1)
- Leonhard Euler 1707-1783 (1)
- Mathematical optimization (1)
- Mathematical problems (1)
- Mathematics (1)
- Number theory (1)
- Problems (1)
- Regular Rings; π-Regular Rings; Abstract Algebra; Ring Theory; Stable Range One (1)
- Tesselation (1)
- Tiling (1)
- Publication
- Publication Type
Articles 1 - 10 of 10
Full-Text Articles in Algebra
Classification Of Cwatsets Through Order 23, Ben Goodwin, Dennis Lin
Classification Of Cwatsets Through Order 23, Ben Goodwin, Dennis Lin
Mathematical Sciences Technical Reports (MSTR)
A cwatset of order n can be represented by a transitive subgroup of Sn. Previous work has shown that each conjugacy class of representation groups corresponds to an isomorphism class of cwatsets. We present a technique for determining whether a particular transitive subgroup of Sn can appear as the representation group for a cwatset of order n. Using this method, we provide a full classification of cwatset isomorphism classes through order 23.
Quest For Tilings On Riemann Surfaces Of Genus Six And Seven, Robert Dirks, Maria Sloughter
Quest For Tilings On Riemann Surfaces Of Genus Six And Seven, Robert Dirks, Maria Sloughter
Mathematical Sciences Technical Reports (MSTR)
The problem of kaleidoscopically tiling a surface by congruent triangles is equivalent to finding groups generated in certain ways. In order to admit a tiling, a group must have a specific set of generators as well as an involutary automorphism, T, that acts to reverse the orientation of the tiles. The purpose of this paper is to explore group theoretic and computational methods for determining the existence of symmetry groups and tiling groups, as well as to classify the symmetry and tiling groups on hyperbolic Riemann surfaces of genus 6 and 7.
Cwatset Isomorphism And Its Consequences, Carolyn M. Girod, Matthew Lipinski, Joseph R. Mileti, Jennifer R. Paulhus
Cwatset Isomorphism And Its Consequences, Carolyn M. Girod, Matthew Lipinski, Joseph R. Mileti, Jennifer R. Paulhus
Mathematical Sciences Technical Reports (MSTR)
We explore the consequences of cwatset isomorphism (there are a finite number of non-isomorphic cwatsets of each order) and consider parallels between the theory of groups and the theory of cwatsets (cwatsets of prime order are cyclic but direct sums of isomorphic cwatsets aren't necessarily isomorphic).
A Look At Biseparating Maps From An Algebraic Point Of View, Melvin Henriksen, Frank A. Smith
A Look At Biseparating Maps From An Algebraic Point Of View, Melvin Henriksen, Frank A. Smith
All HMC Faculty Publications and Research
In [ABN], Araujo, Beckenstein, and Narici add the capstone to a series of papers by several groups of authors by showing that if ρ is a biseparating map between two algebras of all real or complex-valued functions on realcompact spaces, then it is a continuous multiple of an isomorphism between these rings. Their proof uses relatively powerful analytic and topological techniques. In what follows, the extent to which such a result can be generalized to a wider class of algebras using algebraic techniques is investigated. We are unable, however to obtain the main result of [ABN] using these techniques.
Solutions To The Chinese Postman Problem, Kenneth Peter Cramm
Solutions To The Chinese Postman Problem, Kenneth Peter Cramm
Theses Digitization Project
Considering the Chinese Postman Problem, in which a mailman must deliver mail to houses in a neighborhood. The mailman must cover each side of the street that has houses, at least once. The focus of this paper is our attempt to discover the optimal path, or the least number of times each street is walked. The integration of algorithms from graph theory and operations research form the method used to explain solutions to the Chinese Postman Problem.
Notes On Coalgebras, Cofibrations And Concurrency, Alexander Kurz, Dirk Pattinson
Notes On Coalgebras, Cofibrations And Concurrency, Alexander Kurz, Dirk Pattinson
Engineering Faculty Articles and Research
We consider categories of coalgebras as (co)-fibred over a base category of parameters and analyse categorical constructions in the total category of deterministic and non-deterministic coalgebras.
Algebra În Exercijii Şi Probleme Pentru Liceu, Florentin Smarandache, Ion Goian, Raisa Grigor, Vasila Marin
Algebra În Exercijii Şi Probleme Pentru Liceu, Florentin Smarandache, Ion Goian, Raisa Grigor, Vasila Marin
Branch Mathematics and Statistics Faculty and Staff Publications
No abstract provided.
Tight Bounds On The Algebraic Connectivity Of A Balanced Binary Tree, Jason J. Molitierno, Michael Neumann, Bryan L. Shader
Tight Bounds On The Algebraic Connectivity Of A Balanced Binary Tree, Jason J. Molitierno, Michael Neumann, Bryan L. Shader
Mathematics Faculty Publications
In this paper, quite tight lower and upper bounds are obtained on the algebraic connectivity, namely, the second-smallest eigenvalue of the Laplacian matrix, of an unweighted balanced binary tree with k levels and hence n = 2k - 1 vertices. This is accomplished by considering the inverse of a matrix of order k - 1 readily obtained from the Laplacian matrix. It is shown that the algebraic connectivity is 1/(2k - 2k + 3) + 0(1/22k).
Definitions, Solved And Unsolved Problems, Conjectures, And Theorems In Number Theory And Geometry, Florentin Smarandache
Definitions, Solved And Unsolved Problems, Conjectures, And Theorems In Number Theory And Geometry, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Florentin Smarandache, an American mathematician of Romanian descent has generated a vast variety of mathematical problems. Some problems are easy, others medium, but many are interesting or unsolved and this is the reason why the present book appears. Here, of course, there are problems from various types. Solving these problems is addictive like eating pumpkin seed: having once started, one cannot help doing it over and over again.
On Strongly N-Regular And Strongly Regular Rings, Huey Voon Chen
On Strongly N-Regular And Strongly Regular Rings, Huey Voon Chen
Student Works (2000-2009)
Let R be an associative ring with identity 1 (not equal to) 0. An element x E R is said to be right (or left) regular if there exists yin R such that x² y = x (or y.x² = x). If x is both left and right regular, then it is said to be strongly regular. The ring R is said to be strongly regular if every element of R is strongly regular. We say that x is a left -π-regular element if there exist an integer n > 0 and an element y E R such that yx n+1 …