Related papers: An improved algorithm for Generalized \v{C}ech com…
We develop the first constructive algorithms for compiling single-qubit unitary gates into circuits over the universal $V$ basis. The $V$ basis is an alternative universal basis to the more commonly studied $\{H,T\}$ basis. We propose two…
We call complex quasifold of dimension k a space that is locally isomorphic to the quotient of an open subset of the space C^k by the holomorphic action of a discrete group; the analogue of a complex torus in this setting is called a…
We study the \emph{complex-valued} solutions to the Cauchy problem of the modified Korteweg-de Vries equation on the real line. To study the low-regularity problems, we employ a generalized Fourier-Lebesgue space…
In this work, we develop a fully implicit Hybrid High-Order algorithm for the Cahn-Hilliard problem in mixed form. The space discretization hinges on local reconstruction operators from hybrid polynomial unknowns at elements and faces. The…
The aim of this paper is to establish a theory of Galerkin approximations to the space of convex and compact subsets of $\R^d$ with favorable properties, both from a theoretical and from a computational perspective. These Galerkin spaces…
Abstract geometrical computation can solve hard combinatorial problems efficiently: we showed previously how Q-SAT can be solved in bounded space and time using instance-specific signal machines and fractal parallelization. In this article,…
We discuss construction of coverings of the unit ball of a finite dimensional Banach space. The well known technique of comparing volumes gives upper and lower bounds on covering numbers. This technique does not provide a construction of…
Demixing is the problem of identifying multiple structured signals from a superimposed observation. This work analyzes a general framework, based on convex optimization, for solving demixing problems. We present a new solution to determine…
A general structure is developed from which a system of integrable partial difference equations is derived generalising the lattice KdV equation. The construction is based on an infinite matrix scheme with as key ingredient a (formal)…
We compute the homology of random \v{C}ech complexes over a homogeneous Poisson process on the d-dimensional torus, and show that there are, coarsely, two phase transitions. The first transition is analogous to the Erd\H{o}s-R\'enyi phase…
We present a hybrid algorithm for optimizing a convex, smooth function over the cone of positive semidefinite matrices. Our algorithm converges to the global optimal solution and can be used to solve general large-scale semidefinite…
In this paper we develop an evolution of the $C^1$ virtual elements of minimal degree for the approximation of the Cahn-Hilliard equation. The proposed method has the advantage of being conforming in $H^2$ and making use of a very simple…
In this thesis, a new approach for constructing subdivision algorithms for generalized quadratic and cubic B-spline subdivision for subdivision surfaces and volumes is presented. First, a catalog of quality criteria for these subdivision…
In this paper, we show that the popular K-means clustering problem can equivalently be reformulated as a conic program of polynomial size. The arising convex optimization problem is NP-hard, but amenable to a tractable semidefinite…
We present a detailed description of the generalized geometric cluster algorithm for the efficient simulation of continuum fluids. The connection with well-known cluster algorithms for lattice spin models is discussed, and an explicit full…
Let $G\subseteq GL(n)$ be a finite group without pseudo-reflections. We present an algorithm to compute and verify a candidate for the Cox ring of a resolution $X\rightarrow \mathbb{C}^n/G$, which is based just on the geometry of the…
Given a set of $n$ points in the plane, the Unit Disk Cover (UDC) problem asks to compute the minimum number of unit disks required to cover the points, along with a placement of the disks. The problem is NP-hard and several approximation…
We present an optimization procedure for generic polygonal or polyhedral meshes, tailored for the Virtual Element Method (VEM). Once the local quality of the mesh elements is analyzed through a quality indicator specific to the VEM, groups…
Geometric rounding of a mesh is the task of approximating its vertex coordinates by floating point numbers while preserving mesh structure. Geometric rounding allows algorithms of computational geometry to interface with numerical…
The totally-real embeddability of any $2k$-dimensional compact manifold $M$ into $\mathbb C^n$, $n\geq 3k$, has several consequences: the genericity of polynomially convex embeddings of $M$ into $\mathbb C^n$, the existence of $n$ smooth…