Intersections of Leray complexes and regularity of monomial ideals

For a simplicial complex X and a field K, let .It is shown that if X,Y are complexes on the same vertex set, then for k?0

     

On the size of maximal chains and the number of pairwise disjoint maximal antichains

For each integer k≥3, we find all maximal intervals I_k of natural numbers with the following property: whenever the number of elements in every maximal chain in a finite partially ordered set P lies in I_k, then P contains k pairwise disjoint maximal antichains. All such I_k are of the form

     

On the Spaltenstein correspondence

In the article [Spa1], N. Spaltenstein has established a bijection between the irreducible components of _χ, the space of full flags fixed by a nilpotent element χ ? M(n, k), where k is an algebraically closed field, and the standard tableaux associated to the Young diagram of χ. In this present work we determine, when χ is of hook type, for each irreducible component X of _χ, the unique Schubert cell _X of the full flag manifold = (V) (where V is vector space of dimension n over k), such that X ∩ _X is a dense subspace in X. This result will allow us to optimize the computation of _χ and when k = is the complex field, to see that the graph resolution of the partition (2, 1, …, 1) of n is related to the Dynkin diagram of sl(n, ).     

Maps preserving the spectrum of generalized Jordan product of operators

Let A₁,A₂ be standard operator algebras on complex Banach spaces X₁,X₂, respectively. For k?2, let (i₁,…,i_m) be a sequence with terms chosen from {1,…,k}, and define the generalized Jordan product

     

Precise rates in the law of logarithm for the moment convergence of i.i.d. random variables

Let be a sequence of i.i.d. random variables with EX=0 and EX²=σ²<∞. Set , Mn=maxk?n|Sk|, n?1. Let r>1, then we obtain

     

On the number of representations of certain integers as sums of 11 or 13 squares

Let r_k(n) denote the number of representations of an integer n as a sum of k squares. We prove that for odd primes p,

     

Precise rates in complete moment convergence for ρ-mixing sequences

Let X₁,X₂,… be a strictly stationary sequence of ρ-mixing random variables with mean zeros and positive, finite variances, set Sn=X₁+?+Xn. Suppose that , , where q>2δ+2. We prove that, if for any 0<δ?1, then

     

Improved bounds in the metric cotype inequality for Banach spaces

It is shown that if (X,‖⋅X_‖) is a Banach space with Rademacher cotype q then for every integer n there exists an even integer such that for every we have

(1)     

Extreme points and isometries on vector-valued Lipschitz spaces

For a Banach space E and a compact metric space (X,d), a function F:X→E is a Lipschitz function if there exists k>0 such that

     

Distance irredundance and connected domination numbers of a graph

Let k be a positive integer and G be a connected graph. This paper considers the relations among four graph theoretical parameters: the k-domination number γ_k(G), the connected k-domination number ; the k-independent domination number and the k-irredundance number ir_k(G). The authors prove that if an ir_k-set X is a k-independent set of G, then , and that for k?2, if ir_k(G)=1, if ir_k(G) is odd, and if ir_k(G) is even, which generalize some known results.     

Schauder estimates for parabolic nondivergence operators of Hörmander type

Let X₁,X₂,…,Xq be a system of real smooth vector fields satisfying Hörmander's rank condition in a bounded domain Ω of Rn. Let be a symmetric, uniformly positive definite matrix of real functions defined in a domain U⊂R×Ω. For operators of kind

     

An extension of the Vu-Sine theorem and compact-supercyclicity

If (Tt)_t?0 is a bounded C₀-semigroup in a Banach space X and there exists a compact subset K⊆X such that

     

Circular mixed hypergraphs II:The upper chromatic number

A mixed hypergraph is a triple H=(X,C,D), where X is the vertex set and each of C, D is a family of subsets of X, the C-edges and D-edges, respectively. A proper k-coloring of H is a mapping c:X→[k] such that each C-edge has two vertices with a common color and each D-edge has two vertices with distinct colors. A mixed hypergraph H is called circular if there exists a host cycle on the vertex set X such that every edge (C- or D-) induces a connected subgraph of this cycle.We suggest a general procedure for coloring circular mixed hypergraphs and prove that if H is a reduced colorable circular mixed hypergraph with n vertices, upper chromatic number and sieve number s, then

     

Walks and the spectral radius of graphs

Given a graph G, write μ(G) for the largest eigenvalue of its adjacency matrix, ω(G) for its clique number, and w_k(G) for the number of its k-walks. We prove that the inequalities