Related papers: The Chung-Graham Expansion

We prove a functional extension of an exponential inequality originally proposed by Bin Zhao and proved by Xiaosheng Mou. The main result asserts that if $\alpha_1\leq \cdots\leq \alpha_n$ and $\sum_{k=1}^n \alpha_k=0$, then \[ \sum_{k=1}^n…

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

We generalise the expansion formulae of Musiker, Schiffler and Williams, obtained for cluster algebras from orientable surfaces, to a larger class of coefficients which we call principal laminations. In doing so, for any quasi-cluster…

In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…

We propose a recursive algorithm for identifying all finite sequences of positive integers whose product equals their sum. Our method uses solutions of strictly shorter length that are iteratively extended in pursuit of a valid solution.…

We introduce the Pythagorean C*-algebras and use the category/functor method to construct unitary representations of Thompson's groups from representations of them. We calculate several examples.

We introduce a variation of the Ziv-Lempel and Crochemore factorizations of words by requiring each factor to be a palindrome. We compute these factorizations for the Fibonacci word, and more generally, for all $m$-bonacci words.

In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…

Lam, Lee, and Shimozono introduced the double Stanley symmetric functions in their study of the equivariant geometry of the affine Grassmannian. They proved that the associated double Edelman--Greene coefficients, the double Schur expansion…

In this study, a collocation method based on the Fibonacci operational matrix is proposed to solve generalized pantograph equations with linear functional arguments. Some illustrative examples are given to verify the efficiency and…

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

We present a number of results relating partial Cauchy-Littlewood sums, integrals over the compact classical groups, and increasing subsequences of permutations. These include: integral formulae for the distribution of the longest…

We show that every word hyperbolic, surface-by-(noncyclic) free group Gamma is as rigid as possible: the quasi-isometry group of Gamma equals the abstract commensurator group Comm(Gamma), which in turn contains Gamma as a finite index…

This paper is devoted to several existence results for a generalized version of the Yamabe problem. First, we prove the remaining global cases for the range of powers $\gamma\in (0,1)$ for the generalized Yamabe problem introduced by…

Truncated Fourier, Gauss, Kummer and exponential sums can be used to factorize numbers: for a factor these sums equal unity in absolute value, whereas they nearly vanish for any other number. We show how this factorization algorithm can…

For each integer $x$, the $x$-th generalized pentagonal number is denoted by $P_5(x)=(3x^2-x)/2$. Given odd positive integers $a,b,c$ and non-negative integers $r,s$, we employ the theory of ternary quadratic forms to determine when the sum…

In $1963$ Graham proved that every positive integer $n \ge 78$ can be written as a sum of distinct positive integers $a_1, a_2, \ldots, a_r$ for which $\frac{1}{a_1} + \frac{1}{a_2} + \ldots + \frac{1}{a_r}$ is equal to $1$. In the same…

We extend Fibonacci numbers with arbitrary weights and generalize a dozen Fibonacci identities. As a special case, we propose an elliptic extension which extends the $q$-Fibonacci polynomials appearing in Schur's work. The proofs of most of…

We prove that every sufficiently large odd integer can be expressed as a sum of one square and fourteen fifth powers, all of primes. In addition, we establish that every sufficiently large even integer can be written as a sum of one square,…

Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is…