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

Let $P_n$ and $C_n$ denote the path and cycle on $n$ vertices respectively. The dumbbell graph, denoted by $D_{p,k,q}$, is the graph obtained from two cycles $C_p$, $C_q$ and a path $P_{k+2}$ by identifying each pendant vertex of $P_{k+2}$…

Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative…

We characterize positive definiteness for some family of matrices. As an application we derive explicit value of the quadratic embedding constants of the path graphs.

Node embeddings map graph vertices into low-dimensional Euclidean spaces while preserving structural information. They are central to tasks such as node classification, link prediction, and signal reconstruction. A key goal is to design…

This work is about graphs arising from Reuleaux polyhedra. Such graphs must necessarily be planar, $3$-connected and strongly self-dual. We study the question of when these conditions are sufficient. If $G$ is any such a graph with…

Stark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph…

The $W_v$-Path Conjecture due to Klee and Wolfe states that any two vertices of a simple polytope can be joined by a path that does not revisit any facet. This is equivalent to the well-known Hirsch Conjecture. Klee proved that the…

Let $(W,S)$ be a Coxeter system. A $W$-graph encodes a representation of the Hecke algebra $\mathcal{H}$ of $W$. We construct universal representations of multi-parameter Hecke algebras on certain quotients of path algebras, and study their…

Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the…

We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of…

A reproducing kernel Hilbert space (RKHS) has four well-known easily derived properties. Since these properties are usually not emphasized as a simple means of gaining insight into RKHS structure, they are singled out and proved in this…

We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of…

In this article, we give two extended space formulations, respectively, for the induced tree and path polytopes of chordal graphs with vertex and edge variables. These formulations are obtained by proving that the induced tree and path…

The quantum geometric tensor (QGT) characterizes the Hilbert space geometry of the eigenstates of a parameter-dependent Hamiltonian. In recent years, the QGT and related quantities have found extensive theoretical and experimental utility,…

The quadratic embedding constant (QEC) is a numerical invariant associated with quadratic embeddings of graphs into Hilbert spaces, and it is characterized in terms of the distance matrix. For corona graphs $G\odot H$, a general expression…

In this paper we develop a quantization method for flat compact manifolds based on path integrals. In this method the Hilbert space of holomorphic functions in the complexification of the manifold is used. This space is a reproducing kernel…

We introduce a concept of an embedding of a quadratic space in an associative algebra. The general properties of such embeddings are analyzed by linking it to the Clifford algebra. Conversely, there isa simple description of the standard…

Hartsfield and Ringel constructed orientable quadrangular embeddings of the complete graph $K_n$ for $n\equiv 5 \pmod 8$, and nonorientable ones for $n \ge 9$ and $n\equiv 1 \pmod 4$. These provide minimal quadrangulations of their…

Typical R-convolution graph kernels invoke the kernel functions that decompose graphs into non-isomorphic substructures and compare them. However, overlooking implicit similarities and topological position information between those…

Let M be a compact Riemannian manifold without boundary and let H be a self-adjoint generalized Laplace operator acting on sections in a bundle over M. We give a path integral formula for the solution to the corresponding heat equation.…