Orderable and Deformable Coxeter Hyperbolic Tetrahedrons with Finite Volume
Journal Title: International Journal of Computational Engineering and Management IJCEM - Year 2013, Vol 16, Issue 6
Abstract
In this article, we classified the 3-dimensional orderable and deformable Coxeter hyperbolic tetrahedrons with finite volume. Andreev’s states a necessary and sufficient condition for a hyperbolic polyhedron with finite volume. Choi’s theorem provides a necessary and sufficient condition for orderable and deformable Coxeter polyhedron. Using graph theory and combinatorics, we find that there are 13 orderable and deformable Coxeter hyperbolic tetrahedrons with finite volume up to symmetry.
Authors and Affiliations
Dhrubajit Choudhury
Keywords
Related Articles
- EP ID EP162130
- DOI -
- Views 99
- Downloads 0
Work-Life Conflicts of Working Couples and Their Management: A Theoretical Framework
In contemporary workplaces there exist many employed parents who are endeavoring to balance participation between the two central life domains i.e. work and family. For parents living in dual-earner families, simultaneou...
An Power Efficient RNS Backward Converter for Novel Moduli Set { }
In this paper we propose new 3-moduli set for a large dynamic range of 6n-bits.Adder based RNS backward converter for this 3- moduli set is proposed based on New Chinese Remainder Theorem-I to achieve high performance....
Analysis of Bulk Queueing Model with Non Reliable Server
Here we will study bulk service to customer under optimal operation of a single removable and non-reliable server in Markovian queueing system under steady-state conditions. The decision maker can turn a server on at cus...
Computer Based Training
In this paper, we start by providing an overview of the main components of intelligent tutoring systems. We then provide a brief summary of different types of ITS. Next, we present a detailed discussion of two components...
Chaotic Harmony Search Algorithm with Different Chaotic Maps for Solving Assignment Problems
This paper presents an improved version of a harmony meta-heuristic algorithm with different chaotic maps, (IHSCH), for solving the linear assignment problem. The proposed algorithm uses chaotic behavior to generation a...