Related papers: Computable planar paths intersect in a computable …
A graph is IC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share no common end vertex. IC-planarity specializes both NIC-planarity, which allows a pair of crossing…
We study the orbits of a polynomial f in C[X], namely the sets {e,f(e),f(f(e)),...} with e in C. We prove that if nonlinear complex polynomials f and g have orbits with infinite intersection, then f and g have a common iterate. More…
In this paper we develop a technique of constructing uni- formly continuous maps between function spaces Cp(X) endowed with the pointwise topology. We prove that if a space X is compact metrizable and strongly countable-dimensional, then…
Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a…
We consider planar quadrangulations with three marked vertices and discuss the geometry of triangles made of three geodesic paths joining them. We also study the geometry of minimal separating loops, i.e. paths of minimal length among all…
Given a projective intersection of two quadrics X in at least 9 variables, the quantitative behaviour of the rational points on X is investigated under the assumption that X contains a pair of conjugate singular points defined over the…
We give a construction of singular curves with many rational points over finite fields. This construction enables us to prove some results on the maximum number of rational points on an absolutely irreducible projective algebraic curve…
The identification of the interfacial molecules in fluid-fluid equilibrium is a long-standing problem in the area of simulation. We here propose a new point of view, making use of concepts taken from the field of computational geometry,…
In this article, we study isomorphisms between complements of irreducible curves in the projective plane $\mathbb{P}^2$, over an arbitrary algebraically closed field. Of particular interest are rational unicuspidal curves. We prove that if…
A major open problem in computational complexity is the existence of a one-way function, namely a function from strings to strings which is computationally easy to compute but hard to invert. Levin (2023) formulated the notion of one-way…
A path in a graph $G$ is called non-self-touching if two vertices are neighbours in the path if and only if they are neighbours in the graph. We investigate the existence of doubly infinite non-self-touching paths in infinite plane graphs.…
Let $G$ be a graph with an even number of vertices. The matching preclusion number of $G$, denoted by $mp(G)$, is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching. We introduced a $0$-$1$…
This paper first gives a brief overview over some interesting descriptions of conic sections, showing formulations in the three geometric algebras of Euclidean spaces, projective spaces, and the conformal model of Euclidean space. Second…
Let $A$ be a closed affine subspace and let $B$ be a hyperplane in a Hilbert space. Suppose we are given their associated nearest point mappings $P_A$ and $P_B$, respectively. We present a formula for the projection onto their intersection…
Let $F$ be a (possibly improper) edge-coloring of a graph $G$; a vertex coloring of $G$ is \emph{adapted to} $F$ if no color appears at the same time on an edge and on its two endpoints. If for some integer $k$, a graph $G$ is such that…
Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…
On an $r\times (n-r)$ lattice rectangle, we first consider walks that begin at the SW corner, proceed with unit steps in either of the directions E or N, and terminate at the NE corner of the rectangle. For each integer $k$ we ask for…
We propose an exact algorithm for solving the longest simple path problem between two given vertices in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster…
Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…