Related papers: General Recurrence Multidimensional Zeckendorf Rep…

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…

In this work, we generalize a recursive enumerative formula for connected Feynman diagrams with two external legs. The Feynman diagrams are defined from a fermionic gas with a two-body interaction. The generalized recurrence is valid for…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by the recurrence $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several generalizations of this sequence and also several interesting identities. In this…

A classical theorem of Wonenburger, Djokovic, Hoffmann and Paige states that an element of the general linear group of a finite-dimensional vector space is the product of two involutions if and only if it is similar to its inverse. We give…

This paper focuses on the problem of reconstructing a vector of rational functions given some evaluations, or more generally given their remainders modulo different polynomials. The special case of rational functions sharing the same…

The Wigner-Eckart theorem is a well known result for tensor operators of SU(2) and, more generally, any compact Lie group. This paper generalises it to arbitrary Lie groups, possibly non-compact. The result relies on knowledge of recoupling…

The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…

General coherence theorems are constructed that yield explicit presentations of categorical and algebraic objects. The categorical structures involved are finitary discrete Lawvere 2-theories, though they are approached within the language…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

In several applications, such as \tsc{weno} interpolation and reconstruction [Shu C.W.: SIAM Rev. 51 (2009) 82--126], we are interested in the analytical expression of the weight-functions which allow the representation of the approximating…

Given lacunary sequence of integers, $n_k$, $n_{k+1}/n_k>\lambda>1$, we define a new sequence $\{m_k\}$ formed by all possible $l$-wise sums $\pm n_{k_1}\pm n_{k_2}\pm \ldots\pm n_{k_l}$. We prove if $\lambda>\lambda_l$, then any series…

We survey and prove properties a family of recurrences bears in relation to integer representations, compositions, the Pascal triangle, sums of digits, Nim games and Beatty sequences.

We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these…

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

Recently, Capparelli, Meurman, A. Primc and M. Primc introduced a class of colored partitions which has since been called CMPP partitions. This generalized earlier work by M. Primc and \v{S}iki\'{c}, and by Trup\v{c}evi\'{c}. One main…

We propose a generalisation of the Jacquet-Langlands correspondence to the whole Grothendieck group of finite lenght admissible representations. As an application we prove some particular cases of the global Jacquet-Langlands…

A complete classification of continuous, dually epi-translation invariant, and rotation equivariant valuations on convex functions is established. This characterizes the recently introduced functional Minkowski vectors, which naturally…

Heckman and Opdam introduced a non-symmetric analogue of Jack polynomials using Cherednik operators. In this paper, we derive a simple recursion formula for these polynomials and formulas relating the symmetric Jack polynomials with the…

We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…

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…