Finiteness theorems for matroid complexes with prescribed topology

It is known that there are finitely many simplicial complexes (up to isomorphism) with a given number of vertices. Translating to the language of $h$-vectors, there are finitely many simplicial complexes of bounded dimension with $h_1=k$ for any natural number $k$. In this paper we study the question at the other end of the $h$-vector: Are there only finitely many $(d-1)$-dimensional simplicial complexes with $h_d=k$ for any given $k$? The answer is no if we consider general complexes, but when focus on three cases coming from matroids: (i) independence complexes, (ii) broken circuit complexes, and (iii) order complexes of geometric lattices. We prove the answer is yes in cases (i) and (iii) and conjecture it is also true in case (ii).Comment: to appear in European Journal of Combinatoric

Lexicographic shellability, matroids and pure order ideals

In 1977 Stanley conjectured that the $h$-vector of a matroid independence complex is a pure $O$-sequence. In this paper we use lexicographic shellability for matroids to motivate a combinatorial strengthening of Stanley's conjecture. This suggests that a pure $O$-sequence can be constructed from combinatorial data arising from the shelling. We then prove that our conjecture holds for matroids of rank at most four, settling the rank four case of Stanley's conjecture. In general, we prove that if our conjecture holds for all rank $d$ matroids on at most $2d$ elements, then it holds for all matroids

Cabri's role in the task of proving within the activity of building part of an axiomatic system

We want to show how we use the software Cabri, in a Geometry class for preservice mathematics teachers, in the process of building part of an axiomatic system of Euclidean Geometry. We will illustrate the type of tasks that engage students to discover the relationship between the steps of a geometric construction and the steps of a formal justification of the related geometric fact to understand the logical development of a proof; understand dependency relationships between properties; generate ideas that can be useful for a proof; produce conjectures that correspond to theorems of the system; and participate in the deductive organization of a set of statements obtained as solution to open-ended problems

The topology of the external activity complex of a matroid

We prove that the external activity complex $\textrm{Act}_<(M)$ of a matroid is shellable. In fact, we show that every linear extension of LasVergnas's external/internal order $<_{ext/int}$ on $M$ provides a shelling of $\textrm{Act}_<(M)$. We also show that every linear extension of LasVergnas's internal order $<_{int}$ on $M$ provides a shelling of the independence complex $IN(M)$. As a corollary, $\textrm{Act}_<(M)$ and $M$ have the same $h$-vector. We prove that, after removing its cone points, the external activity complex is contractible if $M$ contains $U_{3,1}$ as a minor, and a sphere otherwise.Comment: Comments are welcom

Ressenyes bibliogràfiques

Index de les obres ressenyades: A. RECIO ANDREU, Capitalisme y formas de contratación labora

Assigning mathematics tasks versus providing pre-fabricated mathematics in order to support learning to prove

We present types of mathematics tasks that we propose to our students —future high school mathematics teachers— in a geometry course whose objective is learning to prove and whose enterprise is collectively building an axiomatic system for a portion of plane geometry. We pursue the achievement of the course objective by involving students in different types of tasks instead of providing them with pre-fabricated mathematics