Nazarov's uncertainty principle in higher dimensionpjaming/exposes/... · The problem Benedicks’s...

Nazarov’s uncertainty principle in higherdimension

Philippe Jaming

MAPMO-Federation Denis PoissonUniversite d’Orleans

FRANCEhttp://www.univ-orleans.fr/mapmo/membres/jaming

Philippe.Jaming@gmail.com

Budapest, September 2007

The problem Benedicks’s proof Proof of Nazarov Almost time & band-limited The Umbrella Theorem References

Outline of talk

1 The problemDefinitionsMotivationBenedicks-Amrein-Berthier-Nazarov Theorem

2 Benedicks’s proofBenedick’s proofRandom PeriodizationSecond proof: scaling

3 Proof of NazarovTuran type Lemma

4 Almost time & band-limited functions5 The Umbrella Theorem6 References

Definitions

Definition

Let S,Σ subsets of Rd .(S,Σ) is an annihilating pair if

supp f ⊂ S & supp f ⊂ Σ ⇒ f = 0;

(S,Σ) is a strong annihilating pair if ∃C = C(S,Σ) s.t.∀f ∈ L2(Rd),∫

Rd|f (x)|2 dx ≤ C

(∫Rd\S

|f (x)|2 dx +

∫Rd\Σ

|f (ξ)|2 dξ

Definitions

Definition

Rd|f (x)|2 dx ≤ C

(∫Rd\S

|f (x)|2 dx +

∫Rd\Σ

|f (ξ)|2 dξ

Definitions

Definition

Rd|f (x)|2 dx ≤ C

(∫Rd\S

|f (x)|2 dx +

∫Rd\Σ

|f (ξ)|2 dξ

Definitions

Definition

Let S,Σ subsets of Rd .(S,Σ) is a annihilating pair if

(S,Σ) is a strong annihilating pair if ∃D = D(S,Σ) s.t.∀f ∈ L2(Rd), supp f ⊂ S∫

Σ|f (ξ)|2 dξ ≤ D

∫Rd\Σ

|f (ξ)|2 dξ

Motivation

— sampling theory : how well is a function time and bandlimited ?

— PDE’s...

Motivation

— sampling theory : how well is a function time and bandlimited ?

— PDE’s...

Questions

Question

Given S,Σ ⊂ Rd

is (S,Σ) weakly/strongly annihilating ?estimate C(S,Σ) in terms of geometric quantitiesdepending on S and Σ !

Questions

Question

Given S,Σ ⊂ Rd

Questions

Question

Given S,Σ ⊂ Rd

Benedicks-Amrein-Berthier-Nazarov Theorem

Main Theorem

Theorem

Let S,Σ ⊂ Rd have finite measure. Then

(Benedicks 1974-1985) (S,Σ) is weakly annihilating.(Amrein-Berthier 1977) (S,Σ) is strongly annihilating.(Nazarov d = 1 1993) C(S,Σ) ≤ cec|S||Σ|

(J. d ≥ 2 2007) C(S,Σ) ≤ cec min(|S||Σ|,|S|1/dω(Σ),ω(S)|Σ|1/d

)ω(S) = mean width of S.

Main Theorem

Theorem

Main Theorem

Theorem

Main Theorem

Theorem

Main Theorem

Theorem

Optimal Theorem ?

f = e−π|x |2 = f , S = Σ = B(0,R)∫Rd|f (x)|2 dx ≤ ce(2π+ε)R2

(∫Rd\B(0,R)

e−2π|x |2 dx

∫Rd\B(0,R)

e−2π|ξ|2 dξ

Optimal: C(S,Σ) ≤ ce(2π+ε)(|S||Σ|)1/d.

The above is almost optimal if S,Σ have nice geometry!

Optimal Theorem ?

(∫Rd\B(0,R)

e−2π|x |2 dx

∫Rd\B(0,R)

e−2π|ξ|2 dξ

Optimal Theorem ?

(∫Rd\B(0,R)

e−2π|x |2 dx

∫Rd\B(0,R)

e−2π|ξ|2 dξ

Optimal Theorem ?

(∫Rd\B(0,R)

e−2π|x |2 dx

∫Rd\B(0,R)

e−2π|ξ|2 dξ

Benedick’s proof

|S|, |Σ| < +∞, f ∈ L2(R), supp f ⊂ S & supp f ⊂ Σ.

1 WLOG |S| = 1/2

∫[0,1]

χΣ(ξ + k) dξ = |Σ| < +∞⇒

for a.a. ξ ∈ R, Card k ∈ Z : ξ + k ∈ Σ finite

∫[0,1]

χS(x + k)︸︷︷︸=0 or ≥1

dx = |S| = 1/2 ⇒ ∃F ⊂ [0,1], |F | > 0

s.t. ∀x ∈ F , k ∈ Z, f (x + k) = 0.

Benedick’s proof

1 WLOG |S| = 1/2

∫[0,1]

χΣ(ξ + k) dξ = |Σ| < +∞⇒

∫[0,1]

χS(x + k)︸︷︷︸=0 or ≥1

dx = |S| = 1/2 ⇒ ∃F ⊂ [0,1], |F | > 0

s.t. ∀x ∈ F , k ∈ Z, f (x + k) = 0.

Benedick’s proof

1 WLOG |S| = 1/2

∫[0,1]

χΣ(ξ + k) dξ = |Σ| < +∞⇒

∫[0,1]

χS(x + k)︸︷︷︸=0 or ≥1

dx = |S| = 1/2 ⇒ ∃F ⊂ [0,1], |F | > 0

s.t. ∀x ∈ F , k ∈ Z, f (x + k) = 0.

Proof 2/2

4 by Poisson Summation∑k∈Z

f (x + k)e2iπξ(x+k) =∑k∈Z

f (ξ + k)e2iπkx .

By 2, the RHS is a trigonometric polynomial Z (f )(x) in x(for a.a. ξ)By 3, the LHS is supported in [0,1] \ F

5 Z (f ) = 0 ⇒ f = 0 ⇒ f = 0.

Proof 2/2

f (x + k)e2iπξ(x+k) =∑k∈Z

f (ξ + k)e2iπkx .

By 2, the RHS is a trigonometric polynomial Z (f )(x) in x(for a.a. ξ)By 3, the LHS is supported in [0,1] \ F

5 Z (f ) = 0 ⇒ f = 0 ⇒ f = 0.

Random Periodization

Lemma (Nazarov, d = 1)

ϕ ∈ L1(R), ϕ ≥ 0,∫ 2

∑k∈Z \0

ϕ(v k

∫‖x‖≥1

ϕ(x) dx

Random Periodization

Lemma (Nazarov, d = 1)

ϕ ∈ L1(Rd), ϕ ≥ 0,∫SO(d)

∑k∈Zd\0

ϕ(v ρ(k)

)dv dνd(ρ) '

∫‖x‖≥1

ϕ(x) dx

Random Periodization 2 : Proof

∫SO(d)

∑k∈Zd\0

ϕ(v ρ(k)

)dv dνd(ρ)

k∈Zd\0

∫1≤‖x‖≤2

ϕ(‖k‖x) dx

k∈Zd\0

1‖k‖d

∫‖k‖≤‖x‖≤2‖k‖

ϕ(x) dx

'∫‖x‖≥1

ϕ(x)∑

‖k‖≤‖x‖≤2‖k‖

1‖k‖d dx

∫SO(d)

∑k∈Zd\0

ϕ(v ρ(k)

)dv dνd(ρ)

k∈Zd\0

∫1≤‖x‖≤2

ϕ(‖k‖x) dx

k∈Zd\0

1‖k‖d

∫‖k‖≤‖x‖≤2‖k‖

ϕ(x) dx

'∫‖x‖≥1

ϕ(x)∑

‖k‖≤‖x‖≤2‖k‖

1‖k‖d dx

∫SO(d)

∑k∈Zd\0

ϕ(v ρ(k)

)dv dνd(ρ)

k∈Zd\0

∫1≤‖x‖≤2

ϕ(‖k‖x) dx

k∈Zd\0

1‖k‖d

∫‖k‖≤‖x‖≤2‖k‖

ϕ(x) dx

'∫‖x‖≥1

ϕ(x)∑

‖k‖≤‖x‖≤2‖k‖

1‖k‖d dx

∫SO(d)

∑k∈Zd\0

ϕ(v ρ(k)

)dv dνd(ρ)

k∈Zd\0

∫1≤‖x‖≤2

ϕ(‖k‖x) dx

k∈Zd\0

1‖k‖d

∫‖k‖≤‖x‖≤2‖k‖

ϕ(x) dx

'∫‖x‖≥1

ϕ(x)∑

‖k‖≤‖x‖≤2‖k‖

1‖k‖d dx

∫SO(d)

∑k∈Zd\0

ϕ(v ρ(k)

)dv dνd(ρ)

k∈Zd\0

∫1≤‖x‖≤2

ϕ(‖k‖x) dx

k∈Zd\0

1‖k‖d

∫‖k‖≤‖x‖≤2‖k‖

ϕ(x) dx

'∫‖x‖≥1

ϕ(x)∑

‖k‖≤‖x‖≤2‖k‖

1‖k‖d︸︷︷︸

bdd above & bellow

Second proof: scaling

1 WLOG |S| = C0 small enough (see bellow)

∑k 6=0

χΣ(v k) dv ≤ C|Σ| < +∞⇒

for a.a. v ∈ [1,2], Card k ∈ Z : vk ∈ Σ finite

χS((x + k)/v

)︸︷︷︸

=0 or ≥1

dv dx ≤ (C1 + 2)|S| := 1/2 if C0

small enough ⇒ ∃F ⊂ [0,1], ∃V ⊂ [1,2], |F | > 0 |V | > 0s.t. ∀x ∈ F , v ∈ V , k ∈ Z, f

((x + k)/v

∑k 6=0

χΣ(v k) dv ≤ C|Σ| < +∞⇒

χS((x + k)/v

)︸︷︷︸

=0 or ≥1

dv dx ≤ (C1 + 2)|S| := 1/2 if C0

((x + k)/v

∑k 6=0

χΣ(v k) dv ≤ C|Σ| < +∞⇒

χS((x + k)/v

)︸︷︷︸

=0 or ≥1

dv dx ≤ (C1 + 2)|S| := 1/2 if C0

((x + k)/v

Proof 2/2

f((x + k)/v

)=∑k∈Z

√v f (vk)e2iπkx .

By 2, the RHS is a trigonometric polynomial Pv (x) in x (fora.a. v )By 3, the LHS is supported in [0,1] \ F for some v .

5 Pv (x) = 0 ⇒ f = 0 outside [−1,1] ⇒ f = 0.6 The polynomial has ≤ 4C|Σ| for at least 3/4 of the v ’s.

Proof 2/2

f((x + k)/v

)=∑k∈Z

Proof 2/2

f((x + k)/v

)=∑k∈Z

Turan type Lemma

Lemma (Nazarov, d = 1, Fontes-Merz d ≥ 2)

p(θ1, . . . , θd) =

m1∑k1=0

· · ·md∑

ck1,...,kd e2iπ(r1,k1θ1+···rrd ,kd

θd ) a

trigonometric polynomial in d variables.E ⊂ Td ,Then

sup(θ1,...,θd )∈Td

|p(θ1, . . . , θd)|

14d|E |

)m1+···+md

sup(θ1,...,θd )∈E

|p(θ1, . . . , θd)|.

— ord p := m1 + · · ·+ md is called the order of p.

Turan type Lemma

p(θ1, . . . , θd) =

m1∑k1=0

· · ·md∑

θd ) a

|p(θ1, . . . , θd)|

14d|E |

)m1+···+md

|p(θ1, . . . , θd)|.

Turan type Lemma

p(θ1, . . . , θd) =

m1∑k1=0

· · ·md∑

θd ) a

|p(θ1, . . . , θd)|

14d|E |

)m1+···+md

|p(θ1, . . . , θd)|.

Turan type Lemma

p(θ1, . . . , θd) =

m1∑k1=0

· · ·md∑

θd ) a

|p(θ1, . . . , θd)|

14d|E |

)m1+···+md

|p(θ1, . . . , θd)|.

Turan type Lemma

p(θ1, . . . , θd) =

m1∑k1=0

· · ·md∑

θd ) a

|p(θ1, . . . , θd)|

14d|E |

)m1+···+md

|p(θ1, . . . , θd)|.

Turan type Lemma

p(θ1, . . . , θd) =

m1∑k1=0

· · ·md∑

θd ) a

|p(θ1, . . . , θd)|

14d|E |

)m1+···+md

