Related papers: Correct order on some certain weighted representat…

We study the distribution of the order of a random permutation of $[n]$ through the lens of R\'enyi entropy. In particular, we obtain an asymptotic for the R\'enyi $q$-entropy of the order in the full range $1 \leq q \leq \infty$. For $q >…

The growth rate function $r_N$ counts the number of irreducible representations of simple complex Lie groups of dimension $N$. While no explicit formula is known for this function, previous works have found bounds for $R_N=\sum_{i=1}^Nr_i$.…

We study the non-existence, existence and multiplicity of positive solutions to the following nonlinear Kirchhoff equation:% \begin{equation*} \left\{ \begin{array}{l} -M\left( \int_{\mathbb{R}^{3}}\left\vert \nabla u\right\vert…

Let $\mathcal{B} = (B_1,\ldots, B_h)$ be an $h$-tuple of sets of positive integers. Let $g_{\mathcal{B} }(n)$ count the number of representations of $n$ in the form $n = b_1\cdots b_h$, where $b_i \in B_i$ for all $i \in \{1,\ldots, h\}$.…

Let $\mathbb{N}$ be the set of all nonnegative integers. For any integer $r$ and $m$, let $r+m\mathbb{N}=\{r+mk: k\in\mathbb{N}\}$. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_{S}(n)$ denote the number of solutions of the…

It is proved that all sufficiently large integers $n$ can be represented as $$n=x_1^2+x_2^3+\cdots+x_{13}^{14},$$ where $x_1,\ldots,x_{13}$ are positive integers. This improves upon the current record with $14$ variables in place of $13$.

We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\mathcal{O}_{\epsilon}(n^{3/5+\epsilon})$ solutions of…

Let $a_1,a_2,\dots,a_k$ be positive integers with $\gcd(a_1,a_2,\dots,a_k)=1$. Frobenius number is the largest positive integer that is NOT representable in terms of $a_1,a_2,\dots,a_k$. When $k\ge 3$, there is no explicit formula in…

Given a strictly increasing sequence of positive real numbers tending to infinity $(q_{n})_{n=1}^{\infty}$, and an arbitrary sequence of real numbers $(r_{n})_{n=1}^{\infty}.$ We study the set of $\alpha\in(1,\infty)$ for which…

In this paper, I give sufficient conditions for any linear combination in $\mathbb{Q}$ of numbers $\sum_{n=1}^{\infty}\frac{b_{1,n}}{\alpha_{1,n}}$, $\ldots$, $\sum_{n=1}^{\infty}\frac{b_{K,n}}{\alpha_{K,n}}$ to have algebraic degree…

Let $\chi$ be a non-principal Dirichlet character of modulus $q$ with associated \textit{L}-function $L(s,\chi)$. We prove that $$|L(1,\chi)|\le\left(\frac{1}{2}+O\Big(\frac{\log\log q}{\log q}\Big)\right)\frac{\varphi(q)}{q}\log q\,,$$…

Let q be an odd positive integer and P \in F2[z] be of order q and such that P(0) = 1. We denote by A = A(P) the unique set of positive integers satisfying \sum_{n=0}^\infty p(A, n) z^n \equiv P(z) (mod 2), where p(A,n) is the number of…

Let $n(k_1, k_2)$ be the least integer $n$ such that there exists a graph on $n$ vertices in which every vertex is contained in both a clique of size $k_1$ and an independent set of size $k_2$. Recently, Feige and Pauzner showed that ${n(k,…

We study the weighted $k$-Set Packing problem: Given a collection $S$ of sets, each of cardinality at most $k$, together with a positive weight function $w:\mathcal{S}\rightarrow\mathbb{Q}_{>0}$, the task is to compute a disjoint…

We answer several questions of P. Erdos and R. Graham by showing that for any rational number r > 0, there exist integers n1, n2, ..., nk, k variable, where N < n1 < n2 < ... < nk < (e^r + o_r(1) ) N, such that r = 1/n1 + 1/n2 + ... + 1/nk.…

Given $r \in \mathbb{N}$, define the function $S_{r}: \mathbb{N} \rightarrow \mathbb{Q}$ by $S_{r}(n)=\displaystyle \sum_{k=0}^{n} \frac{k}{k+r} \binom{n}{k}$. In $2015$, the second author conjectured that there are infinitely many $r \in…

The aim of this short note is that if $\{ a_{n}\}$ and $\{ b_{n}\}$ are two sequences of positive real numbers such that $a_{n}\to +\infty$ and $b_n$ satisfying the asymptotic formula $b_n\sim k\cdot a_{n}$, where $k>0$, then…

For $S$ a set of positive integers, and $k$ and $r$ fixed positive integers, denote by $f(S,k;r)$ the least positive integer $n$ (if it exists) such that within every $r$-coloring of $\{1,2,...,n\}$ there must be a monochromatic sequence…

In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…

For positive integers $m$ and $n$, define $f(m,n)$ to be the smallest integer such that any subset $A$ of the $m \times n$ integer grid with $|A| \geq f(m,n)$ contains a rectangle; that is, there are $x\in [m]$ and $y \in [n]$ and…