Related papers: A geometry-based relaxation algorithm for equilibr…
We show that the recent hierarchy of semidefinite programming relaxations based on non-commutative polynomial optimization and reduced density matrix variational methods exhibits an interesting paradox when applied to the bosonic case: even…
Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in $d$-space into constant-complexity subcells. In this paper, we settle in the affirmative a few long-standing open…
We consider three variants of the problem of finding a maximum weight restricted $2$-matching in a subcubic graph $G$. (A $2$-matching is any subset of the edges such that each vertex is incident to at most two of its edges.) Depending on…
For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basic idea is to approximate the configuration space by the vertex-edge graph of its cell decomposition discovered by the first author. The…
The graph matching problem is a significant special case of the Quadratic Assignment Problem, with extensive applications in pattern recognition, computer vision, protein alignments and related fields. As the problem is NP-hard, relaxation…
We present two modifications of the standard cell list algorithm for nonequilibrium molecular dynamics simulations of homogeneous, linear flows. When such a flow is modeled with periodic boundary conditions, the simulation box deforms with…
In this work we study convex relaxations of quadratic optimisation problems over permutation matrices. While existing semidefinite programming approaches can achieve remarkably tight relaxations, they have the strong disadvantage that they…
We derive and analyze a novel approach for modeling and computing the mechanical relaxation of incommensurate 2D heterostructures. Our approach parametrizes the relaxation pattern by the compact local configuration space rather than real…
The non-linear stress-strain relation for crosslinked polymer networks is studied using molecular dynamics simulations. Previously we demonstrated the importance of trapped entanglements in determining the elastic and relaxational…
The weight systems of finite-dimensional representations of complex, simple Lie algebras exhibit patterns beyond Weyl-group symmetry. These patterns occur because weight systems can be decomposed into lattice polytopes in a natural way.…
Consider the problem of finding a point in a unit $n$-dimensional $\ell_p$-ball ($p\ge 2$) such that the minimum of the weighted Euclidean distance from given $m$ points is maximized. We show in this paper that the recent…
In this paper, we introduce a novel analysis of neural networks based on geometric (Clifford) algebra and convex optimization. We show that optimal weights of deep ReLU neural networks are given by the wedge product of training samples when…
A simplex-based network is referred to as a higher-order network, in which describe that the interactions can include more than two nodes. Many multicomponent interactions can be grasped through simplicial complexes, which have recently…
A long standing puzzle in the rheology of living cells is the origin of the experimentally observed long time stress relaxation. The mechanics of the cell is largely dictated by the cytoskeleton, which is a biopolymer network consisting of…
We formulate and discuss the relationship between polyhedral stress functions and internally self-equilibrated frameworks in 2D, and a two-mesh technique for the prediction of the stress field associated with such systems. We generalize…
Analyzing nonlinear conformational relaxation dynamics in elastic networks corresponding to two classical motor proteins, we find that they respond by well-defined internal mechanical motions to various initial deformations and that these…
We establish the most general form of the discrete elasticity of a 2D triangular lattice embedded in three dimensions, taking into account up to next-nearest neighbour interactions. Besides crystalline system, this is relevant to biological…
We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing…
In this paper, we study the optimality gap between two-layer ReLU networks regularized with weight decay and their convex relaxations. We show that when the training data is random, the relative optimality gap between the original problem…
We reprove three known algorithmic bounds for terminal-clustering problems, using a single framework that leads to simpler proofs. In this genre of problems, the input is a metric space $(X,d)$ (possibly arising from a graph) and a subset…