On the 3-Torsion Part of the Homology of the Chessboard Complex

Let 1 ≤ m ≤ n. We prove various results about the chessboard complex M _m,n , which is the simplicial complex of matchings in the complete bipartite graph K _m,n . First, we demonstrate that there is nonvanishing 3-torsion in [(H)\tilde]_d(\sf M_m,n; \mathbb Z){{\tilde{H}_d({\sf M}_{m,n}; {\mathbb Z})}} whenever \fracm+n-43 ￡ d ￡ m-4{{\frac{m+n-4}{3}\leq d \leq m-4}} and whenever 6 ≤ m < n and d = m − 3. Combining this result with theorems due to Friedman and Hanlon and to Shareshian and Wachs, we characterize all triples (m, n, d ) satisfying [(H)\tilde]_d (\sf M_m,n; \mathbb Z) 1 0{{\tilde{H}_d \left({\sf M}_{m,n}; {\mathbb Z}\right) \neq 0}}. Second, for each k ≥ 0, we show that there is a polynomial f _k (a, b) of degree 3k such that the dimension of [(H)\tilde]_k+a+2b-2 (\sf M_{k+a+3b-1,k+2a+3b-1}; \mathbb Z₃){{\tilde{H}_{k+a+2b-2}}\,\left({{\sf M}_{k+a+3b-1,k+2a+3b-1}}; \mathbb Z_{3}\right)}, viewed as a vector space over \mathbbZ₃{\mathbb{Z}_3}, is at most f _k (a, b) for all a ≥ 0 and b ≥ k + 2. Third, we give a computer-free proof that [(H)\tilde]₂ (\sf M_5,5; \mathbb Z) @ \mathbb Z₃{{\tilde{H}_2 ({\sf M}_{5,5}; \mathbb {Z})\cong \mathbb Z_{3}}}. Several proofs are based on a new long exact sequence relating the homology of a certain subcomplex of M _m,n to the homology of M _m-2,n-1 and M _m-2,n-3.     

On the dependence of the growth rate on the length of the defining relator

Let { } be a sequence of finitely presented groups with generating setA={a1, …, am}, and letRk be the symmetrized set of words over the alphabetA∪A−1 obtained from the defining words and their inverses by all cyclic shifts. We shall assume that the words inRk are cyclically irreducible, and their lengths tend to ∞ ask increases. In the paper, it is proved that ifRk satisfies the small cancellation conditionC'(1/6) and the number of relators increases not very rapidly with increasingk, then the growth rate ψ(Gk) tends to 2m−1 ask→∞. Translated fromMatematicheskie Zametki, Vol. 65, No. 4, pp. 611–617, April, 1999.     

Weak Asymptotics for the Generating Polynomials of the Stirling Numbers of the Second Kind

For the horizontal generating functions P_n(z)=∑ⁿ_k=1 S(n, k) z^k of the Stirling numbers of the second kind, strong asymptotics are established, as n→∞. By using the saddle point method for Q_n(z)=P_n(nz) there are two main results: an oscillating asymptotic for z(−e, 0) and a uniform asymptotic on every compact subset of \[−e, 0]. Finally, an Airy asymptotic in the neighborhood of −e is deduced.     

On the explicit solutions of forms of the Sylvester and the Yakubovich matrix equations

In this paper, we consider the explicit solutions of two matrix equations, namely, the Yakubovich matrix equation V−AVF=BW and Sylvester matrix equations AV−EVF=BW,AV+BW=EVF and AV−VF=BW. For this purpose, we make use of Kronecker map and Sylvester sum as well as the concept of coefficients of characteristic polynomial of the matrix A. Some lemmas and theorems are stated and proved where explicit and parametric solutions are obtained. The proposed methods are illustrated by numerical examples. The results obtained show that the methods are very neat and efficient.     

On the structure of the sumsets

Let A be a set of nonnegative integers. For h≥2, denote by hA the set of all the integers representable by a sum of h elements from A. In this paper, we prove that, if k≥3, and A={a₀,a₁,…,a_k−1} is a finite set of integers such that 0=a₀<a₁<?<a_k−1 and (a₁,…,a_k−1)=1, then there exist integers c and d and sets C⊆[0,c−2] and D⊆[0,d−2] such that hA=C∪[c,ha_k−1−d]∪(ha_k−1−D) for all . The result is optimal. This improves Nathanson’s result: h≥max{1,(k−2)(a_k−1−1)a_k−1}.     

On the Decomposition of the Riesz Operator and the Expansion of the Riesz Semigroup

For a Riesz operator T on a reflexive Banach space X with nonzero eigenvalues denote by E(λ_i; T) the eigen-projection corresponding to an eigenvalue λ_i. In this paper we will show that if the operator sequence is uniformly bounded, then the Riesz operator T can be decomposed into the sum of two operators T_p and T_r: T = T_p + T_r, where T_p is the weak limit of T_n and T_r is quasi-nilpotent. The result is used to obtain an expansion of a Riesz semigroup T(t) for t ≥ τ. As an application, we consider the solution of transport equation on a bounded convex body.     

