Uma das questões mais importantes em Teoria de Singularidades é a determinação de condições que garantam a trivialidade topológica em famílias de germes de funções ou aplicações. Neste trabalho é feito um estudo a fim de descrever condições necessárias e suficientes para a trivialidade topológica em famílias de germes de funções com singularidade isolada. Para isto, são apresentados dois métodos. O primeiro é o de campos de vetores controlados, baseado nos trabalhos de Damon-Gaffney e Yoshinaga. O segundo relaciona invariantes associados às famílias de germes de funções com a trivialidade topológica destas. Em ambos os casos, a principal ferramenta é a construção de poliedros de Newton associados às famílias. / One of the most important questions in Theory of Singularities is the determination of conditions that guarantee the topological triviality in families of germs of functions or mappings. In this work a study is made in order to describe necessaries and sufficients conditions for the topological triviality in families of germs of functions with isolated singularity. For this, two methods are presented. The first one is controlled vectors fields method, based on the works of Damon-Gaffney and Yoshinaga. The second relates invariants associated with families of germs of functions with the topological triviality of these. In both cases, the main tool used is the construction of Newton polyhedra associated with families.

Orientador: Rita de Cássia Pavani Lamas / Banca: Vanderlei Minori Horita / Banca: Edna Maura Zuffi / O PROFMAT - Programa de Mestrado Profissional em Matemática em Rede Nacional é coordenado pela Sociedade Brasileira de Matemática e realizado por uma rede de Instituições de Ensino Superior. / Resumo: De acordo com as atuais diretrizes pertinentes ao ensino de matemática (Parâmetros Curriculares Nacionais : Matemática e Proposta Curricular do Estado de São Paulo: Matemática), este trabalho baseia-se na Teoria de Van Hiele, visando a aprendizagem de conceitos geométricos, em particular a aprendizagem de poliedros regulares, através da confecção de dobraduras (origami). Iniciando com uma abordagem histórica sobre poliedro, apresenta orientações para o uso de origami em sala de aula, delineia as principais características da Teoria de Van Hiele, além de retomar os principais conceitos matemáticos associados aos poliedros. Utilizando este arcabouço é proposta uma sequência de atividades de sondagem e aplicação de conceitos geométricos respeitando as fases de aprendizagem de Van Hiele, visando a conclusão por parte do aluno, da existência de apenas cinco poliedros regulares. Após a execução das atividades propostas, as demonstrações dos teoremas relacionados aos poliedros apresentados neste trabalho servirão para a sistematização das conclusões feitas pelos alunos, sempre respeitando o nível de Van Hiele em que se encontrem. Apresenta, ainda, atividades de exploração das características dos poliedros através do Teorema de Euler para poliedros convexos / Abstract: According to the current guidelines relevant to teaching mathematics (National Curriculum: Mathematics, and Curricular Proposal of the State of São Paulo: Mathematics) this work is based on Van Hiele, and aimed at learning of geometric concepts, particularly learning regular polyhedra, by paperfolding (origami). Starting with a historical approach of polyhedron, this work presents guidelines for the use of origami in the classroom, outlines the main features of the Van Hiele theory, and resume the main mathematical concepts associated with polyhedra. Using this framework, a sequence of activities is proposed and the applying of geometric concepts respecting the learning phases of Van Hiele, which aims deduction by the student, of the existence of only five regular polyhedra. After execution of the proposed activities, the proof of theorems related to polyhedra presented in this paper will serve to systematize the conclusions made by the students, always respecting the level of Van Hiele who are. It presents further exploration of the characteristics of polyhedra by Euler's theorem for convex polyhedra / Mestre

