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
53 papers · 1 filter
Best possible bounds on the double-diversity of intersecting hypergraphs
Peter Frankl, Jian Wang
For a family and two elements define . The double-di…
Minimizing interference-to-signal ratios in multi-cell networks
Péter L. Erdős, Tamás Róbert Mezei
In contemporary wireless communication networks, base-stations are organized into coordinated clusters (called cells) to jointly serve the users. However, such fixed systems are pl…
Milnor Fiber Consistency via Flatness
Alex Hof
We describe a new algebro-geometric perspective on the study of the Milnor fibration and, as a first step toward putting it into practice, prove powerful criteria for a deformation…
Functional John and Löwner conditions for pairs of log-concave functions
Grigory Ivanov, Márton Naszódi
John's fundamental theorem characterizing the largest volume ellipsoid contained in a convex body in has seen several generalizations and extensions. One directi…
Rainbow saturation for complete graphs
Debsoumya Chakraborti, Kevin Hendrey, Ben Lund +1
We call an edge-colored graph rainbow if all of its edges receive distinct colors. An edge-colored graph is called -rainbow saturated if does not contain a rainbow copy…
Quantitative Steinitz Theorem: A polynomial bound
Grigory Ivanov, Márton Naszódi
The classical Steinitz theorem states that if the origin belongs to the interior of the convex hull of a set , then there are at most points of who…
On ordered Ramsey numbers of tripartite 3-uniform hypergraphs
Martin Balko, Máté Vizer
For an integer , an ordered -uniform hypergraph is a -uniform hypergraph together with a fixed linear ordering of its vertex set. The or…
Cutting corners
Andrey Kupavskii, Arsenii Sagdeev, Dmitrii Zakharov
We say that a subset of is exponentially Ramsey if there are and such that for any , where stan…
Testing definitional equivalence of theories via automorphism groups
H. Andréka, J. Madarász, I. Németi +1
Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem…
Impact of physicality on network structure
Márton Pósfai, Balázs Szegedy, Iva Bačić +5
The emergence of detailed maps of physical networks, like the brain connectome, vascular networks, or composite networks in metamaterials, whose nodes and links are physical entiti…
On Erdos--Dushnik--Miller theorem without AC
Amitayu Banerjee, Alexa Gopaulsingh
In set theory without the Axiom of Choice, we study the possible placement of Erdos-Dushnik-Miller theorem restricted to an uncountable set of vertices in the hierarchy of weak cho…
A supplement to Chebotarev's density theorem
Gergely Harcos, Kannan Soundararajan
Let be a Galois extension of number fields with Galois group . We show that if the density of prime ideals in that split totally in tends to with a power s…
Monochromatic spanning trees and matchings in ordered complete graphs
János Barát, András Gyárfás, Géza Tóth
Two independent edges in ordered graphs can be nested, crossing or separated. These relations define six types of subgraphs, depending on which relations are forbidden. We refine a…
Unknotting number 21 knots are slice in K3
Marco Marengon, Stefan Mihajlović
We prove that all knots with unknotting number at most 21 are smoothly slice in the K3 surface. We also prove a more general statement for 4-manifolds that contain a plumbing tree…
Products of subgroups, subnormality, and relative orders of elements
Luca Sabatini
Let be a group. We give an explicit description of the set of elements such that for every subgroup of finite index . This is related…
A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits
Sam McArdle, András Gilyén, Mario Berta
Topological invariants of a dataset, such as the number of holes that survive from one length scale to another (persistent Betti numbers) can be used to analyze and classify data i…
Quantum Wasserstein distance based on an optimization over separable states
Géza Tóth, József Pitrik
We define the quantum Wasserstein distance such that the optimization of the coupling is carried out over bipartite separable states rather than bipartite quantum states in general…
Count and cofactor matroids of highly connected graphs
Dániel Garamvölgyi, Tibor Jordán, Csaba Király
We consider two types of matroids defined on the edge set of a graph : count matroids , in which independence is defined by a sparsity count involving the…
Spectral sets and weak tiling
Mihail N. Kolountzakis, Nir Lev, Máté Matolcsi
A set is said to be spectral if the space admits an orthogonal basis of exponential functions. Fuglede (1974) conjectured that is spectral if a…
The extensible No-Three-In-Line problem
Dániel T. Nagy, Zoltán Lóránt Nagy, Russ Woodroofe
The classical No-Three-In-Line problem seeks the maximum number of points that may be selected from an grid while avoiding a collinear triple. The maximum is well known…
On a degenerate elliptic problem arising in the least action principle for Rayleigh-Taylor subsolutions
Björn Gebhard, Jonas Hirsch, József J. Kolumbán
We address a degenerate elliptic variational problem arising in the application of the least action principle to averaged solutions of the inhomogeneous Euler equations in Boussine…
Generalizing Körner's graph entropy to graphons
Viktor Harangi, Xueyan Niu, Bo Bai
Körner introduced the notion of graph entropy in 1973 as the minimal code rate of a natural coding problem where not all pairs of letters can be distinguished in the alphabet. Late…
Random interlacement is a factor of i.i.d
Márton Borbényi, Balázs Ráth, Sándor Rokob
The random interlacement point process (introduced by Sznitman, generalized by Teixeira) is a Poisson point process on the space of labeled doubly infinite nearest neighbour trajec…
Color-avoiding percolation in edge-colored Erdős-Rényi graphs
Balázs Ráth, Kitti Varga, Panna Tímea Fekete +1
We study a variant of the color-avoiding percolation model introduced by Krause et al., namely we investigate the color-avoiding bond percolation setup on (not necessarily properly…