English
Related papers

Related papers: An improved lower bound for finite additive 2-base…

200 papers

Let $n$ be a positive integer and $f(x)$ be a polynomial with nonnegative integer coefficients. We prove that ${\rm lcm}_{\lceil n/2\rceil \le i\le n} \{f(i)\}\ge 2^n$ except that $f(x)=x$ and $n=1, 2, 3, 4, 6$ and that $f(x)=x^s$ with…

Number Theory · Mathematics 2013-11-25 Shaofang Hong , Yuanyuan Luo , Guoyou Qian , Chunlin Wang

Let $q\in(1,2)$ and $x\in[0,\frac1{q-1}]$. We say that a sequence $(\varepsilon_i)_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is an expansion of $x$ in base $q$ (or a $q$-expansion) if \[ x=\sum_{i=1}^{\infty}\varepsilon_iq^{-i}. \] For any…

Number Theory · Mathematics 2014-10-27 Simon Baker , Nikita Sidorov

We obtain positive lower bounds on the Hausdorff dimension of sets of real numbers given by expressions of the form $\sum_{n=1}^\infty \frac{1}{a_n b_n}$, where $b_n$ satisfies some growth condition and $a_n$ lies in some set, possibly…

Number Theory · Mathematics 2026-05-27 Maiken Gravgaard , Simon Kristensen , Jaroslav Hančl

We adapt the construction of subsets of {1, 2, ..., N} that contain no k-term arithmetic progressions to give a relatively thick subset of an arbitrary set of N integers. Particular examples include a thick subset of {1, 4, 9, ..., N^2}…

Number Theory · Mathematics 2010-06-25 Kevin O'Bryant

For a set $A$ of nonnegative integers, let $R_2(A,n)$ denote the number of solutions to $n=a+a'$ with $a,a'\in A$, $a<a'$. Let $A_0$ be the Thue-Morse sequence and $B_0=\mathbb{N}\setminus A_0$. Let $A\subset \mathbb{N}$ and $N$ be a…

Number Theory · Mathematics 2019-11-06 Xing-Wang Jiang , Csaba Sandor , Quan-Hui Yang

It is well-known that for any distinct positive integers $k$ and $n$, the numbers $2^{2^k}+1$ and $2^{2^n}+1$ are relatively prime. In this paper we consider the situation when 1 is replaced by some positive integer $d>1$

Number Theory · Mathematics 2016-01-26 Tigran Hakobyan

We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on…

Combinatorics · Mathematics 2014-08-01 M. Aaghabali , S. Akbari , S. Friedland , K. Markstrom , Z. Tajfirouz

In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two combinatorial sharp lower bounds for ${\rm conid}({\rm B}_0(G))+1$ and ${\rm conid}({\rm B}(G))+2$, two famous topological lower bounds…

Combinatorics · Mathematics 2016-08-01 Meysam Alishahi , Hossein Hajiabolhassan

Secure codes are widely-studied combinatorial structures which were introduced for traitor tracing in broadcast encryption. To determine the maximum size of such structures is the main research objective. In this paper, we investigate the…

Information Theory · Computer Science 2021-08-24 Bingchen Qian , Xin Wang , Gennian Ge

Two orthonormal bases B and B' of a d-dimensional complex inner-product space are called mutually unbiased if and only if |<b|b'>|^2=1/d holds for all b in B and b' in B'. The size of any set containing (pairwise) mutually unbiased bases of…

Quantum Physics · Physics 2023-11-27 Andreas Klappenecker , Martin Roetteler

We tabulate bounds on the optimal number of mutually unbiased bases in R^d. For most dimensions d, it can be shown with relatively simple methods that either there are no real orthonormal bases that are mutually unbiased or the optimal…

Quantum Physics · Physics 2007-05-23 P. Oscar Boykin , Meera Sitharam , Mohamad Tarifi , Pawel Wocjan

In a quantum system having a finite number $N$ of orthogonal states, two orthonormal bases $\{a_i\}$ and $\{b_j\}$ are called mutually unbiased if all inner products $<a_i|b_j>$ have the same modulus $1/\sqrt{N}$. This concept appears in…

Quantum Physics · Physics 2007-05-23 Claude archer

We show that a set $A \subset \{0,1\}^{n}$ with edge-boundary of size at most $|A| (\log_{2}(2^{n}/|A|) + \epsilon)$ can be made into a subcube by at most $(2 \epsilon/\log_{2}(1/\epsilon))|A|$ additions and deletions, provided $\epsilon$…

Combinatorics · Mathematics 2013-11-28 David Ellis

Let $\mathcal{A}=\{a_{n}\}_{n=1}^{\infty}$ and $\mathcal{B}=\{b_{n}\}_{n=1}^{\infty}$ be two sequences of positive integers (not necessarily distinct). Under some restrictions on $\mathcal{A}$ and $\mathcal{B}$, we obtain a lower bound for…

Number Theory · Mathematics 2026-01-22 Artyom Radomskii

We find the lexicographically least infinite binary rich word having critical exponent $2+\sqrt{2}/2$

Formal Languages and Automata Theory · Computer Science 2023-10-12 James Currie , Narad Rampersad

Let $s_a(n)$ denote the sum of digits of an integer $n$ in the base $a$ expansion. Answering, in a extended form, a question of Deshouillers, Habsieger, Laishram, and Landreau, we show that, provided $a$ and $b$ are multiplicatively…

Number Theory · Mathematics 2018-12-19 Régis de la Bretèche , Thomas Stoll , Gérald Tenenbaum

The set $A$ is an asymptotic nonbasis of order $h$ for an additive abelian group $X$ if there are infinitely many elements of $X$ not in the $h$-fold sumset $hA$. For all $h \geq 2$, this paper constructs new classes of asymptotic nonbases…

Number Theory · Mathematics 2020-09-17 Melvyn B. Nathanson

Let $S$ be a finite set, $s=|S|\ge6$. Given a non-negative integer $t$, there exists an inclusion-minimal non-Bondy system $\mathscr{A}$ of size $t$ on $S$ if and only if $s+1\le t\le2s$.

Combinatorics · Mathematics 2026-03-02 T. J. Kepka , P. C. Nemec , J. D. Phillips

We describe a method for bounding the set of exceptional integers not represented by a given additive form in terms of the exceptional set corresponding to a subform. Illustrating our ideas with examples stemming from Waring's problem for…

Number Theory · Mathematics 2015-06-08 Koichi Kawada , Trevor D. Wooley

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

Computational Geometry · Computer Science 2023-12-05 Friedrich Eisenbrand , Matthieu Haeberle , Neta Singer
‹ Prev 1 8 9 10 Next ›