|p(θ1, . . . , θd)|.

Average order

LemmaΣ be a relatively compact open set with 0 ∈ Σ

Λ = Λ(ρ, v) := v tρ(j) : j ∈ Zd a random latticeMρ,v = k ∈ Zd : v tρ(k) ∈ Σ = Λ ∩ Σ

thenEρ,v

(ordMρ,v − d

)≤ Cω(Σ).

remark

If order → size of support, Eρ,v(CardMρ,v − d

)≤ C|Σ|.

Average order

thenEρ,v

(ordMρ,v − d

)≤ Cω(Σ).

remark

)≤ C|Σ|.

Average order

thenEρ,v

(ordMρ,v − d

)≤ Cω(Σ).

remark

)≤ C|Σ|.

Average order

thenEρ,v

(ordMρ,v − d

)≤ Cω(Σ).

remark

)≤ C|Σ|.

Average order

thenEρ,v

(ordMρ,v − d

)≤ Cω(Σ).

remark

)≤ C|Σ|.

Average order

thenEρ,v

(ordMρ,v − d

)≤ Cω(Σ).

remark

)≤ C|Σ|.

End of Proof 1/4

Scale to have |S| = 2−d−1 and take f ∈ L2 with supp f ⊂ S

Set Γρ,v (t) =1

