Journal of Combinatorics Volume 3, Number 3, 343–399, 2012 Aﬃne dual equivalence and k-Schur functions Sami H. Assaf∗ and Sara C. Billey†

First Page		Document Content
Date: 2013-03-28 13:38:22 Algebraic combinatorics Symmetric functions Representation theory Orthogonal polynomials Young tableau Quasisymmetric function Schur polynomial Macdonald polynomials N! conjecture Abstract algebra Mathematics Algebra		Journal of Combinatorics Volume 3, Number 3, 343–399, 2012 Aﬃne dual equivalence and k-Schur functions Sami H. Assaf∗ and Sara C. Billey† Add to Reading List Source URL: www.math.washington.edu Download Document from Source Website File Size: 707,57 KB Share Document on Facebook

	THE NOVIKOV CONJECTURE FOR LINEAR GROUPS by ERIK GUENTNER, NIGEL HIGSON, and SHMUEL WEINBERGER ABSTRACT Let K be a field. We show that every countable subgroup of GL(n, K) is uniformly embeddable in a Hilbert space. T DocID: 1to6t - View Document
	An Etale Approach to the Novikov Conjecture A.N. DRANISHNIKOV University of Florida, Gainesville, FL, USA S. FERRY Department of Mathematics, Rutgers University, Piscataway, NJ DocID: 1tnvs - View Document
	IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 21, NO. 10, OCTOBERwhere n is the stage gain, f is the clock frequency, VDD is the supply voltage, CCLK is the clock capacitance, N is the num DocID: 1rcVq - View Document
	Exercise 7: Lost in complexity Task 1: Why is everything so hard?!? In this exercise, we always consider connected, simple, weighted graphs G = (V, E, W ), restrict message size to O(log n) bits, and assess worst-case ro DocID: 1pCD1 - View Document
	The Maximum Distance Separable Codes Conjecture Let q = p h , where p is a prime. A k-dimensional linear code C over Fq with minimum distance d and length n is a k-dimensional subspace of Fnq in which every DocID: 1oiuj - View Document