activity
20102026
most citedA simple proof of the Zeilberger-Bressoud q-Dyson theorem

22 citations · 45 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2026

A Salem-Spencer-Type Construction for Large Subsets of Integer Grids with No Isosceles Right Triangles

Gyula Károlyi, Jozsef Solymosi

Let be the largest size of a subset of containing no nondegenerate isosceles right triangle. We give a modified Salem--Spencer-type construction over…

math.CO2023

Covering the Permutohedron by Affine Hyperplanes

Gábor Hegedüs, Gyula Károlyi

An almost cover of a finite set in the affine space is a collection of hyperplanes that together cover all points of the set except one. Using the polynomial method, we determine t…

math.RA2018

Evaluation of Polynomials over Finite Rings via Additive Combinatorics

Gyula Károlyi, Csaba Szabó

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings.…

math.CO2013★ 20 cited

A new approach to constant term identities and Selberg-type integrals

Gyula Károlyi, Zoltán Lóránt Nagy, Fedor Petrov +1

Selberg-type integrals that can be turned into constant term identities for Laurent polynomials arise naturally in conjunction with random matrix models in statistical mechanics. B…

math.CO2012★ 22 cited

A simple proof of the Zeilberger-Bressoud q-Dyson theorem

Gyula Károlyi, Zoltán Lóránt Nagy

As an application of the Combinatorial Nullstellensatz, we give a short polynomial proof of the q-analogue of Dyson's conjecture formulated by Andrews and first proved by Zeilberge…

math.CO2010★ 3 cited

Remarks to Arsovski's proof of Snevily's conjecture

Gergely Harcos, Gyula Károlyi, Géza Kós

Based on the recent work of Arsovski, we confirm a conjecture of Feng, Sun, and Xiang, and we give a shortened proof of Snevily's conjecture.