Related papers: Patchworking real algebraic varieties
We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be…
This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…
Tropical algebraic geometry is an active new field of mathematics that establishes and studies some very general principles to translate algebro-geometric problems into purely combinatorial ones. This expository paper gives an introduction…
Recently, parametric mappings have emerged as highly effective surface representations, yielding low reconstruction error. In particular, the latest works represent the target shape as an atlas of multiple mappings, which can closely encode…
The notion of (symmetric) coloured operad or "multicategory" can be obtained from the notion of commutative algebra through a certain general process which we call "theorization" (where our term comes from an analogy with William Lawvere's…
We provide several families of compact complex curves embedded in smooth complex surfaces such that no neighborhood of the curve can be embedded in an algebraic surface. Different constructions are proposed, by patching neighborhoods of…
A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The…
A non-singular connected algebraic curve $A$ in a simply connected algebraic surface $X$ can be knotted so that its homology class and the fundamental group of its complement in $X$ is preserved, provided $A$ is sufficiently complex (not…
In this paper, we introduce a generalization of graphlets to heterogeneous networks called typed graphlets. Informally, typed graphlets are small typed induced subgraphs. Typed graphlets generalize graphlets to rich heterogeneous networks…
An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to…
`Gluing' is a technique of constructing solutions to non-linear (elliptic) partial differential equations such as Yang--Mills equations, minimal surface equations and Einstein equations. Calibrated submanifolds are a certain class of…
In this paper we explore algebraic and geometric structures that arise on parallelizable manifolds. Given a parallelizable manifold $\mathbb{L}$, there exists a global trivialization of the tangent bundle, which defines a map…
We find new examples of complex surfaces with countably many non-isomorphic algebraic structures. Here is one such example: take an elliptic curve $E$ in $\mathbb P^2$ and blow up nine general points on $E$. Then the complement $M$ of the…
This paper is motivated by the real symplectic isotopy problem : does there exists a nonsingular real pseudoholomorphic curve not isotopic in the projective plane to any real algebraic curve of the same degree? Here, we focus our study on…
A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$. A more general theory is developed for frameworks in $\bR^3$ whose vertices are…
In 70's there was discovered a construction how to attach to some algebraic-geometric data an infinite-dimensional subspace in the space k((z)) of the Laurent power series. Now this construction is called the Krichever map. In e-print…
${\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…
A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in such a colouring. Its dual, the cover-decomposition number,…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
This paper is devoted to the investigation of selected situations when the computation of projective (and other) equivalences of algebraic varieties can be efficiently solved with the help of finding projective equivalences of finite sets…