Study Murasugi sum in 4D for knotted surfaces, defining arborescent surfaces.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
We use the methods of Hedden, Juhasz, and Sarkar to exhibit a set of arborescent knots that bound large numbers of non-isotopic minimal genus spanning surfaces. In particular, we describe a sequence of prime knots K_{n} which will bound at least 2^{2n-1} non-isotopic minimal spanning surfaces of genus n.
This study analyzes information flow networks in Chinese stock sectors using transfer entropy.
In this paper, a relationship between the determinant of an alternating link and a certain polytope obtained from the link diagram is analyzed. We also show that when the underlying graph of the link diagram is properly oriented, the number of its spanning arborescence is equal to the determinant, i.e., the value at -1…
Positive Thompson links are arborescent tangles.
In this paper, we study the hyperbolicity of arborescent tangles and arborescent links. We will explicitly determine all essential surfaces in arborescent tangle complements with non-negative Euler characteristic, and show that given an arborescent tangle T, the complement X(T) is non-hyperbolic if and only if T is a r…
Locally finite complexes with polyhedral metrics are arborescent.
The study proves a conjecture about arborescent links with many twigs.
Unified framework for gradient estimation in combinatorial spaces.
Study character varieties of arborescent knots and hyperbolic knots.
Formula for arborescent link tails using theta functions.
A Dehn surgery on a knot in is exceptional if it produces a reducible, toroidal or Seifert fibred manifold. It is known that a large arborescent knot admits no such surgery unless it is a type II arborescent knot. The main theorem of this paper shows that up to isotopy there are exactly three large arborescen…
Paper computes Alexander polynomials for arborescent links.
New algebra counts components of arborescent knots and links.
Authors show that genus defects of Hopf arborescent links are decidable.
Given a link , a representation is {\it trace-free} if it sends each meridian to an element with trace zero. We present a method for completely determining trace-free -representations for arborescent links. Concrete computations are done for a …
We realize a given (monic) Alexander polynomial by a (fibered) hyperbolic arborescent knot and link of any number of components, and by infinitely many such links of at least 4 components. As a consequence, a Mahler measure minimizing polynomial, if it exists, is realized as the Alexander polynomial of a fibered hyperb…
Study -invariants of L-space double branched covers of arborescent links.
For a positive Hopf plumbed arborescent Seifert surface , we study the set of Hopf bands , up to homology and up to the action of the monodromy. The classification of Seifert surfaces for which this set is finite is closely related to the classification of finite Coxeter groups.
In this paper, we investigate the statistical features of the weighted international-trade network. By finding the maximum weight spanning trees for this network we make the extraction of the truly relevant connections forming the network's backbone. We discuss the role of large-sized countries (strongest economies) in…
We briefly review 3-dimensional untwisted Dijkgraaf-Witten theory over a finite group , and present a method of computing untwisted Dijkgraaf-Witten invariants for arborescent links. Some explicit formulas are given when for an odd prime .
Four constructions of Seifert surfaces - Hopf plumbing, arborescent plumbing, basketry, and T-bandword handle decomposition - are described, and some interrelationships found, e.g.: arborescent Seifert surfaces are baskets; Hopf-plumbed baskets are precisely homogeneous T-bandword surfaces. A Seifert surface is Hopf-pl…
We propose a novel self-attention mechanism that can learn its optimal attention span. This allows us to extend significantly the maximum context size used in Transformer, while maintaining control over their memory footprint and computational time. We show the effectiveness of our approach on the task of character lev…
Constructs a new graded variety from algebraic data.
This paper describes a way to subdivide a 3-manifold into angled blocks, namely polyhedral pieces that need not be simply connected. When the individual blocks carry dihedral angles that fit together in a consistent fashion, we prove that a manifold constructed from these blocks must be hyperbolic. The main application…
New links identified with Alexander polynomial signs to detect satellite links.
Arborescent knots are the ones which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is enough for lifting topological description to the level of effective analytical formulas. The paper describes the origin and struc…
This article is devoted to the study of prime alternating +achiral knots. In the case of arborescent knots, we prove in +AAA Visibility Theorem 5.1, that the symmetry is visible on a certain projection (not necessarily minimal) and that it is realised by a homeomorphism of order 4. In the general case (arborescent or n…
In this paper, we give an isotopy classification of 3-bridge spheres of 3-bridge arborescent links, which are not Montesinos links. To this end, we prove a certain refinement of a theorem of J.S. Birman and H.M. Hilden on the relation between bridge presentations of links and Heegaard splittings of 3-manifolds. In the …
We show for an alternating knot the minimal boundary slope of an essential spanning surface is given by the signature plus twice the minimum degree of the Jones polynomial and the maximal boundary slope of an essential spanning surface is given by the signature plus twice the maximum degree of the Jones polynomial. For…
A challenging problem in complex networks is the network reconstruction problem from data. This work deals with a class of networks denoted as conserved networks, in which a flow associated with every edge and the flows are conserved at all non-source and non-sink nodes. We propose a novel polynomial time algorithm to …
This article is solicited by C.\ Adams for a special issue of {\it Chaos, Solitons and Fractals\/} devoted to knot theory and its applications. We present some recent results about Dehn surgeries on arborescent knots and links.
This paper shows neural networks can solve complex graph problems efficiently.
The recently suggested KNTZ trick completed the lasting search for exclusive Racah matrices and for all rectangular representations and has a potential to help in the non-rectangular case as well. This was the last lacking insight about the structure of differential expansion of (rectangularly-)colored kno…
Roberts proved that a family of alternating, arborescent, prime knots each have at least distinct minimal genus Seifert surfaces, where is the genus of the knot in question. We give a subfamily of these knots that have exactly this many minimal genus Seifert surfaces.
Statistical uncertainty of different filtration techniques for market network analysis is studied. Two measures of statistical uncertainty are discussed. One is based on conditional risk for multiple decision statistical procedures and another one is based on average fraction of errors. It is shown that for some import…
We give a complete classification of exceptional surgeries on hyperbolic alternating knots in the 3-sphere. As an appendix, we also show that the Montesinos knots M (-1/2, 2/5, 1/(2q + 1)) with q at least 5 have no non-trivial exceptional surgeries. This gives the final step in a complete classification of exceptional …
By now it is well established that the quantum dimensions of descendants of the adjoint representation can be described in a universal form, independent of a particular family of simple Lie algebras. The Rosso-Jones formula then implies a universal description of the adjoint knot polynomials for torus knots, which in p…
We prove the meridional rank conjecture for twisted links and arborescent links associated to bipartite trees with even weights. These links are substantial generalizations of pretzels and two-bridge links, respectively. Lower bounds on meridional rank are obtained via Coxeter quotients of the groups of link complement…
We propose a new complexity measure for Markov decision processes (MDPs), the maximum expected hitting cost (MEHC). This measure tightens the closely related notion of diameter [JOA10] by accounting for the reward structure. We show that this parameter replaces diameter in the upper bound on the optimal value span of a…
New insights into optimization and generalization for linear models.
Method for factor analysis in short panels without assuming sphericity or Gaussianity.
Let Πbe a link projection in S^2. John Conway and later Francis Bonahon and Larry Siebenmann undertook to split into canonical pieces. These pieces received different names: basic or polyhedral diagrams on one hand, rational, algebraic, bretzel, arborescent diagrams on the other hand. This paper proposes a thorough…
Exceptional Dehn surgeries on arborescent knots have been classified except for Seifert fibered surgeries on Montesinos knots of length 3. There are infinitely many of them as it is known that 4n+6 and 4n+7 surgeries on a (-2, 3, 2n+1) pretzel knot are Seifert fibered. It will be shown that there are only finitely many…
We consider two connected aspects of maximum likelihood estimation of the parameter for high-dimensional discrete graphical models: the existence of the maximum likelihood estimate (mle) and its computation. When the data is sparse, there are many zeros in the contingency table and the maximum likelihood estimate of th…
We claim that the recently discovered universal-matrix precursor for the functions, which define the differential expansion of colored polynomials for twist and double braid knots, can be extended from rectangular to non-rectangular representations. This case is far more interesting, because it involves multiplicit…
This paper finds efficient algorithms for approximating Markov networks with k-tree topologies.
Continuing the quest for exclusive Racah matrices, which are needed for evaluation of colored arborescent-knot polynomials in Chern-Simons theory, we suggest to extract them from a new kind of a double-evolution -- that of the antiparallel double-braids, which is a simple two-parametric family of two-bridge knots, gene…