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
An application of positive definite functions to the problem of MUBs
Mihail N. Kolountzakis, Máté Matolcsi, Mihály Weiner
We present a new approach to the problem of mutually unbiased bases (MUBs), based on positive definite functions on the unitary group. The method provides a new proof of the fact t…
Bounds on the 2-domination number
Csilla Bujtás, Szilárd Jaskó
In a graph , a set is called 2-dominating set if each vertex not in has at least two neighbors in . The 2-domination number is the minimum card…
Non-normal affine monoids, modules and Poincaré series of plumbed 3-manifolds
Tamás László, Zsolt Szilágyi
We construct a non-normal affine monoid together with its modules associated with a negative definite plumbed -manifold . In terms of their structure, we describe the $H_1(M,…
Strong Limit Multiplicity for arithmetic hyperbolic surfaces and -manifolds
Mikolaj Fraczyk
We show that every sequence of torsion-free arithmetic congruence lattices in or satisfies a strong quantitative version of…
Note on k-planar crossing numbers
János Pach, László A. Székely, Csaba D. Tóth +1
The crossing number of a graph is the smallest number of edge crossings over all drawings of in the plane. For any , the -planar crossing number of…
Expanders with superquadratic growth
Antal Balog, Oliver Roche-Newton, Dmitry Zhelezov
We will prove several expanders with exponent strictly greater than . For any finite set , we prove the following six-variable expander results: \begin{alig…
A proof of Pyber's base size conjecture
Hülya Duyan, Zoltán Halasi, Attila Maróti
Building on earlier papers of several authors, we establish that there exists a universal constant such that the minimal base size of a primitive permutation group $…
Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs
Christian Reiher, Vojtěch Rödl, Andrzej Ruciński +2
We show that every 3-uniform hypergraph with vertices and minimum vertex degree at least contains a tight Hamiltonian cycle. Known lower bound constructi…
Handle decompositions of rational balls and Casson-Gordon invariants
Paolo Aceto, Marco Golla, Ana G. Lecuona
Given a rational homology sphere which bounds rational homology balls, we investigate the complexity of these balls as measured by the number of 1-handles in a handle decomposition…
Measures on the square as sparse graph limits
Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy
We study a metric on the set of finite graphs in which two graphs are considered to be similar if they have similar bounded dimensional "factors". We show that limits of convergent…
Pach's selection theorem does not admit a topological extension
Imre Bárány, Roy Meshulam, Eran Nevo +1
Let be -element sets in and let denote the convex hull of points in (for all ) which is a (possibly…
The distribution and density of cyclic groups of the reductions of an elliptic curve over a function field
Márton Erdélyi
Let be a global field of finite characteristic , and let be a non-isotrivial elliptic curve. We give an asympotoic formula of the number of places for which t…
Strengthened volume inequalities for L_p zonoids of even isotropic measures
Karoly J. Boroczky, Ferenc Fodor, Daniel Hug
We strengthen the volume inequalities for L_p zonoids of even isotropic measures and for their duals, which are due to Ball, Barthe and Lutwak, Yang, Zhang. Along the way, we prove…
Geometry of Permutation Limits
Mustazee Rahman, Balint Virag, Mate Vizer
This paper initiates a limit theory of permutation valued processes, building on the recent theory of permutons. We apply this to study the asymptotic behaviour of random sorting n…
On the greatest common divisor of the value of two polynomials
Péter E. Frenkel, József Pelikán
We show that if two monic polynomials with integer coefficients have square-free resultant, then all positive divisors of the resultant arise as the greatest common divisor of the…
Arrangements of homothets of a convex body
Márton Naszódi, János Pach, Konrad Swanepoel
Answering a question of Füredi and Loeb (1994), we show that the maximum number of pairwise intersecting homothets of a -dimensional centrally symmetric convex body , none of…
An Erdős-Gallai type theorem for uniform hypergraphs
Akbar Davoodi, Ervin Győri, Abhishek Methuku +1
A well-known theorem of Erdős and Gallai asserts that a graph with no path of length contains at most edges. Recently Győri, Katona and Lemons gave an exten…
On optimal investment with processes of long or negative memory
Huy N. Chau, Miklos Rasonyi
We consider the problem of utility maximization for investors with power utility functions. Building on the earlier work Larsen et al. (2016), we prove that the value of the proble…
Empirical study of the role of the topology in spreading on communication networks
Alexey N. Medvedev, Janos Kertesz
Topological aspects, like community structure, and temporal activity patterns, like burstiness, have been shown to severly influence the speed of spreading in temporal networks. We…
Better upper bounds on the Füredi-Hajnal limits of permutations
Josef Cibulka, Jan Kynčl
A binary matrix is a matrix with entries from the set . We say that a binary matrix contains a binary matrix if can be obtained from by removal of some row…
Embedding 3-manifolds in spin 4-manifolds
Paolo Aceto, Marco Golla, Kyle Larson
An invariant of orientable 3-manifolds is defined by taking the minimum such that a given 3-manifold embeds in the connected sum of copies of , and we call…
Families with no pairwise disjoint sets
Peter Frankl, Andrey Kupavskii
For integers let denote the maximum of where is a family of subsets of an -element set and contains no pairw…
Dominating sequences in grid-like and toroidal graphs
Boštjan Brešar, Csilla Bujtás, Tanja Gologranc +5
A longest sequence of distinct vertices of a graph such that each vertex of dominates some vertex that is not dominated by its preceding vertices, is called a Grundy do…
Note on Terminal-Pairability in Complete Grid Graphs
Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros
We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel concerning the path-pairability of high-dimensional complete grid graphs. As an intriguing by-prod…