Related papers: Polynomials of Binomial Type and Lucas' Theorem
We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…
Based on a variant of Sury's polynomial identity we derive new expressions for various finite Fibonacci (Lucas) sums. We extend the results to Fibonacci and Chebyshev polynomials, and also to Horadam sequences. In addition to deriving sum…
We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…
In this paper, we construct several new permutation polynomials over finite fields. First, using the linearized polynomials, we construct the permutation polynomial of the form $\sum_{i=1}^k(L_{i}(x)+\gamma_i)h_i(B(x))$ over ${\bf…
We define a new generalization of Catalan numbers to multinomial coefficients. With arithmetic methods, we study their integrality and the integrality of their Lucasnomial generalization. We give a complete characterization of regular Lucas…
In this paper, the correspondence between the finite dimensional representations of a simple Lie algebra and their characteristic polynomials is established, and a monoid structure on these characteristic polynomials is constructed.…
We introduce the notion of Fibonacci and Lucas derivations of the polynomial algebras and prove that any element of kernel of the derivations defines a polynomial identity for the Fibonacci and Lucas polynomials. Also, we prove that any…
In this note we give the answer to the question posed by V. N. Dubinin concerning covering properties of complex polynomials
This article discuss a class of tractable model in the form of polynomial type.
Based on well-known properties of Fibonacci and Lucas numbers and polynomials we give a self-contained approach to some bivariate analogs.
We derive some Fibonacci and Lucas identities which contain inverse binomial coefficients. Extension of the results to the general Horadam sequence is possible, in some cases.
A construction of new sequences of generalized Bernoulli polynomials of first and second kind is proposed. These sequences share with the classical Bernoulli polynomials many algebraic and number--theoretical properties. A new class of…
Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the…
In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
We introduce a family of generalized Broughton polynomials and compute the characteristic varieties of complement of a curve arrangement defined by fibers of some generalized Broughton polynomials
We assemble polynomials in a locally cartesian closed category into a tricategory, allowing us to define the notion of a polynomial pseudomonad and polynomial pseudoalgebra. Working in the context of natural models of type theory, we prove…
Starting from the expression for the superdeterminant of (xI-M), where M is an arbitrary supermatrix, we propose a definition for the corresponding characteristic polynomial and we prove that each supermatrix satisfies its characteristic…
By using the piecewise method, Lagrange interpolation formula and Lucas' theorem, we determine explicit expressions of the inverses of a class of reversed Dickson permutation polynomials and some classes of generalized cyclotomic mapping…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…