Results 31 to 40 of about 91 (73)
Homotopy type of the complex of free factors of a free group
Proceedings of the London Mathematical Society, Volume 121, Issue 6, Page 1737-1765, December 2020., 2020 Abstract We show that the complex of free factors of a free group of rank n⩾2 is homotopy equivalent to a wedge of spheres of dimension n−2. We also prove that for n⩾2, the complement of (unreduced) Outer space in the free splitting complex is homotopy equivalent to the complex of free factor systems and moreover is (n−2)‐connected.
Benjamin Brück, Radhika Gupta
wiley +1 more source
CBSF: A New Empirical Scoring Function for Docking Parameterized by Weights of Neural Network
Computational and Mathematical Biophysics, 2019 A new CBSF empirical scoring function for the estimation of binding energies between proteins and small molecules is proposed in this report. The final score is obtained as a sum of three energy terms calculated using descriptors based on a simple ...
Syrlybaeva Raulia R., Talipov Marat R.
doaj +1 more source
When products of projections diverge
Journal of the London Mathematical Society, Volume 102, Issue 1, Page 345-367, August 2020., 2020 Abstract Slow convergence of cyclic projections implies divergence of random projections and vice versa. Let L1,L2,⋯,LK be a family of K closed subspaces of a Hilbert space. It is well known that although the cyclic product of the orthogonal projections on these spaces always converges in norm, random products might diverge.
Eva Kopecká
wiley +1 more source
Bounds for The Geometric-Arithmetic Index of a Graph
, 2015 The first geometric-arithmetic index GA1.G/, which was introduced by D. Vukičević and B. Furtula recently, is a graph-based molecular structure descriptor.
J. Sigarreta
semanticscholar +1 more source
Decomposing tournaments into paths
Proceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020 Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo +3 more
wiley +1 more source
Untwisting 3‐strand torus knots
Bulletin of the London Mathematical Society, Volume 52, Issue 3, Page 429-436, June 2020., 2020 Abstract We prove that the signature bound for the topological 4‐genus of 3‐strand torus knots is sharp, using McCoy's twisting method. We also show that the bound is off by at most 1 for 4‐strand and 6‐strand torus knots, and improve the upper bound on the asymptotic ratio between the topological 4‐genus and the Seifert genus of torus knots from 2/3 ...
S. Baader, I. Banfield, L. Lewark
wiley +1 more source
Location of zeros for the partition function of the Ising model on bounded degree graphs
Journal of the London Mathematical Society, Volume 101, Issue 2, Page 765-785, April 2020., 2020 Abstract The seminal Lee–Yang theorem states that for any graph the zeros of the partition function of the ferromagnetic Ising model lie on the unit circle in C. In fact, the union of the zeros of all graphs is dense on the unit circle. In this paper, we study the location of the zeros for the class of graphs of bounded maximum degree d⩾3, both in the ...
Han Peters, Guus Regts
wiley +1 more source
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2018 Similarly to Wiener index, hyper-Wiener index of a connected graph is a widely applied topological index measuring the compactness of the structure described by the given graph. Hyper-Wiener index is the sum of the distances plus the squares of distances
Mujahed Hamzeh, Nagy Benedek
doaj +1 more source
The harmonic index for unicyclic and bicyclic graphs with given matching number
, 2015 The harmonic index of a graph G is defined as the sum of the weights 2 d.u/Cd.v/ of all edges uv of G, where d.u/ denotes the degree of a vertex u in G.
Lingping Zhong
semanticscholar +1 more source
The Sanskruti index of trees and unicyclic graphs
Open Chemistry, 2019 The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align*}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align*}$$where sG(u) is the sum of the degrees of the neighbors of a ...
Deng Fei +6 more
doaj +1 more source