相关论文: New scattered sequences of order 3
This article investigates integer sequences that partition the sequence into blocks of various lengths - irregular arrays. The main result of the article is explicit formulas for numbering of irregular arrays. A generalization of Cantor…
A series of detailed quantitative results is established for the family of demi-distributions which is a large extension of the family of usual distributions.
In this paper we introduce and investigate a one-parameter family of polynomials. They are semisymmetric, i.e. symmetric in the variables with odd and even index separately. In fact, the family forms a basis of the space of semisymmetric…
In this paper we get two new classes of regular sequences in the polynomial ring over the field of complex numbers.
A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new upper bound for B_3 sequences.
We exhibit some new families of cyclotomic fields which have non-trivial plus parts of their class numbers. We also prove the $3$ - divisibility of the plus part of the class number of another family consisting of infinitely many cyclotomic…
An ordered variant of the well-known set theory concept of shattering was introduced by Anstee, R\'onyai, and Sali. In this paper, we prove several new results related to order shattering. Given a family $\mathcal F$ of subsets of $[n]$, we…
The main purpose of this article is to introduce some new binomial difference sequence spaces of fractional order ${\tilde{\alpha}} $ along with infinite matrices. Some topological properties of these spaces are considered along with the…
A unitary cyclotomic polynomial of order three is a polynomial of the form \[ \Phi^*_{PQR}(x)=\frac{(x^{PQR}-1)(x^P-1)(x^Q-1)(x^R-1)}{(x^{PQ}-1)(x^{QR}-1)(x^{RP}-1)(x-1)}, \] where $P$, $Q$ and $R$ are powers of three distinct primes $p$,…
A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…
We dedicate this paper to investigate the most generalized form of Fibonacci Sequence, one of the most studied sections of the mathematical literature. One can notice that, we have discussed even a more general form of the conventional one.…
We study the plane automorphisms given by polynomials with certain degree decompositions.
In this paper we introduce a new approach to the concept of multipolynomials and generalize several results of the homogeneous polynomials and symmetric multilinear applications. We also present an abstract approach to the concept of…
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…
Sine-skewed circular distributions are identifiable and have easily-computable trigonometric moments and a simple random number generation algorithm, whereas they are known to have relatively low levels of asymmetry. This study proposes a…
The concept of linear set in projective spaces over finite fields was introduced by Lunardon in 1999 and it plays central roles in the study of blocking sets, semifields, rank-distance codes and etc. A linear set with the largest possible…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
The purpose of this article is to present my new proof of the the construction and the convergence theorem of spectral sequences of filtered complexes, which is much shorter and cleaner than the "standard" proof.
In this paper we introduce a six-parameter generalization of the four-parameter three-variable polynomials on the simplex and we investigate the properties of these polynomials. Sparse recurrence relations are derived by using ladder…
A supersequence over a finite set is a sequence that contains as subsequence all permutations of the set. This paper defines an infinite array of methods to create supersequences of decreasing lengths. This yields the shortest known…