Related papers: Polynomial Triangles Revisited
Some polynomials $P$ with rational coefficients give rise to well defined maps between cyclic groups, $\Z_q\longrightarrow\Z_r$, $x+q\Z\longmapsto P(x)+r\Z$. More generally, there are polynomials in several variables with tuples of rational…
We introduce a refined version of group cohomology and relate it to the space of polynomials on the group in question. We show that the polynomial cohomology with trivial coefficients admits a description in terms of ordinary cohomology…
A generating function for reciprocal binomial coefficients is written down, integral representations of this function are obtained, generating functions for sums of reciprocal binomial coefficients are derived, new identities are obtained,…
In this article we consider the exterior power and the symmetric tensors of the polynomial ring in one variable. The structure of an associative semigraded algebra of this polynomial ring induces on the symmetric tensors the structure of an…
Any permutation-invariant function of data points $\vec{r}_i$ can be written in the form $\rho(\sum_i\phi(\vec{r}_i))$ for suitable functions $\rho$ and $\phi$. This form - known in the machine-learning literature as Deep Sets - also…
We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…
We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…
Polynomial composites were introduced by Anderson, Anderson, and Zafrullah. Over time, composites have appeared in many different papers, but they have not been sorted out in the algebra world. This paper is another part of the study of…
Chebyshev polynomials and their modifications are attributes of various fields of mathematics. In particular, they are generating functions of the rows elements of certain Riordan matrices. In paper, we give a selection of some…
In this paper, the intersection of bivariate orthogonal polynomials on triangle patches will be investigated. The result is interesting by its own but also has important applications in the theory of a posteriori error estimation for finite…
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…
The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…
The aim of this study is to show that harmonic geometric polynomials can be represented in terms of geometric polynomials. This problem was first considered by Keller [14]; however, the corresponding coefficients were not fully determined.…
In this note we introduce a family of polynomials on a matroid derived from chain Tutte polynomials which generalize the classic and ubiquitous characteristic polynomial. We show that the coefficients of these polynomials alternate and…
We construct arithmetic terms representing the partial sums of binomial coefficients, and we extend these results to obtain arithmetic terms representing the multisections of binomial coefficient sums. We also introduce an arithmetic term…
There are four characteristic circles for each triangle on a plane. All for are tangential to the three straight lines containing the triangles' three sides. Three are exterior circles, the fourth is the in-circle. When the triangle is…
Any nonsingular function of spin j matrices always reduces to a matrix polynomial of order 2j. The challenge is to find a convenient form for the coefficients of the matrix polynomial. The theory of biorthogonal systems is a useful…
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…
We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of dominating sets of each cardinality in $G$. In…