Algebraic Shifting and Basic Constructions on Simplicial Complexes

We try to understand the behavior of algebraic shifting with respect to some basic constructions on simplicial complexes, such as union, coning, and (more generally) join. In particular, for the disjoint union of simplicial complexes we prove Δ(K ˙∪ L) = Δ(Δ(K) ˙∪ Δ(L)) (conjectured by Kalai [6]), and for the join we give an example of simplicial complexes K and L for which Δ(K*L)≠Δ(Δ(K)*Δ(L)) (disproving a conjecture by Kalai [6]), where Δ denotes the (exterior) algebraic shifting operator. We develop a ‘homological’ point of view on algebraic shifting which is used throughout this work.     

On the equivalence of extremal Teichmüller mapping

Let T(Δ) and B(Δ) be the Teichmüller space and the infinitesimal Teichmüller space of the unit disk Δ respectively. In this paper, we show that [ν] _B(Δ) being an infinitesimal Strebel point does not imply that [ν] _T(Δ) is a Strebel point, vice versa. As an application of our results, problems proposed by Yao are solved. This work was supported by the National Natural Science Foundation of China (Grant No. 10571028)     

List 2-distance (Δ + 2)-coloring of planar graphs with girth 6 and Δ ≥ 24

It was proved in [1] that every planar graph with girth g ≥ 6 and maximum degree Δ ≥ 8821 is 2-distance (Δ + 2)-colorable. We prove that every planar graph with g ≥ 6 and Δ ≥ 24 is list 2-distance (Δ + 2)-colorable.     

Note on hit-and-miss topologies

This is a continuation of [19]. We characterize first and second countability of the general hit-and-miss hyperspace topologyτ ₊ ^Δ for weakly-R ₀ base spaces. Further, metrizability ofτ ₊ ^Δ is characterized with no preliminary conditions on the base space and the generating family of closed sets and a new proof on uniformizability (i.e. complete regularity) ofτ ₊ ^Δ is given in this general setting, thus generalizing results of [3], [5] and [6].     

Large Monotone Paths in Graphs with Bounded Degree

 We prove that for every ε>0 and positive integer r, there exists Δ₀=Δ₀(ε) such that if Δ>Δ₀ and n>n(Δ,ε,r) then there exists a packing of K _n with ⌊(n−1)/Δ⌋ graphs, each having maximum degree at most Δ and girth at least r, where at most εn ² edges are unpacked. This result is used to prove the following: Let f be an assignment of real numbers to the edges of a graph G. Let α(G,f) denote the maximum length of a monotone simple path of G with respect to f. Let α(G) be the minimum of α(G,f), ranging over all possible assignments. Now let α_Δ be the maximum of α(G) ranging over all graphs with maximum degree at most Δ. We prove that Δ+1≥α_Δ≥Δ(1−o(1)). This extends some results of Graham and Kleitman [6] and of Calderbank et al. [4] who considered α(K _n ). Received: March 15, 1999?Final version received: October 22, 1999     

Large Almost Simple Groups Acting on 16-Dimensional Compact Projective Planes

 This paper deals with the so-called Salzmann program aiming to classify special geometries according to their automorphism groups. Here, topological connected compact projective planes are considered. If finite-dimensional, such planes are of dimension 2, 4, 8, or 16. The classical example of a 16-dimensional, compact projective plane is the projective plane over the octonions with 78-dimensional automorphism group E₆(−26). A 16-dimensional, compact projective plane ? admitting an automorphism group of dimension 41 or more is clasical, [23] 87.5 and 87.7. For the special case of a semisimple group Δ acting on ? the same result can be obtained if dim , see [22]. Our aim is to lower this bound. We show: if Δ is semisimple and dim , then ? is either classical or a Moufang-Hughes plane or Δ is isomorphic to Spin₉ (ℝ, r), r∈{0, 1}. The proof consists of two parts. In [16] it has been shown that Δ is in fact almost simple or isomorphic to SL₃?ċSpin₃ℝ. In the underlying paper we can therefore restrict our considerations to the case that Δ is almost simple, and the corresponding planes are classified. Received 10 February 1997; in final form 19 December 1997     

