English
Related papers

Related papers: Size-4 Counterexamples to the Sidon-Extension Conj…

200 papers

We give a simple example of an $n$-tuple of orthonormal elements in $L_2$ (actually martingale differences) bounded by a fixed constant, and hence subgaussian with a fixed constant but that are Sidon only with constant $\approx \sqrt n$.…

Functional Analysis · Mathematics 2023-04-05 Gilles Pisier

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…

Optimization and Control · Mathematics 2022-12-27 Christian Bingane

Let $\mathcal{P}(n)$ denote the power set of $[n]$, ordered by inclusion, and let $\mathcal{P}(n,p)$ be obtained from $\mathcal{P}(n)$ by selecting elements from $\mathcal{P}(n)$ independently at random with probability $p$. A classical…

Combinatorics · Mathematics 2014-10-06 József Balogh , Richard Mycroft , Andrew Treglown

This paper is a complement to our previous paper [21]. It surveys the works on the Furstenberg set $S=\{2^{m}3^{n}: n\ge 0, m\ge 0\}$ and its random version $T$. We also present some new results. For example, it is proved that $T$ almost…

Functional Analysis · Mathematics 2023-03-14 Aihua Fan , Hervé Queffélec , Martine Quffélec

Let $k \ge 2$ be an integer. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called…

Number Theory · Mathematics 2021-03-19 Sándor Z. Kiss , Csaba Sándor

Let $C$ be the attractor of the IFS $\{f_{d}(z) = (-n+i)^{-1}(z+d): d\in D\}$, $D\subset\{0, 1, \ldots, n^{2}\}$ and let $\dim$ denote the box-counting dimension. It is known that for all $\lambda\in[0, 1]$, that the set of complex numbers…

Dynamical Systems · Mathematics 2025-01-10 Neil MacVicar

The convexity number of a set $X \subset \mathbb{R}^2$ is the minimum number of convex subsets required to cover it. We study the following question: what is the largest possible convexity number $f(n)$ of $\mathbb{R}^2 \setminus S$, where…

Combinatorics · Mathematics 2026-01-05 Chaya Keller , Micha A. Perles

Itsykson and Sokolov [IS14] identified resolution over parities, denoted by $\text{Res}(\oplus)$, as a natural and simple fragment of $\text{AC}^0[2]$-Frege for which no super-polynomial lower bounds on size of proofs are known. Building on…

Computational Complexity · Computer Science 2025-12-09 Sreejata Kishor Bhattacharya , Arkadev Chattopadhyay

We show that for any sequence $f: {\bf N} \to \{-1,+1\}$ taking values in $\{-1,+1\}$, the discrepancy $$ \sup_{n,d \in {\bf N}} \left|\sum_{j=1}^n f(jd)\right| $$ of $f$ is infinite. This answers a question of Erd\H{o}s. In fact the…

Combinatorics · Mathematics 2017-01-17 Terence Tao

We prove that the number of quartic $S_4$--extensions of the rationals of given discriminant $d$ is $O_\eps(d^{1/2+\eps})$ for all $\eps>0$. For a prime number $p$ we derive that the dimension of the space of octahedral modular forms of…

Number Theory · Mathematics 2007-05-23 Juergen Klueners

We investigate the length $\ell(n,k)$ of a shortest preset distinguishing sequence (PDS) in the worst case for a $k$-element subset of an $n$-state Mealy automaton. It was mentioned by Sokolovskii that this problem is closely related to the…

Formal Languages and Automata Theory · Computer Science 2014-12-02 Pavel Panteleev

Let us fix a prime $p$. The Erd\H{o}s-Ginzburg-Ziv problem asks for the minimum integer $s$ such that any collection of $s$ points in the lattice $\mathbb{Z}^n$ contains $p$ points whose centroid is also a lattice point in $\mathbb{Z}^n$.…

Combinatorics · Mathematics 2020-06-30 Lisa Sauermann

The Small Set Expansion Hypothesis (SSEH) is a conjecture which roughly states that it is NP-hard to distinguish between a graph with a small subset of vertices whose edge expansion is almost zero and one in which all small subsets of…

Computational Complexity · Computer Science 2017-05-11 Pasin Manurangsi

For a set of permutations (patterns) $\Pi$ in $S_k$, consider the set of all permutations in $S_n$ that avoid all patterns in $\Pi$. An important problem in current algebraic combinatorics is to find pattern sets $\Pi$ such that the…

Combinatorics · Mathematics 2022-10-24 Avichai Marmor

In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erd\H{o}s. The proof features two different decompositions of…

Combinatorics · Mathematics 2019-06-14 Joel Moreira , Florian Karl Richter , Donald Robertson

Given a collection $\mathcal{A}$ of subsets of an $n$ element set, let $\text{op}(\mathcal{A})$ denote the number of distinct pairs $A,B \in \mathcal{A}$ for which $|A \cap B|$ is odd. For $s \in \{1,2\}$, we prove $\text{op}(\mathcal{A})…

Combinatorics · Mathematics 2022-11-03 Jason O'Neill

We prove that the tail of the sets $$\mathbf S_x := \big\{\left\lfloor x^n\right\rfloor : n\in \mathbb N\big\}$$ are Sidon for almost all $x\in (1,2)$. Then we prove that for all $\varepsilon>0$, there exists $x\in (1,\, 1+\varepsilon)$ and…

Number Theory · Mathematics 2026-02-13 Sayan Dutta

In a projective plane $\Pi_{q}$ (not necessarily Desarguesian) of order $q$, a point subset $\mathcal{S}$ is saturating (or dense) if any point of $\Pi_{q}\setminus \mathcal{S}$ is collinear with two points in $\mathcal{S}$. Modifying an…

Generalising results of Erd\H{o}s-Freud and Lindstr\"om, we prove that the largest Sidon subset of a bounded interval of integers is equidistributed in Bohr neighbourhoods. We establish this by showing that extremal Sidon sets are…

Combinatorics · Mathematics 2021-10-27 Miquel Ortega , Sean Prendiville

Let $\Psi :[1,\infty )\rightarrow \mathbb{R}_{+}$ be a non-decreasing function, $a_{n}(x)$ the $n$'{th} partial quotient of $x$ and $q_{n}(x)$ the denominator of the $n$'{th} convergent. The set of $\Psi $-Dirichlet non-improvable numbers…

Number Theory · Mathematics 2019-05-20 Ayreena Bakhtawar , Philip Bos , Mumtaz Hussain
‹ Prev 1 4 5 6 7 8 10 Next ›