Related papers: Finite determinacy and stability of flatness of an…
An internal characterization of complete metric mappings (by means of Cauchy nets tied at a point) is given and a construction of the completion of a metric mapping is presented.
Representation of convex geometry as an appropriate join of compatible total orderings of the base set can be achieved, when closure operator of convex geometry is algebraic, or finitary. This bears to the finite case proved by P.H.~Edelman…
One of the questions in Rigidity Theory is whether a realization of the vertices of a graph in the plane is flexible, namely, if it allows a continuous deformation preserving the edge lengths. A flexible realization of a connected graph in…
We prove a version of faithfully flat descent in rigid analytic geometry, for almost perfect complexes and without finiteness assumptions on the rings involved. This extends results of Drinfeld for vector bundles.
We establish rigidity results for holomorphic mappings and plurisubharmonic functions in complex geometry. First, under mild conditions, we show that the gradient of a $\operatorname{U}(1)$-invariant strictly plurisubharmonic function in…
The paper shows an inf-sup stability property for several well-known 2D and 3D Stokes elements on triangulations which are not fitted to a given smooth or polygonal domain. The property implies stability and optimal error estimates for a…
We give a complete and detailed proof of Harer's stability theorem for the homology of mapping class groups of surfaces, with the best stability range presently known. This theorem and its proof have seen several improvements since Harer's…
An analytico-geometric reflection principle is established by means of normal deformations of analytic discs.
We describe a flexible construction that produces triples of finitely generated, residually finite groups $M\hookrightarrow P \hookrightarrow \Gamma$, where the maps induce isomorphisms of profinite completions…
In this paper, we shall show that some coincidence point and common fixed point results for three or four mappings could easily be obtained from the corresponding fixed point results for two mappings.
It is proved that any polynomial vector field in two complex variables which is complete on a non-algebraic trajectory is complete.
Following recent work of T. Alazard and C. Shao on applications of para-differential calculus to smooth conjugacy and stability problems for Hamiltonian systems, we prove finite codimension stability of invariant surfaces (in finite…
It is proved that a map $\varphi\colon R\to S$ of commutative noetherian rings that is essentially of finite type and flat is locally complete intersection if and only $S$ is proxy small as a bimodule. This means that the thick subcategory…
Hua's fundamental theorem of geometry of hermitian matrices characterizes all bijective maps on the space of all hermitian matrices, which preserve adjacency in both directions. In this and subsequent paper we characterize maps on the set…
Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…
It is a famous result of Lovasz and Yemini (1982) that 6-connected graphs are rigid in the plane. This was recently improved by Jackson and Jordan (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give…
The main aim of the paper is to study in greater detail absolutely homogeneous structures (that is, objects with the property that each partial isomorphism extends to a global automorphism), with special emphasis on metric spaces and…
Finite metric spaces arise in many different contexts. Enormous bodies of data, scientific, commercial and others can often be viewed as large metric spaces. It turns out that the metric of graphs reveals a lot of interesting information.…
Schmidt's game, and other similar intersection games have played an important role in recent years in applications to number theory, dynamics, and Diophantine approximation theory. These games are real games, that is, games in which the…
The notion of non-deterministic logical matrix (where connectives are interpreted as multi-functions) preserves many good properties of traditional semantics based on logical matrices (where connectives are interpreted as functions) whilst…