Related papers: Falconer lattice sets and the Erdos similarity pro…

In this paper, we study the cardinality of the distance set $\Delta(A, B)$ determined by two subsets $A$ and $B$ of the $d$-dimensional vector space over a finite field $\mathbb{F}_q$. Assuming that $A$ or $B$ lies in a $k$-coordinate plane…

We present some problems and results about variants of sunflowers in families of sets. In particular, we improve an upper bound of the first author, K\"orner and Monti on the maximum number of binary vectors of length $n$ so that every four…

We construct examples of Delone sets of the plane (that is, discrete subsets that are uniformly separated and coarsely dense) that are repetitive (each patch of the set appears in every large-enough ball) though non-rectifiable (i.e. non…

For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on $\mathbb{N}^d$ (Dickson's lemma), yielding Ackermannian upper bounds via controlled bad-sequence…

Batyrev and Tschinkel's example is a Fermat cubic surface bundle $X$ which is a Fano $5$-fold. It is the first example for which Manin's conjecture can never hold for a proper closed exceptional set. Recently, Lehmann, Sengupta, and…

To give positive answer to a question of Frantzikinakis, we study a class of subsets of $\mathbb{N}$, called interpolation sets, on which every bounded sequence can be extended to an almost periodic sequence on $\mathbb{N}$. Strzelecki has…

We calculate the almost sure dimension for a general class of random affine code tree fractals in $\mathbb R^d$. The result is based on a probabilistic version of the Falconer-Sloan condition $C(s)$ introduced in \cite{FS}. We verify that,…

In this note we give a simple sufficient condition for an affine iterated function system to admit an invariant affine subspace persistently with respect to changes in the translation parameters. This yields further examples of tuples of…

We study a finite-field analogue of the Erd\H{o}s distinct distances problem under the Hamming metric. For a set \(S\subseteq \mathbb{F}_q^n\) let $\Delta(S)$ denote the set of Hamming distances determined by \(S\). We prove the lower bound…

We give a geometric proof to the classical fact that the dimension of the deformations of a given generic Fuchsian equation without changing the semi-simple conjugacy class of its local monodromies (``number of accessory parameters'') is…

We study a family of Zariski dense finitely generated discrete subgroups of $\mathrm{Isom}(\mathbb{H}^d)$, $d \geqslant 2$, defined by the following property: any group in this family contains at least one reflection in a hyperplane. As an…

In a well-known paper by Bruna, Nagel and Wainger [BNW], Fourier transform decay estimates were proved for smooth hypersurfaces of finite line type bounding a convex domain. In this paper, we generalize their results in the following ways.…

A recurrence relation is said to have the Laurent property if all of its iterates are Laurent polynomials in the initial values with integer coefficients. We consider a family of nonlinear recurrences with the Laurent property, which were…

We define and study semilattices and lattices for $E$-closed families of theories. Properties of these semilattices and lattices are investigated. It is shown that lattices for families of theories with least generating sets are…

In this paper, we prove an analogue of the Erd\H{o}s-Ko-Rado theorem intersecting families of subspaces in projective Hjelmslev geometries over finite chain rings of nilpotency index 2. We give an example of maximal families that are not…

While the Ablowitz-Ladik lattice is integrable, the Discrete Nonlinear Schr\"odinger equation, which is more significant for physical applications, is not. We prove closeness of the solutions of both systems in the sense of a "continuous…

We establish a cutting lemma for definable families of sets in distal structures, as well as the optimality of the distal cell decomposition for definable families of sets on the plane in $o$-minimal expansions of fields. Using it, we…

We prove the 4-uniform Erd\H{o}s Matching Conjecture for every matching number $s\ge 6961$. The proof has two parts. First, building on ideas from Frankl--R\"odl--Ruci\'nski, we formulate a general finite-board criterion for the $r$-uniform…

We show that the weak limit of a quasiminimizing sequence is a quasiminimal set. This generalizes the notion of weak limit of a minimizing sequences introduced by De Lellis, De Philippis, De Rosa, Ghiraldin and Maggi. This result is also…

We prove a conjecture of Boros, Caro, F\"uredi and Yuster on the maximum number of edges in a 2-connected graph without repeated cycle lengths, which is a restricted version of a longstanding problem of Erd\H{o}s. Our proof together with…