Related papers: Block Structure of Cyclotomic Polynomials

Polycyclic codes are a generalization of cyclic and constacyclic codes. Even though they have been known since 1972 and received some attention more recently, there have not been many studies on polycyclic codes. This paper presents an…

In this paper we present a systematic way to describe exceptional Jacobi polynomials via two partitions. We give the construction of these polynomials and restate the known aspects of these polynomials in terms of their partitions. The aim…

While the parameters of atomic nuclei, Z and A, indicate a general structural pattern for the nuclei, their exact masses in their fine differences seem not to exhibit the orderly kind of logical system that systematic and orderly nature…

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…

We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…

We give explicit upper bounds for coefficients of polynomials appearing in Gauss-Kra\"{i}tchik formula for cyclotomic polynomials. We use a certain relation between elementary symmetric polynomials and power sums polynomials.

We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.

The symmetric Macdonald polynomials are able to be constructed out of the non-symmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their non-symmetric…

Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…

The range of a trigonometric polynomial with complex coefficients can be interpreted as the image of the unit circle under a Laurent polynomial. We show that this range is contained in a real algebraic subset of the complex plane. Although…

Polynomials commute under composition are referred to as commuting polynomials. In this paper, we study division properties for commuting polynomials with rational (and integer) coefficients. As a consequence, we show an algebraic…

I present a construction of permutation polynomials based on cyclotomy, an additive analogue of this construction, and a generalization of this additive analogue which appears to have no multiplicative analogue. These constructions…

We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

We propose a procedure of constructing new block designs starting from a given one by looking at the intersections of its blocks with various sets and grouping those sets according to the structure of the intersections. We introduce a…

This paper classifies the blocks of the cyclotomic Hecke algebras of type G(r,1,n) over an arbitrary field. Rather than working with the Hecke algebras directly we work instead with the cyclotomic Schur algebras. The advantage of these…

A construction of polytopes is given based on integers. These geometries are constructed through a mapping to pure numbers and have multiple applications, including statistical mechanics and computer science. The number form is useful in…

Linear intersection pairs of linear codes have become of interest due to their nice algebraic properties and wide applications. In this paper, we focus on linear intersection pairs of cyclic codes over finite fields. Some properties of…

We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…