Related papers: Vector fields on RP^m x RP^n

The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…

Let us say that an $n$-sided polygon is semi-regular if it is circumscriptible and its angles are all equal but possibly one, which is then larger than the rest. Regular polygons, in particular, are semi-regular. We prove that semi-regular…

We want to compute generic $\mathrm{Ext}$-spaces of twisted polynomial functors in relation to the $\mathrm{Ext}$-spaces of the untwisted ones, modulo a parametrisation. Thanks to the study of a spectral sequence we get to a computation in…

We prove that to any smooth vector field of a closed manifold it can be assigned a nonnegative number called {\em rescaled topological entropy} satisfying the following properties: it is an upper bound for both the topological entropy and…

A path is a simple, piecewise linear curve made up of alternating horizontal and vertical line segments in the plane. A $k$-bend path is a path made up of at most $k + 1$ line segments. A $B_k$-VPG representation of a graph is a collection…

Recall that a vector field on an n-dimensional differentiable manifold M is a mapping X defined on M with values in the tangent bundle TM that assigns to each point $x\in M$ a vector X(x) in the tangent space $T_x M$. A vector field may be…

We develop a numerical approach to cohomology. Essentially, vector spaces and linear maps are replaced by real numbers, which represent dimensions of vector spaces and ranks of linear maps. We use this to refine ideas of Van der Geer and…

Let $X$ be a projective manifold of dimension $n$. Suppose that $T_X$ contains an ample subsheaf. We show that $X$ is isomorphic to $\mathbb{P}^n$. As an application, we derive the classification of projective manifolds containing a…

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…

A span of a given graph $G$ is the maximum distance that two players can keep at all times while visiting all vertices (edges) of $G$ and moving according to certain rules, that produce different variants of span. We prove that the vertex…

This is a review with examples concerning the concepts of affine (in particular, constant and linear) vector fields and fundamental vector fields on a manifold. The affine, linear and constant vector fields on a manifold are shown to be in…

We establish an upper bound for the cochain type level of the total space of a pull-back fibration. It explains to us why the numerical invariant for a principal bundle over the sphere are less than or equal to two. Moreover computational…

This paper describes the construction of a canonical compactification of the space of trajectories and of the unstable/stable sets of a generic gradient like vector field on a closed manifold as well as a canonical structure of a smooth…

A grid polygon is a polygon whose vertices are points of a grid. We define an injective map between permutations of length n and a subset of grid polygons on n vertices, which we call consecutive-minima polygons. By the kernel method, we…

The paper establishes a version of the Hopf boundary point lemma for sections of a vector bundle over a manifold with boundary. This result may be viewed as a counterpart to the tensor maximum principle obtained by R. Hamilton in 1986.…

We show that the stable cohomology of the algebraic polyvector fields on $\mathbb{R}^n$, with values in the adjoint representation is the symmetric product space on the cohomology of M. Kontsevich's graph complex, up to some known classes.

In this note, we provide a important considerations of a familiar topic: the gradient of a vector field. The gradient of a vector field is a common quantity represented in continuum mechanics. However, even for Cartesian coordinate systems,…

In 1979, Hakimi and Schmeichel considered the problem of maximizing the number of cycles of a given length in an $n$-vertex planar graph. They precisely determined the maximum number of triangles and $4$-cycles and presented a conjecture…

Given a linear system in P^n with assigned multiple general points we compute the cohomology groups of its strict transforms via the blow-up of its linear base locus. This leads us to give a new definition of expected dimension of a linear…

In the holomorphic or algebraic setting we consider a vector bundle E on a smooth subvariety X in a smooth variety Y over a field of characteristic zero. Assuming E extends to the l-th neighborhood of X in Y, we study cohomological…