Page 1

Displaying 1 – 13 of 13

Showing per page

La conjecture des soufflets

Jean-Marc Schlenker (2002/2003)

Séminaire Bourbaki

On sait depuis les travaux de Bricard et de Connelly qu’il existe dans l’espace euclidien des polyèdres (non convexes) qui sont flexibles : on peut les déformer continûment sans changer la forme de leurs faces. La conjecture des soufflets affirme que le volume interieur de ces polyèdres est constant au cours de la déformation. Elle a été démontrée récemment par I. Sabitov, qui a pour cela utilisé des outils algébriques inattendus dans ce contexte.

Labeled shortest paths in digraphs with negative and positive edge weights

Phillip G. Bradford, David A. Thomas (2009)

RAIRO - Theoretical Informatics and Applications

This paper gives a shortest path algorithm for CFG (context free grammar) labeled and weighted digraphs where edge weights may be positive or negative, but negative-weight cycles are not allowed in the underlying unlabeled graph. These results build directly on an algorithm of Barrett et al. [SIAM J. Comput.30 (2000) 809–837]. In addition to many other results, they gave a shortest path algorithm for CFG labeled and weighted digraphs where all edges are nonnegative. Our algorithm is based closely...

Light classes of generalized stars in polyhedral maps on surfaces

Stanislav Jendrol', Heinz-Jürgen Voss (2004)

Discussiones Mathematicae Graph Theory

A generalized s-star, s ≥ 1, is a tree with a root Z of degree s; all other vertices have degree ≤ 2. S i denotes a generalized 3-star, all three maximal paths starting in Z have exactly i+1 vertices (including Z). Let be a surface of Euler characteristic χ() ≤ 0, and m():= ⎣(5 + √49-24χ( ))/2⎦. We prove: (1) Let k ≥ 1, d ≥ m() be integers. Each polyhedral map G on with a k-path (on k vertices) contains a k-path of maximum degree ≤ d in G or a generalized s-star T, s ≤ m(), on d + 2- m() vertices...

Light paths with an odd number of vertices in polyhedral maps

Stanislav Jendroľ, Heinz-Jürgen Voss (2000)

Czechoslovak Mathematical Journal

Let P k be a path on k vertices. In an earlier paper we have proved that each polyhedral map G on any compact 2 -manifold 𝕄 with Euler characteristic χ ( 𝕄 ) 0 contains a path P k such that each vertex of this path has, in G , degree k 5 + 49 - 24 χ ( 𝕄 ) 2 . Moreover, this bound is attained for k = 1 or k 2 , k even. In this paper we prove that for each odd k 4 3 5 + 49 - 24 χ ( 𝕄 ) 2 + 1 , this bound is the best possible on infinitely many compact 2 -manifolds, but on infinitely many other compact 2 -manifolds the upper bound can be lowered to ( k - 1 3 ) 5 + 49 - 24 χ ( 𝕄 ) 2 .

Linear combinations of partitions of unity with restricted supports

Christian Richter (2002)

Studia Mathematica

Given a locally finite open covering of a normal space X and a Hausdorff topological vector space E, we characterize all continuous functions f: X → E which admit a representation f = C a C φ C with a C E and a partition of unity φ C : C subordinate to . As an application, we determine the class of all functions f ∈ C(||) on the underlying space || of a Euclidean complex such that, for each polytope P ∈ , the restriction f | P attains its extrema at vertices of P. Finally, a class of extremal functions on the metric space...

Currently displaying 1 – 13 of 13

Page 1