Measure equivalence was introduced by Gromov as a measure-theoretic analogue to quasi-isometry between finitely generated groups. In this talk I will present measure equivalence classification results for right-angled Artin groups, and more generally graph products. This is based on joint works with Jingyin Huang and with Amandine Escalier.
We will give a relaxed introduction to some of the most classical dynamical systems - Anosov flows. These flows were highly influential in the development of ideas which the audience might be more familiar with. For example, Anosov flows give rise to exponential group growth and taut foliations, both of which we will discuss. Finally, we will talk about some recent work obstructing Anosov flows and their combinatorial analogs - veering triangulations
Property (T) was introduced by Kazhdan in the sixties to show that lattices in higher rank semisimple Lie groups are finitely generated. We will discuss some classical examples of groups that satisfy this property, with a particular focus on SL(3, R).
Graph braid groups are similar to braid groups, except that they are defined as ‘braids’ on a graph, rather than the real plane. We can think of graph braid groups in terms of the discrete configuration space of a graph, which is a CW-complex. One can compute a presentation of a graph braid group using Morse theory. In this talk I will give a few examples on how to compute these presentations in terms of generating circuits of the graph. I will then go through a detailed example of a graph that gives a one-ended braid group.
For a hyperbolic knot there are two types of invariants, the hyperbolic invariants coming from the geometric structure and the classical invariants coming from the topology or combinatorics. It has been observed in many different cases that these seemingly different types of invariants are in fact related. I will give examples of these relationships and discuss in particular a link by Stoimenow between the determinant and volume.
The Ivanov conjecture is equivalent to the statement that every covering map of surfaces has the so-called Putman-Wieland property. I will discuss my recent work with Vlad Marković, where we prove it for asymptotically all coverings as the degree grows. I will give some overview of our main tool: spectral geometry, which is related to objects like the heat kernel of a hyperbolic surface, or Cheeger connectivity constant.
We consider the problem of approximating singular values of a matrix when provided with approximations to the leading singular vectors. In particular, we focus on the Generalized Nystrom (GN) method, a commonly used low-rank approximation, and its error in extracting singular values. Like other approaches, the GN approximation can be interpreted as a perturbation of the original matrix. Up to orthogonal transformations, this perturbation has a peculiar structure that we wish to exploit. Thus, we use the Jordan-Wieldant Theorem and similarity transformations to generalize a matrix perturbation theory result on eigenvalues of a perturbed Hermitian matrix. Finally, combining the above, we can derive a bound on the GN singular values approximation error. We conclude by performing preliminary numerical examples. The aim is to heuristically study the sharpness of the bound, to give intuitions on how the analysis can be used to compare different approaches, and to provide ideas on how to make the bound computable in practice.
We present new high-order finite elements discretizing the $L^2$ de Rham complex on triangular and tetrahedral meshes. The finite elements discretize the same spaces as usual, but with different basis functions. They allow for fast linear solvers based on static condensation and space decomposition methods.
The new elements build upon the definition of degrees of freedom given by (Demkowicz et al., De Rham diagram for $hp$ finite element spaces. Comput.~Math.~Appl., 39(7-8):29--38, 2000.), and consist of integral moments on a symmetric reference simplex with respect to a numerically computed polynomial basis that is orthogonal in both the $L^2$- and $H(\mathrm{d})$-inner products ($\mathrm{d} \in \{\mathrm{grad}, \mathrm{curl}, \mathrm{div}\}$).
On the reference symmetric simplex, the resulting stiffness matrix has diagonal interior block, and does not couple together the interior and interface degrees of freedom. Thus, on the reference simplex, the Schur complement resulting from elimination of interior degrees of freedom is simply the interface block itself.
This sparsity is not preserved on arbitrary cells mapped from the reference cell. Nevertheless, the interior-interface coupling is weak because it is only induced by the geometric transformation. We devise a preconditioning strategy by neglecting the interior-interface coupling. We precondition the interface Schur complement with the interface block, and simply apply point-Jacobi to precondition the interior block.
The combination of this approach with a space decomposition method on small subdomains constructed around vertices, edges, and faces allows us to efficiently solve the canonical Riesz maps in $H^1$, $H(\mathrm{curl})$, and $H(\mathrm{div})$, at very high order. We empirically demonstrate iteration counts that are robust with respect to the polynomial degree.