Related papers: Piecewise-linear pseudodiagrams
A forcing set for a perfect matching of a graph is defined as a subset of the edges of that perfect matching such that there exists a unique perfect matching containing it. A complete forcing set for a graph is a subset of its edges, such…
It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…
We study smooth threefolds of the projective space of dimension 5 whose quadrisecant lines don't fill up the space. We give a complete classification of those threefolds X whose only quadrisecant lines are the lines contained in X. Then we…
We consider the problem of finding a Hamiltonian path or cycle with precedence constraints in the form of a partial order on the vertex set. We study the complexity for graph width parameters for which the ordinary problems…
The classical theory of the cross-ratio is a beautiful case study of the moduli of ordered points of the projective line and of invariants of the action of $PGL_2$. We generalize the theory of the cross-ratio to the setting of $S$-valued…
The relationship between nonnegative polynomials and sums of squares is a classical topic in real algebraic geometry. We study \emph{stubborn polynomials} $f$ on a real variety $X$, which are polynomials nonnegative on $X$, such that no odd…
The normal forms associated with holomorphic systems are well known in the literature. In this paper we are concerned about studying the piecewise smooth holomorphic systems (PWHS). Specifically, we classify the possible phase portraits of…
This paper develops meshless methods for probabilistically describing discretisation error in the numerical solution of partial differential equations. This construction enables the solution of Bayesian inverse problems while accounting for…
The purpose of this article is to show that even the most elementary problems in asymptotic extremal graph theory can be highly non-trivial. We study linear inequalities between graph homomorphism densities. In the language of quantum…
We show that for every second order Fuchsian linear differential equation $E$ with $n$ singularities of which $n-3$ are apparent there exists a hypergeometric equation $H$ and a linear differential operator with polynomial coefficients…
A theory of numerical path-following in toric varieties was suggested in two previous papers. The motivation is solving systems of polynomials with real or complex coefficients. When those polynomials are not assumed 'dense', solving them…
The $P_1$--nonconforming quadrilateral finite element space with periodic boundary condition is investigated. The dimension and basis for the space are characterized with the concept of minimally essential discrete boundary conditions. We…
In this paper subdivision schemes, which are used for functions approximation and curves generation, are considered. In classical case, for the functions defined on the real line, the theory of subdivision schemes is widely known due to…
Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\rm W[1]$-hard on general graphs, they have been shown to be fixed-parameter tractable on many sparse graph classes, including…
First, we derive explicit computable expressions of structured backward errors of approximate eigenelements of structured matrix polynomials including symmetric, skew-symmetric, Hermitian, skew-Hermitian, even and odd polynomials. We also…
Welschinger's invariant bounds from below the number of real rational curves through a given generic collection of real points in the real projective plane. We estimate this invariant using Mikhalkin's approach which deals with a…
In this paper we are concerned with determining lower bounds of the number of limit cycles for piecewise polynomial holomorphic systems with a straight line of discontinuity. We approach this problem with different points of view: study of…
The \emph{segment number} of a planar graph is the smallest number of line segments whose union represents a crossing-free straight-line drawing of the given graph in the plane. The segment number is a measure for the visual complexity of a…
We give a criterion for certain generic nondegenerate surfaces in a fake weighted projective $3$-space to have Picard number $>1$. These algebraic surfaces are of general type. We do this by considering degenerations (along an edge),…
We consider three dimensional piecewise linear cones in $\mathbb{R}^4$ that are mass minimizing w.r.t. Lipschitz maps in the sense of \cite{almgren1976existence} as in \cite{Taylor76}. There are three that arise naturally by taking products…