SearcharxivSearch

arXiv · 2501.17214

The Plateau Problem of Michell Trusses and Orthogonality in Springs

Abstract

Given finitely many pointed forces in the plane. Suppose that these forces sum up to zero and their net torques also sum up to zero. One can show that there exists a system of springs whose boundary forces exactly counter-balance these pointed forces. We will generalize to higher dimensions using the Cauchy stress tensor for elastic materials. Given a system of springs, we can multiply the length of each spring with its corresponding spring constant and then sum these products up. The result is called the total mass of the system. We are interested in the Plateau problem of the existence of the minimal spring system given a boundary condition. This minimization problem was first introduced in 1904 by A. Michell. He showed that a minimizer could smear out. The Michell Truss became known in mechanical engineering. It raised attention in optimal design, such as minimizing costs in building bridges. In 1960s and 1970s, the problem was developed using PDE and convex analysis by introducing an equivalent dual maximization problem. In 2008, Bouchitt\'{e}, Gangbo, and Sppecher introduced lines of principal actions to generalize Hencky-Prandtle net to higher dimensional duality and proved that the minimizer can be found provided that it exists. In the unpublished notes of Gangbo, he also showed that if springs of the same kind are optimal. In this paper, we are going to solve the Plateau problem using two different tools in GMT: first, a minimizer can be viewed as a flat chain complex; second, a minimizer can also be viewed as a current. At the end, we are going to show one progress in discovering the topological properties of minimizers: compressed and stretched springs must be perpendicular to each other at non-boundary points. I appreciate my advisor Prof. Robert Hardt for communicating with me regularly on this problem.

Explore related subjects

Keep this discovery

BibTeXRIS

Chengcheng Yang. 2025-01-28. The Plateau Problem of Michell Trusses and Orthogonality in Springs. https://arxiv.org/abs/2501.17214

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC