Related papers: Aubry-Mather theory on graphs
We survey results for Cameron-Liebler sets and low degree Boolean functions for Hamming graphs, Johnson graphs and Grassmann graphs from the point of view of association schemes. This survey covers selected results in finite geometry,…
We find a new definition of colored edge graphs of finite algebras in the case of minimal Taylor algebras, a definition which includes the graphs invented by A. Bulatov. Next we proceed to reprove the main results of A. Bulatov's theory in…
We give a proof of the KAM theorem on the existence of invariant tori for weakly perturbed Hamiltonian systems, based on Thirring's approach for Hamiltonians that are quadratic in the action variables. The main point of this approach is…
We propose a new model of ergodic optimization for expansive dynamical systems: the holonomic setting. In fact, we introduce an extension of the standard model used in this theory. The formulation we consider here is quite natural if one…
As a discretization of the Hodge Laplacian, the combinatorial Laplacian of simplicial complexes has garnered significant attention. In this paper, we study combinatorial Laplacians for complex pairs $(X, A)$, where $A$ is a subcomplex of a…
We derive an improved lattice Hamiltonian for pure gauge theory, coupling arbitrarily distant links in the kinetic term. The level of improvement achieved is examined in variational calculations of the SU(2) specific heat in 2+1 dimensions.
We adapt the notion of Jacobi diagrams on surfaces (considered by Andersen-Mattes-Reshetikhin), and construct a LMO-like map that we use to compare some functoriality properties of WRT and LMO invariants.
In what follows we improve an inequality related to matrix theory. T. Laffey proved (2013) a weaker form of this inequality [2].
In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…
We develop a theory of umkehr maps for twisted generalized homology theories. In this theory, interesting umkehr maps, including generalizations of important classical ones, are induced by cartesian morphisms of a certain category opfibred…
The recent two proofs for the (weak) factorization theorem for birational maps, one by W{\l}odarczyk and the other by Abramovich-Karu-Matsuki-W{\l}odarczyk rely on the results of Morelli. The former uses the process for…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
We study topological Poincar\'e type inequalities on general graphs. We characterize graphs satisfying such inequalities and then turn to the best constants in these inequalities. Invoking suitable metrics we can interpret these constants…
We develop a linear theory of discrete complex analysis on general quad-graphs, continuing and extending previous work of Duffin, Mercat, Kenyon, Chelkak and Smirnov on discrete complex analysis on rhombic quad-graphs. Our approach based on…
In this paper, we reformulate the Bakry-\'Emery curvature on a weighted graph in terms of the smallest eigenvalue of a rank one perturbation of the so-called curvature matrix using Schur complement. This new viewpoint allows us to show…
In this paper, we introduce a unified framework for defining Lin-Lu-Yau (LLY) Ricci curvature on both undirected and directed hypergraphs. By establishing upper bounds and monotonicity properties for the parameterized curvature…
Invariant Lagrangians yield invariant Euler-Lagrange equations, and it was discussed in the literature how to compute those using various local methods. The focus of this paper is on global algebraic differential invariants. In this case…
We develop a tool for embedding almost spanning degenerate graphs of small bandwidth. As an application, we extend the blow-up lemma to degenerate graphs of small bandwidth, the bandwidth theorem to degenerate graphs, and make progress on a…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…
We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…