相关论文: A few weight systems arising from intersection gra…

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

We introduce and study the Wilson loops in a general 3D topological field theories (TFTs), and show that the expectation value of Wilson loops also gives knot invariants as in Chern-Simons theory. We study the TFTs within the…

Higher-rank graphs were introduced by Kumjian and Pask to provide models for higher-rank Cuntz-Krieger algebras. In a previous paper, we constructed 2-graphs whose path spaces are rank-two subshifts of finite type, and showed that this…

Arrangement graphs were introduced for their connection to computational networks and have since generated considerable interest in the literature. In a pair of recent articles by Chen, Ghorbani and Wong, the eigenvalues for the adjacency…

Let c denote a non-negative constant. Suppose that we are given an edge-weighted bipartite graph G=(V,E) with its 2-layered drawing and a family X of intersecting edge pairs. We consider the problem of finding a maximum weighted matching M*…

We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory…

We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…

In recent years, A. Grigor'yan, Y. Lin, Y. Muranov and S.T. Yau [6, 7, 8, 9] constructed a path homology theory for digraphs. Later, S. Chowdhury and F. Memoli [3] studied the persistent path homology for directed networks. In this paper,…

Path graphs are intersection graphs of paths in a tree. We start from the characterization of path graphs by Monma and Wei [C.L.~Monma,~and~V.K.~Wei, Intersection Graphs of Paths in a Tree, J. Combin. Theory Ser. B, 41:2 (1986) 141--181]…

We investigate the role of electron-electron and electron-phonon interactions in strongly correlated systems by performing unbiased quantum Monte Carlo simulations in the square lattice Hubbard-Holstein model at half-filling. We study the…

We study the convergence of distributions on finite paths of weighted digraphs, namely the family of Boltzmann distributions and the sequence of uniform distributions. Targeting applications to the convergence of distributions on paths, we…

This work presents formulas for the Kauffman bracket and Jones polynomials of 3-bridge knots using the structure of Chebyshev knots and their billiard table diagrams. In particular, these give far fewer terms than in the Skein relation…

In this paper, we develop the higher descent equations for higher gauge theories within the framework of 2-term $L_{\infty}$ algebras. Starting from a multilinear symmetric invariant polynomial, we construct a family of higher Chern-Simons…

In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete…

We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…

In [5] the structure of the bifurcation diagrams of a class of superlinear indefinite problems with a symmetric weight was ascertained, showing that they consist of a primary branch and secondary loops bifurcating from it. In [4] it has…

The operational Chow cohomology classes of a complete toric variety are identified with certain functions, called Minkowski weights, on the corresponding fan. The natural product of Chow cohomology classes makes the Minkowski weights into a…

In this paper we investigate connections between linear sets and subspaces of linear maps. We give a geometric interpretation of the results of [18, Section 5] on linear sets on a projective line. We extend this to linear sets in arbitrary…

We prove a connection between Schmidt-rank and weight of quadratic forms. This provides a new tool for the classification of graph states based on entanglement. Our main tool arises from a reformulation of previously known results…

A weighted graph is a graph in which every edge is assigned a non-negative real number. In a weighted graph, the weight of a path is the sum of the weights of its edges, and the weighed degree of a vertex is the sum of the weights of the…