Publication

Motivic Classes of Nakajima Quiver Varieties

Related publications (43)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On the Brauer group of diagonal quartic surfaces

Evis Ieronymou

We obtain an easy sufficient condition for the Brauer group of a diagonal quartic surface D over Q to be algebraic. We also give an upper bound for the order of the quotient of the Brauer group of D by the image of the Brauer group of Q. The proof is based ...

2011

Introducing qualitative dimensions to analyze the usefulness of Web 2.0 platforms as PLEs

Denis Gillet, Stéphane Sire, Evgeny Bogdanov

The trends in web development of educational applications and of Web 2.0 or social applications are converging. Platforms are designed to host a variety of software components (called widgets or plugins), which can be organised or combined (mashed-up) at u ...

2011

Slow Time Behavior of the Semidiscrete Perona–Malik Scheme in One Dimension

Maria Colombo

We consider the long time behavior of the semidiscrete scheme for the Perona-Malik equation in one dimension. We prove that approximated solutions converge, in a slow time scale, to solutions of a limit problem. This limit problem evolves piecewise constan ...

2011

Educational innovation: an Economist’s perspective

Dominique Foray

In the report, prominent researchers from Scandinavia, the US and Switzerland draw on a variety of perspectives and experiences to discuss the challenges in the field of educational research. The report is based on material from the programme’s conference ...

The Research Council of Norway2011

Categorical Foundations for K-theory

Nicolas Mathieu Michel

K-Theory was originally defined by Grothendieck as a contravariant functor from a subcategory of schemes to abelian groups, known today as K0. The same kind of construction was then applied to other fields of mathematics, like spaces and (not necessarily c ...

EPFL2010

Some stochastic comparisons in series systems with active redundancy

We compare the lifetimes of series systems with different allocations of active redundancy using a variety of stochastic comparisons. It is assumed that only one spare can be allocated to each component of the system. (C) 2010 Elsevier B.V. All rights rese ...

2010

Two variants of the support problem for products of abelian varieties and tori

Antonella Perucca

Let G be the product of an abelian variety and a torus defined over a number field K. Let P and Q be K-rational points on G. Suppose that for all but finitely many primes p of K the order of (Q mod p) divides the order of (P mod p). Then there exist a K-en ...

2009

A Class Of Mean Field Interaction Models for Computer and Communication Systems

Jean-Yves Le Boudec

We consider models of

N

interacting objects, where the interaction is via a common resource and the distribution of states of all objects. We consider the case where the number of transitions per time slot per object vanishes as

N

grows. We show that, ...

2008

Adaptive Filters

Ali H. Sayed

Adaptive filtering is a topic of immense practical and theoretical value, having applications in areas ranging from digital and wireless communications to biomedical systems. This book enables readers to gain a gradual and solid introduction to the subject ...

John Wiley & Sons2008

Supporting Loop Proofs in KeY by using BLAST

Mathias Krebs

In contrast to beta-testing, formal verification can guarantee correctness of a program against a specification. Two basic verification techniques are theorem proving and model checking. Both have strengths and weaknesses. Theorem proving is powerful, but ...

2006

A Class Of Mean Field Interaction Models for Computer and Communication Systems

Jean-Yves Le Boudec

We consider models of

N

N

grows. We show that, ...

2008