相关论文: Criticality for the Gehring link problem

We study the small-regularisation limit of the entropic optimal transport problem on the line with distance cost. While convergence of entropic minimizers is well understood in the discrete setting and in the case where the cost is…

The subject of limit curve theorems in Lorentzian geometry is reviewed. A general limit curve theorem is formulated which includes the case of converging curves with endpoints and the case in which the limit points assigned since the…

In the first part of this paper, inspired by the geometric method of Jean-Pierre Marec, we consider the two-impulse Hohmann transfer problem between two coplanar circular orbits as a constrained nonlinear programming problem. By using the…

We interpret the close link between the critical points of Mather's barrier functions and minimal homoclinic orbits with respect to the Aubry sets on $\mathbb{T}^n$. We also prove a critical point theorem for barrier functions, and the…

Using the minimax technique from the critical point theory, which consists in constructing or transforming a suitable class of applications such that a critical value $c$ of a functional $f$ can be characterized as a minimax value over this…

The present work provides a definitive answer to the problem of quantifying relaxation to equilibrium of the solution to the spatially homogeneous Boltzmann equation for Maxwellian molecules. The beginning of the story dates back to a…

Reliability assessment of interconnection networks is critical to the design and maintenance of multiprocessor systems. The $(n, k)$-enhanced hypercube $Q_{n,k}$, as a variation of the hypercube $Q_{n}$, was proposed by Tzeng and Wei in…

Traditional graph centrality measures effectively quantify node importance but fail to capture the structural uniqueness of multi-scale connectivity patterns -- critical for understanding network resilience and function. This paper…

Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches…

We apply the twisting technique that was first introduced in \cite{CK} and later generalized in \cite{QCQ} to obtain an infinite family of adequate, homogeneous or alternative links from a given adequate, homogeneous or alternative link,…

We prove that not every harmonic map from $S^{2}$ to $S^{2}$ can arise as a limit of Ginzburg--Landau critical points. More precisely, we show that the only degree-one harmonic maps that can be approximated in this way are rotations. This…

We study two Heisenberg spin-1/2 chains coupled by a frustrating ``zigzag'' interaction. We are particularly interested in the regime of weak interchain coupling, which is difficult to analyse by either numerical or analytical methods.…

Critical points of a function subject to a constraint can be either detected by restricting the function to the constraint or by looking for critical points of the Lagrange multiplier functional. Although the critical points of the two…

This paper considers the global geometry of general low-rank minimization problems via the Burer-Monterio factorization approach. For the rank-$1$ case, we prove that there is no spurious second-order critical point for both symmetric and…

The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…

Given a thin strip of paper, tie a knot, connect the ends, and flatten into the plane. This is a physical model of a folded ribbon knot in the plane, first introduced by Louis Kauffman. We study the folded ribbonlength of these folded…

We study the H^{-1}-norm of the function 1 on tubular neighbourhoods of curves in R^2. We take the limit of small thickness epsilon, and we prove two different asymptotic results. The first is an asymptotic development for a fixed curve in…

In this paper we investigate the discrete version of the classical hanging chain problem. We generalize the problem, by allowing for arbitrary mass and length of each link. We show that the shape of the chain can be obtained by solving a…

While the problem of computing the genus of a knot is now fairly well understood, no algorithm is known for its four-dimensional variants, both in the smooth and in the topological locally flat category. In this article, we investigate a…

One of the most important and well-studied settings for network design is edge-connectivity requirements. This encompasses uniform demands such as the Minimum $k$-Edge-Connected Spanning Subgraph problem ($k$-ECSS), as well as nonuniform…