857 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Hungarian Academy of SciencesHU402 papers
- Eötvös Loránd UniversityHU156 papers
- Budapest University of Technology and EconomicsHU58 papers
- Central European UniversityAT42 papers
- École Polytechnique Fédérale de LausanneCH31 papers
- Central European University - Budapest Campus24 papers
- University of PannoniaHU23 papers
- Centre National de la Recherche ScientifiqueFR21 papers
- University College LondonGB20 papers
- University of SzegedHU20 papers
- University of Illinois Urbana-ChampaignUS18 papers
- Charles UniversityCZ15 papers
48 papers · 1 filter
Large signed subset sums
Gergely Ambrus, Bernardo González Merino
We study the following question: for given , and , what is the largest value such that from any set of unit vectors in , w…
On non-adaptive majority problems of large query size
Dániel Gerbner, Máté Vizer
We are given balls and an unknown coloring of them with two colors. Our goal is to find a ball that belongs to the larger color class, or show that the color classes have the s…
Distribution of Beurling primes and zeroes of the Beurling zeta function I. Distribution of the zeroes of the zeta function of Beurling
Szilárd Gy. Révész
We prove three results on the density resp. local density and clustering of zeros of the Beurling zeta function close to the one-line . The analysis here brings…
Two-variable logic has weak, but not strong, Beth definability
H. Andréka, I. Németi
We prove that the two-variable fragment of first-order logic has the weak Beth definability property. This makes the two-variable fragment a natural logic separating the weak and t…
Fuglede's conjecture holds for cyclic groups of order
Gergely Kiss, Romanos Diogenes Malikiosis, Gábor Somlai +1
The tile-spectral direction of the discrete Fuglede-conjecture is well-known for cyclic groups of square-free order, initiated by Laba and Meyerowitz, but the spectral-tile directi…
Stochastic reaction-diffusion equations on networks
Mihály Kovács, Eszter Sikolya
We consider stochastic reaction-diffusion equations on a finite network represented by a finite graph. On each edge in the graph a multiplicative cylindrical Gaussian noise driven…
On the lack of semimartingale property
Vilmos Prokaj, László Bondici
In this work we extend the characterization of semimartingale functions in Cinlar et al. (1980) to the non-Markovian setting. We prove that if a function of a semimartingale remain…
On the discrepancy of random subsequences of II
Istvan Berkes, Bence Borda
Let be an irrational number, let be independent, identically distributed, integer-valued random variables, and put . Assuming that $X_1…
A note on thickness of knots
Andras I. Stipsicz, Zoltan Szabo
We introduce a numerical invariant β(K) of a knot K which measures how non-alternating K is. We prove an inequality between β(K) and the (knot Floer) thickness of K. As an applicat…
Non-orientable link cobordisms and torsion order in Floer homologies
Sherry Gong, Marco Marengon
We use unoriented versions of instanton and knot Floer homology to prove inequalities involving the Euler characteristic and the number of local maxima appearing in unorientable co…
Longest k-monotone chains
Gergely Ambrus
We study higher order convexity properties of random point sets in the unit square. Given uniform i.i.d random points, we derive asymptotic estimates for the maximal number of…
Singularity of maps of several variables and a problem of Mycielski concerning prevalent homeomorphisms
Richárd Balka, Márton Elekes, Viktor Kiss +1
S. Banach pointed out that the graph of the generic (in the sense of Baire category) element of has length . J. Mycielski asked if the measure theoretic du…
On Turán numbers of the complete -graphs
Alexander Sidorenko
The Turán number is the minimum number of edges in an -vertex -graph whose independence number does not exceed . For each , there exists suc…
Computing the covering radius of a polytope with an application to lonely runners
Jana Cslovjecsek, Romanos Diogenes Malikiosis, Márton Naszódi +1
We are concerned with the computational problem of determining the covering radius of a rational polytope. This parameter is defined as the minimal dilation factor that is needed f…
An improved quantum-inspired algorithm for linear regression
András Gilyén, Zhao Song, Ewin Tang
We give a classical algorithm for linear regression analogous to the quantum matrix inversion algorithm [Harrow, Hassidim, and Lloyd, Physical Review Letters'09, arXiv:0811.3171] f…
Flows on measurable spaces
Laszlo Lovasz
The theory of graph limits is only understood to any nontrivial degree in the cases of dense graphs and of bounded degree graphs. There is, however, a lot of interest in the interm…
On directed analogues of expander and hyperfinite graph sequences
Endre Csóka, Łukasz Grabowski
We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call "extender" and "hypershallow" graph sequences,…
Sumsets of Semiconvex sets
Imre Ruzsa, Jozsef Solymosi
We investigate additive properties of sets where is a monotone increasing set of real numbers, and the differences of consecutive elements are all…
The density hypothesis for horizontal families of lattices
Mikołaj Frączyk, Gergely Harcos, Péter Maga +1
We prove the density hypothesis for wide families of arithmetic orbifolds arising from all division quaternion algebras over all number fields of bounded degree. Our power-saving b…
Visualizing Transfer Learning
Róbert Szabó, Dániel Katona, Márton Csillag +2
We provide visualizations of individual neurons of a deep image recognition network during the temporal process of transfer learning. These visualizations qualitatively demonstrate…
The cocked hat
Imre Bárány, William Steiger, Sivan Toledo
We revisit the cocked hat -- an old problem from navigation -- and examine under what conditions its old solution is valid.
Stability of the Prekopa-Leindler inequality for log-concave functions
Karoly J. Boroczky, Apratim De
Stability version of the Prekopa-Leindler inequality for log-concave functions on the n-dimensional Euclidean space is established.
Weakly saturated random graphs
Zsolt Bartha, Brett Kolesnik
As introduced by Bollobás, a graph is weakly -saturated if the complete graph is obtained by iteratively completing copies of minus an edge. For all graphs , we…
Data-dependent Pruning to find the Winning Lottery Ticket
Dániel Lévai, Zsolt Zombori
The Lottery Ticket Hypothesis postulates that a freshly initialized neural network contains a small subnetwork that can be trained in isolation to achieve similar performance as th…