Zhang, Hai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 106-109). / Abstract also in Chinese. / Chapter 1 --- Introduction --- p.5 / Chapter 2 --- Preliminaries --- p.13 / Chapter 2.1 --- Maxwell equations --- p.13 / Chapter 2.2 --- Reflection principle --- p.15 / Chapter 3 --- Scattering by General Polyhedral Obstacle --- p.19 / Chapter 3.1 --- Direct problem --- p.19 / Chapter 3.2 --- Inverse problem and statement of main results --- p.21 / Chapter 3.3 --- Proof of the main results --- p.22 / Chapter 3.3.1 --- Preliminaries --- p.23 / Chapter 3.3.2 --- Properties of perfect planes --- p.24 / Chapter 3.3.3 --- Proofs --- p.33 / Chapter 4 --- Scattering by Bi-periodic Polyhedral Grating (I) --- p.35 / Chapter 4.1 --- Direct problem --- p.36 / Chapter 4.2 --- Inverse problem and statement of main results --- p.38 / Chapter 4.3 --- Preliminaries --- p.39 / Chapter 4.4 --- Classification of unidentifiable periodic structures --- p.41 / Chapter 4.4.1 --- Observations and auxiliary tools --- p.41 / Chapter 4.4.2 --- First class of unidentifiable gratings --- p.45 / Chapter 4.4.3 --- Preparation for finding other classes of unidentifiable gratings --- p.47 / Chapter 4.4.4 --- A simple transformation --- p.52 / Chapter 4.4.5 --- Second class of unidentifiable gratings --- p.53 / Chapter 4.4.6 --- Third class of unidentifiable gratings --- p.58 / Chapter 4.4.7 --- Excluding the case with L --- p.61 / Chapter 4.4.8 --- Summary on all unidentifiable gratings --- p.65 / Chapter 4.5 --- Proof of Main results --- p.65 / Chapter 5 --- Scattering by Bi-periodic Polyhedral Grating (II) --- p.69 / Chapter 5.1 --- Preliminaries --- p.70 / Chapter 5.2 --- Classification of unidentifiable periodic structures --- p.72 / Chapter 5.2.1 --- First class of unidentifiable gratings --- p.72 / Chapter 5.2.2 --- Preparation for finding other classes of unidentifiable gratings --- p.73 / Chapter 5.2.3 --- Studying of the case L --- p.76 / Chapter 5.2.4 --- Study of the case with L --- p.89 / Chapter 5.2.5 --- Study of the case with L --- p.95 / Chapter 5.2.6 --- Summary on all unidentifiable gratings --- p.104 / Chapter 5.3 --- Unique determination of bi-periodic polyhedral grating --- p.104 / Bibliography --- p.106

A polyhedron P is a subset of a rational vector space V bounded by hyperplanes. If we fix a lattice in V , then we may consider the exponential integral and sum, two meromorphic functions on the dual vector space which serve to generalize the notion of volume of and number of lattice points contained in P, respectively. In 2007, Berline and Vergne constructed an Euler-Maclaurin formula that relates the exponential sum of a given polyhedron to the exponential integral of each face. This formula was "local", meaning that the coefficients in this formula had certain properties independent of the given polyhedron. In this dissertation, the author finds a new construction for this formula which is very different from that of Berline and Vergne. We may 'perturb' any polyhedron by tranlsating its bounding hyperplanes. The author defines a ring of differential operators R(P) on the exponential volume of the perturbed polyhedron. This definition is inspired by methods in the theory of toric varieties, although no knowledge of toric varieties is necessary to understand the construction or the resulting Euler-Maclaurin formula. Each polyhedron corresponds to a toric variety, and there is a dictionary between combinatorial properties of the polyhedron and algebro-geometric properties of this variety. In particular, the equivariant cohomology ring and the group of equivariant algebraic cycles on the corresponding toric variety are equal to a quotient ring and subgroup of R(P), respectively. Given an inner product (or, more generally, a complement map) on V , there is a canonical section of the equivariant cohomology ring into the group of algebraic cycles. One can use the image under this section of a particular differential operator called the Todd class to define the Euler-Maclaurin formula. The author shows that this formula satisfies the same properties which characterize the Berline-Vergne formula.

In this paper we establish the existence and partial regularity of a (d-2)-dimensional edge-length minimizing polyhedron in [Special characters omitted.] . The minimizer is a generalized convex polytope of volume one which is the limit of a minimizing sequence of polytopes converging in the Hausdorff metric. We show that the (d-2)-dimensional edge-length ζ d -2 is lower-semicontinuous under this sequential convergence. Here the edge set of the limit generalized polytope is a closed subset of the boundary whose complement in the boundary consists of countably many relatively open planar regions.

Polyhedra are geometric representations of linear systems of equations and inequalities. Since polyhedra are used to represent the iteration domains of nested loop programs, procedures for operating on polyhedra can be used for doing loop transformations and other program restructuring transformations which are needed in parallelizing compilers. Thus a need for a library of polyhedral operations has recently been recognized in the parallelizing compiler community. Polyhedra are also used in the definition of domains of variables in systems of affine recurrence equations (SARE). ALPHA is a language which is based on the SARE formalism in which all variables are declared over polyhedral domains consisting of finite unions of polyhedra. This thesis describes a library of polyhedral functions which was developed to support the ALPHA langauge environment, and which is general enough to satisfy the needs of researchers doing parallelizing compilers. This thesis describes the data structures used to represent domains, gives the motivations for the major design decisions that were made in creating the library, and presents the algorithms used for doing polyhedral operations. A new algorithm for recursively generating the face lattice of a polyhedron is also presented. This library has been written and tested, and has be in use since the first quarter of 1993. It is used by research facilities in Europe and Canada which do research in parallelizing compilers and systolic array synthesis. The library is freely distributed by ftp. / Graduation date: 1994

