Related papers: Quadratic embedding constants of path graphs
In this paper we consider a one quartic operator on the $\mathbb{R}^2$ with positive coefficients. Positive fixed points for a quartic operator, were investigated. Theorems on number of positive fixed points of the quartic operator, are…
We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…
In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…
We investigate isoperimetric constants of infinite tessellating metric graphs. We introduce a curvature-like quantity, which plays the role of a metric graph analogue of discrete curvature notions for combinatorial tessellating graphs. We…
Given a graph $G$, we associate a path matrix $P$ whose $(i, j)$ entry represents the maximum number of vertex disjoint paths between the vertices $i$ and $j$, with zeros on the main diagonal. In this note, we resolve four conjectures from…
Are the embeddings of a graph's degenerate core stable? What happens to the embeddings of nodes in the degenerate core as we systematically remove periphery nodes (by repeated peeling off $k$-cores)? We discover three patterns w.r.t.…
The signature of a path is an essential object in the theory of rough paths. The signature representation of the data stream can recover standard statistics, e.g. the moments of the data stream. The classification of random walks indicates…
We use purely combinatorial arguments to give a formula to compute all graded Betti numbers of path ideals of line graphs and cycles. As a consequence we can give new and short proofs for the known formulas of regularity and projective…
We present several constructions of paths and processes with finite quadratic variation along a refining sequence of partitions, extending previous constructions to the non-uniform case. We study in particular the dependence of quadratic…
We present an exact formula for the ordinary generating series of the simple paths between any two vertices of a graph. Our formula involves the adjacency matrix of the connected induced subgraphs and remains valid on weighted and directed…
Given a graph $G$, the exponential distance matrix is defined entry-wise by letting the $(u,v)$-entry be $q^{\text{dist}(u,v)}$, where $\text{dist}(u,v)$ is the distance between the vertices $u$ and $v$ with the convention that if vertices…
We determine (multi)graded Betti numbers of path ideals of lines and star graphs.
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
A regular map is a surface together with an embedded graph, having properties similar to those of the surface and graph of a platonic solid. We analyze regular maps with reflection symmetry and a graph of density strictly exceeding 1/2, and…
We estimate whether there is an embedding from one n-dimensional rectangle into another which expands every k-dimensional area. Our estimate is sharp up to a constant factor in each dimension.
We prove that there is an algorithm to determine if a given finite graph is an induced subgraph of a given curve graph.
We study homological invariants of smooth families of real quadratic forms as a step towards a "Lagrange multipliers rule in the large" that intends to describe topology of smooth maps in terms of scalar Lagrange functions.
It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…
The quadratic Veronese embedding $\rho$ maps the point set $P$ of $\PG{n,F)$ into the point set of $PG({n+2 \choose 2}-1, F$ ($F$ a commutative field) and has the following well-known property: If $M\subset P$, then the intersection of all…