Semi-tilting complexes

We introduce the notion of semi-tilting complexes, which is a small generalization of tilting complexes. Interesting examples include APR-semitilting complexes, etc. Note that non-trivial semi-tilting complexes exist for any non-semisimple non-local artin algebras, while tilting complexes may not. We extend interesting results in the tilting theory to semi-tilting complexes. As corollaries, we also obtain some new characterizations of tilting complexes.     

Balanced complexes and complexes without large missing faces

The face numbers of simplicial complexes without missing faces of dimension larger than i are studied. It is shown that among all such (d−1)-dimensional complexes with non-vanishing top homology, a certain polytopal sphere has the componentwise minimal f-vector; and moreover, among all such 2-Cohen–Macaulay (2-CM) complexes, the same sphere has the componentwise minimal h-vector. It is also verified that the l-skeleton of a flag (d−1)-dimensional 2-CM complex is 2(d−l)-CM, while the l-skeleton of a flag piecewise linear (d−1)-sphere is 2(d−l)-homotopy CM. In addition, tight lower bounds on the face numbers of 2-CM balanced complexes in terms of their dimension and the number of vertices are established.     

Wakamatsu-silting complexes

We introduce Wakamatsu-silting complexes (resp., Wakamatsu-tilting complexes) as a common generalization of both silting complexes (resp., tilting complexes) and Wakamatsu-tilting modules. Characterizations of Wakamatsu-silting complexes are given. In particular, we show that a complex T is Wakamatsu-silting if and only if its dual DT is Wakamatsu-silting. It is conjectured that compact Wakamatsu-silting complexes are just silting complexes. We prove that the conjecture lies under the finitistic dimension conjecture.     

Tableau complexes

Let X, Y be finite sets and T a set of functions X → Y which we will call “ tableaux”. We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such tableau complexes have many nice properties, and are frequently homeomorphic to balls, which we prove using vertex decompositions [BP79]. In our motivating example, the facets are labeled by semistandard Young tableaux, and the more general interior faces are labeled by Buch’s set-valued semistandard tableaux. One vertex decomposition of this “Young tableau complex” parallels Lascoux’s transition formula for vexillary double Grothendieck polynomials [La01, La03]. Consequently, we obtain formulae (both old and new) for these polynomials. In particular, we present a common generalization of the formulae of Wachs [Wa85] and Buch [Bu02], each of which implies the classical tableau formula for Schur polynomials.     

Threshold graphs, shifted complexes, and graphical complexes

We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the independent set, neighborhood, and dominance complexes. We present a number of structural results and relations among them including new characterizations of the class of threshold graphs.     

Subword complexes, cluster complexes, and generalized multi-associahedra

In this paper, we use subword complexes to provide a uniform approach to finite-type cluster complexes and multi-associahedra. We introduce, for any finite Coxeter group and any nonnegative integer k, a spherical subword complex called multi-cluster complex. For k=1, we show that this subword complex is isomorphic to the cluster complex of the given type. We show that multi-cluster complexes of types A and B coincide with known simplicial complexes, namely with the simplicial complexes of multi-triangulations and centrally symmetric multi-triangulations, respectively. Furthermore, we show that the multi-cluster complex is universal in the sense that every spherical subword complex can be realized as a link of a face of the multi-cluster complex.     

Buchsbaum* complexes

A class of finite simplicial complexes, which we call Buchsbaum* over a field, is introduced. Buchsbaum* complexes generalize triangulations of orientable homology manifolds as well as doubly Cohen-Macaulay complexes. By definition, the Buchsbaum* property depends only on the geometric realization and the field. Characterizations in terms of simplicial homology are given. It is proved that Buchsbaum* complexes are doubly Buchsbaum. Various constructions, among them one which generalizes convex ear decompositions, are shown to yield Buchsbaum* simplicial complexes. Graph theoretic and enumerative properties of Buchsbaum* complexes are investigated.     

Glicci simplicial complexes

This note is a case study for the potential of liaison-theoretic methods to applications in Combinatorics. One of the main open questions in liaison theory is whether every homogeneous Cohen-Macaulay ideal in a polynomial ring is glicci, i.e. if it is in the G-liaison class of a complete intersection. We give an affirmative answer to this question for Stanley-Reisner ideals defined by simplicial complexes that are weakly vertex-decomposable. This class of complexes includes matroid, shifted and Gorenstein complexes respectively. Moreover, we construct a simplicial complex which shows that the property of being glicci depends on the characteristic of the base field. As an application of our methods we establish new evidence for two conjectures of Stanley on partitionable complexes and Stanley decompositions.     

