activity
20162025
most citedThe density of planar sets avoiding unit distances

4 citations · 8 across the 11 of their papers we have counts for

collaborators

11 papers

cs.LG2025

Post-Norm can Resharpen Attention

Pál Zsámboki, Benjamin Levi, David Ansel Josef Smith +4

Length Generalization is the essential capacity of autonomous agents to perform tasks in longer contexts than those encountered during training. To systematically study this feat,…

cs.LG2025

Do Attention Heads Compete or Cooperate during Counting?

Pál Zsámboki, Ádám Fraknói, Máté Gedeon +2

We present an in-depth mechanistic interpretability analysis of training small transformers on an elementary task, counting, which is a crucial deductive step in many algorithms. I…

math.CO2024

Diverse beam search to find densest-known planar unit distance graphs

Peter Engel, Owen Hammond-Lee, Yiheng Su +2

This paper addresses the problem of determining the maximum number of edges in a unit distance graph (UDG) of vertices using computer search. An unsolved problem of Paul Erdős…

math.CO2023

The fractional chromatic number of the plane is at least 4

Máté Matolcsi, Imre Z. Ruzsa, Dániel Varga +1

We prove that the fractional chromatic number of the unit distance graph of the Euclidean plane is greater than or equal to . Interestingly, however, we canno…

cs.CL2023

Training BERT Models to Carry Over a Coding System Developed on One Corpus to Another

Dalma Galambos, Pál Zsámboki

This paper describes how we train BERT models to carry over a coding system developed on the paragraphs of a Hungarian literary journal to another. The aim of the coding system is…

math.MG2022★ 4 cited

The density of planar sets avoiding unit distances

Gergely Ambrus, Adrián Csiszárik, Máté Matolcsi +2

By improving upon previous estimates on a problem posed by L. Moser, we prove a conjecture of Erdős that the density of any measurable planar set avoiding unit distances cannot exc…

math.AG2020

A homotopical Skolem--Noether theorem

Ajneet Dhillon, Pál Zsámboki

The classical Skolem--Noether Theorem [Giraud, 71] shows us (1) how we can assign to an Azumaya algebra on a scheme a cohomological Brauer class in and…

math.AT2020★ 2 cited

Commutative classifying space for simplicial groups

Cihan Okay, Pál Zsámboki

In this paper, we introduce a simplicial analog of classifying spaces for commutativity which classify principal bundles with commutativity structure on their transition functions.…

math.AG2019

Twisted forms of perfect complexes and Hilbert 90

Ajneet Dhillon, Pál Zsámboki

Automorphisms of a perfect complex naturally have the structure of an -group: the 1-morphisms are quasi-isomorphisms, the 2-morphisms are homotopies, etc. This article star…

math.AG2018★ 2 cited

On the -stack of complexes over a scheme

Ajneet Dhillon, Pál Zsámboki

We study fppf descent for enhanced derived categories. We revisit the work of [HS] and [TV08] in a lax context. More precisely, we construct a Cartesian and coCartesian fibration $…

math.AG2016

Extensions of -group sheaves

Pal Zsamboki

Let be an -topos, for example the -category of simplicial sheaves on a Grothendieck site. Then -group sheaves are group objects in …