The diameter of associahedra

It is proven here that the diameter of the d  -dimensional associahedron is 2d−4$2d-4$ when d is greater than 9. Two maximally distant vertices of this polytope are explicitly described as triangulations of a convex polygon, and their distance is obtained using combinatorial arguments. This settles two problems posed about twenty-five years ago by Daniel Sleator, Robert Tarjan, and William Thurston.     

W-associahedra have the non-leaving-face property

We use a projection argument to uniformly prove that $W$-permutahedra and $W$-associahedra have the property that if $v,v^{\prime }$ are two vertices on the same face $f$, then any geodesic between $v$ and $v^{\prime }$ does not leave $f$. In type $A$, we show that our geometric projection recovers a slight modification of the combinatorial projection in Sleator et al. (1988).     

Permutahedra and generalized associahedra

Given a finite Coxeter system (W,S) and a Coxeter element c, or equivalently an orientation of the Coxeter graph of W, we construct a simple polytope whose outer normal fan is N. Reading's Cambrian fan Fc, settling a conjecture of Reading that this is possible. We call this polytope the c-generalized associahedron. Our approach generalizes Loday's realization of the associahedron (a type A c-generalized associahedron whose outer normal fan is not the cluster fan but a coarsening of the Coxeter fan arising from the Tamari lattice) to any finite Coxeter group. A crucial role in the construction is played by the c-singleton cones, the cones in the c-Cambrian fan which consist of a single maximal cone from the Coxeter fan.Moreover, if W is a Weyl group and the vertices of the permutahedron are chosen in a lattice associated to W, then we show that our realizations have integer coordinates in this lattice.     

Sublattices of associahedra and permutohedra

Grätzer asked in 1971 for a characterization of sublattices of Tamari lattices. A natural candidate was coined by McKenzie in 1972 with the notion of a bounded homomorphic image of a free lattice—in short, bounded lattice. Urquhart proved in 1978 that every Tamari lattice is bounded (thus so are its sublattices). Geyer conjectured in 1994 that every finite bounded lattice embeds into some Tamari lattice.     

A realization of graph associahedra

Given any finite graph, we offer a simple realization of its corresponding graph associahedron polytope using integer coordinates.     

The Rohlin property for shifts of finite type

We show that an automorphism of a unital AF C^*-algebra with a certain approximate Rohlin property has the Rohlin property. This generalizes a result of Kishimoto. Using this we show that the shift automorphism on the bilateral C^*-algebra associated with an aperiodic irreducible shift of finite type has the Rohlin property.     

T D property and spatial sublocales

As one of main backgrounds of locale theory, topologies have close connections with locales. But locales have other backgrounds such as algebra, mathematical logic, etc. So there are many differences between locales and topologies. Spatiality is an important localic property to investigate the connections between locales and topologies. TheT _D property is a special separation property which plays an important role in this kind of investigations. Just as it will be proved in this paper, theT _D property often appears as the lowest requirement for many topological spaces such that they can be described with localic properties and vice versa. In this paper, we show these special properties of theT _D axiom and investigate some other interesting and important problems ofT _D -spatiality of locales.Supported by the National Natural Science Foundation of China and the Science Foundation of the State Education Commision of China.Supported by the Fund for Excellent Young University Teachers of the State Educational Commission of China and theE _x -Oversea-Scholars Fund of the Educational Commission of China.     

Drinfeld algebra deformations, homotopy comodules and the associahedra

The aim of this work is to construct a cohomology theory controlling the deformations of a general Drinfel'd algebra and thus finish the program which began in [13], [14]. The task is accomplished in three steps. The first step, which was taken in the aforementioned articles, is the construction of a modified cobar complex adapted to a non-coassociative comultiplication. The following two steps each involves a new, highly non-trivial, construction. The first construction, essentially combinatorial, defines a differential graded Lie algebra structure on the simplicial chain complex of the associahedra. The second construction, of a more algebraic nature, is the definition of a map of differential graded Lie algebras from the complex defined above to the algebra of derivations on the bar resolution. Using the existence of this map and the acyclicity of the associahedra we can define a so-called homotopy comodule structure (Definition 3.3 below) on the bar resolution of a general Drinfel'd algebra. This in turn allows us to define the desired cohomology theory in terms of a complex which consists, roughly speaking, of the bimodule and bicomodule maps from the bar resolution to the modified cobar resolution. The complex is bigraded but not a bicomplex as in the Gerstenhaber-Schack theory for bialgebra deformations. The new components of the coboundary operator are defined via the constructions mentioned above. The results of the paper were announced in [12].

     

The noether property and the index of multidimensional convolutions with coefficients of fast oscillating type

Rostov-on-the-Don. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 31, No. 4, pp. 180–186, July–August, 1990.     

Arrangements of hyperplanes with property D

We denote by the complement of the complexification of a real arrangement of hyperplanes. It is known that there is a certain technical property, called property D, on real arrangements of hyperplanes such that: if a real arrangement of hyperplanes is simplicial then has property D, and if has property D then is aK(, 1) space. Our main goal is to prove that: if has property D then is simplicial. We also prove that a quasi-simplicial arrangement is always simplicial.     

Bend intersection property and dendroids of type N

It is proved that a dendroidX is not of typeN if and only if for each arc ofX, the intersection of all its bend sets is nonempty.     

The Reznichenko property and the Pytkeev property in hyperspaces

Summary We investigate two closure-type properties, the Reznichenko property and the Pytkeev property, in hyperspace topologies.     

Iterated function systems of finite type and the weak separation property

We prove that any iterated function system of finite type possesses the weak separation property.

     

The strong approximation property and the weak bounded approximation property

We show that the strong approximation property (strong AP) (respectively, strong CAP) and the weak bounded approximation property (respectively, weak BCAP) are equivalent for every Banach space. This gives a negative answer to Oja's conjecture. As a consequence, we show that each of the spaces _c0$c_0$ and _?1${?}_1$ has a subspace which has the AP but fails to have the strong AP.     

The diameter game

A large class of Positional Games are defined on the complete graph on n vertices. The players, Maker and Breaker, take the edges of the graph in turns, and Maker wins iff his subgraph has a given — usually monotone — property. Here we introduce the d‐diameter game, which means that Maker wins iff the diameter of his subgraph is at most d. We investigate the biased version of the game; i.e., when the players may take more than one, and not necessarily the same number of edges, in a turn. Our main result is that we proved that the 2‐diameter game has the following surprising property: Breaker wins the game in which each player chooses one edge per turn, but Maker wins as long as he is permitted to choose 2 edges in each turn whereas Breaker can choose as many as (1/9)n^1/8/(lnn)^3/8. In addition, we investigate d‐diameter games for d ≥ 3. The diameter games are strongly related to the degree games. Thus, we also provide a generalization of the fair degree game for the biased case. © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009     

The diameter of the acyclic Birkhoff polytope

In this work we give an interpretation of vertices and edges of the acyclic Birkhoff polytope, T_n=Ω_n(T), where T is a tree with n vertices, in terms of graph theory. We generalize a recent result relatively to the diameter of the graph G(T_n).