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
31 papers · 1 filter
Graph unique-maximum and conflict-free colorings
Panagiotis Cheilaris, Geza Toth
We investigate the relationship between two kinds of vertex colorings of graphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are…
On Polygons Excluding Point Sets
Radoslav Fulek, Balázs Keszegh, Filip Morić +1
By a polygonization of a finite point set in the plane we understand a simple polygon having as the set of its vertices. Let and be sets of blue and red points, res…
Multisymmetric polynomials in dimension three
M. Domokos, A. Puskás
The polarizations of one relation of degree five and two relations of degree six minimally generate the ideal of relations among a minimal generating system of the algebra of multi…
Combinatorial Heegaard Floer homology and nice Heegaard diagrams
Peter S. Ozsvath, Andras I. Stipsicz, Zoltan Szabo
We consider a stabilized version of hat Heegaard Floer homology of a 3-manifold Y (i.e. the U=0 variant of Heegaard Floer homology for closed 3-manifolds). We give a combinatorial…
Jarnik's convex lattice -gon for non-symmetric norms
Imre Barany, Nathanael Enriquez
What is the minimum perimeter of a convex lattice -gon? This question was answered by Jarnik in 1926. We solve the same question in the case when perimeter is measured by a (not…
On splitting infinite-fold covers
Márton Elekes, Tamás Mátrai, Lajos Soukup
Let be a set, $\ka$ be a cardinal number and let $\iH$ be a family of subsets of which covers each at least $\ka$ times. What assumptions can ensure that $\iH$ can…
Helly dimension of algebraic groups
M. Domokos, E. Szabó
It is shown that for a linear algebraic group G over a field of characteristic zero, there is a natural number κ(G) such that if a system of Zariski closed cosets in G has empty in…
The embedding dimension of weighted homogeneous surface singularities
András Némethi, Tomohiro Okuma
We analyze the embedding dimension of a normal weighted homogeneous surface singularity, and more generally, the Poincaré series of the minimal set of generators of the graded alge…
Generalized Sidon sets
Javier Cilleruelo, Imre Z. Ruzsa, Carlos Vinuesa
We give asymptotic sharp estimates for the cardinality of a set of residue classes with the property that the representation function is bounded by a prescribed number. We then use…
Stability of the Prékopa-Leindler inequality
Károly J. Böröczky, Keith M. Ball
We prove a stability version of the Prékopa-Leindler inequality.
From f-divergence to quantum quasi-entropies and their use
Denes Petz
Csiszar's f-divergence of two probability distributions was extended to the quantum case by the author in 1985. In the quantum setting positive semidefinite matrices are in the pla…
On symplectic caps
David T. Gay, Andras I. Stipsicz
An important class of contact 3--manifolds are those that arise as links of rational surface singularities with reduced fundamental cycle. We explicitly describe symplectic caps (c…
Borel oracles. An analytical approach to constant-time algorithms
Gabor Elek, Gabor Lippner
Nguyen and Onak constructed the first constant-time algorithm for the approximation of the size of the maximum matching in bounded degree graphs. The Borel oracle machinery is a to…
Contact structures on product five-manifolds and fibre sums along circles
Hansjörg Geiges, András I. Stipsicz
Two constructions of contact manifolds are presented: (i) products of S^1 with manifolds admitting a suitable decomposition into two exact symplectic pieces and (ii) fibre connecte…
The Milnor fibre signature is not semi-continuous
Dmitry Kerner, Andras Nemethi
Consider the germ of an isolated surface singularity in $(\mC^3,0)$. The corresponding Milnor fibre possesses the homology lattice (the integral middle homology with a natural symm…
Improved bounds on the supremum of autoconvolutions
Mate Matolcsi, Carlos Vinuesa
We give a slight improvement of the best known lower bound for the supremum of autoconvolutions of nonnegative functions supported in a compact interval. Also, by means of explicit…
Longest convex chains
Gergely Ambrus, Imre Barany
Assume is a random sample of uniform, independent points from a triangle . The longest convex chain, , of is defined naturally. The length of is a r…
On the Milnor fibers of sandwiched singularities
Andras Nemethi, Patrick Popescu-Pampu
The sandwiched surface singularities are those rational surface singularities which dominate birationally smooth surface singularities. de Jong and van Straten showed that one can…
On directed local chromatic number, shift graphs, and Borsuk-like graphs
Gábor Simonyi, Gábor Tardos
We investigate the local chromatic number of shift graphs and prove that it is close to their chromatic number. This implies that the gap between the directed local chromatic numbe…
Invariants of open books of links of surface singularities
A. Nemethi, M. Tosun
In the present article we determine and characterize completely the support genus, the binding number and the norm of a page of an open book under the following restrictions: M is…
Intrinsic volumes of inscribed random polytopes in smooth convex bodies
Imre Bárány, Ferenc Fodor, Viktor Vígh
Let be a dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by the convex hull of …
Limits of randomly grown graph sequences
C. Borgs, J. Chayes, L. Lovász +2
Motivated in part by various sequences of graphs growing under random rules (like internet models), convergent sequences of dense graphs and their limits were introduced by Borgs,…
Degree-based graph construction
Hyunju Kim, Zoltan Toroczkai, Péter L. Erdős +2
Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This…
Twisted L-functions over number fields and Hilbert's eleventh problem
Valentin Blomer, Gergely Harcos
We prove a Burgess-like subconvex bound for twisted L-functions of a fixed irreducible cuspidal automorphic representation of GL(2) over a totally real number field. The proof is b…