Related papers: Three-monotone interpolation
A function $f$ from a domain in $\mathbb{R}^3$ to the quaternions is said to be inframonogenic if $\overline{\partial}\, f\overline{\partial} =0$, where $\overline{\partial} = \partial/\partial x_0+ (\partial/\partial…
The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…
We study regularity of the time-delayed coordinate maps \[\phi_{h,k}(x) = (h(x), h(Tx), \ldots, h(T^{k-1}x))\] for a diffeomorphism $T$ of a compact manifold $M$ and smooth observables $h$ on $M$. Takens' embedding theorem shows that if $k…
Given a set $S$ of $n$ points in $\mathbb{R}^d$, a $k$-set is a subset of $k$ points of $S$ that can be strictly separated by a hyperplane from the remaining $n-k$ points. Similarly, one may consider $k$-facets, which are hyperplanes that…
Meshfree methods, including the reproducing kernel particle method (RKPM), have been widely used within the computational mechanics community to model physical phenomena in materials undergoing large deformations or extreme topology…
For any 3-monotone on $[a,b]$ function $f$ (its third divided differences are nonnegative for all choices of four distinct points, or equivalently, $f$ has a convex derivative on $(a,b)$) we construct a cubic 3-monotone (like $f$) spline…
The problem of minimizing the Potts energy function frequently occurs in computer vision applications. One way to tackle this NP-hard problem was proposed by Kovtun [19,20]. It identifies a part of an optimal solution by running $k$ maxflow…
A manifold is locally \emph{$k$-fold symmetric}, if for any point and any $k$-dimensional vector subspace tangent to this point there exists a local isometry such that this point is a fixed point and the differential of the isometry…
We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…
In submodular multiway partition (SUB-MP), the input is a non-negative submodular function $f:2^V \rightarrow \mathbb{R}_{\ge 0}$ given by an evaluation oracle along with $k$ terminals $t_1, t_2, \ldots, t_k\in V$. The goal is to find a…
We show that for any compact convex set $K$ in $\mathbb{R}^d$ and any finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$, if the intersection of every sufficiently small subfamily of $\mathcal{F}$ contains an isometric copy of $K$…
For a fixed $k$, this study considers $k$-partition minimization of submodular system $(V, f)$ with a finite set $V$ and symmetric submodular function $f: 2^{V} \mapsto \mathbb{R}$. Our algorithm uses the Queyranne's (1998) algorithm for…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…
A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…
Let a $2\pi$-periodic function $f\in\Bbb C$ changes its monotonicity at a finitely even number of points $y_i$ of the period. The degree of approximation of this $f$ by trigonometric polynomials which are comonotone with it, i.e. that…
Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite…
\emph{Koopman Regularization} is a constrained optimization-based method to learn the governing equations from sparse and corrupted samples of the vector field. \emph{Koopman Regularization} extracts a functionally independent set of…
We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…
We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…