Related papers: A Proper Definition of Higher Order Rigidity
Through experiments, we idealise a plant leaf as a flexible, thin, rectangular plate clamped at the midpoint and positioned perpendicular to an airflow. Flexibility of the structure is considered as an advantage at moderate flow speed…
We study domain coarsening of two dimensional stripe patterns by numerically solving the Swift-Hohenberg model of Rayleigh-Benard convection. Near the bifurcation threshold, the evolution of disordered configurations is dominated by grain…
In this paper, through a very intuitive vanilla proximal method perspective, we derive accelerated high-order optimization algorithms for minimizing a convex function that has H\"{o}lder continuous derivatives. In this general convex…
In this paper, we generalize (accelerated) Newton's method with cubic regularization under inexact second-order information for (strongly) convex optimization problems. Under mild assumptions, we provide global rate of convergence of these…
The combinatorial characterization of generic rigidity for bar-joint frameworks in dimensions $d \ge 3$ has been a long-standing open problem in discrete geometry. While the two-dimensional case was resolved in 1927 by Pollaczek-Geiringer…
Let $\mathcal{O}$ be an order in a central simple algebra $A$ over a number field. The elasticitity $\rho(\mathcal{O})$ is the supremum of all fractions $k/l$ such that there exists an non-zero-divisor $a \in \mathcal{O}$ that has…
Many mechanical structures, both engineered and biological, combine heavy rigid elements such as bones and beams with lightweight flexible ones such as cables and membranes. These are referred to as tensegrities, reflecting that cables can…
We define periodic frameworks as graphs on the torus, using the language of gain graphs. We present some fundamental definitions and results about the infinitesimal rigidity of graphs on a torus of fixed size and shape, and find necessary…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
The complexity of representing a polynomial by a Read-Once Oblivious Algebraic Branching Program (ROABP) is highly dependent on the chosen variable ordering. Bhargava et al. prove that finding the optimal ordering is NP-hard, and provide…
Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their…
We identify the restricted class of attainable effective deformations in a model of reinforced composites with parallel, long, and fully rigid fibers embedded in an elastic body. In mathematical terms, we characterize the weak limits of…
We study approximation algorithms for satisfiable and nearly satisfiable instances of ordering constraint satisfaction problems (ordering CSPs). Ordering CSPs arise naturally in ranking and scheduling, yet their approximability remains…
Motivated by the grid search method and Bayesian optimization, we introduce the concept of contractibility and its applications in model-based optimization. First, a basic framework of contraction methods is established to construct a…
A longstanding problem in rigidity theory is to characterize the graphs which are minimally generically rigid in 3-space. The results of Cauchy, Dehn, and Alexandrov give one important class: the triangulated convex spheres, but there is an…
Despite of some progresses in investigating the roles of the higher-order strain gradients on elastic stabilities of solids, the physical nature on the higher-order elastic instabilities of crystals, especially under extreme strain rates,…
According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems---such as for instance natural deduction---are applied. Therefore, the…
Huang's Lemma is an important tool in CR geometry to study rigidity problems. This paper introduces a generalization of Huang's Lemma based on the rigidity properties of holomorphic mappings preserving certain orthogonality on projective…
Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization --- a linear order on operations satisfying the data…