Related papers: $B'$

For a given subset $A\subseteq \mathbb F_q^*$, we study the problem of finding a large packing set $B$ of $A$, that is, a set $B \subseteq \mathbb F_q^*$ such that $|AB|=|A||B|$. We prove the existence of such a $B$ of size $|B|\ge…

This paper deals more generally with @-numbers defined as follows: Call `\textit{alpha number}' of order $(\underline{\alpha},\bar{\alpha})\in\mathbb{H}^2$, (denote its family by @$_{(\underline{\alpha},\bar{\alpha})\in\mathbb{H}^2;…

For $\alpha, \beta, \delta \in [0,1], \alpha +\beta = 1 $ we consider sets $$ {\rm BAD}^* (\alpha, \beta ;\delta) = \left\{\xi = (\xi_1,\xi_2) \in [0,1]^2: ,\inf_{p\in \mathbb{N}} \max \{(p\log(p+1))^\alpha ||p\xi_1||, (p\log (p+1))^\beta…

Let b > 1 be an integer and denote by s_b(m) the sum of the digits of the positive integer m when is written in base b. We prove that s_b(n!) > C_b log n log log log n for each integer n > e, where C_b is a positive constant depending only…

Let $\mathcal{H}$ be a complex Hilbert space, $\mathcal{B(H)}$ be the algebra of all bounded linear operators on $\mathcal{H}$ and $\mathcal{A} \subseteq \mathcal{B(H)}$ be a von Neumann algebra without central summands of type $I_1$. For…

We shall consider a result of Fel'dman, where a sharp Baker-type lower bound is obtained for linear forms in the values of some E-functions. Fel'dman's proof is based on an explicit construction of Pad\'e approximations of the first kind…

We give a variant of Weyl's inequality for systems of forms together with applications. First we use this to give a different formulation of a theorem of B. J. Birch on forms in many variables. More precisely, we show that the dimension of…

Let $\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\Gamma,d)$. Let $\square_n$ denote the folded $n$-cube $H(n,2)$. We give an upper bound on $A(\square_n,d)$…

We study the Lagarias inequality, an elementary criterion equivalent to the Riemann Hypothesis. Using a continuous extension of the harmonic numbers, we show that the sequence $B_n=\frac{H_n+e^{H_n}\log(H_n)}{n}$ is strictly increasing for…

Recent theorems of Dubickas and Mossinghoff use auxiliary polynomials to give lower bounds on the Weil height of an algebraic number $\alpha$ under certain assumptions on $\alpha$. We prove a theorem which introduces an auxiliary polynomial…

Performing $n$ steps of $\beta$-reduction to a given term in the $\lambda$-calculus can lead to an increase in the size of the resulting term that is exponential in $n$. The same is true for the possible depth increase of terms along a…

Let $B$ be a set of natural numbers of size $n$. We prove that the length of the longest arithmetic progression contained in the product set $B.B = \{bb'| \, b, b' \in B\}$ cannot be greater than $O(n \log n)$ which matches the lower bound…

In 1990, Baker and Montgomery conjectured that $L'(s,\chi_d)$ has $\asymp \log\log |d|$ real zeros in the interval $[1/2,1]$ for almost all fundamental discriminants $d$. The study of these zeros was motivated by their connection to real…

We refine a remark of Steinerberger (2024), proving that for $\alpha \in \mathbb{R}$, there exists integers $1 \leq b_{1}, \ldots, b_{k} \leq n$ such that \[ \left\| \sum_{j=1}^k \sqrt{b_j} - \alpha \right\| = O(n^{-\gamma_k}), \] where…

Recently, Ben Green proved that the two-color van der Waerden number $w(3,k)$ is bounded from below by $k^{b_0(k)}$ where $b_0(k) = c_0\left(\frac{\log k }{\log \log k}\right)^{1/3}$. We prove a new lower bound of $k^{b(k)}$ with $b(k) =…

New inequalities for the numerical radius of bounded linear operators defined on a complex Hilbert space $\mathcal{H}$ are given. In particular, it is established that if $T$ is a bounded linear operator on a Hilbert space $\mathcal{H}$…

Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…

Let $\|n\|$ stand for the integer complexity of the number $n$, i.e. for the least number of $1$'s needed to write $n$ using arbitrary many additions, multiplications, and parentheses. The two-sided inequality $3\log_3 n\leq\|n\|\leq…

We give several new lower bounds on size of homogeneous non-commutative circuits. We present an explicit homogeneous bivariate polynomial of degree $d$ which requires homogeneous non-commutative circuit of size $\Omega(d/\log d)$. For an…

Let $A(n,d)$ (respectively $A(n,d,w)$) be the maximum possible number of codewords in a binary code (respectively binary constant-weight $w$ code) of length $n$ and minimum Hamming distance at least $d$. By adding new linear constraints to…