scholarly journals About the mixed André–Oort conjecture: Reduction to a lower bound for the pure case

2016 ◽  
Vol 354 (7) ◽  
pp. 659-663 ◽  
Author(s):  
Ziyang Gao
Keyword(s):  
2019 ◽  
Vol 485 (2) ◽  
pp. 142-144
Author(s):  
A. A. Zevin

Solutions x(t) of the Lipschitz equation x = f(x) with an arbitrary vector norm are considered. It is proved that the sharp lower bound for the distances between successive extremums of xk(t) equals π/L where L is the Lipschitz constant. For non-constant periodic solutions, the lower bound for the periods is 2π/L. These estimates are achieved for norms that are invariant with respect to permutation of the indices.


10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.


10.37236/1245 ◽  
1996 ◽  
Vol 3 (1) ◽  
Author(s):  
Art M. Duval

Björner and Wachs generalized the definition of shellability by dropping the assumption of purity; they also introduced the $h$-triangle, a doubly-indexed generalization of the $h$-vector which is combinatorially significant for nonpure shellable complexes. Stanley subsequently defined a nonpure simplicial complex to be sequentially Cohen-Macaulay if it satisfies algebraic conditions that generalize the Cohen-Macaulay conditions for pure complexes, so that a nonpure shellable complex is sequentially Cohen-Macaulay. We show that algebraic shifting preserves the $h$-triangle of a simplicial complex $K$ if and only if $K$ is sequentially Cohen-Macaulay. This generalizes a result of Kalai's for the pure case. Immediate consequences include that nonpure shellable complexes and sequentially Cohen-Macaulay complexes have the same set of possible $h$-triangles.


10.37236/1748 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Nagi H. Nahas

The best lower bound known on the crossing number of the complete bipartite graph is : $$cr(K_{m,n}) \geq (1/5)(m)(m-1)\lfloor n/2 \rfloor \lfloor(n-1)/2\rfloor$$ In this paper we prove that: $$cr(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2 \rfloor \lfloor (n-1)/2 \rfloor + 9.9 \times 10^{-6} m^2n^2$$ for sufficiently large $m$ and $n$.


Sign in / Sign up

Export Citation Format

Share Document