output
19912026
most citedGeometric deep learning: going beyond Euclidean data

3.7k citations

Showing 2011Show all

82 papers · 1 filter

math.AP2011

Note On the blowup criterion of smooth solution to the incompressible viscoelastic flow

Baoquan Yuan

We study the blowup criterion of smooth solution to the Oldroyd models. Let be a smooth solution in , it is shown that the solution does…

math.NT2011★ 2 cited

Multiple Mixing for adele groups and rational points

Alexander Gorodnik, Ramin Takloo-Bighash, Yuri Tschinkel

We prove an asymptotic formula for the number of rational points of bounded height on projective equivariant compactifications of $H\G$, where is a connected simple algebraic g…

math.AG2011

Galois theory and projective geometry

Fedor Bogomolov, Yuri Tschinkel

We explore connections between birational anabelian geometry and abstract projective geometry. One of the applications is a proof of a version of the birational section conjecture.

math.MG2011★ 15 cited

Ultrametric skeletons

Manor Mendel, Assaf Naor

We prove that for every there exists with the following property. If is a compact metric space and is a Borel probability measure on $X…

math.DS2011★ 27 cited

Non-stationary compositions of Anosov diffeomorphisms

Mikko Stenlund

Motivated by non-equilibrium phenomena in nature, we study dynamical systems whose time-evolution is determined by non-stationary compositions of chaotic maps. The constituent maps…

math.CO2011★ 1 cited

The number of edges in k-quasi-planar graphs

Jacob Fox, Janos Pach, Andrew Suk

A graph drawn in the plane is called k-quasi-planar if it does not contain k pairwise crossing edges. It has been conjectured for a long time that for every fixed k, the maximum nu…