English
Related papers

Related papers: The Flexibility and Rigidity of Leaper Frameworks

200 papers

Let $p$ and $q$ be positive integers. The $(p, q)$-leaper $L$ is a generalised knight which leaps $p$ units away along one coordinate axis and $q$ units away along the other. Consider a free $L$, meaning that $p + q$ is odd and $p$ and $q$…

Combinatorics · Mathematics 2022-05-24 Nikolai Beluhov

A leaper is a chess piece which generalises the knight. Given $n$ and a $(p, q)$-leaper $L$, we study the greatest $m$ such that the $m \times m$ grid graph can be embedded into the $n \times n$ leaper graph of $L$. We can assume that $p$…

Combinatorics · Mathematics 2025-03-25 Nikolai Beluhov

An $\{r,s\}$-leaper is a generalized knight that can jump from $(x,y)$ to $(x\pm r,y\pm s)$ or $(x\pm s,y\pm r)$ on a rectangular grid. The graph of an $\{r,s\}$-leaper on an $m\times n$ board is the set of $mn$~vertices $(x,y)$ for $0\leq…

Combinatorics · Mathematics 2008-02-03 Donald E. Knuth

A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…

Combinatorics · Mathematics 2024-04-26 Georg Grasegger , Jan Legerský

A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous deformations of the vertices arise from…

Combinatorics · Mathematics 2023-12-18 Anthony Nixon , Bernd Schulze , Joseph Wall

A rigidity theory is developed for bar-joint frameworks in $\mathbb{R}^{d+1}$ whose vertices are constrained to lie on concentric $d$-spheres with independently variable radii. In particular, combinatorial characterisations are established…

Metric Geometry · Mathematics 2017-02-14 Anthony Nixon , Bernd Schulze , Shin-ichi Tanigawa , Walter Whiteley

A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous motions of the vertices arise from…

Combinatorics · Mathematics 2023-12-20 Anthony Nixon , Bernd Schulze , Joseph Wall

Rigidity of the Poisson bracket with respect to the uniform norm is one of the central phenomena discovered within function theory on symplectic manifolds. In the present work we examine the case of $L_p$ norms with $p < \infty$. We show…

Symplectic Geometry · Mathematics 2016-10-04 Karina Samvelyan

A significant range of geometric structures whose rigidity is explored for both practical and theoretical purposes are formed by modifying generically isostatic triangulated spheres. In the block and hole structures (P, p), some edges are…

Metric Geometry · Mathematics 2009-11-03 Wendy Finbow , Elissa Ross , Walter Whiteley

A framework (a straight-line embedding of a graph into a normed space allowing edges to cross) is globally rigid if any other framework with the same edge lengths with respect to the chosen norm is an isometric copy. We investigate global…

Metric Geometry · Mathematics 2025-04-04 Sean Dewar

A bar-and-joint framework is a finite set of points together with specified distances between selected pairs. In rigidity theory we seek to understand when the remaining pairwise distances are also fixed. If there exists a pair of points…

Combinatorics · Mathematics 2013-08-16 Christopher Clement , Audrey Lee-St. John , Jessica Sidman

We give a simple proof of a fairly flexible comparison theorem for equations of the type $-(p(u'+su))'+rp(u'+su)+qu=0$ on a finite interval where $1/p$, $r$, $s$, and $q$ are real and integrable. Flexibility is provided by two functions…

Classical Analysis and ODEs · Mathematics 2017-03-22 Ahmed Ghatasheh , Rudi Weikard

A bar framework (G,p) in dimension r is a graph G whose vertices are points p^1,...,p^n in R^r and whose edges are line segments between pairs of these points. Two frameworks (G,p) and (G,q) are equivalent if each edge of (G,p) has the same…

Metric Geometry · Mathematics 2015-04-03 A. Y. Alfakih

Some aspects of a mathematical theory of rigidity and flexibility are developed for general infinite frameworks and two main results are obtained. In the first sufficient conditions, of a uniform local nature, are obtained for the existence…

Functional Analysis · Mathematics 2008-11-19 J. C. Owen , S. C. Power

Suppose that you add rigid bars between points in the plane, and suppose that a constant fraction $q$ of the points moves freely in the whole plane; the remaining fraction is constrained to move on fixed lines called sliders. When does a…

Combinatorics · Mathematics 2015-02-23 Julien Barré , Marc Lelarge , Dieter Mitsche

A two-dimensional direction-length framework $(G,p)$ consists of a multigraph $G=(V;D,L)$ whose edge set is formed of "direction" edges $D$ and "length" edges $L$, and a realisation $p$ of this graph in the plane. The edges of the framework…

Combinatorics · Mathematics 2016-08-31 Katie Clinch

A 2-dimensional direction-length framework is a collection of points in the plane which are linked by pairwise constraints that fix the direction or length of the line segments joining certain pairs of points. We represent it as a pair…

Combinatorics · Mathematics 2016-07-05 Katie Clinch , Bill Jackson , Peter Keevash

A framework is a graph and a map from its vertices to R^d. A framework is called universally rigid if there is no other framework with the same graph and edge lengths in R^d' for any d'. A framework attachment is a framework constructed by…

Metric Geometry · Mathematics 2010-11-23 Kiril Ratmanski

In structural rigidity, one studies frameworks of bars and joints in Euclidean space. Such a framework is an articulated structure consisting of rigid bars, joined together at joints around which the bars may rotate. In this paper, we will…

Combinatorics · Mathematics 2024-08-28 Joannes Vermant , Klara Stokes

A $d$-dimensional tensegrity framework $(T,p)$ is an edge-labeled geometric graph in ${\mathbb R}^d$, which consists of a graph $T=(V,B\cup C\cup S)$ and a map $p:V\to {\mathbb R}^d$. The labels determine whether an edge $uv$ of $T$…

Combinatorics · Mathematics 2024-10-11 Adam D. W. Clay , Tibor Jordán , Sára Hanna Tóth
‹ Prev 1 2 3 10 Next ›