output
20052020
most citedNetworks beyond pairwise interactions: structure and dynamics

1.6k citations

Showing 2017Show all

9 papers · 1 filter

math.CO2017★ 3 cited

An Erdős-Gallai type theorem for vertex colored graphs

Nika Salia, Casey Tompkins, Oscar Zamora

While investigating odd-cycle free hypergraphs, Győri and Lemons introduced a colored version of the classical theorem of Erdős and Gallai on -free graphs. They proved that an…

math.NT2017★ 7 cited

Analytic properties of spherical cusp forms on GL(n)

Valentin Blomer, Gergely Harcos, Péter Maga

Let be an -normalized spherical vector in an everywhere unramified cuspidal automorphic representation of over with Laplace eigenvalue .…

physics.soc-ph2017★ 197 cited

Hot Streaks in Artistic, Cultural, and Scientific Careers

Lu Liu, Yang Wang, Roberta Sinatra +3

The hot streak, loosely defined as winning begets more winnings, highlights a specific period during which an individual's performance is substantially higher than her typical perf…

math.CO2017★ 10 cited

On the Turán number of some ordered even cycles

Ervin Győri, Dániel Korándi, Abhishek Methuku +3

A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on vertices contains no cycle of length then it has at most edges…

math.CO2017★ 5 cited

Turán number of an induced complete bipartite graph plus an odd cycle

Beka Ergemlidze, Ervin Győri, Abhishek Methuku

Let be an integer. We show that if and , or , then the maximum possible number of edges in a -free graph containing no induced copy…

math.GT2017★ 2 cited

On loose Legendrian knots in rational homology spheres

Alberto Cavallo

We prove that loose Legendrian knots in a rational homology contact 3-sphere, satisfying some additional hypothesis, are Legendrian isotopic if and only if they have the same class…

math.NT2017★ 4 cited

On the global sup-norm of GL(3) cusp forms

Valentin Blomer, Gergely Harcos, Péter Maga

Let be a spherical Hecke-Maass cusp form on the non-compact space . We establish various pointwise upper bounds…

math.CO2017★ 3 cited

Asymptotics for the Turán number of Berge-

Dániel Gerbner, Abhishek Methuku, Máté Vizer

Let be a graph. A hypergraph is called Berge- if it can be obtained by replacing each edge of by a hyperedge containing it. Let be a family of graphs. The…

math.FA2017

Controlling Lipschitz functions

Andrey Kupavskii, Janos Pach, Gabor Tardos

Given any positive integers and , we say the a sequence of points in is {\em Lipschitz--controlling} if one can select suitable values $y_i…