<--- Back to Details
First PageDocument Content
Orthogonal polynomials / Algebraic combinatorics / Algebraic geometry / Representation theory / Macdonald polynomials / N! conjecture / Eigenvalues and eigenvectors / Spectral theory of ordinary differential equations / Sturm–Liouville theory / Algebra / Mathematics / Abstract algebra
Date: 2012-01-05 22:48:16
Orthogonal polynomials
Algebraic combinatorics
Algebraic geometry
Representation theory
Macdonald polynomials
N! conjecture
Eigenvalues and eigenvectors
Spectral theory of ordinary differential equations
Sturm–Liouville theory
Algebra
Mathematics
Abstract algebra

Add to Reading List

Source URL: www.maths.ed.ac.uk

Download Document from Source Website

File Size: 310,88 KB

Share Document on Facebook

Similar Documents

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

Mathematics / Integer sequences / 2N / Collatz conjecture / Discrete mathematics / Residue number system

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

Combinatorial optimization / Binary arithmetic / Binary logarithm / Calculus / Logarithms / Cut / AanderaaKarpRosenberg conjecture / Planar separator theorem

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