26 04 im alumniV8
22 11 im fatiado face
22 11 im fatiado twitter
22 11 im fatiado youtube
22 11 im fatiado gmail
22 11 im fatiado brazil
22 11 im fatiado england
22 11 im fatiado spain

15 07 im Noticia Interpolation formulas uncertainty principlesTítulo: Interpolation formulas, uncertainty principles and sphere packing

Palestrante: Mateus Souza (Basque Center for Applied Mathematics)
Data: 16/07/2021
Horário: 10:00h
Local: Transmissão via RNP e Youtube

Confira AQUI a transmissão pelo RNP.

Confira AQUI a transmissão pelo Youtube.

Resumo: In this talk we will discuss how uncertainty principles and interpolation formulas are connected to sphere packing problems and talk about some recent developments on these fronts. This talk is intended for a broad audience.

12 07 IM Noticia Geometria 1Título: On Mean curvature flow of Singular Riemannian foliations: Non compact cases

Palestrante: Marcos Alexandrino (USP)
Data: 13/07/2021
Horário: 14:00h
Local: Transmissão online

Confira AQUI o link para a transmissão. 

Resumo: In this talk we investigate the mean curvature flow (MCF) of a regular leaf of a closed generalized isoparametric foliation as initial datum, generalizing previous results of Radeschi and first author. We show that, under bounded curvature conditions, any finite time singularity is a singular leaf, and the singularity is of type I. We also discuss the existence of basin of attractions, how cylinder structures can affect convergence of basic MCF of immersed submanifolds and make a few remarks on MCF of non closed leaves of generalized isoparametric foliation.We will introduce all the concepts targeting a wide audience in geometry. This talk is based on a joint work with Leonardo F. Cavenaghi, Icaro Gonçalves.

04 06 2019 IM Noticia 1Nesta tabela reunimos informações sobre todas as turmas de graduação ofertadas na segmentação 2021-1 pelo Instituto de Matemática, incluindo formulários de acesso, links para salas virtuais ou contato do professor ministrante conforme cada caso. Cada turma no sistema está associada a um número de controle que a identifica de forma única. Este número de controle é informado na sua CRID ao lado do código da disciplina. Tenha em mãos a sua CRID ao realizar a consulta, este documento pode ser emitido no portal do aluno pelo site ou pelo App.

Confira o quadro de horário das disciplinas oferecidas pelo IM em 2021.1

Clique AQUI e acesse.

12 07 IM Noticia SeminárioPangolinTítulo: FC-subspaces

Palestrante: Misha Belolipetsky, IMPA
Data: 13/07/2021
Horário: 10:30h
Local: Transmissão online

Confira AQUI o link para a transmissão.

Resumo: In a joint work with Nikolay Bogachev, Alexander Kolpakov, and Leone Slavich we discovered an interesting connection between totally geodesic subspaces of a hyperbolic manifold or orbifold and finite subgroups of the commensurator of its fundamental group. We call the totally geodesic subspaces associated to the finite subgroups by fc-subspaces. It appears that these subspaces have some remarkable properties. We show that in an arithmetic orbifold all totally geodesic subspaces are fc and there are infinitely many of them, while in non-arithmetic cases there are only finitely many fc-subspaces and their number is bounded in terms of volume. In the talk, I will discuss these results and if time permits will sketch some other applications of fc-subspaces.

08 07 IM Noticia ColóquioTítulo: Finding real zeros a lot faster through an adaptive grid

Palestrante: Josué Tonelli Cueto (INRIA)
Data: 09/07/2021
Horário: 09:00h
Local: Transmissão via RNP e Youtube

Confira AQUI a transmissão pelo RNP.

Confira AQUI a transmissão pelo Youtube.

Resumo: An algorithm by Cucker, Krick, Malajovich and Wschebor finds all the real zeros of a dense real polynomial system. This algorithm has three very important properties for a numerical algorithm in algebraic geometry: 1) numerically stable, 2) parallelizable, and 3) good probabilistic run-time. Unfortunately, the algorithm does not have a finite expected run-time, a fact that has been inherited by all algorithms in real numerical algebraic geometry. In this talk, we show how by making this algorithm adaptive, we can obtain finite expected run-time while preserving all the nice features of the original algorithm.

Subcategorias

Topo