Related papers: Idempotent ultrafilters and polynomial recurrence
In this paper, we study some properties of the q-Appell polynomials, including the recurrence relations and the q-difference equations which extend some known calssical (q=1) results. We also provide the recurrence relations and the…
In this paper, we prove new identities for Bernoulli polynomials that extend Alzer and Kwong's results. The key idea is to use the Volkenborn integral over $\mathbb Z_p$ of the Bernoulli polynomials to establish recurrence relations on the…
We derive identities for the determinants of matrices whose entries are (rising) powers of (products of) polynomials that satisfy a recurrence relation. In particular, these results cover the cases for Fibonacci polynomials, Lucas…
In this paper, by the umbral calculus method, we give a remarkable congruence involving Appell polynomials. Some applications on derangement polynomials are also presented.
Assuming an abstract comparison principle called the Ultrapower Axiom, which is motivated by the comparison process of inner model theory and generalizes the statement that the Mitchell order is linear on normal ultrafilters, we…
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
Let $\{u_n\}_n$ be a non-degenerate linear recurrence sequence of integers with Binet's formula given by $u_n= \sum_{i=1}^{m} P_i(n)\alpha_i^n.$ Assume $\max_i \vert \alpha_i \vert >1$. In 1977, Loxton and Van der Poorten conjectured that…
We prove that if S is a commutative semigroup with well founded universal semilattice or a solvable inverse semigroup with well founded semilattice of idempotents, then every strongly productive ultrafilter on S is idempotent. Moreover we…
We prove that the Buchweitz-Greuel-Schreyer Conjecture on the minimal rank of a matrix factorization holds for a generic polynomial of given degree and strength. The proof introduces a notion of the secondary strength of a polynomial, and…
The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…
In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…
In this paper, we give some recurrence formula and new and interesting identities for the poly-Bernoulli numbers and polynomials which are derived from umbral calculus.
Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…
We introduce poly-Bernoulli polynomials in two variables by using a generalization of Stirling numbers of the second kind that we studied in a previous work. We prove the bi-variate poly-Bernoulli polynomial version of some known results on…
We present a novel, perspicuous framework for building iterated ultrapowers. Furthermore, our framework naturally lends itself to the construction of a certain type of order indiscernibles, here dubbed tight indiscernibles, which are shown…
Ballantine--Beck--Feigon--Maurischat introduced the subsum polynomial \[ \operatorname{sp}(\lambda,x):=\prod_i (1+x^{\lambda_i}) \] attached to an integer partition $\lambda$, and studied rational functions obtained by summing reciprocals…
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,…
We study iterated differential polynomial rings over a locally nilpotent ring and show that a large class of such rings are Behrens radical. This extends results of Chebotar and Chen et al.
We prove that \textsf{P}-points (even strong P-points) and Gruff ultrafilters exist in any forcing extension obtained by adding fewer than $\aleph_{\omega}% $-many random reals to a model of \textsf{CH. }These results improve and correct…
We continue the exploration of various aspects of divisibility of ultrafilters, adding one more relation to the picture: multiplicative finite embeddability. We show that it lies between divisibility relations $\mid_M$ and…