Related papers: On triangular numbers, forms of mixed type and the…
In this paper, we study the number of representations of a positive integer $n$ by two positive integers whose product is a multiple of a polygonal number.
In this paper, we study universal sums of triangular numbers and squares. Specifically, we prove that a sum of triangular numbers and squares is universal if and only if it represents…
We consider the problem of classifying all positive-definite integer-valued quadratic forms that represent all positive odd integers. Kaplansky considered this problem for ternary forms, giving a list of 23 candidates, and proving that 19…
We introduce the concept of a triangular representation of a Lie algebra, give a counterpart of Ado's theorem, and discuss $2$-irreducible triangular modules over a nonreductive Lie algebra.
We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that there exist infinitely many integers coprime to all digits…
We consider finite iterated generalized harmonic sums weighted by the binomial $\binom{2k}{k}$ in numerators and denominators. A large class of these functions emerges in the calculation of massive Feynman diagrams with local operator…
We find bases for the spaces $M_2\Big(\Gamma_0(24),\Big(\frac{d}{\cdot}\Big)\Big)$ ($d=1,8,12, 24$) of modular forms. We determine the Fourier coefficients of all $35$ theta products $\varphi[a_1,a_2,a_3,a_4](z)$ in these spaces. We then…
We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…
Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…
We use recurrence equations (alias difference equations) to enumerate the number of formula-representations of positive integers using only addition and multiplication, and using addition, multiplication, and exponentiation, where all the…
Many combinatorial and other number triangles are solutions of recurrences of the Graham-Knuth-Patashnik (GKP) type. Such triangles and their defining recurrences are investigated analytically. They are acted on by a transformation group…
We investigate several families of multiple orthogonal polynomials associated with weights for which the moment generating functions are hypergeometric series with slightly varying parameters. The weights are supported on the unit interval,…
In this survey, we first review some known results on the representation theory of algebras with triangular decomposition, including the classification of the simple modules. We then discuss a recipe to construct Hopf algebras with…
In these proceedings we discuss a representation for modular forms that is more suitable for their application to the calculation of Feynman integrals in the context of iterated integrals and the differential equation method. In particular,…
Special arithmetic series $f(x)=\sum_{n=0}^{\infty}c_nx^n$, whose coefficients $c_n$ are normally given as certain binomial sums, satisfy "self-replicating" functional identities. For example, the equation…
Weighted model counting computes the sum of the rational-valued weights associated with the satisfying assignments for a Boolean formula, where the weight of an assignment is given by the product of the weights assigned to the positive and…
For an arbitrary integer $x$, an integer of the form $T(x)=\frac{x^2+x}{2}$ is called a triangular number. For positive integers $\alpha_1,\alpha_2,\dots,\alpha_k$, a sum…
A number $N$ is a triangular number if it can be written as $N = t(t + 1)/2$ for some nonnegative integer number $t$. A triangular number $N$ is called square if it is a perfect square, that is, $N = d^2$ for some integer number $d$. Square…
The tridiagonal representation approach is an algebraic method for solving second order differential wave equations. Using this approach in the solution of quantum mechanical problems, we encounter two new classes of orthogonal polynomials…