A lower bound on the Kobayashi metric near a point of finite type in ℂ n

1992 ◽  
Vol 2 (4) ◽  
pp. 317-325 ◽  
Author(s):  
Sanghyun Cho
2013 ◽  
Vol 22 (06) ◽  
pp. 1350024 ◽  
Author(s):  
MYEONG-JU JEONG

Nelson and Kanenobu showed that forbidden moves unknot any virtual knot. Similarly a long virtual knot can be unknotted by a finite sequence of forbidden moves. Goussarov, Polyak and Viro introduced finite type invariants of virtual knots and long virtual knots and gave combinatorial representations of finite type invariants. We introduce Fn-moves which generalize the forbidden moves. Assume that two long virtual knots K and K′ are related by a finite sequence of Fn-moves. We show that the values of the finite type invariants of degree 2 of K and K′ are congruent modulo n and give a lower bound for the number of Fn-moves needed to transform K to K′.


2016 ◽  
Vol 144 (10) ◽  
pp. 4393-4394 ◽  
Author(s):  
Nikolai Nikolov
Keyword(s):  

2012 ◽  
Vol 149 (1) ◽  
pp. 148-174 ◽  
Author(s):  
Roland Lötscher

AbstractThe well-known fiber dimension theorem in algebraic geometry says that for every morphism f:X→Y of integral schemes of finite type the dimension of every fiber of f is at least dim X−dim Y. This has recently been generalized by Brosnan, Reichstein and Vistoli to certain morphisms of algebraic stacks f:𝒳→𝒴, where the usual dimension is replaced by essential dimension. We will prove a general version for morphisms of categories fibered in groupoids. Moreover, we will prove a variant of this theorem, where essential dimension and canonical dimension are linked. These results let us relate essential dimension to canonical dimension of algebraic groups. In particular, using the recent computation of the essential dimension of algebraic tori by MacDonald, Meyer, Reichstein and the author, we establish a lower bound on the canonical dimension of algebraic tori.


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/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