Submitted by Clebson Anjos (clebson.leandro54@gmail.com) on 2015-05-18T18:12:57Z No. of bitstreams: 1 arquivototal.pdf: 13930019 bytes, checksum: d5e52fb67904848f89fafaf5ec93c06d (MD5) / Approved for entry into archive by Clebson Anjos (clebson.leandro54@gmail.com) on 2015-05-18T18:15:19Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 13930019 bytes, checksum: d5e52fb67904848f89fafaf5ec93c06d (MD5) / Made available in DSpace on 2015-05-18T18:15:19Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 13930019 bytes, checksum: d5e52fb67904848f89fafaf5ec93c06d (MD5) Previous issue date: 2013-09-24 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / This dissertation is focused on the Euler's theorem for polyhedra homeomorphic to the sphere. Present statements made by Cauchy, Poincaré and Legendre. As a consequence we show that there are only ve regular convex polyhedra, called polyhedra Plato. / Esta dissertação tem como tema central o Teorema de Euler para poliedros homeomorfos à esfera. Apresentamos demonstrações feitas por Cauchy, Poincaré e Legendre. Como consequência mostramos a existência de apenas cinco poliedros convexos regulares, os chamados poliedros de Platão.

La géométrie algébrique réelle est dans sa définition la plus simple, l'étude des ensembles de solutions d'un système d'équations polynomiales à coefficients réelles. Dans cette vaste thématique, on se concentre sur les intersections de quadriques où déjà le cas de trois quadriques reste largement ouvert. Notre sujet peut être résumé comme l'étude topologique des variétés algébriques réelles et l'interaction entre leur topologie d'une part et leur déformations et dégénérations d'autre part, un problème issu du 16ième problème de Hilbert et enrichi par des développements récents. Au cours de cette thèse, nous allons nous focaliser sur les intersections maximales de quadriques réelles et en particulier démonter l'existence de telles intersections en utilisant des développements issus des recherches effectuées depuis la fin des années 80. Dans le cas d'intersections de trois quadriques, nous allons mettre en évidence le lien très étroits entre ces intersections d'une part et les courbes planes d'autre part, et démontrer que l'étude des M-courbes (une des problématiques du 16ième problème de Hilbert) peut se faire à travers l'étude des intersections maximales. Nous utiliserons ensuite les résultats sur les courbes planes nodales afin de déterminer dans certains cas les classes de déformations d'intersections de trois quadriques réelles. / Real algebraic geometry is in its simplest definition, the study of sets of solutions of a system of polynomial equations with real coefficients. In this theme, we focus on the intersections of quadrics where already the case of three quadrics remains wide open. Our subject can be summarized as the topological study of real algebraic varieties and interaction between their topology on the one hand and their deformations and degenerations on the other hand, a problem coming from the 16th Hilbert problem and enriched by recent developments. In this thesis, we will focus on maximum intersections of real quadrics and particularly prove the existence of such intersections using research developments made since the late 80. In the case of intersections of three quadrics, we will point the very close link between the intersections on the one hand and on the other plane curves, and show that the study of M-curves (one of the problems of the 16th Hilbert problem) may be done through the study of maximum intersections. Next, we will use the study on nodal plane curves to determine in some cases deformation classes of intersections of three real quadrics.

En utilisant le concept des fonctions de partition , nous étudions le comportement asymptotique des nombres de Betti gradués des puissances d’idéaux homogènes dans un polynôme sur un corp.Pour un Z-graduer positif, notre résultat principal affirme que les nombres de Betti des puissances est codé par un nombre fini des polynômes. Plus précisément, Z^2 peut être divisé en un nombre fini des régions telles que, dans chacun d’eux, dimk Tor^{S}_{i} (I^t,k)μ est un quasi-polynôme en (μ,t). Ce affine, dans une situation graduée, le résultat de Kodiyalam sur nombres de Betti des puissances dans [33].La déclaration principale traite le cas des produits des puissances d’idéaux homogènes dans un algèbre Z^d -graduée , pour un graduer positif, dans le sens de [37] et il est généralise également pour les filtrations I -good.Dans la deuxième partie, en utilisant la version paramétrique de l’algorithme de Barvinok, nous donnons une formule fermée pour les fonctions de Hilbert non-standard d’anneaux de polynômes, en petites dimensions. / Using the concept of vector partition functions, we investigate the asymptotic behavior of graded Betti numbers of powers of homogeneous ideals in a polynomial ring over a field. For a positive Z-grading, our main result states that the Betti numbers of powers is encoded by finitely many polynomials. More precisely, Z^2 can be splitted into a finite number of regions such that, in each of them, dim_k Tor^{S}_{i} (I^t,k)μ is a quasi-polynomial in (μ,t). This refines, in a graded situation, the result of Kodiyalam on Betti numbers of powers in [33]. The main statement treats the case of a power products of homogeneous ideals in a Z^d -graded algebra, for a positive grading, in the sense of [37] and it is also generalizes to I -good filtrations . In the second part , using the parametric version of Barvinok’s algorithm, we give a closed formula for non-standard Hilbert functions of polynomial rings, in low dimensions.

