English
Related papers

Related papers: Remarks about Connection and Dirac matrices

200 papers

We define a new invariant $w$ for hyperelliptic Lefschetz fibrations over closed oriented surfaces, which counts the number of Dirac braids included intrinsically in the monodromy, by using chart description introduced by the second author.…

Geometric Topology · Mathematics 2017-05-04 Hisaaki Endo , Seiichi Kamada

We shall give a twisted Dirac structure on the space of irreducible connections on a SU(n)-bundle over a three-manifold, and give a family of twisted Dirac structures on the space of irreducible connections on the trivial SU(n)-bundle over…

Differential Geometry · Mathematics 2021-06-22 Yuji Hirota , Tosiaki Kori

Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…

For any $n$-dimensional compact spin Riemannian manifold $M$ with a given spin structure and a spinor bundle $\Sigma M$, and any compact Riemannian manifold $N$, we show an $\epsilon$-regularity theorem for weakly Dirac-harmonic maps . As a…

Analysis of PDEs · Mathematics 2011-02-19 Changyou Wang , Deliang Xu

We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree…

Combinatorics · Mathematics 2011-10-05 Art M. Duval , Caroline J. Klivans , Jeremy L. Martin

The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…

Combinatorics · Mathematics 2025-03-24 Yan-Ting Xie , Shou-Jun Xu

Suppose that $\{T_{a}:a\in G\}$ is a group of uniformly $L$-Lipschitzian mappings with bounded orbits $\left\{T_{a}x:a\in G\right\}$ acting on a hyperconvex metric space $M$. We show that if $L<\sqrt{2}$, then the set of common fixed points…

Functional Analysis · Mathematics 2016-12-20 Andrzej Wiśnicki , Jacek Wośko

The \emph{simplicial rook graph} SR(d,n) is the graph whose vertices are the lattice points in the $n$th dilate of the standard simplex in $\mathbb{R}^d$, with two vertices adjacent if they differ in exactly two coordinates. We prove that…

Combinatorics · Mathematics 2014-05-06 Jeremy L. Martin , Jennifer D. Wagner

In this article, we consider the manifold learning problem when the data set is invariant under the action of a compact Lie group $K$. Our approach consists in augmenting the data-induced graph Laplacian by integrating over the $K$-orbits…

Machine Learning · Computer Science 2023-04-04 Paulina Hoyos , Joe Kileel

Darboux transformation plays a key role in constructing explicit closed-form solutions of completely integrable systems. This paper provides an algebraic construction of generalized Darboux matrices with the same poles for the $2\times2$…

Exactly Solvable and Integrable Systems · Physics 2024-11-26 Yu-Yue Li , Deng-Shan Wang

The topological Tverberg theorem states that any continuous map of a $(d+1)(r-1)$-simplex into the Euclidean $d$-space maps some points from $r$ pairwise disjoint faces of the simplex to the same point whenever $r$ is a prime power. We…

Algebraic Topology · Mathematics 2022-02-21 Sho Hasui , Daisuke Kishimoto , Masahiro Takeda , Mitsunobu Tsutaya

Consider a semigraph $G=(V,\,E)$; in this paper, we study the eigenvalues of the Laplacian matrix of $G$. We show that the Laplacian of $G$ is positive semi-definite, and $G$ is connected if and only if $\lambda_2 >0.$ Along the similar…

Combinatorics · Mathematics 2023-07-10 Pralhad M. Shinde

This paper further investigates \emph{Laplacian simplices}. A construction by Braun and the first author associates to a simple connected graph $G$ a simplex $\cP_G$ whose vertices are the rows of the Laplacian matrix of $G$. In this paper…

Combinatorics · Mathematics 2018-09-11 Marie Meyer , Tefjol Pllaha

Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…

Combinatorics · Mathematics 2024-12-10 Marzieh Eidi , Sayan Mukherjee

This paper discusses discrete-time maps of the form $x(k + 1) = F(x(k))$, focussing on equilibrium points of such maps. Under some circumstances, Lefschetz fixed-point theory can be used to establish the existence of a single locally…

Systems and Control · Electrical Eng. & Systems 2024-10-25 Brian D. O. Anderson , Mengbin Ye

We show that a continuous map or a continuous flow on $\R^{n}$ with a certain recurrence relation must have a fixed point. Specifically, if there is a compact set W with the property that the forward orbit of every point in $\R^{n}$…

Dynamical Systems · Mathematics 2007-05-23 David Richeson , Jim Wiseman

This article deals with the spectra of Laplacians of weighted graphs. In this context, two objects are of fundamental importance for the dynamics of complex networks: the second eigenvalue of such a spectrum (called algebraic connectivity)…

Mathematical Physics · Physics 2017-04-07 Camille Poignard , Tiago Pereira , Jan Philipp Pade

We define the topological Dirac equation describing the evolution of a topological wave function on networks or on simplicial complexes. On networks, the topological wave function describes the dynamics of topological signals or cochains,…

Disordered Systems and Neural Networks · Physics 2021-09-27 Ginestra Bianconi

It is shown that the hypercomplex Dirac equation describes the system of connected fields: 4-scalar, 4-pseudoscalar, 4-vector, 4-pseudo-vector and antisymmetric 4-tensor second rank field. If mass is assumed to be zero this system splits…

Quantum Physics · Physics 2007-05-23 K. S. Karplyuk , O. O. Zhmudskyy

Given a lattice L in Z^m and a subset A of R^m, we say that a point in A is lonely if it is not equivalent modulo L to another point of A. We are interested in identifying lonely points for specific choices of L when A is a dilated standard…

Symbolic Computation · Computer Science 2019-05-22 Maximilian Jaroschek , Manuel Kauers , Laura Kovacs
‹ Prev 1 4 5 6 7 8 10 Next ›