Related papers: Computing branches and asymptotes of meromorphic f…
We prove that computing a single pair of vertices that are mapped onto each other by an isomorphism $\phi$ between two isomorphic graphs is as hard as computing $\phi$ itself. This result optimally improves upon a result of G\'{a}l et al.…
We construct an explicit example of an asymptotically conformal chord-arc curve that fails to be asymptotically smooth. This implies that a function belonging to both the little Bloch space and BMOA does not necessarily lie in VMOA, and…
Past approaches for statistical shape analysis of objects have focused mainly on objects within the same topological classes, e.g., scalar functions, Euclidean curves, or surfaces, etc. For objects that differ in more complex ways, the…
The development of computational techniques in the last decade has made possible to attack some classical problems of algebraic geometry. In this survey, we briefly describe some open problems related to algebraic curves which can be…
We enumerate factorisations of the complete graph into spanning regular graphs in several cases, including when the degrees of all the factors except for one or two are small. The resulting asymptotic behaviour is seen to generalise the…
We introduce tabular algebras, which are simultaneous generalizations of cellular algebras (in the sense of Graham-Lehrer) and table algebras (in the sense of Arad-Blau). We show that if a tabular algebra is equipped with a certain kind of…
Exact solution to many problems in mathematical physics and quantum field theory often can be expressed in terms of an algebraic curve equipped with a meromorphic differential. Typically, the geometry of the curve can be seen most clearly…
Inspired by the works of Dewar, Murty and Kot\v{e}\v{s}ovec, we establish some useful theorems for asymptotic formulas. As an application, we obtain asymptotic formulas for the numbers of skew plane partitions and cylindric partitions. We…
In this paper, we give a fast algorithm for the computation of the Arf closure of an algebroid curve with more than one branch, generalizing an algorithm presented by Arslan and Sahin for the algebroid branch case.
The analysis of curves has been routinely dealt with using tools from functional data analysis. However its extension to multi-dimensional curves poses a new challenge due to its inherent geometric features that are difficult to capture…
We study tori attached to the fundamental groups of plane curves with arbitrary singularities. These tori provide complete information about homology of finite abelian covers of the plane branched along the curve. We calculate these tori in…
We discuss the nature of structure-preserving maps of varies function algebras. In particular, we identify isomorphisms between special Colombeau algebras on manifolds with invertible manifold-valued generalized functions in the case of…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
A general scheme for determining and studying integrable deformations of algebraic curves, based on the use of Lenard relations, is presented. We emphasize the use of several types of dynamical variables : branches, power sums and…
We introduce the regularized integrals for decorated graphs on elliptic curves, which produces an almost holomorphic function on upper half plane. Then we give the graph version of holomorphic anomaly equation to study the anti-holomorphic…
A result of Belyi can be stated as follows. Every curve defined over a number field can be expressed as a cover of the projective line with branch locus contained in a rigid divisor. We define the notion of geometrically rigid divisors in…
This paper presents a spline-based parameterisation framework for plane graphs. The plane graph is characterised by a collection of curves forming closed loops that fence-off planar faces which have to be parameterised individually. Hereby,…
This paper introduces and demonstrates a computational pipeline for the statistical analysis of shape graph datasets, namely geometric networks embedded in 2D or 3D spaces. Unlike traditional abstract graphs, our purpose is not only to…
Asymptotic net is an important concept in discrete differential geometry. In this paper, we show that we can associate affine discrete geometric concepts to an arbitrary non-degenerate asymptotic net. These concepts include discrete affine…
In this paper we study the concept of characteristic numbers and Chern slopes in the context of curve configurations in the real and complex projective plane. We show that some extremal line configurations inherit the same asymptotic…