English
Related papers

Related papers: Sidon sets and 2-caps in $\mathbb{F}_3^n$

200 papers

Let $(X,d)$ be a finite metric space with $|X|=n$. For a positive integer $k$ we define $A_k(X)$ to be the quotient set of all $k$-subsets of $X$ by isometry, and we denote $|A_k(X)|$ by $a_k$. The sequence $(a_1,a_2,\ldots,a_{n})$ is…

Combinatorics · Mathematics 2018-02-22 Mitsugu Hirasaka , Masashi Shinohara

Given a family $\mathcal{F}$ of subsets of $\{1,\ldots,m\}$, we try to compute the least natural number $n$ such that for every function $S:[\aleph_n]^{<\omega}\longrightarrow [\aleph_n]^{<\omega}$ there exists a bijection…

Logic · Mathematics 2017-12-27 Antonio Avilés , Claribet Piña

We prove that maximal cardinality of the Sidon set from $[n]$ exceeds $\sqrt{n}

Combinatorics · Mathematics 2013-04-09 Vladimir Blinovsky

A complete classification of a class of $3$-dimensional algebras is provided. In algebraically closed field $\mathbb{F}$ case this class is an open, dense (in Zariski topology) subset of $\mathbb{F}^{27}$.

Rings and Algebras · Mathematics 2017-11-28 U. Bekbaev

Let $\mathcal{F}$ be an antichain of finite subsets of $\mathbb{N}$. How quickly can the quantities $|\mathcal{F}\cap 2^{[n]}|$ grow as $n\to\infty$? We show that for any sequence $(f_n)_{n\ge n_0}$ of positive integers satisfying…

Combinatorics · Mathematics 2022-06-14 Paul Balister , Emil Powierski , Alex Scott , Jane Tan

A cap set in projective or affine geometry over a finite field is a set of points no three of which are collinear. In this paper, we propose a new construction for complete cap sets that yields a cap set of size 124928 in the affine…

Combinatorics · Mathematics 2026-01-26 Iskandar Karapetyana , Karen Karapetyana

Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…

Number Theory · Mathematics 2015-06-16 Kevin O'Bryant

The classical Three Gap Theorem asserts that for a natural number n and a real number p, there are at most three distinct distances between consecutive elements in the subset of [0,1) consisting of the reductions modulo 1 of the first n…

Differential Geometry · Mathematics 2008-03-11 Ian Biringer , Benjamin Schmidt

We consider $k$-graphs on $n$ vertices, that is, $\mathcal{F}\subset \binom{[n]}{k}$. A $k$-graph $\mathcal{F}$ is called intersecting if $F\cap F'\neq \emptyset$ for all $F,F'\in \mathcal{F}$. In the present paper we prove that for $k\geq…

Combinatorics · Mathematics 2024-12-11 Peter Frankl , Jian Wang

A family of sets F is said to be union-closed if A \cup B is in F for every A and B in F. Frankl's conjecture states that given any finite union-closed family of sets, not all empty, there exists an element contained in at least half of the…

Combinatorics · Mathematics 2007-05-23 Robert Morris

Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…

Number Theory · Mathematics 2013-04-25 Javier Cilleruelo

Let $B(2d-1, d)$ be the subgraph of the hypercube $\mathcal{Q}_{2d-1}$ induced by its two largest layers. Duffus, Frankl and R\"odl proposed the problem of finding the asymptotics for the logarithm of the number of maximal independent sets…

Combinatorics · Mathematics 2025-05-02 József Balogh , Ce Chen , Ramon I. Garcia

In the area of forbidden subposet problems we look for the largest possible size $La(n,P)$ of a family $\mathcal{F}\subseteq 2^{[n]}$ that does not contain a forbidden inclusion pattern described by $P$. The main conjecture of the area…

Combinatorics · Mathematics 2020-07-15 Dániel Gerbner , Dániel Nagy , Balázs Patkós , Máté Vizer

A digraph is $3$-dicritical if it cannot be vertex-partitioned into two sets inducing acyclic digraphs, but each of its proper subdigraphs can. We give a human-readable proof that the number of 3-dicritical semi-complete digraphs is finite.…

Combinatorics · Mathematics 2024-02-22 Frédéric Havet , Florian Hörsch , Lucas Picasarri-Arrieta

A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…

Combinatorics · Mathematics 2024-06-07 Norbert Hegyvári , Máté Pálfy , Erfei Yue

This paper investigates several distinct attempts to generalize in higher dimension the standard 2-dimensional phyllotaxy set construction. We first recall known contructions for these sets on $2D$ manifolds of constant curvature (the…

Other Condensed Matter · Physics 2025-11-20 Rémy Mosseri , Jean-François Sadoc

The correspondence between perfect difference sets and transitive projective planes is well-known. We observe that all known dense (i.e., close to square-root size) Sidon subsets of abelian groups come from projective planes through a…

Combinatorics · Mathematics 2023-04-19 Sean Eberhard , Freddie Manners

For an integer $d \geq 2$, a family $\mathcal{F}$ of sets is $\textit{$d$-wise intersecting}$ if for any distinct sets $A_1,A_2,\dots,A_d \in \mathcal{F}$, $A_1 \cap A_2 \cap \dots \cap A_d \neq \emptyset$, and $\textit{non-trivial}$ if…

Combinatorics · Mathematics 2019-11-05 Jason O'Neill , Jacques Verstraete

Consider a family $\mathcal{F}$ of $k$-subsets of an ambient $(k^2-k+1)$-set such that no pair of $k$-subsets in $\mathcal{F}$ intersects in exactly one element. In this short note we show that the maximal size of such $\mathcal{F}$ is…

Combinatorics · Mathematics 2024-08-02 Danila Cherkashin

A finite set $S \subset \mathbb{Z}$ is a Sidon set if its pairwise differences are distinct. Recall that a perfect difference set (PDS) of order $n$ is a set $B \subset \mathbb{Z}_v$ ($v = n^2 - n + 1$) of size $n$ such that every nonzero…

Combinatorics · Mathematics 2026-05-15 Tong Niu