Groups of $C^{r,s}$-diffeomorphisms related to a foliation

Jacek Lech; Tomasz Rybicki

Displaying similar documents to “Groups of $C^{r, s}$ -diffeomorphisms related to a foliation”

Minimal, rigid foliations by curves on $ℂ ℙ^{n}$

Frank Loray, Julio C. Rebelo (2003)

Journal of the European Mathematical Society

Similarity:

We prove the existence of minimal and rigid singular holomorphic foliations by curves on the projective space $ℂ ℙ^{n}$ for every dimension $n \geq 2$ and every degree $d \geq 2$ . Precisely, we construct a foliation $ℱ$ which is induced by a homogeneous vector field of degree $d$ , has a finite singular set and all the regular leaves are dense in the whole of $ℂ ℙ^{n}$ . Moreover, $ℱ$ satisfies many additional properties expected from chaotic dynamics and is rigid in the following sense: if $ℱ$ is conjugate to another holomorphic...

Twisted cotangent sheaves and a Kobayashi-Ochiai theorem for foliations

Andreas Höring (2014)

Annales de l’institut Fourier

Similarity:

Let $X$ be a normal projective variety, and let $A$ be an ample Cartier divisor on $X$ . Suppose that $X$ is not the projective space. We prove that the twisted cotangent sheaf $Ω_{X} \otimes A$ is generically nef with respect to the polarisation $A$ . As an application we prove a Kobayashi-Ochiai theorem for foliations: if $ℱ ⊊ T_{X}$ is a foliation such that $det ℱ \equiv i_{ℱ} A$ , then $i_{ℱ}$ is at most the rank of $ℱ$ .

Foliations by curves with curves as singularities

M. Corrêa Jr, A. Fernández-Pérez, G. Nonato Costa, R. Vidal Martins (2014)

Annales de l’institut Fourier

Similarity:

Let $ℱ$ be a holomorphic one-dimensional foliation on $ℙ^{n}$ such that the components of its singular locus $Σ$ are curves $C_{i}$ and points $p_{j}$ . We determine the number of $p_{j}$ , counted with multiplicities, in terms of invariants of $ℱ$ and $C_{i}$ , assuming that $ℱ$ is special along the $C_{i}$ . Allowing just one nonzero dimensional component on $Σ$ , we also prove results on when the foliation happens to be determined by its singular locus.

On the rigidity of webs

Michel Belliart (2007)

Bulletin de la Société Mathématique de France

Similarity:

Plane $d$ -webs have been studied a lot since their appearance at the turn of the 20th century. A rather recent and striking result for them is the theorem of Dufour, stating that the measurable conjugacies between 3-webs have to be analytic. Here, we show that even the set-theoretic conjugacies between two $d$ -webs, $d \geq 3$ are analytic unless both webs are analytically parallelizable. Between two set-theoretically conjugate parallelizable $d$ -webs, however, there always exists a nonmeasurable conjugacy;...

Local density of diffeomorphisms with large centralizers

Christian Bonatti, Sylvain Crovisier, Gioia M. Vago, Amie Wilkinson (2008)

Annales scientifiques de l'École Normale Supérieure

Similarity:

Given any compact manifold $M$ , we construct a non-empty open subset $𝒪$ of the space ${Diff}^{1} (M)$ of $C^{1}$ -diffeomorphisms and a dense subset $𝒟 \subset 𝒪$ such that the centralizer of every diffeomorphism in $𝒟$ is uncountable, hence non-trivial.

On operators from $ℓ_{s}$ to $ℓ_{p} \otimes ̂ ℓ_{q}$ or to $ℓ_{p} \hat{\otimes ̂} ℓ_{q}$

Christian Samuel (2010)

Colloquium Mathematicae

Similarity:

We show that every operator from $ℓ_{s}$ to $ℓ_{p} \otimes ̂ ℓ_{q}$ is compact when 1 ≤ p,q < s and that every operator from $ℓ_{s}$ to $ℓ_{p} \hat{\otimes ̂} ℓ_{q}$ is compact when 1/p + 1/q > 1 + 1/s.

The relation between the number of leaves of a tree and its diameter

Pu Qiao, Xingzhi Zhan (2022)

Czechoslovak Mathematical Journal

Similarity:

Let $L (n, d)$ denote the minimum possible number of leaves in a tree of order $n$ and diameter $d .$ Lesniak (1975) gave the lower bound $B (n, d) = ⌈ 2 (n - 1) / d ⌉$ for $L (n, d) .$ When $d$ is even, $B (n, d) = L (n, d) .$ But when $d$ is odd, $B (n, d)$ is smaller than $L (n, d)$ in general. For example, $B (21, 3) = 14$ while $L (21, 3) = 19 .$ In this note, we determine $L (n, d)$ using new ideas. We also consider the converse problem and determine the minimum possible diameter of a tree with given order and number of leaves.