Related papers: Goeritz and Seifert Matrices from Dehn Presentatio…
We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid presentation. For an oriented link it is known that the braid…
This study deals with the missing link prediction problem: the problem of predicting the existence of missing connections between entities of interest. We address link prediction using coupled analysis of relational datasets represented as…
We give a formula for certain values and derivatives of Siegel series and use them to compute Fourier coefficients of derivatives of the Siegel Eisenstein series of weight g/2 and genus g. When g=4, the Fourier coefficient is approximated…
This paper introduces a method to generate hierarchically modular networks with prescribed node degree list by link switching. Unlike many existing network generating models, our method does not use link probabilities to achieve modularity.…
In this paper, we re-investigate the resolution of Toeplitz systems $T u =g$, from a new point of view, by correlating the solution of such problems with syzygies of polynomials or moving lines. We show an explicit connection between the…
A 1989 result of Duarte asserts that for a given tree T on n vertices, a fixed vertex i, and two sets of distinct real numbers L, M of sizes n and n-1, respectively, such that M strictly interlaces L, there is a real symmetric matrix A such…
We explain how to compute the Jones polynomial of a link from one of its grid diagrams and we observe a connection between Bigelow's homological definition of the Jones polynomial and Kauffman's definition of the Jones polynomial.…
A framework to systematically decouple high order elliptic equations into combination of Poisson-type and Stokes-type equations is developed. The key is to systematically construct the underling commutative diagrams involving the complexes…
A faithful description of the state of a complex dynamical network would require, in principle, the measurement of all its $d$ variables, an infeasible task for systems with practical limited access and composed of many nodes with high…
In this paper, we investigate various algebraic and graph theoretic properties of the distance matrix of a graph. Two graphs are $D$-cospectral if their distance matrices have the same spectrum. We construct infinite pairs of $D$-cospectral…
We build on the methods introduced by Friedmann, Hanlon, Stanley, and Wachs, and further developed by Brauner and Friedmann, to construct additional classes of presentations of Specht modules. We obtain these presentations by defining a…
For any natural number n, the Hurwitz graph $\mathcal{H}(S_n )$ has vertices corresponding to reduced words of the cycle $(1 . . . n)$ in terms of transpositions in $S_n$, and has edges corresponding to local shifts. This graph is known to…
The nodes in a network can be grouped into 'roles' based on similar connection patterns. This is usually achieved by defining a pairwise node similarity matrix and then clustering rows and columns of this matrix. This paper presents a new…
Recently N.A'Campo suggested a construction of a link from a generic immersion of a curve into a 2-disk. It is tightly related to the singularity theory. In this paper, we give a simple procedure to draw a diagram of the link from a picture…
Matrix normal models have an associated 4-tensor for their covariance representation. The covariance array associated with a matrix normal model is naturally represented as a Kronecker-product structured covariance associated with the…
We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to positive defined) of graphs' adjacency matrices.…
We provide a new and simple characterization of the multivariate generalized Laplace distribution. In particular, this result implies that the product of a Gaussian matrix with independent and identically distributed columns by an…
Graph link prediction is an important task in cyber-security: relationships between entities within a computer network, such as users interacting with computers, or system libraries and the corresponding processes that use them, can provide…
According to a formula by Gordon and Litherland, the signature of a knot K can be computed as the signature of a Goeritz matrix of K minus a suitable correction term, read off from the diagram of K. In this article, we consider the family…
Cut a Jacobi matrix into two pieces by removing the n-th column and n-th row. We give neccessary and sufficient conditions for the spectra of the original matrix plus the spectra of the two submatrices to uniqely determine the original…