Related papers: The Pascal Triangle of a Discrete Image: Definitio…
Starting from the classical results of Shubnikov and Zamorzayev, computer models of shapes are implemented, which allow to visualize the action of discrete subgroups of continuous topological groups. The action is visualize by performing…
Any two equivalent discrete curves must have the same invariants at the corresponding points under an affine transformation. In this paper, we construct the moving frame and invariants for the discrete centroaffine curves, which could be…
Differential complexes such as the de Rham complex have recently come to play an important role in the design and analysis of numerical methods for partial differential equations. The design of stable discretizations of systems of partial…
The main purpose of this note is to provide an elementary discussion of some simple triangles of integer numbers in particular through their connections with representation theory of $sl_2$. The triangles under consideration are the Catalan…
Predicting the pose of objects from a single image is an important but difficult computer vision problem. Methods that predict a single point estimate do not predict the pose of objects with symmetries well and cannot represent uncertainty.…
To study singularities on complex varieties we study Poincar\'e series of filtrations that are defined by discrete valuations on the local ring at the singularity. In all previous papers on this topic one poses restrictions on the centers…
In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal curve. The map matching problem is usually approached with…
This paper combines image metamorphosis with deep features. To this end, images are considered as maps into a high-dimensional feature space and a structure-sensitive, anisotropic flow regularization is incorporated in the metamorphosis…
Let $\Gamma$ be a discrete group of finite virtual cohomological dimension with certain finiteness conditions of the type satisfied by arithmetic groups. We define a representation ring for $\Gamma$, determined on its elements of finite…
The Paley graph is a well-known self-complementary pseudo-random graph, defined over a finite field of odd order. We describe an attempt at an analogous construction using fields of even order. Some properties of the graph are noted, such…
The paper is devoted to an approach to the notion of the complex dilatation based on the following observations. (1) A natural measure of the distortion of the conformal structure by a real linear automorphism of the complex plane is the…
We study the Hankel transforms of sequences related to the central coefficients of a family of Pascal-like triangles. The mechanism of Riordan arrays is used to elucidate the structure of these transforms.
We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
The discreteness problem, that is, the problem of determining whether or not a given finitely generated group G of orientation preserving isometries of hyperbolic three-space is discrete as a subgroup of the whole isometry group of…
This note aims to bring attention to a simple class of discrete dynamical systems exhibiting some complex behaviour. Each of these systems is defined as a self-mapping of the unit square and is obtained by coupling two families of…
Let k be an algebraically closed field of characteristic zero, F its algebraically closed extension, and G be the group of k-automorphisms of F endowed with a natural topology. One of the purposes of this paper is to show that any…
Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…
We seek a practical method for establishing dense correspondences between two images with similar content, but possibly different 3D scenes. One of the challenges in designing such a system is the local scale differences of objects…
Many stochastic processes are defined on special geometrical objects like spheres and cones. We describe how tools from harmonic analysis, i.e. Fourier analysis on groups, can be used to investigate probability density functions (pdfs) on…