Results 61 to 70 of about 68,753 (202)
The paper proposes a method for constructing primitive polynomials that are used in the design of radio engineering systems, subsystems of cryptographic information protection in reliable automated information processing and control systems at critical ...
Г.М. Гулак
doaj +1 more source
Irreducibility of random polynomials of bounded degree
Irreducibility of random polynomials of bounded degree, Discrete Analysis 2021:7, 16 pp. This paper contributes to a substantial literature on the subject of random polynomials and their behaviour, considerably generalizing known results that show that ...
Huy Tuan Pham, Max Wenqiang Xu
doaj +1 more source
Spherical Functions Associated With the Three Dimensional Sphere
In this paper, we determine all irreducible spherical functions \Phi of any K -type associated to the pair (G,K)=(\SO(4),\SO(3)). This is accomplished by associating to \Phi a vector valued function H=H(u) of a real variable u, which is analytic at u=0 ...
AJ Durán +31 more
core +1 more source
On computing local monodromy and the numerical local irreducible decomposition
Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source
Two-Variable Wilson Polynomials and the Generic Superintegrable System on the 3-Sphere
We show that the symmetry operators for the quantum superintegrable system on the 3-sphere with generic 4-parameter potential form a closed quadratic algebra with 6 linearly independent generators that closes at order 6 (as differential operators ...
Ernie G. Kalnins +2 more
doaj +1 more source
Irreducibility of generalized Fibonacci polynomials
Two ...
Flórez, Rigoberto, Saunders, J. C.
openaire +3 more sources
The 3‐sparsity of Xn−1$X^n-1$ over finite fields of characteristic 2
Abstract Let q$q$ be a prime power and Fq$\mathbb {F}_q$ the finite field with q$q$ elements. For a positive integer n$n$, the polynomial Xn−1∈Fq[X]$X^n - 1 \in \mathbb {F}_q[X]$ is termed 3‐sparse over Fq$\mathbb {F}_q$ if all its irreducible factors in Fq[X]$\mathbb {F}_q[X]$ are either binomials or trinomials.
Kaimin Cheng
wiley +1 more source
We provide irreducibility criteria for multiplicative convolutions of polynomials with integer coefficients, that is, for polynomials of the form hdeg f · f(g/h), where f, g, h are polynomials with integer coefficients, and g and h are relatively prime ...
Bonciocat Anca Iuliana +2 more
doaj +1 more source
Mutual Interlacing and Eulerian-like Polynomials for Weyl Groups [PDF]
We use the method of mutual interlacing to prove two conjectures on the real-rootedness of Eulerian-like polynomials: Brenti's conjecture on $q$-Eulerian polynomials for Weyl groups of type $D$, and Dilks, Petersen, and Stembridge's conjecture on affine ...
Yang, Arthur L. B., Zhang, Philip B.
core
A theorem of Dickson on irreducible polynomials [PDF]
Im Anschluß an ältere spezielle Untersuchungen von Dickson betrachtet Verf. allgemein über einem endlichen Körper mit \(q\) Elementen die Anzahlen der normierten Primpolynome \(P(x) = x^m + c_1x^{m-1}+\cdots + c_m\) vom Grade \(m\) mit bestimmten Vorschriften über die Koeffizienten \(c_1, c_m\). Aus dem von \textit{H. Davenport} und dem Ref. [J.
openaire +2 more sources

