相关论文: Generalized Weierstrass Kernels on the Intersectio…

We present a new method to explicitly define Abelian functions associated with algebraic curves, for the purpose of finding bases for the relevant vector spaces of such functions. We demonstrate the procedure with the functions associated…

Motivated by the analogies between the projective and the almost quaternionic geometries, we study the generalized planar curves and mappings. We follow, recover, and extend the classical approach as developed by Mikes and Sinyukov. Then we…

${\cal U}$ntil now the representation (i.e. plotting) of curve in Parallel Coordinates is constructed from the point $\leftrightarrow$ line duality. The result is a ``line-curve'' which is seen as the envelope of it's tangents. Usually this…

We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…

In this paper we obtain the closed forms of some hypergeometric functions. As an application, we obtain the explicit forms of the Bergman kernel functions for intersection of two complex ellipsoids $\{z \in \mathbb{C}^3 \colon |z_1|^p +…

Computation of Gauss's arithmetic-geometric mean involves iteration of a simple step, whose algebro-geometric interpretation is the construction of an elliptic curve isogenous to a given one, specifically one whose period is double the…

Let C be a complete non-singular irreducible curve of genus 4 over an algebraically closed field of characteristic 0. We determine all possible Weierstrass semigroups of ramification points on double covers of C which have genus greater…

Welschinger invariants enumerate real nodal rational curves in the plane or in another real rational surface. We analyze the existence of similar enumerative invariants that count real rational plane curves having prescribed non-nodal…

Kernels for structured data are commonly obtained by decomposing objects into their parts and adding up the similarities between all pairs of parts measured by a base kernel. Assignment kernels are based on an optimal bijection between the…

Let K be a field of characteristic different from 2 and C an elliptic curve over K given by a Weierstrass equation. To divide an element of the group C by 2, one must solve a certain quartic equation. We characterise the quartics arising…

In a digraph, a kernel is a subset of vertices that is both independent and absorbing. Kernels have important applications in combinatorics and outside. Kernels do not always exist and finding sufficient conditions ensuring their existence…

Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…

Graph-structured data are an integral part of many application domains, including chemoinformatics, computational biology, neuroimaging, and social network analysis. Over the last two decades, numerous graph kernels, i.e. kernel functions…

Hyperspectral imaging is a powerful technology that is plagued by large dimensionality. Herein, we explore a way to combat that hindrance via non-contiguous and contiguous (simpler to realize sensor) band grouping for dimensionality…

A map between connected $2$-manifolds has a geometric kernel if it sends a non-contractible simple loop to a null-homotopic loop. While every non-$\pi_1$-injective map between compact surfaces admits a geometric kernel, this generally fails…

Recent work on background subtraction has shown developments on two major fronts. In one, there has been increasing sophistication of probabilistic models, from mixtures of Gaussians at each pixel [7], to kernel density estimates at each…

We propose a theoretical framework of multi-way similarity to model real-valued data into hypergraphs for clustering via spectral embedding. For graph cut based spectral clustering, it is common to model real-valued data into graph by…

In this paper the author provides a generalization of classical linkage, i.e. linkage by a complete intersection, in a different context. Namely she looks at residuals in the scheme theoretic intersection of a rational normal surface or…

The study of the relation between the Weierstrass inducing formulae for constant mean curvature surfaces and the completely integrable euclidean nonlinear sigma-model suggests a connection among integrable sigma -models in a background and…

Structural kernels are a flexible learning paradigm that has been widely used in Natural Language Processing. However, the problem of model selection in kernel-based methods is usually overlooked. Previous approaches mostly rely on setting…