Related papers: Key polynomials and pseudo-convergent sequences
A conjecture of Kac states that the polynomial counting the number of absolutely indecomposable representations of a quiver over a finite field with given dimension vector has positive coefficients and furthermore that its constant term is…
According to McKay (1980) the irreducible characters of finite subgroups of SU(2) are in a natural 1-1 correspondence with the extended Coxeter-Dynkin graphs of type ADE. We show that the character values themselves can be given by an…
We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…
In this paper, we study some properties of associated sequences of special polynomials. From the properties of associated sequences of polynomials, we derive some interesting identities of special polynomials.
We introduce shifted analogues of key polynomials related to symplectic and orthogonal orbit closures in the complete flag variety. Our definitions are given by applying isobaric divided difference operators to the analogues of Schubert…
Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…
A positive integer k is a length of a polynomial if that polynomial factors into a product of k irreducible polynomials. We find the set of lengths of polynomials of the form x^n in R[x], where (R, m) is an Artinian local ring with m^2 = 0.
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…
An overview of the basic results on Macdonald(-Koornwinder) polynomials and double affine Hecke algebras is given. We develop the theory in such a way that it naturally encompasses all known cases. Among the basic properties of the…
For a general one-sided nonautonomous dynamics defined by a sequence of linear operators, we consider the notion of a polynomial dichotomy with respect to a sequence of norms and we characterize it completely in terms of the admissibility…
Given integers $\ell > m >0$, we define monic polynomials $X_n$, $Y_n$, and $Z_n$ with the property that $\mu$ is a zero of $X_n$ if and only if the triple $(\mu,\mu+m,\mu+\ell)$ satisfies $x^n + y^n = z^n$. It is shown that the…
Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and let $\mathbb{K}_{C}[[x_{1},...,x_{e}]]$ be the ring of formal power series in several variables with exponents in a line free cone $C$. We consider irreducible…
Given an arbitrary sequence $(\alpha_1, \ldots, \alpha_n) \in \mathbb{C}^n$, we show that the degree-$n$ truncation of the formal exponential $\exp\bigl(-\sum_{k=1}^{\infty} \frac{\alpha_k}{k} x^k\bigr)$ produces a polynomial whose roots…
The main objective of this paper is to present recurrence relations for the generalized poly-Cauchy numbers and polynomials. This is accomplished by introducing the concept of generalized m-poly-Cauchy numbers and polynomials. Additionally,…
We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…
We introduce a multivariate analogue of Bernoulli polynomials and give their fundamental properties: difference and differential relations, symmetry, explicit formula, inversion formula, multiplication theorem, and binomial type formula.…
By examining asymptotic behavior of certain infinite basic ($q$-) hypergeometric sums at roots of unity (that is, at a "$q$-microscopic" level) we prove polynomial congruences for their truncations. The latter reduce to non-trivial…
In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…
The classical straightening theorem as proved by Douady and Hubbard shows that a polynomial-like sequence is hybrid equivalent to a polynomial. We generalize this result to non-autonomous iteration where one considers composition sequences…