English
Related papers

Related papers: An improved bound for the rigidity of linearly con…

200 papers

We prove a rigidity result for Serrin's overdetermined problem in a cone that is contained in a half-space in arbitrary dimensions. In the special case where the cone is an epigraph, this result was shown previously in low dimensions with a…

Analysis of PDEs · Mathematics 2017-07-19 Christos Sourdis

In this paper we justify Koiter's model for linearly elastic generalised membrane shells of the first kind subjected to remaining confined in a prescribed half-space. After showing that the confinement condition considered in this paper is…

Analysis of PDEs · Mathematics 2025-11-04 Paolo Piersanti

We prove that for $d\geq 3$, the 1-skeleton of any $(d-1)$-dimensional doubly Cohen Macaulay (abbreviated 2-CM) complex is generically $d$-rigid. This implies the following two corollaries (by Kalai and Lee respectively): Barnette's lower…

Combinatorics · Mathematics 2008-09-05 Eran Nevo

We study the problems of bounding the number weak and strong independent sets in $r$-uniform, $d$-regular, $n$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up…

Combinatorics · Mathematics 2021-07-06 Emma Cohen , Will Perkins , Michail Sarantis , Prasad Tetali

We study the linear elasticity system subject to singular forces. We show existence and uniqueness of solutions in two frameworks: weighted Sobolev spaces, where the weight belongs to the Muckenhoupt class $A_2$; and standard Sobolev spaces…

Numerical Analysis · Mathematics 2023-10-18 Alejandro Allendes , Gilberto Campaña , Enrique Otárola , Abner J. Salgado

We have identified some necessary conditions for the existence of rigid sphere designs. In particular, we have successfully resolved the conjecture proposed by [Ban87]; Given fixed positive integers t and d, we show that there exist only…

Combinatorics · Mathematics 2024-03-26 Yuhi Kamio

We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case…

Combinatorics · Mathematics 2024-09-26 James Cruickshank , Bill Jackson , Shin-ichi Tanigawa

A d-dimensional framework is an embedding of the vertices and edges of a graph in Euclidean space. A d-dimensional framework is globally rigid if every other d-dimensional framework with the same edge lengths has the same pairwise distances…

Metric Geometry · Mathematics 2010-12-30 Matthew Jacobs

We study Serrin's overdetermined boundary value problems in bounded domains on weighted Riemannian manifolds. When the closure of the domain is compact, we establish a rigidity result that characterizes both the solution and the geometry of…

Analysis of PDEs · Mathematics 2026-04-02 Laura Accornero , Giulio Ciraolo

We look at $d$-point extensions of a rotation of angle $\alpha$ with $r$ marked points, generalizing the examples of Veech 1969 and Sataev 1975, together with the square-tiled interval exchange transformations of \cite{fh2}. We study the…

Dynamical Systems · Mathematics 2020-10-06 Sébastien Ferenczi , Pasacal Hubert

The famous example of the double-Watt mechanism given by Connelly and Servatius raises some problems concerning the classical definitions of higher-order flexibility and rigidity, respectively. Recently, the author was able to give a proper…

Algebraic Geometry · Mathematics 2025-02-11 Georg Nawratil

We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman and Sikdar, J. Computer and System Sciences, 75(2):137--153, 2009) are…

Computational Complexity · Computer Science 2009-08-28 Gregory Gutin , Eun Jung Kim , Michael Lampis , Valia Mitsou

Rigidity is the property of a structure that does not flex. It is well studied in discrete geometry and mechanics, and has applications in material science, engineering and biological sciences. A bar-and-joint framework is a pair $(G,p)$ of…

Combinatorics · Mathematics 2021-03-02 Sebastian M. Cioabă , Sean Dewar , Xiaofeng Gu

A bar framework in R^r, denoted by G(p), is a simple connected graph G whose vertices are points p^1,...,p^n in R^r that affinely span R^r, and whose edges are line segments between pairs of these points. In this paper, we use stress…

Metric Geometry · Mathematics 2012-05-18 A. Y. Alfakih

In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid for regular graphs of degree four and five. Also, we give examples to show the order of the bound we give is sharp.

Combinatorics · Mathematics 2012-07-18 Shisen Luo

In this work, we study the problem of computing a maximum common contraction of two vertex-labeled graphs, i.e. how to make them identical by contracting as little edges as possible in the two graphs. We study the problem from a…

Data Structures and Algorithms · Computer Science 2025-07-01 Manuel Lafond , Bertrand Marchand

Motivated by constraint-based CAD software, we develop the foundation for the rigidity theory of a very general model: the body-and-cad structure, composed of rigid bodies in 3D constrained by pairwise coincidence, angular and distance…

Computational Geometry · Computer Science 2010-06-08 Kirk Haller , Audrey Lee-St. John , Meera Sitharam , Ileana Streinu , Neil White

In this paper we consider the effect of symmetry on the rigidity of bar-joint frameworks, spherical frameworks and point-hyperplane frameworks in $\mathbb{R}^d$. In particular we show that, under forced or incidental symmetry, infinitesimal…

Combinatorics · Mathematics 2019-06-07 Katie Clinch , Anthony Nixon , Bernd Schulze , Walter Whiteley

We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…

Combinatorics · Mathematics 2012-10-24 Justin Malestein , Louis Theran

The path to the solution of Feder-Vardi dichotomy conjecture by Bulatov and Zhuk led through showing that more and more general algebraic conditions imply polynomial-time algorithms for the finite-domain Constraint Satisfaction Problems…

Computational Complexity · Computer Science 2025-02-05 Tomáš Nagy , Michael Pinsker , Michał Wrona
‹ Prev 1 4 5 6 7 8 10 Next ›