Related papers: Problem list on Foliations and Diffeomorphism grou…

This collection of problems and conjectures is based on a subset of the open problems from the seminar series and the problem sessions of the Institut Mitag-Leffler programme Graphs, Hypergraphs, and Computing. Each problem contributor has…

This survey is based on a series of five lectures, given May 3--7, 2010, at the Centre de Recerca Matematica, Barcelona. The goal of the lectures was to present aspects of the theory of foliation dynamical systems which have particular…

The dimer tiling problem asks in how many ways can the edges of a graph be covered by dimers so that each site is covered once. In the special case of a planar graph, this problem has a solution in terms of a free fermionic field theory. We…

We study groups of formal or germs of analytic diffeomorphisms in several complex variables. Such groups are related to the study of the transverse structure and dynamics of Holomorphic foliations, via the notion of holonomy group of a leaf…

We consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain a neutral…

We describe a list of open problems in random matrix theory and integrable systems which was presented at the conference ``Integrable Systems, Random Matrices, and Applications'' at the Courant Institute in May 2006.

We present a list of open questions in the theory of holomorphic foliations, possibly with singularities. Some problems have been around for a while, others are very accessible.

We present updates to the problems on Hirzebruch's 1954 problem list focussing on open problems, and on those where substantial progress has been made in recent years. We discuss some purely topological problems, as well as geometric…

Dynamic Complexity was introduced by Immerman and Patnaik PI97 in the nineties and has seen a resurgence of interest with the positive resolution of their conjecture on directed reachability in DynFO DKMSZ18. Since then many natural…

This book covers many of the recent results on group actions on the circle, with an emphasis in the differentiable case.

Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geometry are listed.

We answer two questions on the complexities of decision problems of groups, each related to a classical result. First, C. Miller characterized the complexity of the isomorphism problem for finitely presented groups in 1971. We do the same…

This paper reviews the first-ever image demoireing challenge that was part of the Advances in Image Manipulation (AIM) workshop, held in conjunction with ICCV 2019. This paper describes the challenge, and focuses on the proposed solutions…

We present and discuss some open problems formulated by participants of the International Workshop "Knots, Braids, and Auto\-mor\-phism Groups" held in Novosibirsk, 2014. Problems are related to palindromic and commutator widths of groups;…

This is an expanded version of the talk by the author at the conference Polynomial Rings and Affine Algebraic Geometry, February 12--16, 2018, Tokyo Metropolitan University, Tokyo, Japan. Considering a local version of the Zariski…

This is a survey article on the relationship between algebraic properties of diffeomorphism groups and homotopical properties of foliations, written for the Notices of the AMS.

These lecture notes are meant to accompany two lectures given at the CDM 2016 conference, about the Kadison-Singer Problem. They are meant to complement the survey by the same authors (along with Spielman) which appeared at the 2014 ICM. In…

This article gathers notes of two lectures given at Grenoble's University in June $2023$, and is an introduction to recent works on shear layers, in collaboration with D. Bian, Y. Guo, T. Nguyen and B. Pausader.

This essay summarizes the state of the art on some aspects of the dynamics of polynomial diffeomorphsms in complex dimension two, and it presents a number of open questions.

In this paper we formulate and study the problem of representing groups on graphs. We show that with respect to polynomial time turing reducibility, both abelian and solvable group representability are all equivalent to graph isomorphism,…