Related papers: 2-regular Digraphs of the Lovelock Lagrangian

We define an invariant of Legendrian links in the double-point enhanced grid homology of a link, and prove that it obstructs decomposable Lagrangian cobordisms in the symplectization of the standard contact structure on $\mathbb R^3$.

Bidirected graphs generalize directed and undirected graphs in that edges are oriented locally at every node. The natural notion of the degree of a node that takes into account (local) orientations is that of net-degree. In this paper, we…

A normally regular digraph with parameters $(v,k,\lambda,\mu)$ is a directed graph on $v$ vertices whose adjacency matrix $A$ satisfies the equation $AA^t=k I+\lambda (A+A^t)+\mu(J-I-A-A^t)$. This means that every vertex has out-degree $k$,…

This paper consists of a description of the variety of two dimensional associative algebras within the framework of Nonstandard Analysis. By decomposing each algebra in A^2 as sum of a Jordan algebra and a Lie algebra, we calculate the…

We study bi-Lagrangian structures (a symplectic form with a pair of complementary Lagrangian foliations, also known as para-K\"ahler or K\"unneth structures) on nilmanifolds of dimension less than or equal to 6. In particular, building on…

Let $\Delta =\{ \delta_1,\delta_2,...,\delta_m \} $ be a finite set of 2-connected patterns, i.e. graphs up to vertex relabelling. We study the generating function $D_{\Delta }(z,u_1,u_2,...,u_m),$ which counts polygon dissections and marks…

The Lovelock Lagrangian is for even dimension D obtained from Weil polynomials on the Lie algebra of the Lorentz group SO(1,D-1). The procedure for generating it is related to the Weil homomorphism that converts Lie algebra invariants into…

We study graphs on $n$ vertices which have $2n-2$ edges and no proper induced subgraphs of minimum degree $3$. Erd\H{o}s, Faudree, Gy\'arf\'as, and Schelp conjectured that such graphs always have cycles of lengths $3,4,5,\dots, C(n)$ for…

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

We analyze the particle spectrum of a second-order (in derivatives) theory based on a rank-2 tensor field with both symmetric and antisymmetric components. By demanding the existence of a propagating massless spin-2 particle and invariance…

The $2$-decomposition for ribbon graphs was introduced in [Annals of Combinatorics 15 (2011), pp 675-706]. We extend this result to half-edged ribbon graphs and to rank $D$-weakly colored graphs [SIGMA 12 (2016), 030], generalizing…

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…

For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…

We introduce and study several affine (=annular in this paper) versions of the classical diagram algebras such as Temperley-Lieb, partition, Brauer, Motzkin, rook Brauer, rook, planar partition, and planar rook algebras. We give generators…

In this paper, we introduce the notion of two-way $(t,\lambda)$-liking digraphs as a way to extend the results for generalized friendship graphs. A two-way $(t,\lambda)$-liking digraph is a digraph in which every $t$ vertices have exactly…

We consider knot invariants in the context of large $N$ transitions of topological strings. In particular we consider aspects of Lagrangian cycles associated to knots in the conifold geometry. We show how these can be explicity constructed…

In this paper we study the algebra monomorphisms from A_m =R^(2^m) into A_n=R^(2^n) for 0<m<n where the A_k 's are the Cayley- Dickson algebras over the real numbers. We show that for m>2 there are many different types of monomorphisms and…

We obtain new invariants of topological link concordance and homology cobordism of 3-manifolds from Hirzebruch-type intersection form defects of towers of iterated p-covers. Our invariants can extract geometric information from an arbitrary…

In a graph A, for each two arbitrary vertices g, h with d(g,h)=2,|MAg2h|=mAg2h is introduced the number of edges of A that are closer to g than to h. We say A is a 2-edge distance-balanced graph if we have mAg2h=mAh2g. In this article, we…

We prove that the number of edges of a multigraph $G$ with $n$ vertices is at most $O(n^2\log n)$, provided that any two edges cross at most once, parallel edges are noncrossing, and the lens enclosed by every pair of parallel edges in $G$…