Related papers: Subdivision of complexes of k-Trees

We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…

The classical matrix-tree theorem discovered by G.Kirchhoff in 1847 relates the principal minor of the nxn Laplace matrix to a particular sum of monomials of matrix elements indexed by directed trees with n vertices and a single sink. In…

There are two natural simplicial complexes associated to the noncrossing partition lattice: the order complex of the full lattice and the order complex of the lattice with its bounding elements removed. The latter is a complex that we call…

We completely determine all lower-modular elements of the lattice of all semigroup varieties. As a corollary, we show that a lower-modular element of this lattice is modular.

We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…

The theme of the first two sections, is to prepare the framework of how from a "complicated" family of index models I in K_1 we build many and/or complicated structures in a class K_2. The index models are characteristically linear orders,…

We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…

Let $A$ be a finite-dimensional algebra with two simple modules. It is shown that if the derived category of $A$ admits a stratification with simple factors being the base field $k$, then $A$ is derived equivalent to a quasi-hereditary…

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…

We show a general result known as the Erdos_Sos Conjecture: if $E(G)>{1/2}(k-1)n$ where $G$ has order $n$ then $G$ contains every tree of order $k+1$ as a subgraph.

A k-dimensional hypertree X is a k-dimensional complex on n vertices with a full (k-1)-dimensional skeleton and \binom{n-1}{k} facets such that H_k(X;Q)=0. Here we introduce the following family of simplicial complexes. Let n,k be integers…

We determine the order of magnitude of H^{(k+1)}(x,\vec{y},2\vec{y}), the number of integers up to x that are divisible by a product d_1...d_k with y_i<d_i\le 2y_i, when the numbers \log y_1,...,\log y_k have the same order of magnitude and…

Solving a decades-old problem we show that Keisler's 1967 order on theories has the maximum number of classes. The theories we build are simple unstable with no nontrivial forking, and reflect growth rates of sequences which may be thought…

We consider the ring $\mathbb Z_n$ (integers modulo $n$) with the partial order `$\leq$' given by `$a \leq b$ if either $a=b$ or $a\equiv ab~(mod~n)$'. In this paper, we obtain necessary and sufficient conditions for the poset ($\mathbb…

Let $\mathcal F(r, d)$ denote the moduli space of algebraic foliations of codimension one and degree $d$ in complex proyective space of dimension $r$. We show that $\mathcal F(r, d)$ may be represented as a certain linear section of a…

We explain the construction of minimal tilting complexes for objects of highest weight categories and we study in detail the minimal tilting complexes for standard objects and simple objects. For certain categories of representations of…

We introduce decomposition complexes of posets, which generalize order complexes. The main advantage of our construction is that decomposition complexes are closed under taking products. Other special instances of this theory include nested…

For the affine Hecke algebra of type A at roots of unity, we make explicit the correspondence between geometrically constructed simple modules and combinatorially constructed simple modules and prove the modular branching rule. The latter…

For the affine Hecke algebra of type A at roots of unity, we make explicit the correspondence between geometrically constructed simple modules and combinatorially constructed simple modules and prove the modular branching rule. The latter…

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…