In the present work, 16 genetic code doublets and their cognate amino acids in the genetic code are fitted into a polyhedron model. Based on the structural regularity in nucleobases, and by using a series of common-sense topological approaches to rearranging the Hamiltonian-type graph of the codon map, it is identified that the degeneracy of codons and the internal relation of the 20 amino acid...

Polyacrylic acid/ octavinyl polyhedral oligomeric silsesquioxane, nanocomposite hydrogel with 3-D network was synthesized via radical polymerization. Octavinyl polyhedral oligomeric silsesquioxane was used as crosslinker and nanofiller simultaneously in the preparation of the hydrogel. Hydrogel adsorption performance was determined by adsorption of methylene blue. The adsorption capacity was ev...

A k-trestle of a graph G is a 2-connected spanning subgraph of G of maximum degree at most k. We show that a polyhedral graph G has a 3-trestle, if the separator-hypergraph of G contains no two different cycles joined by a path of 3-separators of length ≥ 0. There are graphs not satisfying this condition that have no 3-trestles. Further, for each integer k every graph with toughness smaller tha...

In the end of the 19th century Bricard discovered a phenomenon of flexible polyhedra, that is, polyhedra with rigid faces and hinges at edges that admit non-trivial flexes. One of the most important results in this field is a theorem of Sabitov asserting that the volume of a flexible polyhedron is constant during the flexion. In this paper we study flexible polyhedral surfaces in R two-periodic...

We investigate the asymptotics of the number of “overlattices” of a cocompact lattice Γ in Aut(X), where X is a locally finite polyhedral complex. We use complexes of groups to prove an upper bound for general X, and a lower bound for certain right-angled buildings.

In this paper, we give a polyhedral realization of the highest weight crystals B(λ) associated with the highest weight modules V (λ) for the generalized Kac-Moody algebras. As applications, we give explicit descriptions of crystals for the generalized Kac-Moody algebras of ranks 2, 3, and Monster algebras.

A subset S of R is said to be polyhedral if it is the intersection of a finite number of closed halfspaces, i.e., if there exist J ∈ N and collections {y1, . . . , yJ} ⊂ R, {α1, . . . , αJ} ⊂ R such that S = ∩j=1{x ∈ R : y jx ≤ αj}. A function f : R → [−∞,+∞] is polyhedral if its epigraph epi f ⊂ R is a polyhedral set. Clearly, any polyhedral set is automatically convex and closed. Consequently...

We study compactifications of subvarieties of algebraic tori using methods from the still developing subject of tropical geometry. Associated to each ``tropical" compactification is a polyhedral object called a tropical fan. Techniques developed by Hacking, Keel, and Tevelev relate the polyhedral geometry of the tropical variety to the algebraic geometry of the compactification. We compare thes...

A Banach space is polyhedral if the unit ball of each of its finite dimensional subspaces is a polyhedron. It is known that a polyhedral Banach space has a separable dual and is c0-saturated, i.e., each closed infinite dimensional subspace contains an isomorph of c0. In this paper, we show that the Orlicz sequence space hM is isomorphic to a polyhedral Banach space if limt→0 M(Kt)/M(t) = ∞ for ...