Related papers: Curves That Must Be Retraced

In this paper, we study the relations between the numerical structure of the optimal solutions of a convex programming problem defined on the edge set of a simple graph and the stability number (i.e. the maximum size of a subset of pairwise…

A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges. We show that optimal 1-planar graphs can be recognized in linear time. Our…

Let $f$ be a plane curve. We give a procedure based on Abhyankar's approximate roots to detect if it has a single place at infinity, and if so construct its associated $\delta$-sequence, and consequently its value semigroup. Also for fixed…

We show that every smooth projective curve over a finite field k admits a finite tame morphism to the projective line over k. Furthermore, we construct a curve with no such map when k is an infinite perfect field of characteristic two. Our…

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…

We present a deterministic linear-time algorithm for finding an odd cycle through two specified vertices in an undirected graph. This is shown in a generalized form as follows: Let $\Gamma$ be any group in which every element is of order at…

It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…

Quantum symmetry of a graph $C^{*}$-algebra $C^{*}(\Gamma)$ corresponding to a finite graph $\Gamma$ has been explored by several mathematicians within different categories in the past few years. In this article, we establish that there are…

We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs $G$, either (i) there is a countably-infinite tournament $K$ such that $G\not\subseteq K$, or (ii)…

In this note, we prove that for every $0<\sigma<1$, there exists a smooth complete hypersurface $\Sigma$ in $\mathbb{H}^{n+1}$ with prescribed asymptotic boundary $\partial \Sigma=\Gamma$ at infinity, whose principal curvatures…

We are concerned with the behavior of the polynomial maps $F=(P,Q)$ of $\mathbb{C}^2$ with finite fibres and satisfying the condition that all of the curves $aP+bQ=0$, $(a:b)\in \mathbb{P}^1$, are irreducible rational curves. The obtained…

We prove that if $\Omega$ is a simply connected quadrature domain for a distribution with compact support and the infinity point belongs the boundary, then the boundary has an asymptotic curve that is either a straight line or a parabola or…

By a curve in R^d we mean a continuous map gamma:I -> R^d, where I is a closed interval. We call a curve gamma in R^d at most k crossing if it intersects every hyperplane at most k times (counted with multiplicity). The at most d crossing…

A geometric graph is a drawing of a graph in the plane where the vertices are drawn as points in general position and the edges as straight-line segments connecting their endpoints. It is plane if it contains no crossing edges. We study…

P-time event graphs are discrete event systems able to model cyclic production systems where tasks need to be performed within given time windows. Consistency is the property of admitting an infinite execution of such tasks that does not…

Let $f$ be a polynomial automorphism of the affine plane. In this paper we consider the possibility for it to possess infinitely many periodic points on an algebraic curve $C$. We conjecture that this happens if and only if $f$ admits a…

We prove that if $\Gamma$ is a finite connected vertex-transitive cubic graph, then either $|V\Gamma| \le 90$, or $\Gamma$ is a split Praeger--Xu graph, or there exist two vertices $\alpha$ and $\beta$ such that the identity is the only…

In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…

The local Lipschitz property is shown for the graph avoiding multiple point intersection with lines directed in a given cone. The assumption is much stronger than those of Marstrand's well-known theorem, but the conclusion is much stronger…

Let $G$ be a finite simple non-complete connected graph on $\{1, \ldots, n\}$ and $\kappa(G) \geq 1$ its vertex connectivity. Let $f(G)$ denote the number of free vertices of $G$ and $\mathrm{diam}(G)$ the diameter of $G$. Being motivated…