Related papers: Combinatorial method of polynomial expansion of sy…
This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…
The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.
We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…
We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…
We extend the Newton's method and show the extended Newton's method leads to the binomial expansion of Newton's method that the convergences become the quadratic and linearly. In case of the quadratic convergence, we give the convergence…
This work presents a study of perturbations of symmetric Boolean functions. In particular, it establishes a connection between exponential sums of these perturbations and Diophantine equations of the form $$ \sum_{l=0}^n \binom{n}{l}…
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 classical theory of symmetric functions has a central position in algebraic combinatorics, bridging aspects of representation theory, combinatorics, and enumerative geometry. More recently, this theory has been fruitfully extended to…
In this paper we give an improvement of the degree of the homogeneous linear recurrence with integer coefficients that exponential sums of symmetric Boolean functions satisfy. This improvement is tight. We also compute the asymptotic…
A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.
We establish some new combinatorial identities involving Euler polynomials and balancing (Lucas-balancing) polynomials. The derivations use elementary techniques and are based on functional equations for the respective generating functions.…
We present positivity conjectures for the Schur expansion of Jack symmetric functions in two bases given by binomial coefficients. Partial results suggest that there are rich combinatorics to be found in these bases, including Eulerian…
Many mathematicians have been studying various degenerate versions of special polynomials and numbers in some arithmetic and combinatorial aspects. Our main focus here is a new type of degenerate poly-Euler polynomials and numbers. This…
The paper presents several combinatorial properties of the boolean cumulants. A corollary is a new proof of the multiplicative property of the boolean cumulant series that can be easily adapted for the case of boolean independence with…
In this paper, we propose some algorithms for analytical solution construction to nonlinear polynomial partial differential equations with constant function coefficients. These schemes are based on one-(single), two- (double) or three-…
We present positivity conjectures for the Schur expansion of Jack symmetric functions in two bases given by binomial coefficients. Partial results suggest that there are rich combinatorics to be found in these bases, including Eulerian…
In this paper we use computational method based on operational point of view to prove a new generating function of exponential polynomials. We give its applications involving geometric polynomials, Bernoulli and Euler numbers.
This paper presents a method to detect and recognize symmetries in Boolean functions. The idea is to use information theoretic measures of Boolean functions to detect sub-space of possible symmetric variables. Coupled with the new…
We apply matrix methods to arithmetic functions by associating matrices to the functions in a manner drawn from the theory of symmetric functions. Then we study the characteristic polynomials of the associated matrices.
We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…