Degré d'une solution algébrique d'un tissu sur le plan projectif complexe

Let γ be an algebraic solution of a non-dicritical d-web in the complex projective plane. We give a formula relating global data (degree of the solution and of the web) to local data (some indices supported on the union of the singular set of γ with the intersection of the curve with the discriminant of the web).     

The minimal degree of plane models of double covers of smooth curves

If X is a smooth curve such that the minimal degree of its plane models is not too small compared with its genus, then X has been known to be a double cover of another smooth curve Y under some mild condition on the genera. However there are no results yet for the minimal degrees of plane models of double covers except some special cases. In this paper, we give upper and lower bounds for the minimal degree of plane models of the double cover X in terms of the gonality of the base curve Y and the genera of X and Y. In particular, the upper bound equals to the lower bound in case Y is hyperelliptic. We give an example of a double cover which has plane models of degree equal to the lower bound.     

Une réponse négative au problème de Noether différentiel

According to a theorem first stated by Clifford, Noether [8] and Rosanes [12], which later received a complete proof by Castelnuovo [2], the Cremona group of the plane is generated by de Jonquières transformations. J.F. Ritt [10] asked whether such a result could be generalized to the differential plane. We give a negative answer, relying on a flat system of Rouchon.     

Quasi-multipliers and algebrizations of an operator space

Let X be an operator space, let φ be a product on X, and let (X,φ) denote the algebra that one obtains. We give necessary and sufficient conditions on the bilinear mapping φ for the algebra (X,φ) to have a completely isometric representation as an algebra of operators on some Hilbert space. In particular, we give an elegant geometrical characterization of such products by using the Haagerup tensor product. Our result makes no assumptions about identities or approximate identities. Our proof is independent of the earlier result of Blecher, Ruan and Sinclair [D.P. Blecher, Z.-J. Ruan, A.M. Sinclair, A characterization of operator algebras, J. Funct. Anal. 89 (1) (1990) 188-201] which solved the case when the bilinear mapping has an identity of norm one, and our result is used to give a simple direct proof of this earlier result. We also develop further the connections between quasi-multipliers of operator spaces and their representations on a Hilbert space or their embeddings in the second dual, and show that the quasi-multipliers of operator spaces defined in [M. Kaneda, V.I. Paulsen, Quasi-multipliers of operator spaces, J. Funct. Anal. 217 (2) (2004) 347-365] coincide with their C^∗-algebraic counterparts.     

Rational curve with Galois point and extendable Galois automorphism

Let G be the Galois group of a Galois point for a plane curve C. An element of G induces a birational transformation of C. We study if it can be extended to a projective or birational transformation of the plane. In the course of the study we give the defining equation of a rational curve with the Galois point. Furthermore, we introduce a special birational transformation in order to make the defining equation into a simpler form.     

Computing optimal islands

Let S be a bicolored set of n points in the plane. A subset I of S is an island if there is a convex set C such that I=C∩S. We give an O(n³)-time algorithm to compute a monochromatic island of maximum cardinality. Our approach is adapted to optimize similar (decomposable) objective functions. Finally, we use our algorithm to give an O(logn)-approximation for the problem of computing the minimum number of convex polygons that cover a class region.     

Interior graphs of maximal outerplane graphs

A maximal outerplane graph (mop) is a plane embedding of a graph in which all vertices lie on the exterior face, and the addition of an edge between any two vertices would destroy this outerplanarity property. Removing the edges of the exterior face of a mop G results in the interior graph of G. We give a necessary and sufficient condition for a graph to be the interior graph of some mop.     

Forcing faces in plane bipartite graphs

Let Ω denote the class of connected plane bipartite graphs with no pendant edges. A finite face s of a graph G∈Ω is said to be a forcing face of G if the subgraph of G obtained by deleting all vertices of s together with their incident edges has exactly one perfect matching. This is a natural generalization of the concept of forcing hexagons in a hexagonal system introduced in Che and Chen [Forcing hexagons in hexagonal systems, MATCH Commun. Math. Comput. Chem. 56 (3) (2006) 649-668]. We prove that any connected plane bipartite graph with a forcing face is elementary. We also show that for any integers n and k with n?4 and n?k?0, there exists a plane elementary bipartite graph such that exactly k of the n finite faces of G are forcing. We then give a shorter proof for a recent result that a connected cubic plane bipartite graph G has at least two disjoint M-resonant faces for any perfect matching M of G, which is a main theorem in the paper [S. Bau, M.A. Henning, Matching transformation graphs of cubic bipartite plane graphs, Discrete Math. 262 (2003) 27-36]. As a corollary, any connected cubic plane bipartite graph has no forcing faces. Using the tool of Z-transformation graphs developed by Zhang et al. [Z-transformation graphs of perfect matchings of hexagonal systems, Discrete Math. 72 (1988) 405-415; Plane elementary bipartite graphs, Discrete Appl. Math. 105 (2000) 291-311], we characterize the plane elementary bipartite graphs whose finite faces are all forcing. We also obtain a necessary and sufficient condition for a finite face in a plane elementary bipartite graph to be forcing, which enables us to investigate the relationship between the existence of a forcing edge and the existence of a forcing face in a plane elementary bipartite graph, and find out that the former implies the latter but not vice versa. Moreover, we characterize the plane bipartite graphs that can be turned to have all finite faces forcing by subdivisions.     

