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

Source URL: math.uchicago.edu

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

Source URL: math.uchicago.edu

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

Source URL: www.inesc-id.pt

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

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

Source URL: resources.mpi-inf.mpg.de

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

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

Source URL: www-ma4.upc.es

Beyond Ohba’s Conjecture: A bound on the choice number of k-chromatic graphs with n vertices Jonathan A. Noel∗, Douglas B. West†, Hehui Wu‡, Xuding Zhu§ August 27, 2014 Abstract

Source URL: people.maths.ox.ac.uk

A BINOMIAL COEFFICIENT IDENTITY ASSOCIATED TO A CONJECTURE OF BEUKERS Scott Ahlgren, Shalosh B. Ekhad, Ken Ono and Doron Zeilberger If n is a positive integer, then let A(n) :=

Source URL: www.mathcs.emory.edu

ON DEGREE SEQUENCES FORCING THE SQUARE OF A HAMILTON CYCLE KATHERINE STADEN AND ANDREW TREGLOWN Abstract. A famous conjecture of P´ osa from 1962 asserts that every graph on n vertices and with minimum degree at least 2

Source URL: www.klstaden.site11.com

PARITY OF THE PARTITION FUNCTION Ken Ono Abstract. Let p(n) denote the number of partitions of a non-negative integer n. A well-known conjecture asserts that every arithmetic progression contains infinitely many integer

Source URL: www.mathcs.emory.edu

N U ME R I C A L R E L A TED o F

Source URL: people.mpim-bonn.mpg.de

• Mathematics
• Algebra
• Abstract algebra
• Commutative algebra
• Analytic number theory
• Elliptic curve
• Group theory
• Birch and Swinnerton-Dyer conjecture
• Curve
• Complex multiplication
• Integral element
• Supersingular elliptic curve