Related papers: Discrete Lagrangian Systems on Graphs. Symplecto-T…
We elaborate and make rigorous various speculations about the implications of spectral properties of self-adjoint operators on spaces of automorphic forms for location of zeros of $L$-functions. Some of these ideas arose in work of Colin de…
We consider a family of closed symplectic manifolds 4-manifolds which we call symplectic bielliptic surfaces and study its Lagrangian cobordism group of weakly-exact Lagrangian G-branes (that is, Lagrangians equipped with a grading, a Pin…
Architected materials possessing physico-chemical properties adaptable to disparate environmental conditions embody a disruptive new domain of materials science. Fueled by advances in digital design and fabrication, materials shaped into…
Let $G$ be a compact connected semisimple Lie group. We extend the techniques of Weinstein [W] to give a construction in group cohomology of symplectic forms $\omega$ on \lq twisted' moduli spaces of representations of the fundamental group…
We study Dirichlet forms and Laplacians on self-similar sets with overlaps. A notion of "finitely ramified of finite type($f.r.f.t.$) nested structure" for self-similar sets is introduced. It allows us to reconstruct a class of self-similar…
Dynamics on and of networks refer to changes in topology and node-associated signals, respectively and are pervasive in many socio-technological systems, including social, biological, and infrastructure networks. Due to practical…
A discrete version of the Conformal Field Theory of symplectic fermions is introduced and discussed. Specifically, discrete symplectic fermions are realised as holomorphic observables in the double-dimer model. Using techniques of discrete…
Previous work in the literature has studied the Hamiltonian structure of an R-squared model of gravity with torsion in a closed Friedmann-Robertson-Walker universe. Within the framework of Dirac's theory, torsion is found to lead to a…
The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often been considered. After…
Existing neural network models to learn Hamiltonian systems, such as SympNets, although accurate in low-dimensions, struggle to learn the correct dynamics for high-dimensional many-body systems. Herein, we introduce Symplectic Graph Neural…
We study the local symplectic algebra of curves. We use the method of algebraic restrictions to classify symplectic $T_7$ singularities. We define discrete symplectic invariants - the Lagrangian tangency orders. We use these invariants to…
Symmetries in the Lagrangian formalism of arbitrary order are analysed with the help of the so-called Anderson-Duchamp-Krupka equations. For the case of second order equations and a scalar field we establish a polynomial structure in the…
We establish several useful commutative diagrams consisting of low term exact sequences attached to {\Grot} spectral sequences, which extends and integrates the previous ones appeared in literature such as Alexei~N. Skorobogatov [Beyond the…
We present a variational theory of integrable differential-difference equations (semi-discrete integrable systems). This is a natural extension of the ideas known by the names "Lagrangian multiforms" and "Pluri-Lagrangian systems", which…
We introduce a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that the spectrum of this operator captures several structural…
The paper deals with a comprehensive theory of mappings, whose local behavior can be described by means of linear subspaces, contained in the graphs of two (primal and dual) generalized derivatives. This class of mappings includes the…
This thesis generalizes the differential operators on standard oriented graphs and oriented hypergraphs introduced in 10.1137/15M1022793 and arXiv:2007.00325. The extended concepts of gradients, adjoints and $p$-Laplacians for vertices and…
This paper investigates a model reduction problem for linear directed network systems, in which the interconnections among the vertices are described by general weakly connected digraphs. First, the definitions of pseudo controllability and…
Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient…
The spectral properties of the Laplacian operator on ``small-world'' lattices, that is mixtures of unidimensional chains and random graphs structures are investigated numerically and analytically. A transfer matrix formalism including a…