∑k∈Zd

f(ρ(k + t)

)Set Eρ,v = t ∈ [0,1] : Γρ,v (t) = 0

Γρ,v (t) = vd/2∑

m∈Zd

f(v tρ(m)

)e2iπmt (Poisson summation)

m∈Mρ,v

m/∈Mρ,v

:= Pρ,v + Rρ,v

with Mρ,v = m ∈ Zd : v tρ(m) ∈ Σ

End of Proof 1/4

Set Γρ,v (t) =1

∑k∈Zd

f(ρ(k + t)

)Set Eρ,v = t ∈ [0,1] : Γρ,v (t) = 0

Γρ,v (t) = vd/2∑

m∈Zd

f(v tρ(m)

m∈Mρ,v

m/∈Mρ,v

:= Pρ,v + Rρ,v

End of Proof 1/4

Set Γρ,v (t) =1

∑k∈Zd

f(ρ(k + t)

)Set Eρ,v = t ∈ [0,1] : Γρ,v (t) = 0

Γρ,v (t) = vd/2∑

m∈Zd

f(v tρ(m)

m∈Mρ,v

m/∈Mρ,v

:= Pρ,v + Rρ,v

End of Proof 1/4

Set Γρ,v (t) =1

∑k∈Zd

f(ρ(k + t)

)Set Eρ,v = t ∈ [0,1] : Γρ,v (t) = 0

Γρ,v (t) = vd/2∑

m∈Zd

f(v tρ(m)

m∈Mρ,v

m/∈Mρ,v

:= Pρ,v + Rρ,v

End of Proof 2/4

From the Lattice averaging lemma, one can choose ρ, v s.t.

— ‖Rρ,v‖22 ≤ C

∫Rd\Σ

|f (ξ)|2 dξ (w.h.p)

— ord Pρ,v ≤ C(ω(Σ) + d) (w.h.p)

— |Eρ,v | ≥ 1/2 (certain)

— f (0) ≤ |Pρ,v (0)| (certain).

ρ, v s.t. all 4 properties hold.

End of Proof 2/4

— ‖Rρ,v‖22 ≤ C

∫Rd\Σ

|f (ξ)|2 dξ (w.h.p)

— f (0) ≤ |Pρ,v (0)| (certain).

End of Proof 2/4

— ‖Rρ,v‖22 ≤ C

∫Rd\Σ

|f (ξ)|2 dξ (w.h.p)

— f (0) ≤ |Pρ,v (0)| (certain).

End of Proof 3/4

On Eρ,v , we have Γρ,v = 0, thus Pρ,v = −Rρ,v so

∫Eρ,v

|Pρ,v (t)|2 dt =

∫Eρ,v

|Rρ,v (t)|2 dt ≤ C∫

Rd\Σ|f (ξ)|2 dξ

So E := t ∈ Eρ,v : |Pρ,v (t)|2 ≤ 4C∫

Rd\Σ |f (ξ)|2 dξ has

|E | ≥ 1/4.

End of Proof 3/4

On Eρ,v , we have Γρ,v = 0, thus Pρ,v = −Rρ,v so

∫Eρ,v

|Pρ,v (t)|2 dt =

∫Eρ,v

|Rρ,v (t)|2 dt ≤ C∫

Rd\Σ|f (ξ)|2 dξ

So E := t ∈ Eρ,v : |Pρ,v (t)|2 ≤ 4C∫

Rd\Σ |f (ξ)|2 dξ has

|E | ≥ 1/4.

End of Proof 4/4

|f (0)|2 ≤ |Pρ,v (0)|2 ≤

∑k∈Zd

|Pρ,v (k)|

supx∈Td

|Pρ,v (x)|)2

[(14d|E |

)ordPρ,v−1

supx∈E

|Pρ,v (x)|

(14d1/4

)ordPρ,v−1(

Rd\Σ|f (ξ)|2 dξ

≤ CeCω(Σ)

∫Rd\Σ

|f (ξ)|2 dξ.

Apply to f → fy (x) = f (x)e−2iπxy , Σ → Σy = Σ− y andintegrate over y ∈ Σ QED

Almost time & band-limited functions: Landau-Slepian-Pollak

Sε,T ,Ω :=

f ∈ L2 :

∫|t |>T

|f (t)|2dt < ε‖f‖2

∫|ξ|>Ω

|f (ξ)|2dξ < ε‖f‖2

Theorem (Landau-Slepian-Pollak)∃ an orthonormal system γkk=0,1,... s.t., ∀f ∈ Sε,T ,Ω,

‖f − P4TΩf‖ ≤ 7‖f‖.

f ∈ L2(R) supp f ⊂ [−Ω,Ω], h < π/Ω

f (t) =∑k∈Z

f (kh)sincπ

h(t − kh).

Sε,T ,Ω :=

f ∈ L2 :

∫|t |>T

|f (t)|2dt < ε‖f‖2

∫|ξ|>Ω

|f (ξ)|2dξ < ε‖f‖2

‖f − P4TΩf‖ ≤ 7‖f‖.

f ∈ L2(R) supp f ⊂ [−Ω,Ω], h < π/Ω

f (t) =∑k∈Z

f (kh)sincπ

h(t − kh).

Sε,T ,Ω :=

f ∈ L2 :

∫|t |>T

|f (t)|2dt < ε‖f‖2

∫|ξ|>Ω

|f (ξ)|2dξ < ε‖f‖2

‖f − P4TΩf‖ ≤ 7‖f‖.

f ∈ L2(R) supp f ⊂ [−Ω,Ω], h < π/Ω

f (t) =∑k∈Z

f (kh)sincπ

h(t − kh).

The Umbrella Theorem

The Umbrella Theorem (J.-Powell)

ϕ,ψ ∈ L2(R). ∃N = N(ϕ,ψ) s.t.

(ek )k∈I ⊂ L2(R) orthonormal∀k ∈ I, |ek | ≤ ϕ and |ek | ≤ ψ,

then #I ≤ N.

ϕ,ψ ∈ L2(R). ∃N = N(ϕ,ψ) s.t.

then #I ≤ N.

ϕ,ψ ∈ L2(R). ∃N = N(ϕ,ψ) s.t.

then #I ≤ N.

ϕ,ψ ∈ L2(R). ∃N = N(ϕ,ψ) s.t.

then #I ≤ N.

ϕ,ψ ∈ L2(R). ∃N = N(ϕ,ψ) s.t.

then #I ≤ N.

ε > 0 et T ,Ω > 0 s.t.∫|x |>T

|ϕ(x)|2 dx < ε ,

∫|x |>Ω

|ψ(x)|2 dx < ε

Landau-Pollak-Slepian, ∃γk o.n.b. (ek ) ' Pγ1,...,γ[4TΩ]ek

coordinates of the ek ’s in γ1, . . . , γ[4TΩ] → “spherical code”in C4TΩ ' R8TΩ.A spherical code is finite !

ε > 0 et T ,Ω > 0 s.t.∫|x |>T

|ϕ(x)|2 dx < ε ,

∫|x |>Ω

|ψ(x)|2 dx < ε

ε > 0 et T ,Ω > 0 s.t.∫|x |>T

|ϕ(x)|2 dx < ε ,

∫|x |>Ω

|ψ(x)|2 dx < ε

ε > 0 et T ,Ω > 0 s.t.∫|x |>T

|ϕ(x)|2 dx < ε ,

∫|x |>Ω

|ψ(x)|2 dx < ε

Estimates on spherical codes

(e1, . . . ,eN) ∈ Sd−1 [−α, α]-spherical code if⟨ei ,ej

⟩∈ [−α, α].

(linear independence) α < 1d ⇒ N ≤ d ;

(volume counting) N ≤(

2−α1−α

(Delsarte-Goethals-Siedel) α < 1√d

N ≤ 1−α2

1−α2d d andequality only possible for −α, α-codes.

(Siedel) −α, α-codes have cardinality ≤ d(d−1)2 (best

≥ 29d2)

DSG bound met for some α’s.(J - Guedon 20??) α = d (−1+γ)/2/6, γ > 0 thenNmax ≥ edγ/C .

⟩∈ [−α, α].

2−α1−α

N ≤ 1−α2

≥ 29d2)

⟩∈ [−α, α].

2−α1−α

N ≤ 1−α2

≥ 29d2)

⟩∈ [−α, α].

2−α1−α

N ≤ 1−α2

≥ 29d2)

⟩∈ [−α, α].

2−α1−α

N ≤ 1−α2

≥ 29d2)

⟩∈ [−α, α].

2−α1−α

N ≤ 1−α2

≥ 29d2)

