相关论文: Elementary Bounds on Digital Sums of Powers, Facto…

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and…

In this note, we shall give an improved lower bound for the argument of a power of a given algebraic number which has absolute value one but is not a root of unity.

We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds…

We give lower bounds on the communication complexity required to solve several computational problems in a distributed-memory parallel machine, namely standard matrix multiplication, stencil computations, comparison sorting, and the Fast…

A criterion is given for studying (explicit) Baker type lower bounds of linear forms in numbers $1,\Theta_1,...,\Theta_m\in\mathbb{C}^*$ over the ring $\mathbb{Z}_{\mathbb{I}}$ of an imaginary quadratic field $\mathbb{I}$. This work deals…

Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ where $K$ is a field. In this paper, we give some properties of $n$-matrix factorizations of polynomials in $R$. We also derive some results giving some lower bounds on the number of $n$-matrix factors…

We give an elementary proof that the sum of the digits of $2^n$ in base 10 is greater than $\log_4 n$. In particular, the limit of the sum of digits of $2^n$ is infinite.

Taking Shapiro's cyclic sums $\sum_{i=1}^n x_i/(x_{i+1}+x_{i+2})$ (assuming index addition mod $n$) as a starting point, we introduce a broader class of cyclic sums, called generalized Shapiro-Diananda sums, where the denominators are…

We bound the tensor ranks of elementary symmetric polynomials, and we give explicit decompositions into powers of linear forms. The bound is attained when the degree is odd.

We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all i=k+1,...,n, we give an upper bound on the smallest integer m…

Let $q, m\geq 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbb{Z}[x]$ be a polynomial of degree $h\geq 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We…

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

This note shows that the three theorems presented in J. Math. Anal. Appl. 556 (2026), 130199, whose proofs, in their present formulation, are purely formal, follow from elementary calculus.

Given a multiplicative function $f$, we let $S(x,f)=\sum_{n\leq x}f(n)$ be the associated partial sum. In this note, we show that lower bounds on partial sums of divisor-bounded functions result in lower bounds on the partial sums…

Let $B_n(m)$ be a set picked uniformly at random among all $m$-elements subsets of $\{1,2,\ldots,n\}$. We provide a pathwise construction of the collection $(B_n(m))_{1\leq m\leq n}$ and prove that the logarithm of the least common multiple…

We provide new upper bounds for sums of certain arithmetic functions in many variables at polynomial arguments and, exploiting recent progress on the mean-value of the Erd\H os-Hooley $\Delta$-function, we derive lower bounds for the…

Let $\mathbb{I}$ denote an imaginary quadratic field or the field $\mathbb{Q}$ of rational numbers and $\mathbb{Z}_{\mathbb{I}}$ its ring of intergers. We shall prove an explicit Baker type lower bound for $\mathbb{Z}_{\mathbb{I}}$-linear…

In recent years, maximizing G\'al sums regained interest due to a firm link with large values of $L$-functions. In the present paper, we initiate an investigation of small sums of G\'al type, with respect to the $L^1$-norm. We also consider…

This paper studies the limitations of the generic approaches to solving cryptographic problems in classical and quantum settings in various models. - In the classical generic group model (GGM), we find simple alternative proofs for the…

A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.