Quaterionic Construction of the W(F_4) Polytopes with Their Dual Polytopes and Branching under the Subgroups B(B_4) and W(B_3)*W(A_1)

4-dimensional $F_{4}$ polytopes and their dual polytopes have been constructed as the orbits of the Coxeter-Weyl group $W(F_{4})$ where the group elements and the vertices of the polytopes are represented by quaternions. Branchings of an arbitrary \textbf{$W(F_{4})$} orbit under the Coxeter groups $W(B_{4}$ and $W(B_{3}) \times W(A_{1})$ have been presented. The role of group theoretical technique and the use of quaternions have been emphasizedComment: 26 pages, 10 figure

Affine Wa(A4), Quaternions, and Decagonal Quasicrystals

We introduce a technique of projection onto the Coxeter plane of an arbitrary higher dimensional lattice described by the affine Coxeter group. The Coxeter plane is determined by the simple roots of the Coxeter graph I2 (h) where h is the Coxeter number of the Coxeter group W(G) which embeds the dihedral group Dh of order 2h as a maximal subgroup. As a simple application we demonstrate projections of the root and weight lattices of A4 onto the Coxeter plane using the strip (canonical) projection method. We show that the crystal spaces of the affine Wa(A4) can be decomposed into two orthogonal spaces whose point groups is the dihedral group D5 which acts in both spaces faithfully. The strip projections of the root and weight lattices can be taken as models for the decagonal quasicrystals. The paper also revises the quaternionic descriptions of the root and weight lattices, described by the affine Coxeter group Wa(A3), which correspond to the face centered cubic (fcc) lattice and body centered cubic (bcc) lattice respectively. Extensions of these lattices to higher dimensions lead to the root and weight lattices of the group Wa(An), n>=4 . We also note that the projection of the Voronoi cell of the root lattice of Wa(A4) describes a framework of nested decagram growing with the power of the golden ratio recently discovered in the Islamic arts.Comment: 26 pages, 17 figure

Quasi Regular Polyhedra and Their Duals with Coxeter Symmetries Represented by Quaternions I

In two series of papers we construct quasi regular polyhedra and their duals which are similar to the Catalan solids. The group elements as well as the vertices of the polyhedra are represented in terms of quaternions. In the present paper we discuss the quasi regular polygons (isogonal and isotoxal polygons) using 2D Coxeter diagrams. In particular, we discuss the isogonal hexagons, octagons and decagons derived from 2D Coxeter diagrams and obtain aperiodic tilings of the plane with the isogonal polygons along with the regular polygons. We point out that one type of aperiodic tiling of the plane with regular and isogonal hexagons may represent a state of graphene where one carbon atom is bound to three neighboring carbons with two single bonds and one double bond. We also show how the plane can be tiled with two tiles; one of them is the isotoxal polygon, dual of the isogonal polygon. A general method is employed for the constructions of the quasi regular prisms and their duals in 3D dimensions with the use of 3D Coxeter diagrams.Comment: 22 pages, 16 figure

Snub 24-Cell Derived from the Coxeter-Weyl Group W(D4)

Snub 24-cell is the unique uniform chiral polytope in four dimensions consisting of 24 icosahedral and 120 tetrahedral cells. The vertices of the 4-dimensional semi-regular polytope snub 24-cell and its symmetry group {(W(D_{4})\mathord{/{\vphantom {(W(D_{4}) C_{2}}}. \kern-\nulldelimiterspace} C_{2}}):S_{3} of order 576 are obtained from the quaternionic representation of the Coxeter-Weyl group \textbf{$W(D_{4}).$}The symmetry group is an extension of the proper subgroup of the Coxeter-Weyl group \textbf{$W(D_{4})$}by the permutation symmetry of the Coxeter-Dynkin diagram \textbf{$D_{4} .$} The 96 vertices of the snub 24-cell are obtained as the orbit of the group when it acts on the vector \textbf{$\Lambda =(\tau, 1, \tau, \tau)$}or\textbf{}on the vector\textbf{$\Lambda =(\sigma, 1, \sigma, \sigma)$}in the Dynkin basis with\textbf{$\tau =\frac{1+\sqrt{5}}{2} {\rm and}\sigma =\frac{1-\sqrt{5}}{2} {\rm .}$} The two different sets represent the mirror images of the snub 24-cell. When two mirror images are combined it leads to a quasi regular 4D polytope invariant under the Coxeter-Weyl group \textbf{$W(F_{4}).$}Each vertex of the new polytope is shared by one cube and three truncated octahedra. Dual of the snub 24 cell is also constructed. Relevance of these structures to the Coxeter groups \textbf{$W(H_{4}){\rm and}W(E_{8})$}has been pointed out.Comment: 15 pages, 8 figure

Lot sizing with piecewise concave production costs

Cataloged from PDF version of article.We study the lot-sizing problem with piecewise concave production costs and concave holding costs. This problem is a generalization of the lot-sizing problem with quantity discounts, minimum order quantities, capacities, overloading, subcontracting or a combination of these. We develop a dynamic programming algorithm to solve this problem and answer an open question in the literature: we show that the problem is polynomially solvable when the breakpoints of the production cost function are time invariant and the number of breakpoints is fixed. For the special cases with capacities and subcontracting, the time complexity of our algorithm is as good as the complexity of algorithms available in the literature. We report the results of a computational experiment where the dynamic programming is able to solve instances that are hard for a mixed-integer programming solver. We enhance the mixed-integer programming formulation with valid inequalities based on mixing sets and use a cut-and-branch algorithm to compute better bounds. We propose a state space reduction–based heuristic algorithm for large instances and show that the solutions are of good quality by comparing them with the bounds obtained from the cut-and-branch

Quaternionic Root Systems and Subgroups of the Aut(F4)Aut(F_{4})

Cayley-Dickson doubling procedure is used to construct the root systems of some celebrated Lie algebras in terms of the integer elements of the division algebras of real numbers, complex numbers, quaternions and octonions. Starting with the roots and weights of SU(2) expressed as the real numbers one can construct the root systems of the Lie algebras of SO(4),SP(2)= SO(5),SO(8),SO(9),F_{4} and E_{8} in terms of the discrete elements of the division algebras. The roots themselves display the group structures besides the octonionic roots of E_{8} which form a closed octonion algebra. The automorphism group Aut(F_{4}) of the Dynkin diagram of F_{4} of order 2304, the largest crystallographic group in 4-dimensional Euclidean space, is realized as the direct product of two binary octahedral group of quaternions preserving the quaternionic root system of F_{4}.The Weyl groups of many Lie algebras, such as, G_{2},SO(7),SO(8),SO(9),SU(3)XSU(3) and SP(3)X SU(2) have been constructed as the subgroups of Aut(F_{4}). We have also classified the other non-parabolic subgroups of Aut(F_{4}) which are not Weyl groups. Two subgroups of orders192 with different conjugacy classes occur as maximal subgroups in the finite subgroups of the Lie group $G_{2}$ of orders 12096 and 1344 and proves to be useful in their constructions. The triality of SO(8) manifesting itself as the cyclic symmetry of the quaternionic imaginary units e_{1},e_{2},e_{3} is used to show that SO(7) and SO(9) can be embedded triply symmetric way in SO(8) and F_{4} respectively

Stochastic lot sizing problem with controllable processing times

Cataloged from PDF version of article.In this study, we consider the stochastic capacitated lot sizing problem with controllable processing times where processing times can be reduced in return for extra compression cost. We assume that the compression cost function is a convex function as it may reflect increasing marginal costs of larger reductions and may be more appropriate when the resource life, energy consumption or carbon emission are taken into consideration. We consider this problem under static uncertainty strategy and α service level constraints. We first introduce a nonlinear mixed integer programming formulation of the problem, and use the recent advances in second order cone programming to strengthen it and then solve by a commercial solver. Our computational experiments show that taking the processing times as constant may lead to more costly production plans, and the value of controllable processing times becomes more evident for a stochastic environment with a limited capacity. Moreover, we observe that controllable processing times increase the solution flexibility and provide a better solution in most of the problem instances, although the largest improvements are obtained when setup costs are high and the system has medium sized capacities