Related papers: Segmenti paralleli
Let $\pi:E\to M$ be a vector bundle over a simply connected manifold and $\nabla$ a linear connection in $\pi$. Let $\sigma: U \rightarrow E$ be a $\nabla$-parallel section of $\pi$ defined on a connected open subset $U$ of $M$. We give…
This paper surveys recent analytical and numerical research on linear problems for the integral fractional Laplacian, fractional obstacle problems, and fractional minimal graphs. The emphasis is on the interplay between regularity,…
Recently, Andrews considered the partitions with parts separated by parity, in which parts of a given parity are all smaller than those of the other parity. Inspired from the partitions with parts separated by parity, we investigate the…
A set of n segments in the plane may form a Euclidean TSP tour, a tree, or a matching, among others. Optimal TSP tours as well as minimum spanning trees and perfect matchings have no crossing segments, but several heuristics and…
The edge-length ratio of a straight-line drawing of a graph is the ratio between the lengths of the longest and of the shortest edge in the drawing. The planar edge-length ratio of a planar graph is the minimum edge-length ratio of any…
Line planning, i.e. choosing paths which are operated by one vehicle end-to-end, is an important aspect of public transport planning. While there exists heuristic procedures for generating lines from scratch, most theoretical observations…
We study the problem of approximation of 2D set of points. Such type of problems always occur in physical experiments, econometrics, data analysis and other areas. The often problems of outliers or spikes usually make researchers to apply…
We consider the problem of simultaneous detection and estimation under a sequential framework. In particular we are interested in sequential tests that distinguish between the null and the alternative hypothesis and every time the decision…
We prove that the following problem is complete for the existential theory of the reals: Given a planar graph and a polygonal region, with some vertices of the graph assigned to points on the boundary of the region, place the remaining…
An intersecting $r$-uniform straight line system is an intersecting linear system whose lines consist of $r$ points on straight line segment of $\mathbb{R}^2$ and any two lines share a point. Recently, the author [A. V\'azquez-\'Avila,…
A graph $G$ with vertex set $\{v_1,v_2,\ldots,v_n\}$ is an intersection graph of segments if there are segments $s_1,\ldots,s_n$ in the plane such that $s_i$ and $s_j$ have a common point if and only if $\{v_i,v_j\}$ is an edge of~$G$. In…
The doorways problem considers adjacent parallel hallways of unit width each with a single doorway (aligned with integer lattice points) of unit width. It then asks, what are the properties of lines that pass through each doorway?…
Three lines are concurrent if they intersect at a single point. In this paper I prove that if $F$ is a bounded family of compact connected sets in the plane, such that every three sets in $F$ can be pierced by a single line, then there…
The problem of extending partial geometric graph representations such as plane graphs has received considerable attention in recent years. In particular, given a graph $G$, a connected subgraph $H$ of $G$ and a drawing $\mathcal{H}$ of $H$,…
The general problem for consistency between arbitrary transports along paths in fibre bundles and bundle morphisms between them is formulated and investigated. The special case of one fibre bundle, its morphism and transport along paths…
Computing the crossing number of a graph is one of the most classical problems in computational geometry. Both it and numerous variations of the problem have been studied, and overcoming their frequent computational difficulty is an active…
In multistage perfect matching problems we are given a sequence of graphs on the same vertex set and asked to find a sequence of perfect matchings, corresponding to the sequence of graphs, such that consecutive matchings are as similar as…
In this paper we first study the isoperimetric problem in the case of integer triangles, as well as Alcuin's sequence and how it relates to the number of different integer triangles with a given perimeter. We then present and compare two…
Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove that every reflexive directed graph can be interpreted as a program…
To solve many problems on graphs, graph traversals are used, the usual variants of which are the depth-first search and the breadth-first search. Implementing a graph traversal we consequently reach all vertices of the graph that belong to…