Large Almost Simple Groups Acting on 16-Dimensional Compact Projective Planes

 This paper deals with the so-called Salzmann program aiming to classify special geometries according to their automorphism groups. Here, topological connected compact projective planes are considered. If finite-dimensional, such planes are of dimension 2, 4, 8, or 16. The classical example of a 16-dimensional, compact projective plane is the projective plane over the octonions with 78-dimensional automorphism group E₆(−26). A 16-dimensional, compact projective plane ? admitting an automorphism group of dimension 41 or more is clasical, [23] 87.5 and 87.7. For the special case of a semisimple group Δ acting on ? the same result can be obtained if dim , see [22]. Our aim is to lower this bound. We show: if Δ is semisimple and dim , then ? is either classical or a Moufang-Hughes plane or Δ is isomorphic to Spin₉ (ℝ, r), r∈{0, 1}. The proof consists of two parts. In [16] it has been shown that Δ is in fact almost simple or isomorphic to SL₃?ċSpin₃ℝ. In the underlying paper we can therefore restrict our considerations to the case that Δ is almost simple, and the corresponding planes are classified.     

List-colourings of graphs

In this paper, we go some way towards proving a conjecture of Albertson and Tucker. Among other results, we show that ifc>11/6 and Δ is sufficiently large, then a graph of maximum degree Δ with a list of cardinality [cΔ] assigned to each edge may be edge-coloured so that each edge is coloured with an element of its list.     

On some new generalized difference sequence spaces defined by a sequence of moduli

In this paper, we define the new generalized difference sequence spaces [V, λ, F, p, q]₀(Δ _v ^m ), [V, λ, F, p, q]₁(Δ _v ^m ) and [V, λ, F, p, q]_∞(Δ _v ^m ). We also study some inclusion relations between these spaces.     

On a Class of Generalized Lacunary Difference Sequence Spaces Defined by Orlicz Functions

In this article we introduce the generalized lacunary difference sequence spaces [N_θ,M,Δ~m]_0,[N_θ,M,Δ~m]_1 and [N_θ,M,Δ~m]_∞using m~(th)- difference.We study their properties like completeness,solidness,symmetricity.Also we obtain some inclusion relations involving the spaces [N_θ,M,Δ~m]_0,[N_θ,M,Δ~m]_1 and[N_θ,M,Δ~m]_∞and the Cesàro summable and strongly Cesàro summable sequences.     

On Large Systems of Sets with No Large Weak Δ-subsystems

weak Δ-system if the cardinality of the intersection of any two sets is the same. We elaborate a construction by R?dl and Thoma [9] and show that for large n, there exists a family ℱ of subsets of without weak Δ-systems of size 3 with . Received: October 1, 1997     

Bivariate spline interpolation with optimal approximation order

Let Δ be a triangulation of some polygonal domain Ω ⊂ R² and let S_q^r(Δ) denote the space of all bivariate polynomial splines of smoothness r and degree q with respect to Δ. We develop the first Hermite-type interpolation scheme for S _q ^r (Δ), q ≥ 3r + 2, whose approximation error is bounded above by Kh ^q +1, where h is the maximal diameter of the triangles in Δ, and the constant K only depends on the smallest angle of the triangulation and is independent of near-degenerate edges and near-singular vertices. Moreover, the fundamental functions of our scheme are minimally supported and form a locally linearly independent basis for a superspline subspace of S _q ^r (Δ). This shows that the optimal approximation order can be achieved by using minimally supported splines. Our method of proof is completely different from the quasi-interpolation techniques for the study of the approximation power of bivariate splines developed in [7] and [18].     

On the fundamental group of real toric varieties

LetX (Δ) be the real toric variety associated to a smooth fan Δ. The main purpose of this article is: (i) to determine the fundamental group and the universal cover ofX (Δ), (ii) to give necessary and sufficient conditions on Δ under which π₁(X(Δ)) is abelian, (iii) to give necessary and sufficient conditions on Δ under whichX(Δ) is aspherical, and when Δ is complete, (iv) to give necessary and sufficient conditions forC _Δ to be aK (π, 1) space whereC _Δ is the complement of a real subspace arrangement associated to Δ.     