On the Finite Group with the Index of Maximal Subgroups of the Monster

Abstract

We study the problem concerning the influence of the index of maximal subgroup or the degree of primitive permutation representation of the finite simple groups on the structure of a group. Let G be a finite group and s be the index of maximal subgroup of the Monster M. In this paper, we prove that there exists an epimorphism from G to M or A _s if G has the primitive permutation representation of degree s, and as a consequence we prove that the Monster is determined by every s.     

An Example of the Effect of Rescaling of the Reflection Coefficient on the Scattering Potential for the One-Dimensional Schrodinger Equation

Let us consider the one-dimensional Schrödinger equation with the scattering potential V(x)=2δ(x) and corresponding reflection coefficient b(k)=?i/(k + i). The potential satisfies a theorem of Deift and Trubowitz which states that non-negative measurable potentials V(x) satisfying a certain range condition have reflection coefficients b(k) such that b(0)=?1. We rescale the reflection coefficient for V(x)=2δ(x) by writing b(k)=?iv/(k + 1) where 0<v<1. It is shown how V(x) changes with v, through the use of the Gelfand-Levitan equation. This example illustrates how sensitive the potential is to rescaling of the reflection coefficient. In particular, the rescaling leads to a negative portion of V(x), as is expected from the Deift-Trubowitz theorem. The example of this paper will be used in a later paper to illustrate the nature of bounds on potentials obtained through the use of variational principles.     

On the normality of the rings of Schubert varieties

