Matches in SemOpenAlex for { <https://semopenalex.org/work/W4313367953> ?p ?o ?g. }
Showing items 1 to 71 of
71
with 100 items per page.
- W4313367953 endingPage "177" @default.
- W4313367953 startingPage "157" @default.
- W4313367953 abstract "We address a central question in rigidity theory, namely to bound the number of Euclidean or spherical embeddings of minimally rigid graphs. Since these embeddings correspond to the real roots of certain algebraic systems, the same enumerative question can be asked in complex spaces. Bézout’s bound on the quadratic equations that capture the edge lengths yields trivially a bound of O2d⋅|V| embeddings, for graphs of |V| vertices in d dimensions; it had not been improved until recently. A first improvement was obtained for d≥5 (Bartzos et al., 2020). The same work related the number of embeddings and the number of a class of graph orientations. A combinatorial analysis based on the latter yielded the first nontrivial upper bounds for 2≤d≤4, while further improving the bounds for d≥5 (Bartzos et al., 2022). Here, we follow a similar procedure as in Bartzos et al. (2022). First we obtain upper bounds on graph orientations with fixed outdegree by enhancing the existing graph theoretic tools. Then we use the relation between graph orientations and the bound on the embedding number to provide new upper bounds in all dimensions on the number of complex embeddings by extending the recent progress. Namely, for d=2 (Laman graph embeddings) and d=3, we improve the upper bound from O(3.78|V|) to O(3.46|V|) and from O(6.84|V|) to O(6.32|V|), respectively. Regarding the tightness of our results, we present examples of graphs indicating that our bound on the outdegree-constrained orientations may be sharp, but we have no similar data for the embedding number." @default.
- W4313367953 created "2023-01-06" @default.
- W4313367953 creator A5051757549 @default.
- W4313367953 creator A5087662998 @default.
- W4313367953 creator A5091017449 @default.
- W4313367953 date "2023-03-01" @default.
- W4313367953 modified "2023-09-23" @default.
- W4313367953 title "An asymptotic upper bound for graph embeddings" @default.
- W4313367953 cites W1522692516 @default.
- W4313367953 cites W1964537835 @default.
- W4313367953 cites W1987075624 @default.
- W4313367953 cites W2013407568 @default.
- W4313367953 cites W2026588045 @default.
- W4313367953 cites W2139834426 @default.
- W4313367953 cites W2581659641 @default.
- W4313367953 cites W2801664259 @default.
- W4313367953 cites W2902145203 @default.
- W4313367953 cites W3093733732 @default.
- W4313367953 doi "https://doi.org/10.1016/j.dam.2022.12.010" @default.
- W4313367953 hasPublicationYear "2023" @default.
- W4313367953 type Work @default.
- W4313367953 citedByCount "0" @default.
- W4313367953 crossrefType "journal-article" @default.
- W4313367953 hasAuthorship W4313367953A5051757549 @default.
- W4313367953 hasAuthorship W4313367953A5087662998 @default.
- W4313367953 hasAuthorship W4313367953A5091017449 @default.
- W4313367953 hasConcept C114614502 @default.
- W4313367953 hasConcept C118615104 @default.
- W4313367953 hasConcept C129782007 @default.
- W4313367953 hasConcept C129844170 @default.
- W4313367953 hasConcept C132525143 @default.
- W4313367953 hasConcept C134306372 @default.
- W4313367953 hasConcept C154945302 @default.
- W4313367953 hasConcept C2524010 @default.
- W4313367953 hasConcept C33923547 @default.
- W4313367953 hasConcept C41008148 @default.
- W4313367953 hasConcept C41608201 @default.
- W4313367953 hasConcept C77553402 @default.
- W4313367953 hasConcept C9376300 @default.
- W4313367953 hasConceptScore W4313367953C114614502 @default.
- W4313367953 hasConceptScore W4313367953C118615104 @default.
- W4313367953 hasConceptScore W4313367953C129782007 @default.
- W4313367953 hasConceptScore W4313367953C129844170 @default.
- W4313367953 hasConceptScore W4313367953C132525143 @default.
- W4313367953 hasConceptScore W4313367953C134306372 @default.
- W4313367953 hasConceptScore W4313367953C154945302 @default.
- W4313367953 hasConceptScore W4313367953C2524010 @default.
- W4313367953 hasConceptScore W4313367953C33923547 @default.
- W4313367953 hasConceptScore W4313367953C41008148 @default.
- W4313367953 hasConceptScore W4313367953C41608201 @default.
- W4313367953 hasConceptScore W4313367953C77553402 @default.
- W4313367953 hasConceptScore W4313367953C9376300 @default.
- W4313367953 hasLocation W43133679531 @default.
- W4313367953 hasOpenAccess W4313367953 @default.
- W4313367953 hasPrimaryLocation W43133679531 @default.
- W4313367953 hasRelatedWork W1668729694 @default.
- W4313367953 hasRelatedWork W1986542256 @default.
- W4313367953 hasRelatedWork W2150672947 @default.
- W4313367953 hasRelatedWork W2374829073 @default.
- W4313367953 hasRelatedWork W2383129606 @default.
- W4313367953 hasRelatedWork W2385671392 @default.
- W4313367953 hasRelatedWork W2552783079 @default.
- W4313367953 hasRelatedWork W2610737932 @default.
- W4313367953 hasRelatedWork W2741785956 @default.
- W4313367953 hasRelatedWork W2964545464 @default.
- W4313367953 hasVolume "327" @default.
- W4313367953 isParatext "false" @default.
- W4313367953 isRetracted "false" @default.
- W4313367953 workType "article" @default.