Extension of continuous functions in digital spaces with the Khalimsky topology

The digital space Zn equipped with Efim Khalimsky's topology is a connected space. We study continuous functions Zn⊃A→Z, from a subset of Khalimsky n-space to the Khalimsky line. We give necessary and sufficient condition for such a function to be extendable to a continuous function Zn→Z. We classify the subsets A of the digital plane such that every continuous function A→Z can be extended to a continuous function on the whole plane.     

A generalization of outerplanar graphs

Let G be a planar graph and W a set of vertices, G is W-outerplanar if it can be embedded in the plane so that all vertices of W lie on the exterior face. We give a characterization of these graphs by forbidden subgraphs, an upper bound on the number of edges, and other properties which lead to an algorithm of W-outerplanarity testing.     

Existence and convergence of best proximity points

Consider a self map T defined on the union of two subsets A and B of a metric space and satisfying T(A)⊆B and T(B)⊆A. We give some contraction type existence results for a best proximity point, that is, a point x such that d(x,Tx)=dist(A,B). We also give an algorithm to find a best proximity point for the map T in the setting of a uniformly convex Banach space.     

On crossing numbers of geometric proximity graphs

Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, namely, the k-nearest neighbor graph, the k-relative neighborhood graph, the k-Gabriel graph and the k-Delaunay graph. For k=0 (k=1 in the case of the k-nearest neighbor graph) these graphs are plane, but for higher values of k in general they contain crossings. In this paper, we provide lower and upper bounds on their minimum and maximum number of crossings. We give general bounds and we also study particular cases that are especially interesting from the viewpoint of applications. These cases include the 1-Delaunay graph and the k-nearest neighbor graph for small values of k.     

Classification of seven-point four-distance sets in the plane

A point set X in the plane is called a k-distance set if there are exactly k different distances between two distinct points in X. In this paper, we classify 7-point 4-distance sets and show that there are forty two 7-point 4-distance sets in the plane up to isomorphism, we also give some results about diameter graphs.     

The butterfly decomposition of plane trees

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition, which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one correspondence between doubly rooted plane trees and free Dyck paths, which implies a simple derivation of a relation between the Catalan numbers and the central binomial coefficients. We also establish a one-to-one correspondence between leaf-colored doubly rooted plane trees and free Schröder paths. The classical Chung-Feller theorem as well as some generalizations and variations follow quickly from the butterfly decomposition. We next obtain two involutions on free Dyck paths and free Schröder paths, leading to parity results and combinatorial identities. We also use the butterfly decomposition to give a combinatorial treatment of Klazar's generating function for the number of chains in plane trees. Finally we study the total size of chains in plane trees with n edges and show that the average size of such chains tends asymptotically to (n+9)/6.     

Contractive maps on normed linear spaces and their applications to nonlinear matrix equations

In this paper we will give necessary and sufficient conditions under which a map is a contraction on a certain subset of a normed linear space. These conditions are already well known for maps on intervals in R. Using the conditions and Banach’s fixed point theorem we can prove a fixed point theorem for operators on a normed linear space. The fixed point theorem will be applied to the matrix equation X = I_n + A^∗f(X)A, where f is a map on the set of positive definite matrices induced by a real valued map on (0, ∞). This will give conditions on A and f under which the equation has a unique solution in a certain set. We will consider two examples of f in detail. In one example the application of the fixed point theorem is the first step in proving that the equation has a unique positive definite solution under the conditions on A.     

Eigenvalue location using certain matrix functions and geometric curves

The main inertia theorem gives necessary and sufficient conditions that an n×n complex matrix A have no eigenvalues on the imaginary axis of the complex plane. In this paper corresponding necessary and sufficient conditions are given that A have no eigenvalues on any arbitrary circle, line, and certain other curves in the complex plane. Generalizations of the second part of the main inertia theorem give inclusion regions for the eigenvalues of A.     

The weakest contractive conditions for Edelstein’s mappings to have a fixed point in complete metric spaces

In this paper, we give the answer to the following problem: Let (X, d) be a complete metric space and let T be a mapping on X satisfying \(d(Tx, Ty) < d(x, y)\) for any \(x, y \in X\) with \(x \ne y\). Then what are the weakest additional assumptions to imply the same conclusion as in the Banach contraction principle?     

A characterization of classical Minkowski planes over a perfect field of characteristic two

We give a new set of axioms defining the concept of (B^*)-plane (i.e. Minkowski plane without the tangency property) and we show that every (B^*)-plane in which a condition similar to the “Fano condition” of Heise and Karzel (see [5, § 3]) holds, is a Minkowski plane over a perfect field of characteristic two. In particular, every finite (B^*)-plane of even order is a Minkowski plane over a field. Consequences for strictly 3-transitive groups are derived from the preceding results; in particular, every strictly 3-transitive set of permutations of odd degree containing the identity is a protective group PGL₂(GF(2 ⁿ )) over a finite field GF(2 ⁿ , for some positive integer n.