Related papers: Rectangular Diagrams of Legendrian Graphs
Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…
The Gronwall conjecture states that a planar 3-web of foliations which admits more than one distinct linearizations is locally equivalent to an algebraic web. We propose an analogue of the Gronwall conjecture for the 3-web of foliations by…
We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…
Motivated by the problem of global stability of thermodynamical equilibria in non-equilibrium thermodynamics formulated in a recent paper [12], we introduce some mechanisms for constructing semi-infinite orbits of contact Hamiltonian…
Associated Legendre functions of fractional degree appear in the solution of boundary value problems in wedges or in toroidal geometries, and elsewhere in applied mathematics. In the classical case when the degree is half an odd integer,…
In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand…
For certain types of quantum graphs we show that the random-matrix form factor can be recovered to at least third order in the scaled time $\tau$ from periodic-orbit theory. We consider the contributions from pairs of periodic orbits…
We introduce topological parallelisms of oriented lines (briefly called oriented parallelisms). Every topological parallelism (of lines) on PG(3,R) gives rise to a parallelism of oriented lines, but we show that even the most homogeneous…
We define relative versions of the classical invariants of Legendrian and transverse knots in contact 3-manifolds for knots that are homologous to a fixed reference knot. We show these invariants are well-defined and give some basic…
We give an $h$--principle type result for a class of Legendrian embeddings in contact manifolds of dimension at least $5$. These Legendrians, referred to as loose, have trivial pseudo-holomorphic invariants. We demonstrate they are…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
We interpret realizations of a graph on the sphere up to rotations as elements of a moduli space of curves of genus zero. We focus on those graphs that admit an assignment of edge lengths on the sphere resulting in a flexible object. Our…
Recently, there are a great deal of work done which connects the Legendrian isotopic problem with contact invariants. The isotopic problem of Legendre curve in a contact 3-manifold was studies via the Legendrian curve shortening flow which…
The notion of an upward plane graph in graph theory and that of a progressive plane graph (or plane string diagram) in category theory are essentially the same thing. In this paper, we combine the ideas in graph theory and category theory…
For any Legendrian knot in (R^3,ker(dz-ydx)), we show that the existence of an augmentation to any field of the Chekanov-Eliashberg differential graded algebra over Z[t,t^{-1}] is equivalent to the existence of a ruling of the front…
In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…
We prove a deletion-contraction formula for motivic Feynman rules given by the classes of the affine graph hypersurface complement in the Grothendieck ring of varieties. We derive explicit recursions and generating series for these motivic…
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…
We unify several seemingly different graph and digraph classes under one umbrella. These classes are all broadly speaking different generalizations of interval graphs, and include, in addition to interval graphs, also adjusted interval…
We prove analogues for hypergraphs of Szemer\'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer\'edi theorem of Furstenberg and…