相关论文: Criticality for the Gehring link problem

We show that near any given minimizing sequence of paths for the mountain pass lemma, there exists a critical point whose polarization is also a critical point. This is motivated by the fact that if any polarization of a critical point is…

The minimal network problem is a classical topic in geometric measure theory and the calculus of variations, which aims to find networks of minimal length connecting given points. Most classical results are established in the Euclidean…

We consider the sequence of Gibbs measures of Ising models with Kac interaction defined on a periodic two-dimensional discrete torus near criticality. Using the convergence of the Glauber dynamic proven by H. Weber and J.C. Mourrat and a…

An account of the transversality conditions of variational problems gives rise to essential results in the analysis of different physical phenomena. This powerful and elegant approach has proven to be fruitful in a diversity of variational…

We study the universal closest refinement problem on measurable bipartite relations over standard Borel spaces. Given prescribed side measures, the feasible class consists of finite refinement plans concentrated on the relation and carrying…

We introduce a novel definition of curvature for hypergraphs, a natural generalization of graphs, by introducing a multi-marginal optimal transport problem for a naturally defined random walk on the hypergraph. This curvature, termed…

We generalize the notion of integral Menger curvature introduced by Gonzalez and Maddocks by decoupling the powers in the integrand. This leads to a new two-parameter family of knot energies $intM^{p,q}$. We classify finite-energy curves in…

This is a survey of some of the consequences of the recently introduced congruences on the theory of connectednesses (radical classes) and disconnectednesses (semisimple classes) of graphs and topological spaces. In particular, it is shown…

Urban transportation networks are inherently vulnerable to disruptions that affect connectivity and passenger mobility. Traditional graph_theoretic metrics, such as betweenness and degree centrality, offer insights into local network…

We prove the existence of families of distinct isotopy classes of physical unknots through the key concept of parametrised thickness. These unknots have prescribed length, tube thickness, a uniform bound on curvature, and cannot be…

Motivated by the concept of Euclidean Distance Degree, which measures the complexity of finding the nearest point to an algebraic set in Euclidean space, we introduce the notion of Grassmann Distance Complexity (GDC). This concept…

This article is an overview of the results obtained in recent years on symplectic connections. We present what is known about preferred connections (critical points of a variational principle). The class of Ricci-type connections (for which…

We study a modified notion of Ollivier's coarse Ricci curvature on graphs introduced by Lin, Lu, and Yau in [11]. We establish a rigidity theorem for complete graphs that shows a connected finite simple graph is complete if and only if the…

In 1999, Jacobson and Lehel conjectured that for $k \geq 3$, every $k$-regular Hamiltonian graph has cycles of at least linearly many different lengths. This was further strengthened by Verstra\"{e}te, who asked whether the regularity can…

In this article, we give a theorem of reduction of the structure group of a principal bundle P with regular structure group G. Then, when G is in the classes of Lie groups defined by T.Robart [13], we define the closed holonomy group of a…

Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…

We define half grid diagrams and prove every link is half grid presentable by constructing a canonical half grid pair (which gives rise to a grid diagram of some special type) associated with an element in the oriented Thompson group. We…

We identify the holomorphic de Rham complex of the minimal extension of a meromorphic vector bundle with connexion on a compact Riemann surface X with the L^2 complex relative to a suitable metric on the bundle and a complete metric on the…

In network analysis, a measure of node centrality provides a scale indicating how central a node is within a network. The coreness is a popular notion of centrality that accounts for the maximal smallest degree of a subgraph containing a…

The paper provides bounds for the ropelength of a link in terms of the crossing numbers of its split components. As in earlier papers, the bounds grow with the square of the crossing number; however, the constant involved is a substantial…