Related papers: Piecewise-linear pseudodiagrams
The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every edge is realized as a y-monotone curve. In the variant…
The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the…
Computing cohesive subgraphs is a central problem in graph theory. While many formulations of cohesive subgraphs lead to NP-hard problems, finding a densest subgraph can be done in polynomial time. As such, the densest subgraph model has…
Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solutions to L. Meeks and Treglown showed that for certain kinds of linear equations, it is NP-complete to decide if a given set of integers…
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
We consider the problem of shadowing for differential equations with grow-up. We introduce so-called nonuniform shadowing properties (in which size of the error depends on the point of the phase space) and prove for them analogs of…
Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper we show that several NP-hard zero forcing numbers are not…
For solving a wide class of nonconvex and nonsmooth problems, we propose a proximal linearized iteratively reweighted least squares (PL-IRLS) algorithm. We first approximate the original problem by smoothing methods, and second write the…
The solutions to a large class of semi-linear parabolic PDEs are given in terms of expectations of suitable functionals of a tree of branching particles. A sufficient, and in some cases necessary, condition is given for the integrability of…
In the Segment Intersection Graph Representation Problem, we want to represent the vertices of a graph as straight line segments in the plane such that two segments cross if and only if there is an edge between the corresponding vertices.…
Given a graph $F$, we consider the problem of determining the densest possible pseudorandom graph that contains no copy of $F$. We provide an embedding procedure that improves a general result of Conlon, Fox, and Zhao which gives an upper…
The paper studies the problem of prescribing positive cross curvature on the three-dimensional sphere. We produce several existence results and an example of non-uniqueness, disproving a conjecture of Hamilton's.
Second order partial differential equations which describe spherical surfaces (ss) or pseudospherical surfaces (pss) are considered. These equations are equivalent to the structure equations of a metric with Gaussian curvature $K = 1$ or $K…
The subset sum problem is one of the simplest and most fundamental NP-hard problems in combinatorial optimization. We consider two extensions of this problem: The subset sum problem with digraph constraint (SSG) and subset sum problem with…
In this paper, we first consider the pseudoprimeness of meromorphic solutions $u$ to a family of partial differential equations (PDEs) $H(u_{z_1},u_{z_2},\ldots,u_{z_n})=P(u)$ of Waring's-problem form, where $H(z_1,z_2,\ldots,z_n)$ is a…
In this work we study weighted total least squares problems on infinite dimensional spaces. We show that in most cases this problem does not admit a solution (except in the trivial case) and then, we consider a regularization on the…
We extend a recently developed method to solve semi-linear PDEs to the case of a degenerated diffusion. Being a pure Monte Carlo method it does not suffer from the so called curse of dimensionality and it can be used to solve problems that…
Third order equations, which describe spherical surfaces (ss) or pseudospherical surfaces (pss), of the form \[ \nu\,z_{t}-\lambda\,z_{xxt}=A(z,z_{x},z_{xx})\,z_{xxx}+B(z,z_{x},z_{xx}) \] with $\nu$, $\lambda$ $\in$ $\mathbb{R}$,…
We explore two questions about pseudo-polynomials, which are functions $f:\mathbb N \to \mathbb Z$ such that $k$ divides $f(n+k) - f(n)$ for all $n,k$. First, for certain arbitrarily sparse sets $R$, we construct pseudo-polynomials $f$ with…
We are concerned with split graphs and pseudo-split graphs whose complements are isomorphic to themselves. These special subclasses of self-complementary graphs are actually the core of self-complementary graphs. Indeed, we show that all…