相关论文: Knots in lattice homology

Graph embedding is a transformation of nodes of a graph into a set of vectors. A~good embedding should capture the graph topology, node-to-node relationship, and other relevant information about the graph, its subgraphs, and nodes. If these…

We study the homology concordance group of knots in integer homology three-spheres which bound integer homology four-balls. Using knot Floer homology, we construct an infinite number of $\mathbb{Z}$-valued, linearly independent homology…

In this paper, we define grid homologies for singular links in lens spaces and use them to construct a resolution cube for knot Floer homology of regular links in lens spaces. The results will first be proved over $\mathbb{Z}/2\mathbb{Z}$…

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…

We define a filtration of the smooth concordance group based on the genus of representative knots. We use the Heegaard Floer epsilon and Upsilon invariants to prove the quotient groups with respect to this filtration are infinitely…

We define a notion of {\it positive part} of a lattice $\Lambda$ and we endow the set of such positive parts with a topology. We then study some properties of this topology, by comparing it with the one of $V^*/\RM_{> 0}$, where $V^*$ is…

Classical graph matching aims to find a node correspondence between two unlabeled graphs of known topologies. This problem has a wide range of applications, from matching identities in social networks to identifying similar biological…

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

Let $\Gamma_G$ denote a graph associated with a group $G$. A compelling question about finite groups asks whether or not a finite group $H$ must be nilpotent provided $\Gamma_H$ is isomorphic to $\Gamma_G$ for a finite nilpotent group $G$.…

Given an arbitrary graph $E$ we investigate the relationship between $E$ and the groupoid $G_E$. We show that there is a lattice isomorphism between the lattice of pairs $(H, S)$, where $H$ is a hereditary and saturated set of vertices and…

There is interesting internal structure in the nullspaces of graph and hypergraph adjacency matrices, especially for trees, bipartite graphs, and related combinatorial classes. The zero loci of nullvectors, i.e., their zero coordinates'…

We review the use of grid diagrams in the development of Heegaard Floer theory. We describe the construction of the combinatorial link Floer complex, and the resulting algorithm for unknot detection. We also explain how grid diagrams can be…

Let $G$ be a finite non-cyclic group. The non-cyclic graph $\Gamma_G$ of $G$ is the graph whose vertex set is $G\setminus Cyc(G)$, two distinct vertices being adjacent if they do not generate a cyclic subgroup, where $Cyc(G)=\{a\in G:…

Graph neural networks can accurately predict the chemical properties of many molecular systems, but their suitability for large, macromolecular assemblies such as gels is unknown. Here, graph neural networks were trained and optimised for…

We present a braid-theoretic approach to combinatorially computing knot Floer homology. To a knot or link K, which is braided about the standard disk open book decomposition for (S^3,\xi_std), we associate a corresponding multi-pointed nice…

Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…

We study the theory of convergence for CAT$(0)$-lattices (that is groups $\Gamma$ acting geometrically on proper, geodesically complete CAT$(0)$-spaces) and their quotients (CAT$(0)$-orbispaces). We describe some splitting and collapsing…

We consider a graph called a lattice diagram, which is a graph in the $xy$-plane such that each edge is parallel to the $x$-axis or the $y$-axis. In [4], we investigated transformations of certain lattice diagrams, and we considered the…

We use the Heegaard-Floer homology correction terms defined by Ozsv\'{a}th--Szab\'{o} to formulate a new obstruction for a knot to be of finite order in the smooth concordance group. This obstruction bears a formal resemblance to that of…

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…