Related papers: Recursions associated to trapezoid, symmetric and …

We present a theory for splitting algebras of monic polynomials over rings, and apply the results to symmetric functions, and Galois theory. Our main result is that the ring of invariants of a splitting algebra under the symmetric group…

Let $(0, a_1, \ldots, a_{d-1})_n$ denote the function $f_n(x_0, x_1, \ldots, x_{n-1})$ of degree $d$ in $n$ variables generated by the monomial $x_0x_{a_1} \cdots x_{a_{d-1}}$ and having the property that $f_n$ is invariant under cyclic…

In this paper, we provide some novel binomial convolution related to symmetric functions, as well as convolution sums without the binomial symbol. Moreover we give some new convolution sums of Bernoulli, Euler, and Genocchi numbers and…

The problem of finding a nonzero solution of a linear recurrence $Ly = 0$ with polynomial coefficients where $y$ has the form of a definite hypergeometric sum, related to the Inverse Creative Telescoping Problem of [14][Sec. 8], has now…

It is a classical result from universal algebra that the notions of polymorphisms and invariants provide a Galois connection between suitably closed classes (clones) of finitary operations $f\colon B^n\to B$, and classes (coclones) of…

For cryptographic systems the method of confusion and diffusion is used as a fundamental technique to achieve security. Confusion is reflected in nonlinearity of certain Boolean functions describing the cryptographic transformation. In this…

We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this…

In this paper, we investigate permutation rotation-symmetric (shift-invariant) vectorial Boolean functions on $n$ bits that are liftings from Boolean functions on $k$ bits, for $k\leq n$. These functions generalize the well-known map used…

There is a growing literature on sums of reciprocals of polynomial functions of recurrence relations with constant coefficients and fixed depth, such as Fibonacci and Tribonacci numbers, products of such numbers, and balancing numbers…

In the spirit of the Head-Gordon-Pople algorithm, we report vertical, transfer and horizontal recurrence relations for the efficient and accurate computation of four-electron integrals over Gaussian basis functions. Our recursive approach…

In this paper, we present and prove that the coefficients $u_n$ and $v_n$ in the series expansions $F^2(a,b;c;z) = \sum_{n=0}^\infty u_n z^n$ and $F^3(a,b;c;z) = \sum_{n=0}^\infty v_n z^n$ ($a,b,c,z \in \mathbb{C}$ and $-c \notin \mathbb{N}…

Here we revisit the quantum algorithms for obtaining Forrelation [Aaronson et al, 2015] values to evaluate some of the well-known cryptographically significant spectra of Boolean functions, namely the Walsh spectrum, the cross-correlation…

A conjecture of Odoni stated over Hilbertian fields $K$ of characteristic zero asserts that for every positive integer $d$, there exists a polynomial $f\in K[x]$ of degree $d$ such that for every positive integer $n$, each iterate $f^{\circ…

In this work, we consider a new type of Fourier-like representation of Boolean function $f\colon\{+1,-1\}^n\to\{+1,-1\}$ \[ f(x) = \cos\left(\pi\sum_{S\subseteq[n]}\phi_S \prod_{i\in S} x_i\right). \] This representation, which we call the…

Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…

It is well known that the Fourier--Bohr coefficients of regular model sets exist and are uniformly converging, volume-averaged exponential sums. Several proofs for this statement are known, all of which use fairly abstract machinery. For…

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

We introduce a family of quasisymmetric functions called {\em Eulerian quasisymmetric functions}, which have the property of specializing to enumerators for the joint distribution of the permutation statistics, major index and excedance…

Inspired by the work of Schur on the Taylor series of the exponential and Laguerre polynomials, we study the Galois theory of trimmed exponentials $f_{n,n+k}=\sum_{i=0}^{k} \frac{x^{i}}{(n+i)!}$ and of the generalized Laguerre polynomials…

We generalize certain totient functions using elementary symmetric polynomials and derive explicit product forms for the totient functions involving the second elementary symmetric sum. This work follows from the work of Toth [The Ramanujan…