— W. O. AMREIN & A. M. BERTHIER On support properties ofLp-functions and their Fourier transforms. J. FunctionalAnalysis 24 (1977) 258–267.— M. BENEDICKS On Fourier transforms of functions supportedon sets of finite Lebesgue measure. J. Math. Anal. Appl. 106(1985) 180–183.— F. L. NAZAROV Local estimates for exponential polynomialsand their applications to inequalities of the uncertainty principletype. (Russian) Algebra i Analiz 5 (1993) 3–66; translation inSt. Petersburg Math. J. 5 (1994) 663–717.— PH. JAMING Nazarov’s uncertainty principle in higherdimension J. Approx. Theory (2007) available in Arxiv.—PH. JAMING & A. POWELL, Uncertainty principles fororthonormal bases. J. Funct. Anal., 243 (2007), 611–630.

Nazarov's uncertainty principle in higher dimensionpjaming/exposes/... · The problem Benedicks’s...

Documents

Transcript of Nazarov's uncertainty principle in higher dimensionpjaming/exposes/... · The problem Benedicks’s...

Russell Simmons Exposes Abe Foxman in Jerusalem

Crucible exposes recruits to simulated IEDs

Court insider exposes judicial treachery november 16

Georgij Nazarov - Tajne ciscenja mozga.pdf

