Related papers: A prime decomposition theorem for the 2-string lin…

This paper provides a relationship between a geometric structure of a suspended tree and the number of link components of the associated link diagram.

If a biconnected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every biconnected graph has a canonical decomposition into 2.5-connected components. These…

The Onion Decomposition has recently been shown to provide principled models of complex graphs that better reproduce the sparse networks found in nature, but at the cost of complicated connection rules. We propose a k-edge swapping MCMC…

We analyze the ring tmf_*tmf of cooperations for the connective spectrum of topological modular forms (at the prime 2) through a variety of perspectives: (1) the E_2-term of the Adams spectral sequence for tmf ^ tmf admits a decomposition…

Link prediction is an important network science problem in many domains such as social networks, chem/bio-informatics, etc. Most of these networks are dynamic in nature with patterns evolving over time. In such cases, it is necessary to…

We propose a new method, using deformation theory, to study the maximal rank conjecture. For line bundles of extremal degree, which can be viewed as the first case to test the conjecture, we prove that maximal rank conjecture holds by our…

We investigate topology change in 3D. Using Morse theory and handle decomposition we find the set of elementary cobordisms for 3-manifolds. These are: (i) \O <-> S^2; (ii) \Sigma_g <-> \Sigma_{g+1}; (iii) \Sigma_{g_1} \sqcup \Sigma_{g_2}…

The decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned d-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into…

We investigate the stability of strings connecting charges Q in the representation {2Q+1} of SU(2) Yang-Mills theory in (2+1) dimensions. While the fundamental {2}-string between two charges Q=1/2 is unbreakable and stable, the string…

Symmetries are widespread in physical, technological, biological, and social systems and networks, including power grids. The swing equation is a classic model for the dynamics of powergrid networks. The main goal of this paper is to…

For a wide class of bipartite systems with localized couplings, we establish existence of an effective light-cone for propagation of entanglement. This result yields a hard lower bound on the time it takes, under ideal conditions (no loss,…

We use an action, of 2l-component string links on l-component string links, defined by the first author and Xiao-Song Lin, to lift the indeterminacy of finite type link invariants. The set of links up to this new indeterminacy is in…

Ever since its birth, up until its present development, the major role of string theory involves being the best candidate for the theory of quantum gravity and other species of interactions. In the present work, we would like to accomplish…

In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical…

Connections between structural graph theory and finite model theory recently gained a lot of attention. In this setting, many interesting questions remain on the properties of dependent (NIP) hereditary classes of graphs, in particular…

Using a construction that builds a monoid from a monoid action, this paper exhibits an example of a direct product of monoids that admits a prefix-closed regular cross-section, but one of whose factors does not admit a regular…

In the present paper we introduce a lattice-ordered partial monoid structure on a suitable set of multilayer networks. We first study a kind of mappings that preserve the partial order and describe the order structure. After that we define…

Bidirected graphs (earlier studied by Edmonds, Johnson and, in equivalent terms of skew-symmetric graphs, by Tutte, Goldberg, Karzanov, and others) proved to be a useful unifying language for describing both flow and matching problems. In…

A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…

We construct a model for the string group as an infinite-dimensional Lie group. In a second step we extend this model by a contractible Lie group to a Lie 2-group model. To this end we need to establish some facts on the homotopy theory of…