Flapan--Naimi--Pommersheim showed that every spatial embedding of , the complete graph on ten vertices, contains a non-split three-component link; that is, is intrinsically triple-linked in . The work of Bowlin--Foisy and Flapan--Foisy--Naimi--Pommersheim extended the list of known intrin…
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
Paper introduces new link homotopy invariants and applies them to 3-bouquet graphs.
In this note, we present a new way to associate a spectral triple to the noncommutative -algebra of a strongly connected finite higher-rank graph . We generalize a spectral triple of Consani and Marcolli from Cuntz-Krieger algebras to higher-rank graph -algebras , and we prove that these s…
To a finite, connected, unoriented graph of Betti-number g>=2 and valencies >=3 we associate a finitely summable, commutative spectral triple (in the sense of Connes), whose induced zeta functions encode the graph. This gives another example where non-commutative geometry provides a rigid framework for classification.
A new graph encoder StarE models hyper-relational KGs, improving link prediction.
Knowledge graph (KG) completion aims to fill the missing facts in a KG, where a fact is represented as a triple in the form of . Current KG completion models compel two-thirds of a triple provided (e.g., and ) to predict the remaining one. In this paper, we propose a new…
Paper constructs unfaithful probability distributions in binary causal graphs.
Paper introduces simplified formulas for Milnor's triple linking number.
Formula for Milnor triple linking number in link diagrams with multiple crossings.
Link prediction is an important way to complete knowledge graphs (KGs), while embedding-based methods, effective for link prediction in KGs, perform poorly on relations that only have a few associative triples. In this work, we propose a Meta Relational Learning (MetaR) framework to do the common but challenging few-sh…
Knowledge graphs are used to represent relational information in terms of triples. To enable learning about domains, embedding models, such as tensor factorization models, can be used to make predictions of new triples. Often there is background taxonomic information (in terms of subclasses and subproperties) that shou…
A method for reasoning on knowledge graphs using debate dynamics.
New method constructs moduli spaces of Lagrangian surfaces in CP^2 from grid diagrams.
We first show that the braid group over a graph topologically containing no -shape subgraph has a presentation related only by commutators. Then using discrete Morse theory and triple Massey products, we prove that a graph topologically contains none of four prescribed graphs if and only if its 4-braid groups is a r…
We use the theory of oriented matroids to show that any linear embedding of , the complete graph on nine vertices, contains a non-split link with three components.
We address the problem of learning vector representations for entities and relations in Knowledge Graphs (KGs) for Knowledge Base Completion (KBC). This problem has received significant attention in the past few years and multiple methods have been proposed. Most of the existing methods in the literature use a predefin…
In this article we give necessary and sufficient conditions for two triples of integers to be realized as the Thurston-Bennequin number and the rotation number of a Legendrian theta-graph with all cycles unknotted. We show that these invariants are not enough to determine the Legendrian class of a topologically planar …
Knowledge Graph (KG) embedding has attracted more attention in recent years. Most KG embedding models learn from time-unaware triples. However, the inclusion of temporal information beside triples would further improve the performance of a KGE model. In this regard, we propose ATiSE, a temporal KG embedding model which…
We associate a two-step nilpotent Lie algebra to an arbitrary Schreier graph. We then use properties of the Schreier graph to determine necessary and sufficient conditions for this Lie algebra to extend to a three-step nilpotent Lie algebra. As an application, if we start with pairs of non-isomorphic Schreier graphs co…
TransINT embeds KGs by preserving implication rules, outperforming existing methods.
Novel GNN model tackles few-shot learning with improved performance.
There is an established bijection between finite-index subgroups Gamma of Gamma(2) and bipartite graphs on surfaces, or, equivalently, certain triples of permutations. We utilize this relationship to study both congruence and noncongruence subgroups in terms of the corresponding graphs. We show some elementary criteria…
We consider a system of three surfaces, graphs over a bounded domain in , intersecting along a time-dependent curve and moving by mean curvature while preserving the pairwise angles at the curve of intersection (equal to .) For the corresponding two-dimensional parabolic free boundary problem we pr…
The paper integrates Lie-Leibniz triples into Lie group-rack triples.
The recent proliferation of knowledge graphs (KGs) coupled with incomplete or partial information, in the form of missing relations (links) between entities, has fueled a lot of research on knowledge base completion (also known as relation prediction). Several recent works suggest that convolutional neural network (CNN…
We describe some regular techniques of calculating finite degree invariants of triple points free smooth plane curves . They are a direct analog of similar techniques for knot invariants and are based on the calculus of {\em triangular diagrams} and {\em connected hypergraphs} in the same way as the calcul…
Tensor models decode human perception and memory using SPO triples.
Integrable dynamics explained via geometric maps and cluster algebras.
We consider the motion by mean curvature of an -dimensional graph over a time-dependent domain in , intersecting at a constant angle. In the general case, we prove local existence for the corresponding quasilinear parabolic equation with a free boundary, and derive a continuation criteri…
New -manifolds created from -regular graphs with unique Eulerian cycles.
Introduces new spectral triples for parabolic geometry.
Knowledge graphs are structured representations of real world facts. However, they typically contain only a small subset of all possible facts. Link prediction is a task of inferring missing facts based on existing ones. We propose TuckER, a relatively straightforward but powerful linear model based on Tucker decomposi…
Develops TCD maps to relate discrete differential geometry and cluster algebras.
Every link in the 3-sphere has a projection to the plane where the only singularities are pairwise transverse triple points. The associated diagram, with height information at each triple point, is a triple-crossing diagram of the link. We give a set of diagrammatic moves on triple-crossing diagrams analogous to the Re…
Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise disjoint. We conjecture that it can be algorithmically checked if an (ordered or unorde…
Triple linking numbers were defined for 3-component oriented surface-links in 4-space using signed triple points on projections in 3-space. In this paper we give an algebraic formulation using intersections of homology classes (or cup products on cohomology groups). We prove that spherical links have trivial triple lin…
We introduce mod 3 triple Milnor invariants and triple cubic residue symbols for certain primes of the Eisenstein number field , following the analogies between knots and primes. Our triple symbol generalizes both the cubic residue symbol and Rédei's triple symbol, and describes the decomposition…
We consider a knot homotopy as a cylinder in 4-space. An ordinary triple point of the cylinder is called {\em coherent} if all three branches intersect at pairwise with the same index. A {\em triple unknotting} of a classical knot is a homotopy which connects with the trivial knot and which has as singu…
Extends Einstein-Hilbert action to higher-order spectral triples.
Computing Chern-Simons action for perturbed Dirac triples
In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the table of known knots and links with triple-crossing number equal to five. By intro…
I answer an open question left by Gui-Song Li in "On self-intersections of immersed surfaces" (AMS Proceedings, Volume 126, 1998, pp.3721-3726.) The intersection graph of a generic surface is the set of values which are either singularities or intersections. It is a multigraph whose edges are trans…
We give the classification of solvable and splitting Lie triple system and it turn that, up to isomorphism there exist 7 non isomorphic canonical Lie triple systems and 6 non isomorphic splitting canonical Lie triple systems and find the solvable Lie algebras associated.
In the 1950's Milnor defined a family of higher order invariants generalizing the linking number. Even the first of these new invariants, the triple linking number, has received and fruitful study since its inception. In the case that has vanishing pairwise linking numbers, this triple linking number gives an integ…
Study describes moduli of quaternionic hyperbolic triples of points.
The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain -component -link () determined from two commutative pure -braids and . We present the triple linking number of such a -link, by usin…
Extends Manin triples to Lie bialgebroids over Lie groupoids.
Invariant detects triple points in sphere immersions.