相关论文: Tightness and computing distances in the curve com…

Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…

This article continues the study of computable elementary topology started by the author and T. Grubba in 2009 and extends the author's 2010 study of axioms of computable separation. Several computable T3- and Tychonoff separation axioms…

The subject of this paper is the problem of arrangement of real algebraic curves on real algebraic surfaces. In this paper we extend Rokhlin, Kharlamov-Gudkov-Krakhnov and Kharlamov-Marin congruences for curves on surfaces and give some…

We apply the Ramsey theory to the analysis of geometrical properties of closed contours. Consider a set of six points placed on a closed contour. The straight lines connecting these points are y_ik (x)={\alpha}_ik x+\b{eta}_ik (i,k=1...6),…

We investigate the geometry of holomorphic curves and complex surfaces from the perspective of singularity theory. We show that, with a suitable choice of a complex bilinear symmetric form, the families of functions and mappings that…

We apply topological methods and a Lusternik-Schnirelmann-type approach to prove existence results for closed geodesics of Finsler metrics on spheres and projective spaces. The main tool in the proofs are spherical complexities, which have…

In this paper we give a detailed proof of a result we announced a year ago. This result is an effective version of the theorem of Mazur-Kamienny-Merel concerning uniform bounds for rational torsion points on elliptic curves over number…

We prove that the non-separating curve complex of every surface of finite type and genus at least three admits an exhaustion by finite rigid sets.

We provide an algorithm of constructing a rectifiable curve between two sufficiently close points of a proximally smooth set in a uniformly convex and uniformly smooth Banach space. Our algorithm returns a reasonably short curve between two…

This paper provides a non-standard analogue of Bezout's theorem. This is acheived by showing that, in all characteristics, the notion of Zariski multiplicity coincides with intersection multiplicity when we consider the full families of…

An approach for the computation of upper bounds on the size of large complete arcs is presented. We obtain in particular geometrical properties of irreducible envelopes associated to a second largest complete arc provided that the order of…

Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the…

We prove distance bounds for graphs possessing positive Bakry-\'Emery curvature apart from an exceptional set, where the curvature is allowed to be non-positive. If the set of non-positively curved vertices is finite, then the graph admits…

A closed quasigeodesic on a convex polyhedron is a closed curve that is locally straight outside of the vertices, where it forms an angle at most $\pi$ on both sides. While the existence of a simple closed quasigeodesic on a convex…

We consider embedded, smooth curves in the plane which are either closed or asymptotic to two lines. We study their behaviour under curve shortening flow with a global forcing term. Firstly, we prove an analogue to Huisken's distance…

We establish sharp estimates for the convergence rate of the Kranosel'ski\v{\i}-Mann fixed point iteration in general normed spaces, and we use them to show that the asymptotic regularity bound recently proved in [11] (Israel Journal of…

We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…

We introduce a new type of distinct distances result: a lower bound on the number of distances between points on a line and points on a two-dimensional strip. This can be seen as a generalization of the well-studied problems of distances…

Quantum invariants in low dimensional topology offer a wide variety of valuable invariants of knots and 3-manifolds, presented by explicit formulas that are readily computable. Their computational complexity has been actively studied and is…

We study the geometry of the space of rational curves on smooth complete intersections of low degree, which pass through a given set of points on the variety. The argument uses spreading out to a finite field, together with an adaptation to…