Home
Convex Optimization
Convex Optimization Group
Calculus of Inequalities
Conic Independence
Convex Cones
Convex, Affine, Conic Hulls
Convex Functions
Convex Geometry
Distance Geometry
Distance Matrix Cone
Dual Cones
Duality Gap
Euclidean Distance Matrices
Elliptope and Fantope
Extreme Directions
Eigenvalues/Eigenvectors
Farkas Lemma
Face Recognition
Fifth Metric Property
Kissing Number
Linear Algebra
Linear Matrix Inequality
Matrix Calculus
Manifold Learning
Molecular Conformation
Positive Semidefinite Cone
Projection
Quasiconvex Functions
Rank Constraint
Semidefinite Programming
Schoenberg Criterion
Sensor Network Localization
Optimization News
SEO Consultant
Video
Wikimization
Zeros of Polynomials
Contact Us
Wikimization     Meboo     Video     News     Contact     See
Felice crystal
Home arrow Optimization News arrow Gerasimov's theorem and N-Koszul algebras. (arXiv:0801.3383v2 [math.RA] UPDATED)
Gerasimov's theorem and N-Koszul algebras. (arXiv:0801.3383v2 [math.RA] UPDATED)

The paper is devoted to graded algebras having a single homogeneous relation. Using Gerasimov's theorem, a criterion to be N-Koszul is given, providing new examples. An alternative proof of Gerasimov's theorem for N=2 is given. Some related results on Calabi-Yau algebras are proved.

Read more: http://arxiv.org/abs/0801.3383.

 

The Course

The Videos

See Inside

Convex Optimization

by Stephen Boyd 

& L. Vandenberghe 

Buy Book



See Figures

See Inside

Dattorro

by Dattorro

Buy Book



The Course

Bertsekas

by Dimitri Bertsekas 

Buy Book



See Inside

Hiriart-Urruty & Lemaréchal

by Hiriart-Urruty

& Lemaréchal

Buy Book



See Inside

Rockafellar

by Rockafellar

Buy Book



Optimization Newsletter
Subscription:

Email:

Receive HTML mailings?
Subscribe Unsubscribe