Related papers: New results on path-decompositions and their down-…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
Given an undirected graph G and a set A \subseteq V(G), an A-path is a path in G that starts and ends at two distinct vertices of A with intermediate vertices in V(G) \setminus A. An A-path is called an (A,\ell)-path if the length of the…
Many data-rich industries are interested in the efficient discovery and modelling of structures underlying large data sets, as it allows for the fast triage and dimension reduction of large volumes of data embedded in high dimensional…
Among the novel metrics used to study the relative importance of nodes in complex networks, k-core decomposition has found a number of applications in areas as diverse as sociology, proteinomics, graph visualization, and distributed system…
Every finite graph $G$ can be decomposed in a canonical way that displays its local connectivity-structure [DJKK26]. These decompositions are defined via a suitable more tree-like covering of $G$, whose tangle-tree structure is projected…
In this paper, we propose a general approach for describing hadronic B decays. Using this method, all amplitudes for such decays can be expressed in terms of contractions, though the matrix elements are not evaluated. Many years ago, Buras…
We describe a mechanism for using discrete symmetries to solve the doublet-triplet splitting problem of four-dimensional supersymmetric GUT's. We present two versions of the mechanism, one via ``deconstruction,'' and one in terms of…
A new (scalar) spectral decomposition is found for the Dirac system in two dimensions associated to the focusing Davey--Stewartson II (DSII) equation. Discrete spectrum in the spectral problem corresponds to eigenvalues embedded into a…
The problem of bi-equivariant extension of continuous maps of binary $G$-spaces is considered. The concept of a structural map of distributive binary $G$-spaces is introduced, and a theorem on the bi-equivariant extension of structural maps…
This paper presents new results from a detailed study of the structure of autocatalytic sets. We show how autocatalytic sets can be decomposed into smaller autocatalytic subsets, and how these subsets can be identified and classified. We…
Previous research on relation classification has verified the effectiveness of using dependency shortest paths or subtrees. In this paper, we further explore how to make full use of the combination of these dependency information. We first…
A decomposition of a non-empty simple graph $G$ is a pair $[G,P]$, such that $P$ is a set of non-empty induced subgraphs of $G$, and every edge of $G$ belongs to exactly one subgraph in $P$. The chromatic index $\chi'([G,P])$ of a…
We present a new approach for solving (minimum disagreement) correlation clustering that results in sublinear algorithms with highly efficient time and space complexity for this problem. In particular, we obtain the following algorithms for…
Fixing two concordant links in $3$--space, we study the set of all embedded concordances between them, as knotted annuli in $4$--space. When regarded up to surface-concordance or link-homotopy, the set $\mathcal{C}(L)$ of concordances from…
The Induced Disjoint Paths problem is to test whether a graph G with k distinct pairs of vertices (s_i,t_i) contains paths P_1,...,P_k such that P_i connects s_i and t_i for i=1,...,k, and P_i and P_j have neither common vertices nor…
Khovanov homology has been the subject of much study in knot theory and low dimensional topology since 2000. This work introduces a Khovanov Laplacian and a Khovanov Dirac to study knot and link diagrams. The harmonic spectrum of the…
This paper summarizes substantive new results derived by a student team (the first three authors) under the direction of the fourth author at the 2005 session of the KSU REU ``Brainstorming and Barnstorming''. The main results are a…
A path decomposition of a graph G is a collection of edge-disjoint paths of G that covers the edge set of G. Gallai (1968) conjectured that every connected graph on n vertices admits a path decomposition of cardinality at most (n+1)/2.…
The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the…
We introduce a new perspective and a generalization of spectral networks for 4d $\mathcal{N}=2$ theories of class $\mathcal{S}$ associated to Lie algebras $\mathfrak{g} = \textrm{A}_n$, $\textrm{D}_n$, $\textrm{E}_{6}$, and…