We prove that the cone over a Schubert variety inG/P (P being a maximal parabolic subgroup of classical type) is normal by exhibiting a 2-regular sequence inR(w) (the homogeneous coordinate ring of the Schubert varietyX(w) inG/P under the canonical protective embeddingG/P ⊂→ (p (H° G/P,L)),L being the ample generator of (PicG/P), which vanishes on the singular locus ofX(w). We also prove the surjectivity ofH° (G/Q, L) H° (X(w), L), whereQ is a classical parabolic subgroup (not necessarily maximal) ofG andL is an ample line bundle onG/Q.     

Existence of Lipschitzian solutions to the classical problem of the calculus of variations in the autonomous case

Under general growth assumptions, that include some cases of linear growth, we prove existence of Lipschitzian solutions to the problem of minimizing ∫_a^bL(x(s),x′(s)) ds with the boundary conditions x(a)=A, x(b)=B.     

Convergence of the Dirichlet solutions of the very fast diffusion equation

For any −1<m<0, positive functions f, g and u₀≥0, we prove that under some mild conditions on f, g and u₀ as R→∞ the solution u^R of the Dirichlet problem u_t=(u^m/m)_xx in (−R,R)×(0,∞), u(R,t)=(f(t)|m|R)^1/m, u(−R,t)=(g(t)|m|R)^1/m for all t>0, u(x,0)=u₀(x) in (−R,R), converges uniformly on every compact subset of R×(0,T) to the solution of the equation u_t=(u^m/m)_xx in R×(0,T), u(x,0)=u₀(x) in R, which satisfies some mass loss formula on (0,T) where T is the maximal time such that the solution u is positive. We also prove that the solution constructed is equal to the solution constructed in Hui (2007) [15] using approximation by solutions of the corresponding Neumann problem in bounded cylindrical domains.     

On the Genus of the Nilpotent Graphs of Finite Groups

The nilpotent graph of a group G is a simple graph whose vertex set is G?nil(G), where nil(G) = {y ∈ G | ? x, y ? is nilpotent ? x ∈ G}, and two distinct vertices x and y are adjacent if ? x, y ? is nilpotent. In this article, we show that the collection of finite non-nilpotent groups whose nilpotent graphs have the same genus is finite, derive explicit formulas for the genus of the nilpotent graphs of some well-known classes of finite non-nilpotent groups, and determine all finite non-nilpotent groups whose nilpotent graphs are planar or toroidal.     

On the Additive Group Structure of the Nonstandard Models of the Theory of Integers

Let $\hat \mathbb{Z}$ denote the inverse limit of all finite cyclic groups. Let F, G and H be abelian groups with H ≤ G. Let FβH denote the abelian group (F × H, +^β), where +^βis defined by (a, x) +^β (b, y) = (a + b, x + y + β(a) + β(b) — β(a + b)) for a certain β : F → G linear mod H meaning that β(0) = 0 and β(a) + β(b) — β(a + b) ∈ H for all a, b in F. In this paper we show that the following hold: (1) The additive group of any nonstandard model ℤ* of the ring ℤ is isomorphic to (ℤ*₊/H)βH for a certain β : ℤ*₊/H → $\hat \mathbb{Z}$ linear mod H. (2) $\hat \mathbb{Z}$ is isomorphic to (ℤ₊/H )βH for some β : $\hat \mathbb{Z}$/H →ℚ linear mod H, though $\hat \mathbb{Z}$ is not the additive group of any model of Th(ℤ, +, ×) and the exact sequence H → $\hat \mathbb{Z}$ → $\hat \mathbb{Z}$/H is not splitting.     

Helly-Type Theorems on the Homology of the Space of Transversals

In this paper we ``measure' the size of the set of n -transversals of a family F of convex sets in R <sup>n+k</sup> according to its homological complexity inside the corresponding Grassmannian manifold. Our main result states that the ``measure' μ of the set of n -transversals of F is greater than or equal to k if and only if every k+1 members of F have a common point and also if and only if for some integer m , 1≤ m≤ n , and every subfamily F ^\prime of F with k+2 members, the ``measure' μ of the set of m -transversals of F ^\prime is greater than or equal to k . Received October 25, 2000, and in revised form September 27, 2001, and October 17, 2001. Online publication March 1, 2002.     

On the behavior of the product of independent random variables

For two independent non-negative random variables X and Y, we treat X as the initial variable of major importance and Y as a modifier (such as the interest rate of a portfolio). Stability in the tail behaviors of the product compared with that of the original variable X is of practical interests. In this paper, we study the tail behaviors of the product XY when the distribution of X belongs to the classes L and S, respectively. Under appropriate conditions, we show that the distribution of the product XY is in the same class as X when X belongs to class L or S, in other words, classes L and S are stable under some mild conditions on the distribution of Y. We also show that if the distribution of X is in class L(γ) (γ>0) and continuous, then the product XY is in L if and only if Y is unbounded.     

On the number of regular vertices of the union of jordan regions

Let \C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. If the boundaries of two sets in \C cross exactly twice, then their intersection points are called regular vertices of the arrangement \A(\C) . Let R(\C) denote the set of regular vertices on the boundary of the union of \C . We present several bounds on |R(\C)| , depending on the type of the sets of \C . (i) If each set of \C is convex, then |R(\C)|=O(n ^1.5+\eps ) for any \eps>0 . (ii) If no further assumptions are made on the sets of \C , then we show that there is a positive integer r that depends only on s such that |R(\C)|=O(n ^2-1/r ) . (iii) If \C consists of two collections \C ₁ and \C ₂ where \C ₁ is a collection of m convex pseudo-disks in the plane (closed Jordan regions with the property that the boundaries of any two of them intersect at most twice), and \C ₂ is a collection of polygons with a total of n sides, then |R(\C)|=O(m ^2/3 n ^2/3 +m +n) , and this bound is tight in the worst case. Received December 4, 1998, and in revised form June 3, 2000. Online publication Feburary 1, 2001.     

Computing the genus of the 2-amalgamations of graphs

The above authors [2] and S. Stahl [3] have shown that if a graphG is the 2-amalgamation of subgraphsG ₁ andG ₂ (namely ifG=G ₁∪G ₂ andG ₁∩G ₂={x, y}, two distinct points) then the orientable genus ofG,γ(G), is given byγ(G)=γ(G ₁)+γ(G ₂)+ε, whereε=0,1 or −1. In this paper we sharpen that result by giving a means by whichε may be computed exactly. This result is then used to give two irreducible graphs for each orientable surface.     

On the Rate of Decay of the Concentration Function of the Sum of Independent Random Variables

Let X₁, ... , X_n be i.i.d. integral valued random variables and S_n their sum. In the case when X₁ has a moderately large tail of distribution, Deshouillers, Freiman and Yudin gave a uniform upper bound for max _{k ∊ ℤ} Pr{S_n = k} (which can be expressed in term of the Lévy Doeblin concentration of S_n), under the extra condition that X₁ is not essentially supported by an arithmetic progression. The first aim of the paper is to show that this extra condition cannot be simply ruled out. Secondly, it is shown that if X₁ has a very large tail (larger than a Cauchy-type distribution), then the extra arithmetic condition is not sufficient to guarantee a uniform upper bound for the decay of the concentration of the sum S_n. Proofs are constructive and enhance the connection between additive number theory and probability theory.À Jean-Louis Nicolas, avec amitié et respect2000 Mathematics Subject Classification: Primary—60Fxx, 60Exx, 11Pxx, 11B25     

Kernel density in the study of the strong stability of the queueing system

We use kernel density with correction of boundary effects to study the strong stability of the M/M/1 system after perturbation of arrival flow (respectively service times), to evaluate the proximity of G/M/1 (respectively M/G/1) and M/M/1 systems when the distribution G is unknown. Simulation studies are performed to support the results.     

On the upper bounds of the minimum number of rows of disjunct matrices

A 0-1 matrix is d-disjunct if no column is covered by the union of any d other columns. A 0-1 matrix is (d; z)-disjunct if for any column C and any d other columns, there exist at least z rows such that each of them has value 1 at column C and value 0 at all the other d columns. Let t(d, n) and t(d, n; z) denote the minimum number of rows required by a d-disjunct matrix and a (d; z)-disjunct matrix with n columns, respectively. We give a very short proof for the currently best upper bound on t(d, n). We also generalize our method to obtain a new upper bound on t(d, n; z). The work of Y. Cheng and G. Lin is supported by Natural Science and Engineering Research Council (NSERC) of Canada, and the Alberta Ingenuity Center for Machine Learning (AICML) at the University of Alberta. The work of D.-Z. Du is partially supported by National Science Foundation under grant No.CCF0621829.