Related papers: Computational analytic continuation
The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…
Extracting useful information from large data sets can be a daunting task. Topological methods for analyzing data sets provide a powerful technique for extracting such information. Persistent homology is a sophisticated tool for identifying…
Analytic continuation problems are notoriously ill-posed without additional regularizing constraints, even though every analytic function has a rigidity property of unique continuation from every curve inside the domain of analyticity. In…
Let D be a strictly convex domain and X be a singular analytic subset of C^2 such that the intersection of X and D is non empty. We give conditions under which a function holomophic on the intersection of X and D can be extended…
Computational topology provides a tool, persistent homology, to extract quantitative descriptors from structured objects (images, graphs, point clouds, etc). These descriptors can then be involved in optimization problems, typically as a…
We study the analytic continuation problem for a germ of a biholomorphic mapping from a non-minimal real hypersurface $M\subset\CC{n}$ into a real hyperquadric $\mathcal Q\subset\CP{n}$ and prove that under certain non-degeneracy conditions…
The subject of persistent homology has vitalized applications of algebraic topology to point cloud data and to application fields far outside the realm of pure mathematics. The area has seen several fundamentally important results that are…
In a previous paper, a process algebra based on ACP (Algebra of Communicating Processes) was proposed in which processes involving data can be handled by means of features originating from imperative programming. In this paper, an extension…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
We study the question of constructive approximation of the harmonic measure $\omega_x^\Omega$ of a connected bounded domain $\Omega$ with respect to a point $x\in\Omega$. In particular, using a new notion of computable harmonic…
Hamiltonian Monte Carlo has emerged as a standard tool for posterior computation. In this article, we present an extension that can efficiently explore target distributions with discontinuous densities. Our extension in particular enables…
Persistent (co)homology is a central construction in topological data analysis, where it is used to quantify prominence of features in data to produce stable descriptors suitable for downstream analysis. Persistence is challenging to…
We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…
We construct a complex entire function with arbitrary number of variables which has the following property: The infinite set consisting of all the values of all its partial derivatives of any orders at all algebraic points, including zero…
Gosper developed an algorithm for performing arithmetic on continued fractions (CFs), and introduced continued logarithms (CLs) as a variant of continued fractions better suited to representing extremely large (or small) numbers. CLs are…
A complex-analytic structure within the unit disk of the complex plane is presented. It can be used to represent and analyze a large class of real functions. It is shown that any integrable real function can be obtained by means of the…
While topological data analysis has emerged as a powerful paradigm for structural inference, its foundational tools, notably persistent homology and the persistent Laplacian, are frequently insensitive to localized structural fluctuations…
In the model of \emph{local computation algorithms} (LCAs), we aim to compute the queried part of the output by examining only a small (sublinear) portion of the input. Many recently developed LCAs on graph problems achieve time and space…
We consider the quantum processor based on a chain of trapped ions to propose an architecture wherein the motional degrees of freedom of trapped ions (position and momentum) could be exploited as the computational Hilbert space. We adopt a…
Under very general conditions it is shown that if $A$ is a uniform algebra generated by real-analytic functions, then either $A$ consists of all continuous functions or else there exists a disc on which every function in $A$ is holomorphic.…