Related papers: Cocycles of the space of long embeddings and BCR g…

In this paper, we give some non-trivial geometric cycles of the space of long embeddings R^j --> R^n (n-j >= 2) modulo immersions. We construct a class of cycles from specific chord diagrams associated with the 2-loop or 3-loop hairy…

We will construct differential forms on the embedding spaces Emb(R^j,R^n) for n-j>=2 using configuration space integral associated with 1-loop graphs, and show that some linear combinations of these forms are closed in some dimensions.…

In this paper we show that via the configuration space integral construction a non-trivalent graph cocycle can also yield a non-zero cohomology class of the space of higher (and even) codimensional long knots. This simultaneously proves…

We classify rotary (orientably-regular) maps whose underlying graphs are multicycles. For the multicycle $\mathrm{C}_n^{(\lambda)}$ of length $n$ and edge-multiplicity $\lambda$, we determine all rotary embeddings for $n\geqslant 3$ and…

We construct nontrivial cohomology classes of the space $Imb(S^1,\R^n)$ of imbeddings of the circle into $\R^n$, by means of Feynman diagrams. More precisely, starting from a suitable linear combination of nontrivalent diagrams, we…

Let K be the space of long j-knots in R^n. In this paper we introduce a graph complex D and a linear map I from D to the de Rham complex of K via configuration space integral, and prove that (1) when both n>j>=3 are odd, the map I is a…

We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…

The real cohomology of the space of imbeddings of S^1 into R^n, n>3, is studied by using configuration space integrals. Nontrivial classes are explicitly constructed. As a by-product, we prove the nontriviality of certain cycles of…

We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…

In this paper, we study a class of graph drawings that arise from bobbin lace patterns. The drawings are periodic and require a combinatorial embedding with specific properties which we outline and demonstrate can be verified in linear…

Cocycles are constructed by polynomial expressions for Alexander quandles. As applications, non-triviality of some quandle homology groups are proved, and quandle cocycle invariants of knots are studied. In particular, for an infinite…

We find a family of planar bipartite graphs all of whose Lombardi drawings (drawings with circular arcs for edges, meeting at equal angles at the vertices) are nonplanar. We also find families of embedded series-parallel graphs and…

It is well known that the edge vector space of an oriented graph can be decomposed in terms of cycles and cocycles (alias cuts, or bonds), and that a basis for the cycle and the cocycle spaces can be generated by adding and removing edges…

We construct a number of topologically trivial but smoothly non-trivial families of embeddings of 3-manifolds in 4-manifolds. These include embeddings of homology spheres in $S^4$ that are not isotopic but have diffeomorphic complements,…

The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…

We produce an infinite family of $2$-complexes that are intrinsically linked when embedded into four dimensions. In particular, we show that any embedding into $\mathbb{R}^4$ of the suspension of a graph containing $K_6$ as a minor contains…

For the space of long knots in R^3, Vassiliev's theory defines the so called finite order cocycles. Zero degree cocycles are finite type knot invariants. The first non-trivial cocycle of positive dimension in the space of long knots has…

The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of…

We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural results for this lattice, including explicit formulas for…

Let Emb(S^j,S^n) denote the space of C^infty-smooth embeddings of the j-sphere in the n-sphere. This paper considers homotopy-theoretic properties of the family of spaces Emb(S^j,S^n) for n >= j > 0. There is a homotopy-equivalence of…