Odd crossing numbers and even rotation numbers for cycles in plane immersions.
problem Analyzing crossing and rotation numbers of cycles in plane immersions of graphs.
method Generic immersions and Legendrian embeddings of graphs, focusing on cycles of specific lengths.
result Sum of rotation numbers of all 5-cycles is even, and sum of crossing numbers is odd.
Approximates cycles in planar and bounded-genus graphs.
problem Finding many disjoint cycles in planar and bounded-genus graphs.
method Constant-factor approximation algorithms for vertex-disjoint and edge-disjoint cycles.
result First algorithms for vertex-disjoint paths in fully planar and bounded-genus instances.
The paper explores linked cycles in graphs and their properties.
problem Understanding the structure of linked cycles in graphs.
method Analyzing the set of all pairs of disjoint cycles in graphs and showing conditions for minimally linked sets.
result A minimally linked set of cycles in a complete graph Kp+q has at most eighteen elements. 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.
problem Detecting non-trivial cycles in embedding spaces.
method Construct cycles from chord diagrams, use modified configuration space integrals, and pair arguments.
result Non-trivial cycles in embedding spaces are detected.
Characterizes weakly linked pairs of complete graphs in 3D space.
problem Identifying pairs of complete graphs that are weakly linked.
method Algebraic characterisation and geometric analysis of linking cycles.
result Characterization of weakly linked pairs of complete graphs.
Study on detecting and recovering hidden dense cycles in random graphs.
problem Detecting and recovering hidden dense cycles in random graphs.
method Information-theoretic analysis of thresholds for detection and recovery.
result Characterization of information-theoretic thresholds for detection and recovery.
New 3-manifolds created from 4-regular graphs with unique Eulerian cycles.
problem Creating compact 3-manifolds from specific graph structures. method Defining 3-manifolds via compatible Eulerian cycles in 4-regular graphs. result Each manifold in the class has a unique minimal ideal triangulation with n tetrahedra. New graph invariant measures embeddability in 3D.
problem Measuring embeddability of graphs in 3D.
method Defining freeness index to measure embeddability of graph complements.
result Cubic graphs satisfying orientable cycle double cover conjecture have freeness index at least two.
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.
problem Detecting and recovering dense cycles in Erdős-Rényi graphs.
method Characterization of computational thresholds for detection and recovery using low-degree polynomial algorithms.
result A gap exists between the detection and recovery thresholds for certain parameter regimes.
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.
problem Graph complexes without specific cycle lengths.
method Proves stronger statements about independence complexes being contractible or homotopy equivalent to spheres.
result Independence complexes are either contractible or homotopy equivalent to spheres.
In 1983 Conway and Gordon proved that any embedding of the complete graph K7 into R3 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 asymptotic expansion of graph Laplacian on discretized surfaces, relating spanning trees and cycle-rooted forests.
problem Asymptotic expansion of graph Laplacian on discretized surfaces.
method Relate spanning trees and cycle-rooted spanning forests to zeta-regularized determinants.
result Explicit formula for limit of cycle-rooted spanning forest probability and topological observables.
Study on linking numbers in random book embeddings of complete graphs.
problem Distribution and mean of linking numbers in random book embeddings of complete graphs.
method Analyzes a family of two-component links arising from random embeddings of complete graphs, using Eulerian numbers and linear growth in mean linking number.
result Mean of squared linking number over all random embeddings is $ rac{i}{6}$, where i is the number of interior edges. New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.
problem Learning causal structures with cycles in linear non-Gaussian models.
method Characterizing when graphs determine the same model, using quadratic and cubic polynomial relations, and a strategy of decorrelating cycles and multivariate regression.
result Consistent and computationally efficient algorithm for learning causal structures with disjoint cycles.
Study of height jumps in Ceresa cycle using asymptotic Hodge theory.
problem Understanding height jumps in the Ceresa cycle.
method Analysis of asymptotic behavior of Hain-Reed beta-invariant in degenerating families of curves.
result Height jump of Ceresa cycle is equal to the slope of the dual graph of the curve.
Let S(s,w) be the graph whose vertices are all subexpressions with target w of a fixed expression s in generators of a Coxeter group and edges are the pairs of subexpressions with Hamming distance 2. We prove that S(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.
problem Identify causal graph structure with cycles and latent confounders.
method Established lower bounds, developed CI and do see tests algorithms, and proved tightness.
result Proposed algorithms can recover all causal edges except for double adjacent bidirected edges.
We extend the edge version of the classical Menger's Theorem for undirected graphs to n-dimensional simplicial complexes with chains over the field F2. 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 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.
problem Identifying stable predictors in models with hidden variables and causal cycles.
method Use acyclic directed mixed graphs (ADMGs) and directed graphs (DGs) with m-separation and σ-separation to characterize and construct intervention-stable predictor sets. result Graphical characterizations of Markov blankets, stable frontiers, and stable blankets in models with hidden variables and cycles.
Gauss diagrams' properties can change with Hamiltonian cycle choice.
problem The impact of Hamiltonian cycle choice on Gauss diagrams.
method Examined realizable and unrealizable Gauss diagrams, and proved preservation of realizability under certain Hamiltonian cycle changes.
result Properties of Gauss diagrams can vary 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.
problem Completing swap cycles in decentralized exchanges efficiently and without slippage.
method Introduces an asset matrix formulation to verify and complete CoW cycles using graph traversal and imbalance correction.
result Demonstrates efficient discovery and insertion of synthetic orders for atomic cycle closure.
Hamiltonian cycles found in toroidal maps.
problem Hamiltonicity of doubly semi-equivelar maps on the torus.
method Analyzing 2-uniform tilings of the plane to derive Hamiltonian cycles.
result Every doubly semi-equivelar map on the torus contains a Hamiltonian cycle.
The study provides a criterion to compute the total Thurston-Bennequin invariant of Legendrian graphs.
problem Computing the total Thurston-Bennequin invariant for Legendrian graphs.
method Generalized criterion for computing the total Thurston-Bennequin invariant from the tb of smaller cycles.
result The criterion holds for graphs with up to 9 vertices and for infinite families of examples.
Algorithms compute length spectra of torus graphs efficiently.
problem Computing length spectra of graphs embedded on a torus.
method Preprocessing and algorithms based on polyhedral norms.
result Efficient computation of length spectra and spectrum comparison.
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 K6, 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.
problem Finding the minimum number of vertices in a discrete isometric filling of cycle graphs.
method Explicit construction of isometric fillings using concentric annular structures.
result Explicit construction of isometric fillings with \( |V(K_n)| \le \left(\frac{1}{6} + o(1)
ight)n^2 \), improving the upper bound to \( D^* \le \frac{1}{6} \).
New proof shows no flat embedding for Petersen family graphs.
problem Proving Petersen family graphs have no flat embeddings.
method Applying Böhme's Lemma and the Jordan-Brouwer Separation Theorem.
result Every Petersen family graph has no flat embedding.
The study finds conditions on graph complements for positive curvature.
problem Conditions for positive Lin--Lu--Yau curvature in graph complements.
method Investigation of forbidden subgraphs in graph complements.
result Graphs without 4-cycles in their complement have positive curvature.
Study classifies Halin graphs with positive curvature.
problem Classifying Halin graphs with specific curvature.
method Analyzing generalized Halin graphs formed by connecting tree leaves.
result Identified all generalized Halin graphs with positive Lin-Lu-Yau curvature.
New theorem bounds link volume using surface coefficients.
problem Bounding hyperbolic volume of links on surfaces.
method Analogue of Dasbach-Lin theorem for surface links.
result Bounds on link volume from surface polynomial 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.
problem Constructing non-trivial cocycles for long embeddings with more than one loop.
method Integral over configuration spaces associated with Bott-Cattaneo-Rossi graphs with more than one loop.
result Explicit construction of a non-trivial family of trivial long embeddings for odd dimensions.
The study constructs a Legendrian cycle for FnW2,n-sets and proves Reilly-type variational formulae.
problem Understanding higher-order mean curvature integrals of non-smooth sets.
method Construction of a Legendrian cycle and analysis of proximal unit normal bundles.
result Reilly-type variational formulae for higher-order mean curvature integrals of FnW2,n-sets. In this paper we present new proofs of the Conway-Gordon-Sachs and Sachs Theorems on the linked cycles in graphs embedded in R3. 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.
problem Computing Masur-Veech volumes for quadratic differentials.
method Describing components of the double ramification cycle and their excess intersection classes, leading to a recursion for completed volumes.
result Completed volumes agree with top intersection of tautological classes on 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.