832 citations
- Canadian Institute for Theoretical AstrophysicsCA11 papers
- Centre National de la Recherche ScientifiqueFR11 papers
- California Institute of TechnologyUS7 papers
- University of British ColumbiaCA7 papers
- University of California, BerkeleyUS7 papers
- University of Notre DameUS6 papers
- University of OxfordGB6 papers
- Massachusetts Institute of TechnologyUS4 papers
- National Institute of Astrophysics, Optics and ElectronicsMX4 papers
- Princeton UniversityUS4 papers
- The University of Texas at AustinUS4 papers
- University of Southern CaliforniaUS4 papers
7 papers · 1 filter
A measure-theoretic approach to the theory of dense hypergraphs
Gábor Elek, Balázs Szegedy
In this paper we develop a measure-theoretic method to treat problems in hypergraph theory. Our central theorem is a correspondence principle between three objects: An increasing h…
The Symmetry Preserving Removal Lemma
Balazs Szegedy
In this note we observe that in the hyper-graph removal lemma the edge removal can be done in a way that the symmetries of the original hyper-graph remain preserved. As an applicat…
A bijective proof of a factorization formula for Macdonald polynomials at roots of unity
Francois Descouens, Hideaki Morita, Yasuhide Numata
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restrict…
A Combinatorial Interpretation for Certain Relatives of the Conolly Sequence
B. Balamohan, Zhiqiang Li, Stephen Tanny
For any integer s >= 0, we derive a combinatorial interpretation for the family of sequences generated by the recursion (parameterized by s) h_s(n) = h_s(n - s - h_s(n - 1)) + h_s(…
Exact Euler Maclaurin formulas for simple lattice polytopes
Yael Karshon, Shlomo Sternberg, Jonathan Weitsman
Euler Maclaurin formulas for a polytope express the sum of the values of a function over the lattice points in the polytope in terms of integrals of the function and its derivative…
Learning symmetric k-juntas in time n^o(k)
Mihail N. Kolountzakis, Evangelos Markakis, Aranyak Mehta
We give an algorithm for learning symmetric k-juntas (boolean functions of boolean variables which depend only on an unknown set of of these variables) in the PAC model und…