2,821 research outputs found

    Lower bounds on the number of realizations of rigid graphs

    Get PDF
    Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the fastest available method, although its complexity is still exponential. Combining computational results with the theory of constructing new rigid graphs by gluing, we give a new lower bound on the maximal possible number of (complex) realizations for graphs with a given number of vertices. We extend these ideas to rigid graphs in three dimensions and we derive similar lower bounds, by exploiting data from extensive Gr\"obner basis computations

    On the maximal number of real embeddings of minimally rigid graphs in R2\mathbb{R}^2, R3\mathbb{R}^3 and S2S^2

    Get PDF
    Rigidity theory studies the properties of graphs that can have rigid embeddings in a euclidean space Rd\mathbb{R}^d or on a sphere and which in addition satisfy certain edge length constraints. One of the major open problems in this field is to determine lower and upper bounds on the number of realizations with respect to a given number of vertices. This problem is closely related to the classification of rigid graphs according to their maximal number of real embeddings. In this paper, we are interested in finding edge lengths that can maximize the number of real embeddings of minimally rigid graphs in the plane, space, and on the sphere. We use algebraic formulations to provide upper bounds. To find values of the parameters that lead to graphs with a large number of real realizations, possibly attaining the (algebraic) upper bounds, we use some standard heuristics and we also develop a new method inspired by coupler curves. We apply this new method to obtain embeddings in R3\mathbb{R}^3. One of its main novelties is that it allows us to sample efficiently from a larger number of parameters by selecting only a subset of them at each iteration. Our results include a full classification of the 7-vertex graphs according to their maximal numbers of real embeddings in the cases of the embeddings in R2\mathbb{R}^2 and R3\mathbb{R}^3, while in the case of S2S^2 we achieve this classification for all 6-vertex graphs. Additionally, by increasing the number of embeddings of selected graphs, we improve the previously known asymptotic lower bound on the maximum number of realizations. The methods and the results concerning the spatial embeddings are part of the proceedings of ISSAC 2018 (Bartzos et al, 2018)

    On the Number of Embeddings of Minimally Rigid Graphs

    Full text link
    Rigid frameworks in some Euclidian space are embedded graphs having a unique local realization (up to Euclidian motions) for the given edge lengths, although globally they may have several. We study the number of distinct planar embeddings of minimally rigid graphs with nn vertices. We show that, modulo planar rigid motions, this number is at most (2n−4n−2)≈4n{{2n-4}\choose {n-2}} \approx 4^n. We also exhibit several families which realize lower bounds of the order of 2n2^n, 2.21n2.21^n and 2.88n2.88^n. For the upper bound we use techniques from complex algebraic geometry, based on the (projective) Cayley-Menger variety CM2,n(C)⊂P(n2)−1(C)CM^{2,n}(C)\subset P_{{{n}\choose {2}}-1}(C) over the complex numbers CC. In this context, point configurations are represented by coordinates given by squared distances between all pairs of points. Sectioning the variety with 2n−42n-4 hyperplanes yields at most deg(CM2,n)deg(CM^{2,n}) zero-dimensional components, and one finds this degree to be D2,n=1/2(2n−4n−2)D^{2,n}={1/2}{{2n-4}\choose {n-2}}. The lower bounds are related to inductive constructions of minimally rigid graphs via Henneberg sequences. The same approach works in higher dimensions. In particular we show that it leads to an upper bound of 2D3,n=2n−3n−2(n−6n−3)2 D^{3,n}= {\frac{2^{n-3}}{n-2}}{{n-6}\choose{n-3}} for the number of spatial embeddings with generic edge lengths of the 1-skeleton of a simplicial polyhedron, up to rigid motions

    Automated Discharging Arguments for Density Problems in Grids

    Full text link
    Discharging arguments demonstrate a connection between local structure and global averages. This makes it an effective tool for proving lower bounds on the density of special sets in infinite grids. However, the minimum density of an identifying code in the hexagonal grid remains open, with an upper bound of 37≈0.428571\frac{3}{7} \approx 0.428571 and a lower bound of 512≈0.416666\frac{5}{12}\approx 0.416666. We present a new, experimental framework for producing discharging arguments using an algorithm. This algorithm replaces the lengthy case analysis of human-written discharging arguments with a linear program that produces the best possible lower bound using the specified set of discharging rules. We use this framework to present a lower bound of 2355≈0.418181\frac{23}{55} \approx 0.418181 on the density of an identifying code in the hexagonal grid, and also find several sharp lower bounds for variations on identifying codes in the hexagonal, square, and triangular grids.Comment: This is an extended abstract, with 10 pages, 2 appendices, 5 tables, and 2 figure

    Euclidean distance geometry and applications

    Full text link
    Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomplete set of distances, and the output is a set of points in Euclidean space that realizes the given distances. We survey some of the theory of Euclidean distance geometry and some of the most important applications: molecular conformation, localization of sensor networks and statics.Comment: 64 pages, 21 figure
    • 

    corecore