Related papers: Characterization theorem for best polynomial splin…

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…

We prove an embedded local uniformization theroem for a valuation centered on a point of a quasi-excellent scheme of characteristic zero. The proof reduces to valuations of rank 1 and consists in desingularizing the ideal formed by the…

This is a survey on best polynomial approximation on the unit sphere and the unit ball. The central problem is to describe the approximation behavior of a function by polynomials via smoothness of the function. A major effort is to identify…

We consider the best constant in a critical Sobolev inequality of second order. We show non-rigidity for the optimizers above a certain threshold, namely we prove that the best constant is achieved by a non-constant solution of the…

The paper is devoted to an analysis of a new constraint qualification and a derivation of the strongest existing optimality conditions for nonsmooth mathematical programming problems with equality and inequality constraints in terms of…

This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…

We propose an alternative to $k$-nearest neighbors for functional data whereby the approximating neighboring curves are piecewise functions built from a functional sample. Using a locally defined distance function that satisfies…

We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…

We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…

We obtain new lower bounds of the minimal genus of a locally flat surface representing a 2-dimensional homology class in a topological 4-manifold with boundary, using the von Neumann-Cheeger-Gromov $\rho$-invariant. As an application our…

We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…

This paper studies best finitely supported approximations of one-dimensional probability measures with respect to the $L^r$-Kantorovich (or transport) distance, where either the locations or the weights of the approximations' atoms are…

In this paper, pursuing the same line of ideas in the proof of an old longstanding open conjecture of \emph{Kadison-Singer} , we introduce a key lemma which we call it the interlacing lemma which indicates a necessary condition for having a…

A slope $p/q$ is characterising for a knot $K \subset \mathbb{S}^3$ if the orientation-preserving homeomorphism type of the manifold $\mathbb{S}^3_K(p/q)$ obtained by performing Dehn surgery of slope $p/q$ along $K$ uniquely determines the…

In this paper we show that, with respect to the $L^2$ norm, three classes of functions in $H^r(0,1)$, defined by certain boundary conditions, admit optimal spline spaces of all degrees $\geq r-1$, and all these spline spaces have uniform…

We consider a generalisation of Ulam's method for approximating invariant densities of one-dimensional chaotic maps. Rather than use piecewise constant polynomials to approximate the density, we use polynomials of degree n which are defined…

In this paper, we use skein-theoretic techniques to classify all virtual knot polynomials and trivalent graph invariants with certain smallness conditions. The first half of the paper classifies all virtual knot polynomials giving…

The existence of topologically slice knots that are of infinite order in the knot concordance group followed from Freedman's work on topological surgery and Donaldson's gauge theoretic approach to 4-manifolds. Here, as an application of…

Penalized spline smoothing is a popular and flexible method of obtaining estimates in nonparametric regression but the classical least-squares criterion is highly susceptible to model deviations and atypical observations. Penalized spline…