H. Federer: Geometric Measure Theory. Springer-Verlag, New York, 1969.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....: K 1 g (e) G is submersive at x. Furthermore, # det [dC 1 (x) ker dK g (x) # # (17) 9 2.2 A disintegration formula The following disintegration formula, proved in Proposition 3.1 of [22] will be useful. The formula (19) is proved for vastly more general K by Federer [7]) Proposition 3 Let K : M N be a smooth mapping between Riemannian manifolds. Let NK = K (M CK ) where CK is the set of points where K is not submersive, i.e. the rank of dK is less than dimN . Assume that CK M . Suppose # is a continuous function of compact support on M . Let vol ....

H. Federer: Geometric Measure Theory, Springer-Verlag, New York, 1969. 27

....We have R IR N W (v h ) dx O(h Gamma1 ) so that u is the characteristic function of some measurable set E IR N . As h Gamma1 (OE o (x; rv h ) 2 hW (v h ) 2OE o (x; rv h ) p W (v h ) using the fact that OE o (x; Delta) is one homogeneous and the coarea formula [16] we have F h (v h ) 2 Z fjrv h j6=0g jrv h j p W (v h ) h 1 e f(x; rv h ; r 2 v h ) i OE o i x; rv h jrv h j j mdx 2 Z 1 0 p W (t) Z fv h =tg fjrv h j6=0g h 1 e f(x; rv h ; r 2 v h ) i dP N Gamma1 dt: G. Bellettini Variational approximation of some ....

H. Federer: Geometric Measure Theory, Springer-Verlag, Berlin, 1968.

....invariants of G. So, we can write: k[X] G = e M i=1 k[ Pi 1 ; Pi n ]S i where the S i are linearly independent over k[ Pi 1 ; Pi n ] and the Pi i are algebraically independent over k: this is the most accurate description of k[X] G we could dream of According to [17], it is called the Hironaka decomposition of invariants. Algorithms are given in [17] and [14] to find a system of fundamental invariants. The following proposition will be helpful to link Prop. 8 to field theory. Therefore, it will enable us to apply the algorithm of field theory, based on ....

....n ]S i where the S i are linearly independent over k[ Pi 1 ; Pi n ] and the Pi i are algebraically independent over k: this is the most accurate description of k[X] G we could dream of According to [17] it is called the Hironaka decomposition of invariants. Algorithms are given in [17] and [14] to find a system of fundamental invariants. The following proposition will be helpful to link Prop. 8 to field theory. Therefore, it will enable us to apply the algorithm of field theory, based on linear algebra, to get the Hironaka decomposition of an invariant (see Prop. 10) ....

B. Sturmfels: Algorithms in Invariant Theory. Springer-Verlag, Wien, 1993.

....of our theory to bilipschitz spheres. We let x Delta y denote the inner product of two vectors x; y 2 E . For A ae E and r 0 we write B(A; r) fx : d(x; A) rg; S(A; r) fx : d(x; A) rg: Part of this article was written while the first author was visiting the University of Bielefeld in 1995 96. The hospitality of SFB 343 is hereby acknowledged. 1991 Mathematics Subject Classification: Primary 30C65 2. Estimates for uniformity constants 2.1. Summary of Section 2. We give estimates for the uniformity constants of various standard domains. All proofs are elementary. ....

....is a Hilbert space. If E is infinite dimensional, Theorem 5.2 will give in certain cases constants better than the ones obtained in this section. 2.2. Lemma. Each bounded set A ae E is contained in a ball B(a; r) with r = d(A) p 2 . Proof. If dimE = n 1 , this follows from Jung s theorem [Fe, 2.10.41] Indeed, one can choose r = d(A) p n=2(n 1) The infinite dimensional case was proved by J. Danes [Da, Th. 2] 2.3. Theorem. Each ball and half space in E is htop and hlog (p; c) uniform for all 0 p dimE Gamma 1 with c = p 3=2 = 1:22474 : Proof. Suppose first that G is ....

[Article contains additional citation context not shown here]

H. Federer: Geometric measure theory. - Springer-Verlag, 1969.

....method. For the SDP problem, the separation oracle is to determine whether a given symmetric matrix is positive semidefinite and if not provide a separating hyperplane. Cholesky factorization or eigenvalue and eigenvector evaluations easily provide polynomial time oracles for this task. See [32] for a thorough treatment. The ellipsoid method, however, has not proven practical in most applications, including SDP. A more recent development is the possibility of using interior point methods to obtain polynomial time algorithms for semidefinite programs. The earliest work in this direction ....

....and an initial ellipsoid containing its feasible region to start the process. However, it is generally believed that in order to apply interior point methods to the same combinatorial optimization problem one needs to have the explicit listing of all of the inequalities in the LP formulation, see [32] and [27] For instance, Goldfarb and Todd in their survey article on linear programming write: it appears that its [Karmarkar s new algorithm] theoretical implications are far more limited than those of the ellipsoid method. Indeed, Karmarkar s algorithm requires the linear programming ....

[Article contains additional citation context not shown here]

, Geometric Algorithms and Combinatorial Optimization, Springer Verlag, 1988.

.... set, ff(G 0 ) is equal to the size of the minimum clique cover, ae(G 0 ) Grotschel, Lovasz and Schrijver have shown that for perfect graphs one can compute the largest clique and the largest independent set in polynomial time; see [6] 7] 8] and in particular, their elaborate book [9]. Their idea is based on computing an invariant known as the Lovasz number of graphs (G) Lovasz has shown that for all graphs (G) G) G) As will be seen in the next section, G) is defined as the minimum of some convex function derived from the graph. Grotschel, Lovasz and Schrijver use ....

....A is positive definite and A is positive semi definite, respectively. The weighted Lovasz number of a graph G is defined as: G; w) minf(X W ) j X 2 Mg: 2.1) Lovasz has shown that for all w: G; w) G; w) G; w) 2. 2) For a quick proof see [15] for a more thorough treatment consult [9]. In case of perfect graphs, equality holds in 2.2, in fact, equality is a necessary and sufficient condition for perfectness of a graph) in particular, G; w) is an integer. There is a dual way of defining (G; w) G; w) maxfW ffl Y jY 2 M ; Y 0; and traceY = 1g: 2.3) Notice that ....

[Article contains additional citation context not shown here]

, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, 1988

No context found.

H. Federer: Geometric Measure Theory. Springer-Verlag, New York, 1969.

No context found.

H. Federer: Geometric Measure Theory. Springer Verlag, Berlin 1969

No context found.

Algorithms in Invariant theory, Springer-Verlag, Wien, 1993.

No context found.

Algorithms for Modern Parallel Computer Architectures, pages 197#208, Springer-Verlag, New York, NY, 1988.

No context found.

, Geometric Invariant Theory, Springer Verlag, 1965.

No context found.

H. Federer: Geometric Measure Theory. Springer-Verlag, Berlin (1969).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC