English
Related papers

Related papers: Popular differences for right isosceles triangles

200 papers

The $3k-4$ Theorem is a classical result which asserts that if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with \begin{equation}\label{hyp}|A+B|=|A|+|B|+r\leq |A|+|B|+\min\{|A|,\,|B|\}-3-\delta,\end{equation} where $\delta=1$ if…

Number Theory · Mathematics 2019-12-02 David J. Grynkiewicz

We study the minimum number of distinct distances between point sets on two curves in $R^3$. Assume that one curve contains $m$ points and the other $n$ points. Our main results: (a) When the curves are conic sections, we characterize all…

Combinatorics · Mathematics 2023-03-21 Toby Aldape , Jingyi Liu , Gregory Pylypovych , Adam Sheffer , Minh-Quan Vo

Given a right triangle ABC, with the ninety degree angle at A; consider the triangle O1OO2.Where the point O is the midpoint of the hypotenuseBC(and so the center of the triangle ABC's circumcircle), the point O1 being the triangle AOB's…

General Mathematics · Mathematics 2008-04-09 Konstantine "Hermes" Zelator

We show that if $k\ge 2$ is an integer and $(F_n^{(k)})_{n\ge 0}$ is the sequence of $k$-generalized Fibonacci numbers, then there are only finitely many triples of positive integers $1<a<b<c$ such that $ab+1,~ac+1,~bc+1$ are all members of…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christoph Hutle , Florian Luca , Laszlo Szalay

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

Combinatorics · Mathematics 2024-04-24 Arnau Padrol , Eva Philippe , Francisco Santos

We prove a strengthening of Chang's lemma for subsets of $\mathbb F_p^n$. The classical conclusion that the large spectrum is contained in a subspace of dimension at most $2\varepsilon^{-2}\log(1/\alpha)$ is refined to show that every…

Number Theory · Mathematics 2026-05-11 Gaia Carenini , Leonardo Franchi

Let $\mathcal{F}=\{A_1,A_2,\ldots,A_k\}$ be a collection of finite arithmetic progressions, where each $A_d$ is an initial segment of the set $D_d=\{d,2d,3d,\ldots\}$ of consecutive multiples of a positive integer $d$. Let $m(\mathcal{F})$…

Combinatorics · Mathematics 2026-03-04 Noga Alon , Michał Dębski , Jarosław Grytczuk , Jakub Przybyło

We give an alternative proof of the statement, by using elimination from algebraic geometry, that the only set $S\subset\mathbb{R}^2$, $\left|S\right|=6$ such that all subsets that form a triangle are isosceles triangles, is the regular…

Computational Geometry · Computer Science 2024-12-11 Zoltán Kovács

Consider triangulations of $\mathbb R P^2$ whose all vertices have valency six except three vertices of valency $4$. In this chapter we prove that the number $f(n)$ of such triangulations with no more than $n$ triangles grows as $C\cdot…

Combinatorics · Mathematics 2025-11-05 Mikhail Chernavskikh , Altan Erdnigor , Nikita Kalinin , Alexandr Zakharov

We give the structure of discrete two-dimensional finite sets $A,\,B\subseteq \R^2$ which are extremal for the recently obtained inequality $|A+B|\ge (\frac{|A|}{m}+\frac{|B|}{n}-1)(m+n-1)$, where $m$ and $n$ are the minimum number of…

Number Theory · Mathematics 2013-11-19 G. A. Freiman , D. Grynkiewicz , O. Serra , Y. V. Stanchescu

In this paper and a companion paper, we prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as…

Combinatorics · Mathematics 2022-07-21 Bruce Reed , Maya Stein

We study arithmetic progressions in primes with common differences as small as possible. Tao and Ziegler showed that, for any $k \geq 3$ and $N$ large, there exist non-trivial $k$-term arithmetic progressions in (any positive density subset…

Number Theory · Mathematics 2015-09-17 Xuancheng Shao

An $m$-general set in $AG(n,q)$ is a set of points such that any subset of size $m$ is in general position. A $3$-general set is often called a capset. In this paper, we study the maximum size of an $m$-general set in $AG(n,q)$,…

Combinatorics · Mathematics 2022-10-04 Michael Tait , Robert Won

It is shown that given a set of $N$ points in the plane or on the sphere, there is a subset of size $\gtrsim N^{1/3}/\log N$ with all pairwise distances between points distinct.

Combinatorics · Mathematics 2014-04-08 Marcos Charalambides

Given a prime power $q$ and a positive integer $n$, let $\mathbb{F}_{q^{n}}$ represents a finite extension of degree $n$ of the finite field ${\mathbb{F}_{q}}$. In this article, we investigate the existence of $m$ elements in arithmetic…

Number Theory · Mathematics 2024-01-09 Kaustav Chatterjee , Hariom Sharma , Aastha Shukla , Shailesh Kumar Tiwari

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Combinatorics · Mathematics 2010-04-13 Adrian Dumitrescu

Answering a question of Gowers, Tao proved that any $A\times B\times C\subset SL_d(\mathbb{F}_q)^3$ contains $|A||B||C|/|SL_d(\mathbb{F}_q)|+O_d(|SL_d(\mathbb{F}_q)|^2/q^{\min(d-1,2)/8})$ three-term progressions $(x,xy,xy^2)$. Using a…

Combinatorics · Mathematics 2023-01-11 Sarah Peluse

It is established that there exists an absolute constant $c>0$ such that for any finite set $A$ of positive real numbers $$|AA+A| \gg |A|^{\frac{3}{2}+c}.$$ On the other hand, we give an explicit construction of a finite set $A \subset…

Combinatorics · Mathematics 2018-10-03 Oliver Roche-Newton , Imre Z. Ruzsa , Chun-Yen Shen , Ilya D. Shkredov

In a 1989 paper \cite{arasu2}, Arasu used an observation about multipliers to show that no $(352,27,2)$ difference set exists in any abelian group. The proof is quite short and required no computer assistance. We show that it may be applied…

Combinatorics · Mathematics 2020-07-16 Daniel M. Gordon

In a recent breakthrough, Adiprasito, Avvakumov, and Karasev constructed a triangulation of the $n$-dimensional real projective space with a subexponential number of vertices. They reduced the problem to finding a small downward closed…

Combinatorics · Mathematics 2022-08-17 Peter Frankl , János Pach , Dömötör Pálvölgyi