arXiv research

Odd crossing numbers and even rotation numbers for cycles in plane immersions.

Approximates cycles in planar and bounded-genus graphs.

The paper explores linked cycles in graphs and their properties.

We show that deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph.

Paper detects non-trivial cycles in embedding spaces using graph integrals.

Characterizes weakly linked pairs of complete graphs in 3D space.

Study on detecting and recovering hidden dense cycles in random graphs.

New $3$-manifolds created from $4$-regular graphs with unique Eulerian cycles.

New graph invariant measures embeddability in 3D.

Using Kontsevich's identification of the homology of the Lie algebra l_infty with the cohomology of Out(F_r), Morita defined a sequence of 4k-dimensional classes mu_k in the unstable rational homology of Out(F_{2k+2}). He showed by a computer calculation that the first of these is non-trivial, so coincides with the uni…

Detection of dense cycles in graphs reveals a gap between easy detection and hard recovery.

Lin-Lu-Yau introduced an interesting notion of Ricci curvature for graphs and obtained a complete characterization for all Ricci-flat graphs with girth at least five [1]. In this paper, we propose a concrete approach to construct an infinite family of distinct Ricci-flat graphs of girth four with edge-disjoint 4-cycles…

Proves a conjecture about graph complexes without specific cycle lengths.

In 1983 Conway and Gordon proved that any embedding of the complete graph $K_7$ into $\mathbb{R}^3$ contains at least one nontrivial knot as its Hamiltonian cycle. After their work knots (also links) are considered as intrinsic properties of abstract graphs, and numerous subsequent works have been continued until recen…

We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. In particular, we show the existence of contractible Hamiltonian cycle in equivelar triangulated maps. We also present an alg…

We study the Thurston-Bennequin number of complete and complete bipartite Legendrian graphs. We define a new invariant called the total Thurston-Bennequin number of the graph. We show that this invariant is determined by the Thurston-Bennequin numbers of 3-cycles for complete graphs and by the Thurston-Bennequin number…

Study on linking numbers in random book embeddings of complete graphs.

New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.

Study of height jumps in Ceresa cycle using asymptotic Hodge theory.

Let $\mathfrak{S}(\underline{s},w)$ be the graph whose vertices are all subexpressions with target $w$ of a fixed expression $\underline{s}$ in generators of a Coxeter group and edges are the pairs of subexpressions with Hamming distance 2. We prove that $\mathfrak{S}(\underline{s},w)$ is connected and its cycle space …

We present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to construct such cycles. This is further generalized and shown to hold for more general maps.

Study designs experiments to identify causal graph structure with cycles and latent confounders.

We extend the edge version of the classical Menger's Theorem for undirected graphs to $n$-dimensional simplicial complexes with chains over the field $\mathbb{F}_2$. The classical Menger's Theorem states that two different vertices in an undirected graph can be connected by $k$ pairwise edge-disjoint paths if, and only…

We describe which knots can be obtained as cycles in the canonical book representation of K_n, the complete graph on n vertices. We show that the canonical book representation of K_n contains a Hamiltonian cycle that is a composite knot if and only if n>11 and we show that when p and q are relatively prime, the (p,q) t…

We prove that, up to homeomorphism, any graph subject to natural necessary conditions on orientation and the cycle rank can be realized as the Reeb graph of a Morse function on a given closed manifold $M$. Along the way, we show that the Reeb number $\mathcal{R}(M)$, i.e. the maximum cycle rank among all Reeb graphs of…

This paper extends stable blanket theory to models with hidden variables and causal cycles.

Gauss diagrams' properties can change with Hamiltonian cycle choice.

We investigate probabilistic graphical models that allow for both cycles and latent variables. For this we introduce directed graphs with hyperedges (HEDGes), generalizing and combining both marginalized directed acyclic graphs (mDAGs) that can model latent (dependent) variables, and directed mixed graphs (DMGs) that c…

Proposes a new method for completing swap cycles in decentralized exchanges.

Hamiltonian cycles found in toroidal maps.

The study provides a criterion to compute the total Thurston-Bennequin invariant of Legendrian graphs.

Algorithms compute length spectra of torus graphs efficiently.

A book representation of a graph is a particular way of embedding a graph in three dimensional space so that the vertices lie on a circle and the edges are chords on disjoint topological disks. We describe a set of operations on book representations that preserves ambient isotopy, and apply these operations to $K_6$, t…

We determine when certain state cycles represent nontrivial Khovanov homology classes by analyzing features of the state graph. Using this method, we are able to produce hyperbolic knots with arbitrarily many diagonals containing nontrivial state cycle homology classes. This gives lower bounds on the Khovanov width of …

Improved upper bound for discrete isometric filling of cycles.

New proof shows no flat embedding for Petersen family graphs.

The study finds conditions on graph complements for positive curvature.

Study classifies Halin graphs with positive curvature.

New theorem bounds link volume using surface coefficients.

We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every face of a planar embedding of the graph in order to capture the effect of unary potentials. A ground state of the resulting approximation can…

While loopy belief propagation (LBP) performs reasonably well for inference in some Gaussian graphical models with cycles, its performance is unsatisfactory for many others. In particular for some models LBP does not converge, and in general when it does converge, the computed variances are incorrect (except for cycle-…

The paper constructs non-trivial cocycles for long embeddings with more than one loop.

The study constructs a Legendrian cycle for $F_nW^{2,n}$-sets and proves Reilly-type variational formulae.

In this paper we present new proofs of the Conway-Gordon-Sachs and Sachs Theorems on the linked cycles in graphs embedded in $\R^3$. We reduce these theorems to certain property of graphs mapped to the plane.

We state and prove a correct version of a theorem presented in an earlier paper.

Completed volumes match with combinatorial classes of the double ramification cycle.

We showed in another paper [arXiv:1103.1759] that every connected graph can be realized as the cut locus of some point on some riemannian surface $S$. Here, criteria for the orientability of $S$ are given, and are applied to classify the distinct, orientable, cut locus structures on graphs with four generating cycles.

We present formulae for computing the Yamada polynomial of spatial graphs obtained by replacing edges of plane graphs, such as cycle-graphs, theta-graphs, and bouquet-graphs, by spatial parts. As a corollary, it is shown that zeros of Yamada polynomials of some series of spatial graphs are dense in a certain region in …