相关论文: Box Graphs and Resolutions I
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
The prime motivation behind this paper is to prove that any torus link can be realized as the union of the one-dimensional connected components of the set of critical values of the argument map restricted to a complex algebraic plane curve.…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
We present a unified framework to study graph kernels, special cases of which include the random walk graph kernel \citep{GaeFlaWro03,BorOngSchVisetal05}, marginalized graph kernel \citep{KasTsuIno03,KasTsuIno04,MahUedAkuPeretal04}, and…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
A genus one curve of degree 5 is defined by the 4 x 4 Pfaffians of a 5 x 5 alternating matrix of linear forms on P^4. We describe a general method for investigating the invariant theory of such models. We use it to explain how we found our…
We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…
We introduce a new formalism and a number of new results in the context of geometric computational vision. The classical scope of the research in geometric computer vision is essentially limited to static configurations of points and lines…
We find that for many Calabi-Yau threefolds with elliptic or genus one fibrations mirror symmetry factorizes between the fiber and the base of the fibration. In the simplest examples, the generic CY elliptic fibration over any toric base…
This survey is the continuation of a series of works aimed at applying tools from Singularity Theory to Differential Equations. More precisely, we utilize the powerfull Milnor's Fibration Theory to give geometric-topological classifications…
This is a first part of a series of papers in which we develop explicit computational methods for automorphic forms for GL(3) and PGL(3) over elliptic function fields. In this first part, we determine explicit formulas for the action of the…
The goal of this paper is to find a close to isomorphic presentation of 3-manifolds in terms of Hopf algebraic expressions. To this end we define and compare three different braided tensor categories that arise naturally in the study of…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
In a previous work, we proved that each minimal symplectic filling of any oriented lens space, viewed as the singularity link of some cyclic quotient singularity and equipped with its canonical contact structure, can be obtained from the…
We identify two families of ten-point Feynman diagrams that generalize the elliptic double box, and show that they can be expressed in terms of the same class of elliptic multiple polylogarithms to all loop orders. Interestingly, one of…
Given a directed graph E, we construct for each real number l a quiver whose vertex space is the topological realisation of E, and whose edges are directed paths of length l in the vertex space. These quivers are not topological graphs in…
It is well-known that every 3-connected planar graph has a unique planar embedding on the sphere. We study the extension to triangulated 1-planar graphs, T1P graphs for short, which admit an embedding in which each edge is crossed at most…
Knowledge graph embeddings (KGE) have been extensively studied to embed large-scale relational data for many real-world applications. Existing methods have long ignored the fact many KGs contain two fundamentally different views: high-level…
A graphical expansion formula for non-commutative matrix integrals with values in a finite-dimensional real or complex von Neumann algebra is obtained in terms of ribbon graphs and their non-orientable counterpart called Moebius graphs. The…
Enumerative algebraic geometry deals with problems of counting geometric objects defined algebraically, An important class of enumerative problems is that of counting curves: given a class of curves in some projective variety defined by…