Paul Hametner

most citedZero testing and equation solving for sparse polynomials on rectangular domains

1 citations · 1 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2026

Large solution-free sets via combinatorial degenerations

Paul Hametner, Jozsef Solymosi

Consider the linear form $L (x, y, z, w) = 3 x + y - 2 z - 2 w$ . For a positive integer $N$ , denote by $r_{L} (N)$ the largest size of a subset of ${1, 2, \dots, N}$ that avoids nontrivial solution…

math.CO2026

Beating Product Constructions for Linear Equations Over Finite Fields

Paul Hametner, Fred Tyrrell

We show that for any $A \subseteq F_{q}^{n}$ lacking non-trivial solutions to a translation-invariant linear equation of genus one, meaning that no nonempty proper subset of th…

math.CO2026

The minimum degree question for the Maker Breaker Domination Game

Jakob Führer, Georg Grasegger, Paul Hametner +1

The Maker Breaker Domination Game is a two player game played on a graph $G$ in which the players take turns to claim a vertex from the graph. The aim of the Dominator is to claim…

math.RA2023★ 1 cited

Zero testing and equation solving for sparse polynomials on rectangular domains

Erhard Aichinger, Simon Grünbacher, Paul Hametner

We consider sparse polynomials in $N$ variables over a finite field, and ask whether they vanish on a set $S^{N}$ , where $S$ is a set of nonzero elements of the field. We see that if…