Related papers: Upper Bounds on Integer Complexity

Let $\chi$ be a Dirichlet character modulo a prime~$p$. We give explicit upper bounds on $q_1<q_2<\dots<q_n$, the $n$ smallest prime nonresidues of $\chi$. More precisely, given $n_0$ and $p_0$ there exists an absolute constant…

Let $\alpha(n)$ be the least number $k$ for which there exists a simple graph with $k$ vertices having precisely $n \geq 3$ spanning trees. Similarly, define $\beta(n)$ as the least number $k$ for which there exists a simple graph with $k$…

We study the syntactic complexity of finite/cofinite, definite and reverse definite languages. The syntactic complexity of a class of languages is defined as the maximal size of syntactic semigroups of languages from the class, taken as a…

Given a database, a common problem is to find the pairs or $k$-tuples of items that frequently co-occur. One specific problem is to create a small space "sketch" of the data that records which $k$-tuples appear in more than an $\epsilon$…

Linear upper bounds may be derived by imposing specific structural conditions on a generating set, such as additional constraints on ranks, eigenvalues, or the degree of the minimal polynomial of the generating matrices. This paper…

We prove that if $\alpha$ is a non-zero algebraic number of degree $d \geq 2$ which is not a root of unity, then $dh(\alpha)>(1/4) (\log(\log (d))/\log(d))^3.

Essential covers were introduced by Linial and Radhakrishnan as a model that captures two complementary properties: (1) all variables must be included and (2) no element is redundant. In their seminal paper, they proved that every essential…

Let $\Gamma$ denote the modular group $SL(2,\Bbb Z)$ and $C_n(\Gamma)$ the number of congruence subgroups of $\Gamma$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log C_n(\Gamma)}{(\log n)^2/\log\log n} =…

Professor Georges Rhin considers a nonzero algebraic integer $\a$ with conjugates $\a_1=\a, \ldots, \a_d$ and asks what can be said about $\d \sum_{ | \a_i | >1} | \a_i |$, that we denote ${\rm{R}}(\a)$. If $\a$ is supposed to be a totally…

Let $Z(N)$ denote the minimum number of zeros in $[0,2\pi]$ that a cosine polynomial of the form $$f_A(t)=\sum_{n\in A}\cos nt$$ can have when $A$ is a finite set of non-negative integers of size $|A|=N$. It is an old problem of Littlewood…

Let $Q(n)$ denote the number of integers $1 \leq q \leq n$ whose prime factorization $q= \prod^{t}_{i=1}p^{a_i}_i$ satisfies $a_1\geq a_2\geq \ldots \geq a_t$. Hardy and Ramanujan proved that $$ \log Q(n) \sim \frac{2\pi}{\sqrt{3}}…

A square is a word of the form $xx$ for a non-empty word $x$. Brlek and Li [Comb. Theory, 2025] proved that the number of distinct squares in a word $w$ of length $n$ is at most $n - \sigma$, where $\sigma$ is the number of letters used in…

We consider the top tree compression scheme introduced by Bille et al. [ICALP 2013] and construct an infinite family of trees on $n$ nodes labeled from an alphabet of size $\sigma$, for which the size of the top DAG is…

We provide a new upper bound for sampling numbers $(g_n)_{n\in \mathbb{N}}$ associated to the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. There are universal constants…

We show that if $A\subset \{1,\ldots,N\}$ has no solutions to $a-b=n^2$ with $a,b\in A$ and $n\geq 1$ then \[|A|\ll \frac{N}{(\log N)^{c\log\log \log N}}\] for some absolute constant $c>0$. This improves upon a result of…

Given a graph $G$, an {\em obstacle representation} of $G$ is a set of points in the plane representing the vertices of $G$, together with a set of connected obstacles such that two vertices of $G$ are joined by an edge if and only if the…

For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining…

Let S = <s_1, s_2, s_3, ..., s_n> be a given vector of n real numbers. The rank of a real z with respect to S is defined as the number of elements s_i in S such that s_i is less than or equal to z. We consider the following decision…

We give an upper bound of $n((n-1)!-(n-3)!)$ for the possible largest size of a subsemigroup of the full transformational semigroup over $n$ elements consisting only of nonpermutational transformations. As an application we gain the same…

Let $\{p_n\}_{n\ge 1}$ be the sequence of primes and $\vartheta(x) = \sum_{p \leq x} \log p$, where $p$ runs over the primes not exceeding $x$, be the Chebyshev $\vartheta$-function. In this note we derive lower and upper bounds for…