Related papers: Certified surface approximations using the interva…
We give a complete classification of Riemannian and Lorentzian surfaces of arbitrary codimension in a pseudo-sphere whose pseudo-spherical Gauss maps are of 1-type or, in particular, harmonic. In some cases a concrete global classification…
In classical differential geometry, a central question has been whether abstract surfaces with given geometric features can be realized as surfaces in Euclidean space. Inspired by the rich theory of embedded triply periodic minimal…
The aim of this paper is to prove that every continuous map from a compact subset of a real algebraic variety into a sphere can be approximated by piecewise-regular maps of class C^k, where k is an arbitrary integer.
We present an algorithm that covers any given rational ruled surface with two rational parametrizations. In addition, we present an algorithm that transforms any rational surface parametrization into a new rational surface parametrization…
In our earlier work \cite{KZ}, we introduced an analytic regularizability theory for smooth strictly pseudoconvex hypersurfaces in complex space. That is, we found a necessary and sufficient condition for a hypersurface to be CR-equivalent…
We build on recent work by B. Brown (Sci. Adv. 6, eaay4929 (2020)) to develop and simulate an explicit recipe for a just-in-time decoding scheme in three 3D surface codes, which can be used to implement a transversal (non-Clifford)…
Let $k$ be either a number a field or a function field over $\mathbb{Q}$ with finitely many variables. We present a practical algorithm to compute the geometric Picard lattice of a K3 surface over $k$ of degree $2$, i.e., a double cover of…
We compute the constant of approximation for an arbitrary rational point on an arbitrary smooth cubic hypersurface $X$ over a number field $k$, provided that there is a $k$-rational line somewhere on $X$. In the process, we verify the Coba…
In this paper, we consider the colorful $k$-center problem, which is a generalization of the well-known $k$-center problem. Here, we are given red and blue points in a metric space, and a coverage requirement for each color. The goal is to…
The analysis of scattering from complex objects using surface integral equations is a challenging problem. Its resolution has wide ranging applications- from crack propagation to diagnostic medicine. The two ingredients of any integral…
We discuss an algorithm for the exact sampling of vectors v in [0,1]^N satisfying a set of pairwise difference inequalities. Applications include the exact sampling of skew Young Tableaux, of configurations in the Bead Model, and of…
We consider a mechanical system with impact and n degrees of freedom, written in generalized coordinates. The system is not necessarily Lagrangian. The representative point of the system must remain inside a set of constraints K; the…
This paper analyzes the computational complexity of validated interval methods for uncertain nonlinear systems and steady-state enclosure. Interval analysis produces guaranteed enclosures that account for uncertainty and round-off, but its…
We study a version of the randomized Kaczmarz algorithm for solving systems of linear equations where the iterates are confined to the solution space of a selected subsystem. We show that the subspace constraint leads to an accelerated…
This short study presents an opportunistic approach to a (more) reliable validation method for prediction uncertainty average calibration. Considering that variance-based calibration metrics (ZMS, NLL, RCE...) are quite sensitive to the…
A novel approach is introduced to a very widely occurring problem, providing a complete, explicit resolution of it: minimisation of a convex quadratic under a general quadratic, equality or inequality, constraint. Completeness comes via…
In this paper, we develop a two-stage distributed algorithm that enables nodes in a graph to cooperatively estimate the spectrum of a matrix $W$ associated with the graph, which includes the adjacency and Laplacian matrices as special…
To what extent are two images picturing the same 3D surfaces? Even when this is a known scene, the answer typically requires an expensive search across scale space, with matching and geometric verification of large sets of local features.…
We give a general unified method that can be used for $L_1$ {\em closeness testing} of a wide range of univariate structured distribution families. More specifically, we design a sample optimal and computationally efficient algorithm for…
Clique-width is one of the graph complexity measures leading to polynomial special-case algorithms for generally NP-complete problems, e.g. graph colourability. The best two currently known algorithms for verifying c-colourability of graphs…