Polytopal complexes: maps,chain complexes and… necklaces

The notion of polytopal map between two polytopal complexes is defined. This definition is quite simple and extends naturally those of simplicial and cubical maps. It is then possible to define an induced chain map between the associated chain complexes. One uses this new tool to give the first combinatorial proof of the splitting necklace theorem of Alon.     

Coxeter cochain complexes

We define the Coxeter cochain complex of a Coxeter group (G, S) with coefficients in a ?[G]-module A. This is closely related to the complex of simplicial cochains on the abstract simplicial complex I(S) of the commuting subsets of S. We give some representative computations of Coxeter cohomology and explain the connection between the Coxeter cohomology for groups of type A, the (singular) homology of certain configuration spaces, and the (Tor) homology of certain local Artin rings.     

Pre-balanced dualizing complexes

We study pre-balanced dualizing complexes over noncommutative complete semilocal algebras and prove an analogue of Van den Bergh’s theorem [VdB, 6.3]. The relationship between pre-balanced dualizing complexes and Morita dualities is studied. Some immediate applications to classical ring theory are also given.     

Simple homotopy types of Hom-complexes, neighborhood complexes, Lovász complexes, and atom crosscut complexes

In this paper we provide concrete combinatorial formal deformation algorithms, namely sequences of elementary collapses and expansions, which relate various previously extensively studied families of combinatorially defined polyhedral complexes.To start with, we give a sequence of elementary collapses leading from the barycentric subdivision of the neighborhood complex to the Lovász complex of a graph. Then, for an arbitrary lattice L we describe a formal deformation of the barycentric subdivision of the atom crosscut complex Γ(L) to its order complex . We proceed by proving that the complex of sets bounded from below J(L) can also be collapsed to .Finally, as a pinnacle of our project, we apply all these results to certain graph complexes. Namely, by describing an explicit formal deformation, we prove that, for any graph G, the neighborhood complex N(G) and the polyhedral complex Hom(K₂,G) have the same simple homotopy type in the sense of Whitehead.     

Chessboard complexes indomitable

We give a simpler, degree-theoretic proof of the striking new Tverberg type theorem of Blagojevi?, Ziegler and Matschke. Our method also yields some new examples of “constrained Tverberg theorems” including a simple colored Radon?s theorem for d+3 points in Rd. This gives us an opportunity to review some of the highlights of this beautiful theory and reexamine the role of chessboard complexes in these and related problems of topological combinatorics.     

Nested set complexes of Dowling lattices and complexes of Dowling trees

Given a finite group G and a natural number n, we study the structure of the complex of nested sets of the associated Dowling lattice (Proc. Internat. Sympos., 1971, pp. 101–115) and of its subposet of the G-symmetric partitions which was recently introduced by Hultman (, 2006), together with the complex of G-symmetric phylogenetic trees . Hultman shows that the complexes and are homotopy equivalent and Cohen–Macaulay, and determines the rank of their top homology. An application of the theory of building sets and nested set complexes by Feichtner and Kozlov (Selecta Math. (N.S.) 10, 37–60, 2004) shows that in fact is subdivided by the order complex of . We introduce the complex of Dowling trees and prove that it is subdivided by the order complex of . Application of a theorem of Feichtner and Sturmfels (Port. Math. (N.S.) 62, 437–468, 2005) shows that, as a simplicial complex, is in fact isomorphic to the Bergman complex of the associated Dowling geometry. Topologically, we prove that is obtained from by successive coning over certain subcomplexes. It is well known that is shellable, and of the same dimension as . We explicitly and independently calculate how many homology spheres are added in passing from to . Comparison with work of Gottlieb and Wachs (Adv. Appl. Math. 24(4), 301–336, 2000) shows that is intimely related to the representation theory of the top homology of . Research partially supported by the Swiss National Science Foundation, project PP002-106403/1.     

Coloring complexes and arrangements

Steingrimsson’s coloring complex and Jonsson’s unipolar complex are interpreted in terms of hyperplane arrangements. This viewpoint leads to short proofs that all coloring complexes and a large class of unipolar complexes have convex ear decompositions. These convex ear decompositions impose strong new restrictions on the chromatic polynomials of all finite graphs. Similar results are obtained for characteristic polynomials of submatroids of type ℬ _n arrangements. The first author was supported by NSF grant DMS-0500638. The second author was supported by NSF grant DMS-0245623.