<p>Studying properties of random polynomials has marked a shift in algebraic geometry. Instead of worst-case analysis, which often leads to overly pessimistic perspectives, randomness helps perform average-case analysis, and thus obtain a more realistic view. Also, via Erdos' astonishing 'probabilistic method', one can potentially obtain deterministic results by introducing randomness into a question that apriori had nothing to do with randomness. </p> <p><br></p> <p>In this thesis, we study topological questions in real algebraic geometry, o-minimal geometry and random algebraic geometry, with motivation from incidence combinatorics. Specifically, we prove results along two different threads:</p> <p><br></p> <p>1. Topology of semi-algebraic and definable (over any o-minimal structure over R) sets, in both deterministic and random settings.</p><p>2. Topology of random hypersurface arrangements. In this case, we also prove a result that could be of independent interest in random graph theory.</p> <p><br></p> <p>Towards the first thread, motivated by applications in o-minimal incidence combinatorics, we prove bounds (both deterministic and random) on the topological complexity (as measured by the Betti numbers) of general definable hypersurfaces restricted to algebraic sets. Given any sequence of hypersurfaces, we show that there exists a definable hypersurface G, and a sequence of polynomials, such that each manifold in the sequence of hypersurfaces appears as a component of G restricted to the zero set of some polynomial in the sequence of polynomials. This shows that the topology of the intersection of a definable hypersurface and an algebraic set can be made <i>arbitrarily pathological</i>. On the other hand, we show that for random polynomials, the Betti numbers of the restriction of the zero set of a random polynomial to any definable set deviates from a Bezout-type bound with <i>bounded probability</i>.</p> <p><br></p> <p>Progress in o-minimal incidence combinatorics has lagged behind the developments in incidence combinatorics in the algebraic case due to the absence of an o-minimal version of the Guth-Katz <i>polynomial partitioning</i> theorem, and the first part of our work explains why this is so difficult. However, our average result shows that if we can prove that the measure of the set of polynomials which satisfy a certain property necessary for polynomial partitioning is suitably bounded from below, by the <i>probabilistic method</i>, we get an o-minimal polynomial partitioning theorem. This would be a tremendous breakthrough and would enable progress on multiple fronts in model theoretic combinatorics. </p> <p><br></p> <p>Along the second thread, we have studied the average Betti numbers of <i>random hypersurface arrangements</i>. Specifically, we study how the average Betti numbers of a finite arrangement of random hypersurfaces grows in terms of the degrees of the polynomials in the arrangement, as well as the number of polynomials. This is proved using a random Mayer-Vietoris spectral sequence argument. We supplement this result with a better bound on the average Betti numbers when one considers an <i>arrangement of quadrics</i>. This question turns out to be equivalent to studying the expected number of connected components of a certain <i>random graph model</i>, which has not been studied before, and thus could be of independent interest. While our motivation once again was incidence combinatorics, we obtained the first bounds on the topology of arrangements of random hypersurfaces, with an unexpected bonus of a result in random graphs.</p>

We generalize Forman’s discrete Morse theory, on one end by developing a discrete analogue of Morse-Bott theory for CW complexes, motivated by Morse-Bott theory in the smooth setting. On the other, motivated by J-N. Corvellec’s Morse theory for continuous functionals, we generalize Forman’s discrete Morse-floer theory by considering a vector field more general than the one extracted from a discrete Morse function, and defining a boundary operator from which the Betti numbers of the CW complex are obtained. We also do some Conley theory analysis.

In this thesis, we will work with the nodal sets of Laplace eigenfunctions on a few simple manifolds, like the sphere and the flat torus. We will obtain bounds on the total Betti number of the nodal set that depend on the corresponding eigenvalue. Our work generalize Courant's theorem. / Dans ce mémoire, nous travaillons sur les ensembles nodaux de combinaisons de fonctions propres du laplacien, particulièrement sur la sphère et le tore plat. On bornera les nombres de Betti de ces ensembles en fonction de la valeur propre maximale. D'une certaine façon, cela généralise le fameux théorème de Courant.

