Related papers: Arithmetic Terms for Multinomial Coefficient Sums

We give an exact coefficients formula of any infinite product of power series with constant term equal to $1$, by using structures from partitions of integers and permutation groups. This is an universal theorem for various of Binomial-type…

The trinomial transform of a sequence is a generalization of the well-known binomial transform, replacing binomial coefficients with trinomial coefficients. We examine Pascal-like triangles under trinomial transform, focusing on the ternary…

In this paper, we introduce relations between binomial sums involving (generalized) Fibonacci and Lucas numbers, and different kinds of binomial coefficients. We also present some relations between sums with two and three binomial…

Using elementary methods, we establish old and new relations between binomial coefficients, Fibonacci numbers, Lucas numbers, and more.

We consider Problem 6.94 posed in the book Concrete Mathematics by Graham, Knuth, and Patashnik, and solve it by using bivariate exponential generating functions. The family of recurrence relations considered in the problem contains many…

We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…

We compute an analogue of Pascal's triangle enriched in bilinear forms over a finite field. This gives an arithmetically meaningful count of the ways to choose $j$ ring homomorphisms into an algebraic closure from an \'etale extension of…

In this technical report, certain interesting classification of arithmetical functions is proposed. The notion of additively decomposable and multiplicatively decomposable arithmetical functions is proposed. The concepts of arithmetical…

We consider the problem of representation of a bivariate function by sums of ridge functions. We show that if a function of a certain smoothness class is represented by a sum of finitely many, arbitrarily behaved ridge functions, then it…

The classical multidimensional resultant can be defined as the, suitably normalized, generator of a projective elimination ideal in the ring of universal coefficients. This is the approach via the so-called inertia forms or…

We give a bijective parameter representation for a sum of squares of numbers being equal to another sum of squares of numbers.

In this paper, we present several new congruences on the $q$-trinomial coefficients introduced by Andrews and Baxter. A new congruence on sums of central $q$-binomial coefficients is also established.

A survey is given on mathematical structures which emerge in multi-loop Feynman diagrams. These are multiply nested sums, and, associated to them by an inverse Mellin transform, specific iterated integrals. Both classes lead to sets of…

Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via…

The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…

In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…

The problem of developing an arithmetic for continued fractions (in order to perform, e.g., sums and products) does not have a straightforward solution and has been addressed by several authors. In 1972, Gosper provided an algorithm to…

In this paper we initiate the study of products and sums divisible by central binomial coefficients. We show that 2(2n+1)binom(2n,n)| binom(6n,3n)binom(3n,n) for every n=1,2,3,... Also, for any nonnegative integers $k$ and $n$ we have…

We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…