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.

No description available.

No description available.

Ha Minh Lam et M. Morales ont introduit une classe d'idéaux binomiaux qui est une extension binomiale d'idéaux monomiaux libres de carrés.Étant donné I un idéal monomial quadratique de k[x] libre de carrés et J une somme d'idéaux de scroll de k[z] qui satisfont certaines conditions, nous définissons l'extension binomiale de I comme B=I+J. Le sujet de cette thèse est d'étudier le nombre p plus grand tel que les sizygies de B son linéaires jusqu'au pas p-1. Sous certaines conditions d'ordre imposées sur les facettes du complexe de Stanley-Reisner de I nous obtiendrons un ordre > pour les variables de l'anneau de polynomes k[z]. Ensuite nous prouvons pour un calcul des bases de Gröbner que l'idéal initial in(B), sous l'ordre lexicographique induit par l'ordre de variables >, est quadratique libre de carrés. Nous montrerons que B est régulier si et seulement si I est 2-régulier. Dans le cas géneral, lorsque I n'est pas 2-régulier nous trouverons une borne pour l'entier q maximal qui satisfait que les premier q-1 sizygies de B son linéaires. En outre, en supossant que J est un idéal torique et en imposant des conditions supplémentaires, nous trouveron une borne supérieure pour l'entier q maximal qui satisfait que les premier q-1 sizygies de B son linéaires. En imposant des conditions supplémentaires, nous prouverons que les deux bornes sont égaux.

This thesis is divided into two parts. The first part is concerned with the commutative algebra of certain combinatorial structures arising from uniform hypergraphs. The main focus lies on two particular classes of hypergraphs called chordal hypergraphs and complete hypergraphs, respectively. Both these classes arise naturally as generalizations of the corresponding well known classes of simple graphs. The classes of chordal and complete hypergraphs are introduced and studied in Chapter 2 and Chapter 3 respectively. Chapter 4, that is the content of \cite{E5}, answers a question posed at the P.R.A.G.MAT.I.C. summer school held in Catania, Italy, in 2008. In Chapter 5 we study hypergraph analogues of line graphs and cycle graphs. Chapter 6 is concerned with a connectedness notion for hypergraphs and in Chapter 7 we study a weak version of shellability.The second part is concerned with affine monoids and their monoid rings. Chapter 8 provide a combinatorial study of a class of positive affine monoids that behaves in some sense like numerical monoids. Chapter 9 is devoted to the class of numerical monoids of maximal embedding dimension. A combinatorial description of the graded Betti numbers of the corresponding monoid rings in terms of the minimal generators of the monoids is provided. Chapter 10 is concerned with monomial subrings generated by edge sets of complete hypergraphs.

<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.

If <i>E</i> is an exterior algebra on a finite dimensional vector space and <i>M</i> is a graded <i>E</i>-module, the relationship between the resonance varieties of <i>M</i> and the minimal free resolution of <i>M </i>is studied. In the context of Orlik–Solomon algebras, we give a condition under which elements of the second resonance variety can be obtained. We show that the resonance varieties of a general <i>M</i> are invariant under taking syzygy modules up to a shift. As corollary, it is shown that certain points in the resonance varieties of <i>M</i> can be determined from minimal syzygies of a special form, and we define syzygetic resonance varieties to be the subvarieties consisting of such points. The (depth one) syzygetic resonance varieties of a square-free module <i>M</i> over <i>E</i> are shown to be subspace arrangements whose components correspond to graded shifts in the minimal free resolution of <i>_SM</i>, the square-free module over a commutative polynomial ring <i>S </i>corresponding to <i>M</i>. Using this, a lower bound for the graded Betti numbers of the square-free module<i> M</i> is given. As another application, it is shown that the minimality of certain syzygies of Orlik–Solomon algebras yield linear subspaces of their (syzygetic) resonance varieties and lower bounds for their graded Betti numbers.

<p>This dissertation establishes limit theory for topological functionals of geometric complexes from a stochastic process viewpoint. Standard filtrations of geometric complexes, such as the Čech and Vietoris-Rips complexes, have a natural parameter <i>r </i>which governs the formation of simplices: this is the basis for persistent homology. However, the parameter <i>r</i> may also be considered the time parameter of an appropriate stochastic process which summarizes the evolution of the filtration.</p><p>Here we examine the stochastic behavior of two of the foremost classes of topological functionals of such filtrations: the Betti numbers and the Euler characteristic. There are also two distinct setups in which the points underlying the complexes are generated, where the points are distributed randomly in <i>R^d</i> according to a general density (the traditional setup) and where the points lie in the tail of a heavy-tailed or exponentially-decaying “noise” distribution (the extreme-value theory (EVT) setup).<br></p><p>These results constitute some of the first results combining topological data analysis (TDA) and stochastic process theory. The first collection of results establishes stochastic process limits for Betti numbers of Čech complexes of Poisson and binomial point processes for two specific regimes in the traditional setup: the sparse regime—when the parameter <i>r </i>governing the formation of simplices causes the Betti numbers to concentrate on components of the lowest order; and the critical regime—when the parameter <i>r</i> is of the order <i>n^-1/d</i> and the geometric complex becomes highly connected with topological holes of every dimension. The second collection of results establishes a functional strong law of large numbers and a functional central limit theorem for the Euler characteristic of a random geometric complex for the critical regime in the traditional setup. The final collection of results establishes functional strong laws of large numbers for geometric complexes in the EVT setup for the two classes of “noise” densities mentioned above.<br></p>

<p>This dissertation establishes a variety of limit theorems pertaining to rare events in stochastic topology, exploiting probabilistic methods to study simplicial complex models. We focus on the filtration of \vc ech complexes and examine the asymptotic behavior of two topological functionals: the Betti numbers and critical faces. The filtration involves a parameter rn>0 that determines the growth rate of underlying Cech complexes. If rn depends also on the time parameter t, the obtained limit theorems will be established in a functional sense.</p> <p>The first part of this dissertation is devoted to investigating the layered structure of topological complexity in the tail of a probability distribution. We establish the functional strong law of large numbers for Betti numbers, a basic quantifier of algebraic topology, of a geometric complex outside an open ball of radius Rn, such that Rn to infinity as the sample size n increases. The nature of the obtained law of large numbers is determined by the decay rate of a probability density. It especially depends on whether the tail of a density decays at a regularly varying rate or an exponentially decaying rate. The nature of the limit theorem depends also on how rapidly Rn diverges. In particular, if Rn diverges sufficiently slowly, the limiting function in the law of large numbers is crucially affected by the emergence of arbitrarily large connected components supporting topological cycles in the limit.</p> <p>The second part of this dissertation investigates convergence of point processes associated with critical faces for a Cech filtration built over a homogeneous Poisson point process in the d-dimensional flat torus. The convergence of our point process is established in terms of the  Mo-topology, when the connecting radius of a Cech complex decays to 0, so slowly that critical faces are even less likely to occur than those in the regime of threshold for homological connectivity. We also obtain a series of limit theorems for positive and negative critical faces, all of which are considerably analogous to those for critical faces.</p>