Related papers: Twisted edge Laplacians on finite graphs from a K\…
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…
In this paper, we show that associated to any coisotropic Cartan geometry there is a twisted Courant algebroid. This includes in particular parabolic geometries. Using this twisted Courant structure, we give some new results about the…
Effective resistance (ER) is an attractive way to interrogate the structure of graphs. It is an alternative to computing the eigen-vectors of the graph Laplacian. Graph laplacians are used to find low dimensional structures in high…
Twisted trilayer graphene (TLG) may be the simplest realistic system so far, which has flat bands with nontrivial topology. Here, we give a detailed calculation about its band structures and the band topology, i.e. valley Chern number of…
In the present paper we propose a geometric model of the twisted K-theory corresponding to elements of finite order in $H^3(X, \mathbb{Z})\times [X, \BBSU_\otimes]$.
Incommensurately twisted graphene bilayers are described by long-wavelength theories, but to date such theories exist only at small angles of interlayer rotation. We construct a long wavelength theory without such a restriction, instead…
Topological non-trivial band structures are the core problem in the field of topological materials. In this paper, we investigate the topological band structure in a system with controllable Dirac points from the perspective of wave packet…
Twisted bilayer graphene with a twist angle of around 1.1{\deg} features a pair of isolated flat electronic bands and forms a strongly correlated electronic platform. Here, we use scanning tunneling microscopy to probe local properties of…
We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…
We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or thickened $K_{3,m}$'s. Our construction is explicit,…
We study the atomic structure of twisted bilayer graphene, with very small mismatch angles ($\theta \sim 0.28^0$), a topic of intense recent interest. We use simulations, in which we combine a recently presented semi-empirical potential for…
A twisting system is one of the major tools to study graded algebras, however, it is often difficult to construct a (non-algebraic) twisting system if a graded algebra is given by generators and relations. In this paper, we show that a…
At certain angles of rotation called `magic angles' twisted bilayer graphene features almost flat bands. The resulting strong correlations drive the system to novel phases which have been observed in experiments recently. A complete…
In \cite{Elek} we proved that the limit of a weakly convergent sequence of finite graphs can be viewed as a graphing or a continuous field of infinite graphs. Thus one can associate a type $II_1$-von Neumann algebra to such graph sequences.…
The continuum model of the twisted graphene bilayer (Phys. Rev. Lett. 99, 256802, 2007) is extended to include all types of commensurate structures. The essential ingredient of the model, the Fourier components of the spatially modulated…
An oriented hypergraph is an oriented incidence structure that generalizes and unifies graph and hypergraph theoretic results by examining its locally signed graphic substructure. In this paper we obtain a combinatorial characterization of…
In this paper, the electronic properties of 30{\deg} twisted double bilayer graphene, which loses the translational symmetry due to the incommensurate twist angle, are studied by means of the tight-binding approximation. We demonstrate the…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
In this article, we introduce a new type of mapping contracting perimeters of triangles in a complete metric space and present related fixed point theorem. We study the metric completeness property of the underlying space in terms of fixed…
We consider the electronic structure of a slightly twisted graphene bilayer and show the coexistence of van Hove singularities (VHSs) and superlattice Dirac points in a continuum approximation. The graphene-on-graphene moir\'e pattern gives…