Home Todos os Eventos Detalhes - Colóquio: Approximate counting

EMAIL Imprimir

Todos os Eventos

Evento 

Título:
Colóquio: Approximate counting
quando:
17.10.2017 11.00 h
onde:
Auditório 201 - Niterói
Categoria:
Colóquios

Descrição

Colóquios do IF-UFF

 

Na próxima terça-feira (17/10), às 11:00, na sala de seminários 201, teremos o colóquio ministrado pelo Prof. Dr. Thomas Prellberg (Queen Mary University of London).

O título e o resumo da apresentação seguem abaixo. Um lanche será servido quinze minutos antes.

Contamos com a presença de todos.

Atenciosamente,

A Comissão


*****

Título: Approximate Counting

Resumo:
Counting may seem intuitive, but early humans probably had a number awareness which helped them to keep track of their surroundings, rather than the exact counting we think of today. In the continued quest for exactness, the question of ?how many? arises as a central issue in many areas of mathematics, physics, and beyond. Due to the difficult nature of some counting problems, it is sometimes helpful to modify the question to ?roughly how many,? as an approximate answer is easier to obtain and in many cases sufficient.
In this lecture, I will show the relevance of ?how many structures are there of a given kind? in my own areas of specialty such as combinatorics and statistical physics, and how the endeavour to count structures continues to advance research. The focus will be on the counting of paths on a discrete lattice.
One example for such lattice paths is given by self-avoiding walks, which are paths on a regular lattice that do not self-intersect. The Encyclopædia Britannica lists self-avoiding walks as one of two examples of classical unsolved combinatorial problems. This problem has been at the forefront of research in statistical mechanics for more than half a century; self-avoiding walks have been of interest to chemists, physicists and mathematicians, Nobel Laureates and Fields Medalists alike.

Grupo

Mapa
Grupo:
Auditório 201
Rua:
Av. Litorânea
CEP:
24210-346
Cidade:
Niterói
UF:
Rj
País:
País: br

Descrição

Desculpe, a descrição não está disponível
<<  Dez 17  >>
 Do  Se  Te  Qu  Qu  Se  Sá 
       1  2
  3  4  5  6  7  8  9
101113141516
17181920212223
24252627282930
31