Related papers: A First Look at Chebyshev-Sobolev Series for Digit…
The Eynard-Orantin invariants of a plane curve are multilinear differentials on the curve. For a particular class of genus zero plane curves these invariants can be equivalently expressed in terms of simpler expressions given by polynomials…
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
The present work is a user's guide to the results of a previous paper by the second and third authors, where a description of the space of characters of a quasi-projective variety was given in terms of global quotient orbifold pencils.…
We introduce a signature inversion scheme for $C^1$-axial linear curves which are widely used in various areas. We show that in the presence of a linear coordinate function, the derivatives of the underlying curve at any point $x$ can be…
Recent successes in word embedding and document embedding have motivated researchers to explore similar representations for networks and to use such representations for tasks such as edge prediction, node label prediction, and community…
We prove a sharp $L^p$-Sobolev regularity results for a class of generalized Radon transforms for families of curves in a three dimensional manifold, with folding canonical relations. The proof relies on decoupling inequalities by Wolff and…
Digital ink promises to combine the flexibility and aesthetics of handwriting and the ability to process, search and edit digital text. Character recognition converts handwritten text into a digital representation, albeit at the cost of…
The discrete cosine transform is a valuable tool in analysis of data on undirected rectangular grids, like images. In this paper it is shown how one can define an analogue of the discrete cosine transform on triangles. This is done by…
We present an algorithm for detecting basepoints of linear series of curves in the plane. Moreover, we give an algorithm for constructing a linear series of curves in the plane for given basepoints. The underlying method of these algorithms…
We study mappings with bounded (p,q)-distortion associated to Sobolev spaces on Carnot groups. Mappings of such type have applications to the Sobolev type embedding theory and classification of manifolds. For this class of mappings, we…
We examine implicit representations of parametric or point cloud models, based on interpolation matrices, which are not sensitive to base points. We show how interpolation matrices can be used for ray shooting of a parametric ray with a…
In this paper we generalize the study of Matiyasevich on integer points over conics, introducing the more general concept of radical points. With this generalization we are able to solve in positive integers some Diophantine equations,…
Different techniques from machine learning are applied to the problem of computing line bundle cohomologies of (hypersurfaces in) toric varieties. While a naive approach of training a neural network to reproduce the cohomologies fails in…
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space $x$ and frequency $\xi$. The symbol smoothness conditions obeyed by many…
Symmetries of combinatorial objects are known to complicate search algorithms, but such obstacles can often be removed by detecting symmetries early and discarding symmetric subproblems. Canonical labeling of combinatorial objects…
We consider Holder smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges between polynomial pieces that are in `good continuation' of…
Voxel representation and processing is an important issue in a broad spectrum of applications. E.g., 3D imaging in biomedical engineering applications, video game development and volumetric displays are often based on data representation by…
We make use of the complex implicit representation in order to provide a deterministic algorithm for checking whether or not two implicit algebraic curves are related by a similarity, a central question in Pattern Recognition and Computer…
The non-convexity of a smooth and compact connected component of a real algebraic plane curve can be measured by a combinatorial object called the Poincare-Reeb tree associated to the curve and to a direction of projection. In this paper we…
Particle-style token machines are a way to interpret proofs and programs, when the latter are defined according to the principles of linear logic. In this paper, we show that token machines also make sense when the programs at hand are…