English
Related papers

Related papers: Multiplier Sequences for Simple Sets of Polynomial…

200 papers

Thw purpose of this paper is to present a systemic study of some families of the generalized q-Euler numbers and polynomials of higher order.

Number Theory · Mathematics 2009-12-25 Taekyun Kim

Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…

Combinatorics · Mathematics 2017-08-01 Victor H. Moll , José L. Ramirez , Diego Villamizar

Exploiting the fact that the $q$-Whittaker polynomials arise as a specialization of the (modified) Macdonald polynomials, we derive some of their basic properties, and explore interesting identities that they satisfy. We also show how they…

Combinatorics · Mathematics 2020-06-24 F. Bergeron

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

Number Theory · Mathematics 2021-09-27 Karl Dilcher , Maciej Ulas

Using sequences of finite length with positive integer elements and the inversion statistic on such sequences, a collection of binomial and multinomial identities are extended to their $q$-analog form via combinatorial proofs. Using the…

Combinatorics · Mathematics 2020-05-18 Adrian Avalos , Mark Bly

We first introduce a family of binary $pq^2$-periodic sequences based on the Euler quotients modulo $pq$, where $p$ and $q$ are two distinct odd primes and $p$ divides $q-1$. The minimal polynomials and linear complexities are determined…

Information Theory · Computer Science 2022-01-10 Jingwei Zhang , Shuhong Gao , Chang-An Zhao

A generalization of numeration system in which the set N of the natural numbers is recognizable by finite automata can be obtained by describing a lexicographically ordered infinite regular language. Here we show that if P belonging to Q[x]…

Computational Complexity · Computer Science 2007-05-23 Michel Rigo

We obtain a complete classification of complex-valued sequences which are both multiplicative and automatic.

Number Theory · Mathematics 2021-01-19 Jakub Konieczny , Mariusz Lemańczyk , Clemens Müllner

Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.

Number Theory · Mathematics 2025-02-28 Henri Cohen

We provide an explicit formula for the coefficient polynomials of a Hermite diagonal differential operator. The analysis of the zeros of these coefficient polynomials yields the characterization of generalized Hermite multiplier sequences…

Complex Variables · Mathematics 2016-01-26 Tamás Forgács , Andrzej Piotrowski

In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…

Number Theory · Mathematics 2025-09-25 Manfred G. Madritsch , Robert F. Tichy

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

Complex Variables · Mathematics 2017-09-26 Simon St-Amant , Jérémie Turcotte

We give a very brief introduction to the machinery of spectral sequences, including the spectral sequence of a bicomplex. We then briefly introduce a generalisation of the spectral sequences of a bicomplex to the spectral sequences of…

K-Theory and Homology · Mathematics 2025-08-21 Andrew Phimister

We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…

Probability · Mathematics 2023-02-09 Paweł J. Szabłowski

We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…

Data Structures and Algorithms · Computer Science 2011-03-14 Vincent Blondel , Stéphane Gaubert , Natacha Portier

For any $n$ and $k$, we provide an explicit (that is, computable in polynomial time) example of integer $B_k$-sequence of size $n$ consisting of elements bounded by $n^{k+o(k)}$.

Combinatorics · Mathematics 2023-04-11 Igor S. Sergeev

We provide a framework for relating certain q-series defined by sums over partitions to multiple zeta values. In particular, we introduce a space of polynomial functions on partitions for which the associated q-series are q-analogues of…

Number Theory · Mathematics 2023-08-22 Henrik Bachmann , Jan-Willem van Ittersum

This note gives a simple approach to q-analogues of some results associated with Abel polynomials.

Combinatorics · Mathematics 2008-03-11 Johann Cigler

The purpose of this note is to characterize those orthogonal polynomials sequences $(P_n)_{n\geq0}$ for which $$ \pi(x)\mathcal{D}_q P_n(x)=(a_n x+b_n)P_n(x)+c_n P_{n-1}(x),\quad n=0,1,2,\dots, $$ where $\mathcal{D}_q$ is the Askey-Wilson…

Classical Analysis and ODEs · Mathematics 2021-10-08 K. Castillo , D. Mbouna , J. Petronilho

Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…

Combinatorics · Mathematics 2025-12-10 Csilla Bujtás , Sandi Klavžar , Jing Tian