Related papers: Generic solutions of equations with iterated expon…
We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…
The aim of this paper is twofold. Firstly, we investigate a finite sum involving the generalized falling factorial polynomials, in some special cases of which we express it in terms of the degenerate Stirling numbers of the second kind, the…
We show that the exceptional orthogonal polynomials can be viewed as confluent limits of the generalized Schur polynomials introduced by Sergeev and Veselov.
In this paper, we establish more identities of generalized multi poly-Euler polynomials with three parameters and obtain a kind of symmetrized generalization of the polynomials. Moreover, generalized multi poly-Bernoulli polynomials are…
Permutation polynomials have been a subject of study for a long time and have applications in many areas of science and engineering. However, only a small number of specific classes of permutation polynomials are described in the literature…
We construct N-complexes of non completely antisymmetric irreducible tensor fields on $\mathbb R^D$ generalizing thereby the usual complex (N=2) of differential forms. These complexes arise naturally in the description of higher spin gauge…
In this study we introduce a second type of higher order generalised geometric polynomials. This we achieve by examining the generalised stirling numbers $S(n; k;\alpha;\beta;\gamma)$ [Hsu & Shiue,1998] for some negative arguments. We study…
The methods of classical invariant theory are used to construct generic polynomials for groups $S_5$ and $A_5$, along with explicit reductions to specializations of the generic polynomials defining any desired field extension with those…
A method for generating irreducible polynomials of degree n over the finite field GF(2) is proposed. The irreducible polynomials are found by solving a system of equations that brings the information on the internal properties of the…
In this paper, we study the representations of integral quadratic polynomials. Particularly, it is shown that there are only finitely many equivalence classes of positive ternary universal integral quadratic polynomials, and that there are…
We consider several generalizations of the classical $\gamma$-positivity of Eulerian polynomials (and their derangement analogues) using generating functions and combinatorial theory of continued fractions. For the symmetric group, we prove…
We show how the knowledge of the Fourier coefficients of the Cherednik kernel leads to combinatorial formulas for generalized exponents. We recover known formulas for generalized exponents of irreducible representations parameterized by…
We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…
I give a model-theoretic setting for the modular $j$ function and its derivatives. These structures, here called $j$-fields, provide an adequate setting for interpreting the Ax-Schanuel theorem for $j$ (Pila-Tsimerman 2015). Following the…
We explicitly present expansions of the complex field which are models of the theories of green points in the multiplicative group case and in the case of an elliptic curve without complex multiplication defined over $\mathbb{R}$. In fact,…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We address some questions concerning indecomposable polynomials and their spectrum. How does the spectrum behave via reduction or specialization, or via a more general ring morphism? Are the indecomposability properties equivalent over a…
We present a method for the solution of polynomial equations. We do not intend to present one more method among several others, because today there are many excellent methods. Our main aim is educational. Here we attempt to present a method…
We establish closed-form expansions for the universal edge elimination polynomial of paths and cycles and their generating functions. This includes closed-form expansions for the bivariate matching polynomial, the bivariate chromatic…
In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.