Related papers: Multiplicative generalised polynomial sequences
A (d-parameter) basic nilsequence is a sequence of the form \psi(n)=f(a^{n}x), n \in Z^{d}, where x is a point of a compact nilmanifold X, a is a translation on X, and f is a continuous function on X; a nilsequence is a uniform limit of…
We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.
In this paper, we use elementary method to give a classification of the multiplicative maps on matrix algebra $M_{n}(\mF)$ over a field $\mF$ of characteristic $0$. All the multiplicative maps are classified into three classes: the trivial…
In this paper we extend the notion of Melham sum to the Pell and Pell-Lucas sequences. While the proofs of general statements rely on the binomial theorem, we prove some spacial cases by the known Pell identities. We also give extensions of…
We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…
Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite product theories) or using monads, and the category of Lawvere theories is equivalent to the category of finitary monads on Set. We show how…
In this note we introduce a notion of a generically (strongly generically) NP-complete problem and show that the randomized bounded version of the halting problem is strongly generically NP-complete.
We describe arbitrary multiplicative differential forms on Lie groupoids infinitesimally, i.e., in terms of Lie algebroid data. This description is based on the study of linear differential forms on Lie algebroids and encompasses many known…
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
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…
A known characterization for entire functions that preserve all nonnegative matrices of order two is shown to characterize polynomials that preserve nonnegative matrices of order two. Equivalent conditions are derived and used to prove that…
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 provide the law of large numbers for roots of finite free multiplicative convolution of polynomials which have only non-negative real roots. Moreover, we study the empirical root distributions of limit polynomials obtained through the…
We study large partial sums, localized with respect to the sums of variances, of a sequence of centered random variables. An application is given to the distribution of prime factors of typical integers.
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
We consider several classes of complete intersection numerical semigroups, aris- ing from many different contexts like algebraic geometry, commutative algebra, coding theory and factorization theory. In particular, we determine all the…
We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.
We classify all linearly compact simple Jordan superalgebras over an algebraically closed field of characteristic zero. As a corollary, we deduce the classification of all linearly compact unital simple generalized Poisson superalgebras.
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…
A new class of Poisson algebras, the class of {\em generalized Weyl Poisson algebras}, is introduced. It can be seen as Poisson algebra analogue of generalized Weyl algebras or as giving a Poisson structure to (certain) generalized Weyl…