Sciweavers

10 search results - page 1 / 2
» Factorial Grothendieck Polynomials
Sort
View
COMBINATORICS
2006
104views more  COMBINATORICS 2006»
13 years 7 months ago
Factorial Grothendieck Polynomials
In this paper, we study Grothendieck polynomials indexed by Grassmannian permutations from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials which are...
Peter McNamara
BSL
2000
153views more  BSL 2000»
13 years 7 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
ICALP
2010
Springer
14 years 5 days ago
The Positive Semidefinite Grothendieck Problem with Rank Constraint
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
Jop Briët, Fernando Mário de Oliveira ...
JCT
2011
100views more  JCT 2011»
13 years 2 months ago
On polynomial integrals over the orthogonal group
We consider integrals of type On ua1 11 . . . uan 1nub1 21 . . . ubn 2n du, with respect to the Haar measure on the orthogonal group. We establish several remarkable invariance pro...
Teodor Banica, Benoit Collins, Jean-Marc Schlenker
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 4 months ago
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
Subhash Khot, Assaf Naor