Since the early 1990s, a classical object in commutative algebra has been the study of binomial ideals. A widely-investigated class of binomial ideals is the one containing those generated by a subset of 2-minors of an (m x n)-matrix of indeterminates. This thesis is devoted to illustrate some algebraic and homological properties of two classes of ideals of 2-minors: binomial edge ideals and polyomino ideals. Binomial edge ideals arise from finite graphs and their appeal results from the fact that their homological properties reflect nicely the combinatorics of the underlying graph. First, we focus on the binomial edge ideals of block graphs. We give a lower bound for their Castelnuovo-Mumford regularity by computing the two distinguished extremal Betti numbers of a new family of block graphs, called flower graphs. Moreover, we present a linear time algorithm to compute Castelnuovo-Mumford regularity and Krull dimension of binomial edge ideals of block graphs. Secondly, we consider some classes of Cohen-Macaulay binomial edge ideals. We provide the regularity and the Cohen-Macaulay type of binomial edge ideals of Cohen-Macaulay cones, and we show the extremal Betti numbers of Cohen-Macaulay bipartite and fan graphs. In addition, we compute the Hilbert-Poincaré series of the binomial edge ideals of some Cohen-Macaulay bipartite graphs. Polyomino ideals arise from polyominoes, plane figures formed by joining one or more equal squares edge to edge. It is known that the polyomino ideal of simple polyominoes is prime. We consider multiply connected polyominoes, namely polyominoes with holes, and observe that the non-existence of a certain sequence of inner intervals of the polyomino, called zig-zag walk, gives a necessary condition for the primality of the polyomino ideal. Moreover, by computational approach, we prove that for all polyominoes with rank less than or equal to 14 the above condition is also sufficient. Lastly, we present an infinite class of prime polyomino ideals.

A complexidade de um módulo M, sobre uma álgebra de dimensão finita R, é a medida do crescimento da dimensão de suas sizigias. No nosso trabalho, estudamos esse conceito, nos concentrando muito mais no caso das álgebras autoinjetiva. Relacionamos esse crescimento com o comportamento da componente do carcás de Auslander-Reiten, a qual o módulo M pertence. Em particular, estudamos, com bastante cuidado, o caso em que a complexidade é 1, o que significa que a dimensão das sizigias são eventualmente constante. Surpreendentemente, o comportamento de todos os módulos numa mesma componente é muito parecido. / The complexity of a module M under a finite dimensional algebra R is the measure of the growth of its syzygies\' dimension. In our work, we study this concept concentrating on the case of the selfinjective algebras. We relate this growth with the behavior of the Auslander-Reiten component containing this module. In particular, we study, carefully, the case in which the complexity is 1. Surprisingly, the behavior of every module in the same component as M is very similar.

Recently computational topology had an important development in data analysis giving birth to the field of Topological Data Analysis. Persistent homology appears as a fundamental tool based on the topology of data that can be represented as points in metric space. In this work, we apply techniques of Topological Data Analysis, more precisely, we use persistent homology to calculate topological features more persistent in data. In this sense, the persistence diagrams are processed as feature vectors for applying Machine Learning algorithms. In order to classification, we used the following classifiers: Partial Least Squares-Discriminant Analysis, Support Vector Machine, and Naive Bayes. For regression, we used Support Vector Regression and KNeighbors. Finally, we will give a certain statistical approach to analyze the accuracy of each classifier and regressor. / Recentemente a topologia computacional teve um importante desenvolvimento na análise de dados dando origem ao campo da Análise Topológica de Dados. A homologia persistente aparece como uma ferramenta fundamental baseada na topologia de dados que possam ser representados como pontos num espaço métrico. Neste trabalho, aplicamos técnicas da Análise Topológica de Dados, mais precisamente, usamos homologia persistente para calcular características topológicas mais persistentes em dados. Nesse sentido, os diagramas de persistencia são processados como vetores de características para posteriormente aplicar algoritmos de Aprendizado de Máquina. Para classificação, foram utilizados os seguintes classificadores: Análise de Discriminantes de Minimos Quadrados Parciais, Máquina de Vetores de Suporte, e Naive Bayes. Para a regressão, usamos a Regressão de Vetores de Suporte e KNeighbors. Finalmente, daremos uma certa abordagem estatística para analisar a precisão de cada classificador e regressor.

A complexidade de um módulo M, sobre uma álgebra de dimensão finita R, é a medida do crescimento da dimensão de suas sizigias. No nosso trabalho, estudamos esse conceito, nos concentrando muito mais no caso das álgebras autoinjetiva. Relacionamos esse crescimento com o comportamento da componente do carcás de Auslander-Reiten, a qual o módulo M pertence. Em particular, estudamos, com bastante cuidado, o caso em que a complexidade é 1, o que significa que a dimensão das sizigias são eventualmente constante. Surpreendentemente, o comportamento de todos os módulos numa mesma componente é muito parecido. / The complexity of a module M under a finite dimensional algebra R is the measure of the growth of its syzygies\' dimension. In our work, we study this concept concentrating on the case of the selfinjective algebras. We relate this growth with the behavior of the Auslander-Reiten component containing this module. In particular, we study, carefully, the case in which the complexity is 1. Surprisingly, the behavior of every module in the same component as M is very similar.