In this thesis, we study foldings of orthogonal polygons into orthogonal polyhedra. The particular problem examined here is whether a paper cutout of an orthogonal polygon with fold lines indicated folds up into a simple orthogonal polyhedron. The folds are orthogonal and the direction of the fold (upward or downward) is also given. We present a polynomial time algorithm to solve this problem. Next we consider the same problem with the exception that the direction of the folds are not given. We prove that this problem is NP-complete. Once it has been determined that a polygon does fold into a polyhedron, we consider some restrictions on the actual folding process, modelling the case when the polyhedron is constructed from a stiff material such as sheet metal. We show an example of a polygon that cannot be folded into a polyhedron if folds can only be executed one at a time. Removing this restriction, we show another polygon that cannot be folded into a polyhedron using rigid material.

Two types of problems are studied in this thesis: reconstruction and visualization of polygons and polyhedra. <br /><br /> Three problems are considered in reconstruction of polygons and polyhedra, given a set of projection characteristics. The first problem is to reconstruct a closed convex polygon (polyhedron) given the number of visible edges (faces) from each of a set of directions <em>S</em>. The main results for this problem include the necessary and sufficient conditions for the existence of a polygon that realizes the projections. This characterization gives an algorithm to construct a feasible polygon when it exists. The other main result is an algorithm to find the maximum and minimum size of a feasible polygon for the given set <em>S</em>. Some special cases for non-convex polygons and for perspective projections are also studied. <br /><br /> For reconstruction of polyhedra, it is shown that when the projection directions are co-planar, a feasible polyhedron (i. e. a polyhedron satisfying the projection properties) can be constructed from a feasible polygon and vice versa. When the directions are covered by two planes, if the number of visible faces from each of the directions is at least four, then an algorithm is presented to decide the existence of a feasible polyhedron and to construct one, when it exists. When the directions see arbitrary number of faces, the same algorithm works, except for a particular sub-case. <br /><br /> A polyhedron is, in general, called equiprojective, if from any direction the size of the projection or the projection boundary is fixed, where the "size" means the number of vertices, edge, or faces. A special problem on reconstruction of polyhedra is to find all equiprojective polyhedra. For the case when the size is the number of vertices in the projection boundary, main results include the characterization of all equiprojective polyhedra and an algorithm to recognize them, and finding the minimum equiprojective polyhedra. Other measures of equiprojectivity are also studied. <br /><br /> Finally, the problem of efficient visualization of polyhedra under given constraints is considered. A user might wish to find a projection that highlights certain properties of a polyhedron. In particular, the problem considered is given a set of vertices, edges, and/or faces of a convex polyhedron, how to determine all projections of the polyhedron such that the elements of the given set are on the projection boundary. The results include efficient algorithms for both perspective and orthogonal projections, and improved adaptive algorithm when only edges are given and they form disjoint paths. A related problem of finding all projections where the given edges, faces, and/or vertices are not on the projection boundary is also studied.

Here, we present the program QContacts, which implements Voronoi polyhedra to determine atomic and residue contacts across the interface of a protein-protein interaction. While QContacts also describes hydrogen bonds, ionic pair and salt bridge interactions, we focus on QContacts’ identification of atomic contacts in a protein interface compared against the current methods. Initially, we investigated in detail the differences between QContacts, radial cutoff and Change in Solvent Accessible Surface Area (delta-SASA) methods in identifying pair-wise contacts across the binding interface. The results were assessed based on a set of 71 double cycle mutants. QContacts excelled at identifying knob-in-hole contacts. QContacts, closest atom radial cutoff and the delta-SASA methods performed well at picking out direct contacts; however, QContacts was the most accurate in excluding false positives. The significance of the differences identified between QContacts and previous methods was assessed using pair-wise contact frequencies in a broader set of 592 protein interfaces. The inaccuracies introduced by commonly used radial cutoff methods were found to produce misleading bias in the residue frequencies. This bias could compromise pair-wise potentials that are based on such frequencies. Here we show that QContacts provides a more accurate description of protein interfaces at atomic resolution than other currently available methods. QContacts is available in a web-based form at http://tsailab.tamu.edu/qcons (Fischer et al., 2006).

This dissertation provides the first known examples of finite co-volume Kleinian groups which have co- final towers of finite index subgroups with positive rank gradient. We prove that if the fundamental group of an orientable finite volume hyperbolic 3-manifold has fi nite index in the reflection group of a right-angled ideal polyhedron in H^3 then it has a co-fi nal tower of fi nite sheeted covers with positive rank gradient. The manifolds we provide are also known to have co- final towers of covers with zero rank gradient. We also prove that the reflection groups of compact right-angled hyperbolic polyhedra satisfying mild conditions have co-fi nal towers of fi nite sheeted covers with positive rank gradient. / text