Related papers: 2-regular Digraphs of the Lovelock Lagrangian

We characterize all graphs for which there are eigenvectors of the graph Laplacian having all their components in {-1,+1} or {-1,0,+ 1}. Graphs having eigenvectors with components in {-1,+1} are called bivalent and are shown to be the…

We prove that the maximum number of edges in a 3-uniform linear hypergraph on $n$ vertices containing no 2-regular subhypergraph is $n^{1+o(1)}$. This resolves a conjecture of Dellamonica, Haxell, Luczak, Mubayi, Nagle, Person, R\"odl,…

It is shown that graphs that generalize the ADE Dynkin diagrams and have appeared in various contexts of two-dimensional field theory may be regarded in a natural way as encoding the geometry of a root system. After recalling what are the…

Some formulae are given for the enumeration of certain types of dissections of the convex (n+2)-gon by non-crossing diagonals. The classical Schroeder and Motzkin numbers are addressed using a cataloguing tool, the "reversive symbol". The…

Let (X, g) be an arbitrary pseudo-riemannian manifold. A celebrated result by Lovelock gives an explicit description of all second-order natural (0,2)-tensors on X, that satisfy the conditions of being symmetric and divergence-free. Apart…

This work is a follow-up of the article [Proc.\ London Math.\ Soc.\ 119(2):358--378, 2019], where the authors solved the problem of counting labelled 4-regular planar graphs. In this paper, we obtain a precise asymptotic estimate for the…

Given a monotone Lagrangian submanifold invariant under a loop of Hamiltonian diffeomorphisms, we compute a piece of the closed-open string map into the Hochschild cohomology of the Lagrangian which captures the homology class of the loop's…

We define a differential graded algebra associated to Legendrian knots in thickened convex surfaces $\Sigma\times \mathbb{R}$. The algebra is defined in the same spirit as the Chekanov-Eliashberg DGA for Legendrians in $\mathbb{R}^3$, but…

The classification of one parameter local Coulomb branch solution of theories with eight supercharges is given by assuming that it is given by a genus $g$ fiberation of Riemann surfaces. The crucial point is the fact that certain conjugacy…

We explain a direct topological proof for the multiplicativity of Duflo isomorphism for arbitrary finite dimensional Lie algebras, and derive the explicit formula for the Duflo map. The proof follows a series of implications, starting with…

We show that the class of multigraphs with at most $p$ connected components and bonds of size at most $k$ is well-quasi-ordered by edge contraction for all positive integers $p,k$. (A bond is a minimal non-empty edge cut.) We also…

We observe that for planar graphs, the geometric duality relation generates both 2-isomorphism and abstract duality. This observation has the surprising consequence that for links, the equivalence relation defined by isomorphisms of…

In this paper we find asymptotic enumerations for the number of line graphs on $n$-labelled vertices and for different types of related combinatorial objects called 2-covers. We find that the number of 2-covers, $s_n$, and proper 2-covers,…

In this article, we extend the notion of the Laplacian spread to simple directed graphs (digraphs) using the restricted numerical range. First, we provide Laplacian spread values for several families of digraphs. Then, we prove sharp upper…

We construct infinitely many connected, circulant digraphs of outdegree three that have no hamiltonian circuit. All of our examples have an even number of vertices, and our examples are of two types: either every vertex in the digraph is…

We expand Conlon's random algebraic construction to show that for any odd number $k \geq 3$ exists a natural number $c_k$ (the same as Conlon's) such that $\operatorname{ex}(n^a,n,\theta_{k,c_k}) = \Omega_{k,a}((n^{1 + a})^{\frac{k +…

A good edge-labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. In this paper we prove that any graph on…

In this paper, we study the $L(2, 1)$-Labeling of the Mycielski and the iterated Mycielski of graphs in general. For a graph $G$ and all $t\geq 1$, we give sharp bounds for $\lambda(M^t(G))$ the $L(2, 1)$-labeling number of the $t$-th…

A type of directed multigraph called a W-digraph is introduced to model the structure of certain representations of Hecke algebras, including those constructed by Lusztig and Vogan from involutions in a Weyl group. Building on results of…

The paper constructs an infinite sequence of strongly regular directed graphs. The construction is based on representing adjacency matrices as block matrices composed of circulant blocks, together with the use of a compactification…