相关论文: Quadratic Embedding of Theta Graphs via Reproducin…

A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…

A new link between tetrahedra and the group SU(2) is pointed out: by associating to each face of a tetrahedron an irreducible unitary SU(2) representation and by imposing that the faces close, the concept of quantum tetrahedron is seen to…

Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where until recently solely reserved to numerical data. Within the…

The classical Heawood inequality states that if the complete graph $K_n$ on $n$ vertices is embeddable in the sphere with $g$ handles, then $g \ge\dfrac{(n-3)(n-4)}{12}$. A higher-dimensional analogue of the Heawood inequality is the…

A good deal of research has been done and published on coloring of the vertices of graphs for several years while studying of the excellent work of those maestros, we get inspire to work on the vertex coloring of graphs in case of a…

Graph embedding techniques allow to learn high-quality feature vectors from graph structures and are useful in a variety of tasks, from node classification to clustering. Existing approaches have only focused on learning feature vectors for…

An almost complex structure J on a 4-manifold X may be described in terms of a rank 2 vector bundle E. A splitting of J consists of a pair of line bundles spanning E. A hypersurface M in X satisfying a nondegeneracy condition inherits a…

We resolve in the affirmative conjectures of Repovs and A. Skopenkov (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our…

A \emph{book-embedding} of a graph $G$ is an embedding of vertices of $G$ along the spine of a book, and edges of $G$ on the pages so that no two edges on the same page intersect. the minimum number of pages in which a graph can be embedded…

Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a…

A theta is a graph formed by three paths between the same pair of distinct vertices so that the union of any two of the paths induces a hole. A wheel is a graph formed by a hole and a node that has at least 3 neighbors in the hole. In this…

Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…

To a finite, connected, unoriented graph of Betti-number g>=2 and valencies >=3 we associate a finitely summable, commutative spectral triple (in the sense of Connes), whose induced zeta functions encode the graph. This gives another…

We give a mathematical definition of some path integrals, emphasizing those relevant to the quantization of symplectic manifolds (and more generally, Poisson manifolds) $\unicode{x2013}$ in particular, the coherent state path integral. We…

In algebraic geometry, trigonal curves can always be embedded into Hirzebruch surfaces. In tropical geometry, the notion of trigonality does not have a unique translation. We focus on the characterization in terms of the existence of a…

In the context of a quantum critical spin chain whose low energy physics corresponds to a conformal field theory (CFT), it was recently demonstrated [A. Milsted G. Vidal, arXiv:1805.12524] that certain classes of tensor networks used for…

This is an exposition of results on the existence problem of $\pi_1$-injective immersed and embedded surfaces in graph-manifolds, and also of nonpositively curved metrics on graph-manifolds, obtained by different authors. The results are…

Quartic spectrahedra in 3-space form a semialgebraic set of dimension 24. This set is stratified by the location of its ten nodes. There are twenty maximal strata, identified recently by Degtyarev and Itenberg, via the global Torelli…

A {\em theta} is a graph made of three internally vertex-disjoint chordless paths $P_1 = a \dots b$, $P_2 = a \dots b$, $P_3 = a \dots b$ of length at least~2 and such that no edges exist between the paths except the three edges incident to…

The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture…