Related papers: A note on linear forms in two logarithms: the argu…

In the article, a notion "logarithmically absolutely monotonic function" is introduced, an inclusion that a logarithmically absolutely monotonic function is also absolutely monotonic is revealed, the logarithmically complete monotonicity…

Let R be the ring of S-integers of an algebraic function field (in one variable) over a perfect field, where S is finite and not empty. It is shown that for every positive integer N there exist elements of R that can not be written as a sum…

The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.

The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height…

The goal of this note is to spell out the (apparently well-known and intuitively clear) notion of abelian category over an algebraic stack. In the future we will discuss the (much less evident) notion, when instead of an abelian category…

We present a linearity theorem for a proof language of intuitionistic multiplicative additive linear logic, incorporating addition and scalar multiplication. The proofs in this language are linear in the algebraic sense. This work is part…

We show that the number of integer solutions for a pair of bilinear equations in at least 2*6 variables has (up to logarithms) the expected upper bound unless there is a structural reason why it is not the case.

We prove a quantitative version of a result of Furstenberg and Deligne stating that the the diagonal of a multivariate algebraic power series with coefficients in a field of positive characteristic is algebraic. As a consequence, we obtain…

We prove an upper bound for the length of an arithmetic progression represented by an irreducible integral binary quadratic form or a norm form, which depends only on the form and the progression's common difference. For quadratic forms,…

In this work, a pre-Gr\"{u}ss inequality for positive Hilbert space operators is proved. So that, some numerical radius inequalities are proved. On the other hand, based on a non-commutative Binomial formula, a non-commutative upper bound…

For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n}$ be the $k-$Fibonacci sequence which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for powers of 2 which are…

We describe a numerical algorithm for evaluating the numbers of roots minus the number of poles contained in a region based on the argument principle with the function of interest being written as a Mellin transformation of a usually…

In this note, we present some new results on even almost perfect numbers which are not powers of two. In particular, we show that $2^{r+1} < b$, if ${2^r}{b^2}$ is an even almost perfect number.

Consider a finite-dimensional, complex Lie algebra G and a semi-simple automorphism {\alpha}. This note aims to give a short and simple proof for explicit upper bounds for the derived length of the radical R and the rank of a Levi…

For a nonsingular integer matrix A, we study the growth of the order of A modulo N. We say that a matrix is exceptional if it is diagonalizable, and a power of the matrix has all eigenvalues equal to powers of a single rational integer, or…

Lower bounds are given for the number of non-real zeros of a second order linear differential polynomial with constant coefficients in a real entire function with finitely many non-real zeros.

We generalise and improve some recent bounds for additive energies of modular roots. Our arguments use a variety of techniques, including those from additive combinatorics, algebraic number theory and the geometry of numbers. We give…

We give a mathematical structure on an arithmetic surface, that has algebraic meanings over finite places and can estimate the canonical norm for a relative differential form on the arithmetic surface. This will give a lower bound for the…

In this note we show that unsatisfiable systems of linear equations with a constant number of variables per equation over prime finite fields have polynomial-size constant-degree semi-algebraic proofs of unsatisfiability. These are proofs…

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…