Pandemic Exposes Weaknesses in India’s

Capital Markets Day 2011 Mikhail Nazarov, Sergey Veselov

Lecture 13 dr. P. Nazarov - edu.sablab.netedu.sablab.net/biostat/2016/Lectures/Biostatistics-L13.pdf · Data analysis in trascriptomics edu.sablab.net/transcript 1 dr. P. Nazarov

YARYONG HEO FEDOR NAZAROV ANDREAS SEEGER¨ … · YARYONG HEO FEDOR NAZAROV ANDREAS SEEGER¨ Abstract. We investigate connections between radial Fourier multi-pliers on Rd and certain

O . P . Cherkasova , I.N. Smirnova, M . M . Nazarov ,

On the structure of cyclotomic Nazarov–Wenzl algebras · The cyclotomic Nazarov–Wenzl algebras of type G(r ,1 n) Throughout this paper, unless otherwise stated, we always assume

Georgij Nazarov - Tajne Ciscenja Mozga

Emaad Khalid exposes Zaid Hamid

System for the Nazarov Cyclization Natural Deep Eutectic ... · Supporting Information Natural Deep Eutectic Solvents as an Efficient and Reusable Catalytic System for the Nazarov

attilajc.files.wordpress.com file17. th International Bosphorus Judo Tournament 5-6 July 2003 Ýstanbul - Turkey Cat. -66 Nb. de Judokas: 22 —NAZAROV GRICORIOS -NAZAROV GRIGORI

Optimized Link State Protocol Version 2 Assaf Israel, Eli Nazarov, Asi Bross Version 2 Assaf Israel, Eli Nazarov, Asi Bross.

Alexander Nazarov

IFA Exposes Alarming Scott County Financials

Maxim Nazarov arXiv:math/0307091v3 [math.RT] 5 Apr 2004 · Maxim Nazarov Department of Mathematics, University of York, York YO10 5DD, England Email address: mln1@york.ac.uk D´edi´e

NAZAROV-WENZL ALGEBRAS, COIDEAL ...NAZAROV-WENZL ALGEBRAS, COIDEAL SUBALGEBRAS AND CATEGORIFIED SKEW HOWE DUALITY MICHAEL EHRIG AND CATHARINA STROPPEL Abstract. We describe how certain

CYCLOTOMIC NAZAROV-WENZL ALGEBRAS › core › services › aop... · CYCLOTOMIC NAZAROV-WENZL ALGEBRAS SUSUMU ARIKI, ANDREW MATHAS and HEBING RUI ... where V is the de ning representation