相关论文: Bounds for the counting function of the Jordan-P\'…

A commutative loop is Jordan if it satisfies the identity $x^2 (y x) = (x^2 y) x$. Using an amalgam construction and its generalizations, we prove that a nonassociative Jordan loop of order $n$ exists if and only if $n\geq 6$ and $n\neq 9$.…

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…

For any integer $N \geq 1$, let $\mathfrak{E}_N$ be the set of all Egyptian fractions employing denominators less than or equal to $N$. We give upper and lower bounds for the cardinality of $\mathfrak{E}_N$, proving that $$ \frac{N}{\log N}…

An Egyptian fraction is a sum of the form $1/n_1 + \cdots + 1/n_r$ where $n_1, \dots, n_k$ are distinct positive integers. We prove explicit lower bounds for the cardinality of the set $E_N$ of rational numbers that can be represented by…

Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.

For an arbitrary representation $\rho$ of a complex finite-dimensional Lie algebra, we construct a collection of numbers that we call the Jordan-Kronecker invariants of $\rho$. Among other interesting properties, these numbers provide lower…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

Let $\tau(n)$ stand for the number of divisors of the positive integer $n$. We obtain upper bounds for $\tau(n)$ in terms of $\log n$ and the number of distinct prime factors of $n$.

Following de Loera and Santos, the P\'olya exponent of a $n$-ary real form (i.e. a homogeneous polynomial in $n$ variables with real coefficients) $f$ is the infimum of the upward closed set of nonnegative integers $m$ such that $(x_1 +…

A Jordan loop is a commutative loop satisfying the Jordan identity $(x^2 y) x = x^2 (y x)$. We establish several identities involving powers in Jordan loops and show that there is no nonassociative Jordan loop of order $9$.

Conceptually, a rough number is a positive integer with no small prime factors. Formally, for real numbers $x$ and $y$, let $\Phi(x,y)$ denote the number of positive integers at most $x$ with no prime factors less than $y$. In this paper we…

We present lower bounds on the sum and product of the distinct prime factors of an odd perfect number, which provide a lower bound on the size of the odd perfect number as a function of the number of its distinct prime factors.

Let $P$ be a polynomial with integer coefficients and degree at least two. We prove an upper bound on the number of integer solutions $n\leq N$ to $n! = P(x)$ which yields a power saving over the trivial bound. In particular, this applies…

We obtain general upper bounds of the sizes and the numbers of Jordan blocks for the eigenvalues $\lambda \not= 1$ in the monodromies at infinity of polynomial maps.

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

We show that while the number of coprime compositions of a positive integer $n$ into $k$ parts can be expressed as a $\mathbb{Q}$-linear combinations of the Jordan totient functions, this is never possible for the coprime partitions of $n$…

A {+,x}-circuit counts a given multivariate polynomial f, if its values on 0-1 inputs are the same as those of f; on other inputs the circuit may output arbitrary values. Such a circuit counts the number of monomials of f evaluated to 1 by…

Let $M_n(R)$ be the algebra of all $n\times n$ matrices over a unital commutative ring $R$ with 6 invertible. We say that $A\in M_n(R)$ is a Jordan product determined point if for every $R$-module $X$ and every symmetric $R$-bilinear map…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

An explicit upper bound is derived for the modulus of divided difference for a smooth(not necessarily analytic) function defined on a smooth Jordan arc (or a smooth Jordan curve) in the complex plane. As an immediate application, an error…