Ostrowski Type Inequalities on Time Scales for Double Integrals

In this paper we first derive an Ostrowski type inequality on time scales for double integrals via ΔΔ-integral which unify corresponding continuous and discrete versions. We then replace the ΔΔ-integral by the ∇ ∇-, Δ∇-, and ∇Δ-integrals and get completely analogous results.     

A Hartogs type theorem for separately Cr functions

The main step in the proof of Hartogs’ theorem on separate analyticity (see [3], [4], [5]) consists in showing that if a function f defined in Δ × Δ is holomorphic for |z ₂| < ε and separately holomorphic in z ₂ when z ₁ is kept fixed, then it is jointly holomorphic; the normal convergence of the Taylor series of f is obtained through the celebrated Hartogs’ lemma on subharmonic functions.     

The linear arboricity of graphs

Alinear forest is a forest in which each connected component is a path. Thelinear arboricity la(G) of a graphG is the minimum number of linear forests whose union is the set of all edges ofG. Thelinear arboricity conjecture asserts that for every simple graphG with maximum degree Δ=Δ(G), . Although this conjecture received a considerable amount of attention, it has been proved only for Δ≦6, Δ=8 and Δ=10, and the best known general upper bound for la(G) is la(G)≦⌈3Δ/5⌉ for even Δ and la(G)≦⌈(3Δ+2)/5⌉ for odd Δ. Here we prove that for everyɛ>0 there is a Δ₀=Δ₀(ɛ) so that la(G)≦(1/2+ɛ)Δ for everyG with maximum degree Δ≧Δ₀. To do this, we first prove the conjecture for everyG with an even maximum degree Δ and withgirth g≧50Δ. Research supported in part by Allon Fellowship, by a Bat Sheva de Rothschild grant, by the Fund for Basic Research administered by the Israel Academy of Sciences and by a B.S.F. Bergmann Memorial grant.     

Subalgebras of the Stanley—Reisner Ring

In [2], Billera proved that the R -algebra of continuous piecewise polynomial functions (C ⁰ splines) on a d -dimensional simplicial complex Δ embedded in R ^d is a quotient of the Stanley—Reisner ring A _Δ of Δ. We derive a criterion to determine which elements of the Stanley—Reisner ring correspond to splines of higher-order smoothness. In [5], Lau and Stiller point out that the dimension of C ^r _k (Δ) is upper semicontinuous in the Zariski topology. Using the criterion, we give an algorithm for obtaining the defining equations of the set of vertex locations where the dimension jumps. Received June 2, 1997, and in revised form December 22, 1997, and March 24, 1998.     

On completely reducible solvable subgroups of GL(n, Δ)

Let Δ be a finite field and denote by GL(n, Δ) the group ofn×n nonsingular matrices defined over Δ. LetR⊆GL(n, Δ) be a solvable, completely reducible subgroup of maximal order. For |Δ|≧2, |Δ|≠3 we give bounds for |R| which improve previous ones. Moreover for |Δ|=3 or |Δ|>13 we determine the structure ofR, in particular we show thatR is unique, up to conjugacy. This work is part of a Ph.D. thesis done at the Hebrew University under the supervision of Professor A. Mann.     

On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles

Vizing and Behzad independently conjectured that every graph is (Δ + 2)-totally-colorable, where Δ denotes the maximum degree of G. This conjecture has not been settled yet even for planar graphs. The only open case is Δ = 6. It is known that planar graphs with Δ ≥ 9 are (Δ + 1)-totally-colorable. We conjecture that planar graphs with 4 ≤ Δ ≤ 8 are also (Δ + 1)-totally-colorable. In addition to some known results supporting this conjecture, we prove that planar graphs with Δ = 6 and without 4-cycles are 7-totally-colorable. Supported by the Natural Science Foundation of Department of Education of Zhejiang Province, China, Grant No. 20070441.