Zobrazeno 1 - 10
of 454
pro vyhledávání: '"Generic polynomial"'
Autor:
Tao Zheng
Publikováno v:
Journal of Symbolic Computation. 104:381-401
Multiplicative relations between the roots of a polynomial in Q [ x ] have drawn much attention in the field of arithmetic and algebra, while the problem of computing these relations is interesting to researchers in many other fields. In this paper,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1eb09998728f050e24240d11a05f2bc5
https://doi.org/10.1016/j.jsc.2020.08.001
https://doi.org/10.1016/j.jsc.2020.08.001
Autor:
Pavel Pyatov, Anastasia Trofimova
Publikováno v:
Moscow Mathematical Journal. 21:427-442
We consider quotients of the group algebra of the $3$-string braid group $B_3$ by $p$-th order generic polynomial relations on the elementary braids. In cases $p=2,3,4,5$ these quotient algebras are finite dimensional. We give semisimplicity criteria
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f0838ca42e3c4789a7261a1f1a43fd4
https://doi.org/10.17323/1609-4514-2021-21-2-427-442
https://doi.org/10.17323/1609-4514-2021-21-2-427-442
Autor:
Boulos El Hilany
Publikováno v:
Colloquium Mathematicum. 166:129-136
For any two integers $k,n$, $2\leq k\leq n$, let $f:(\mathbb{C}^*)^n\rightarrow\mathbb{C}^k$ be a generic polynomial map with given Newton polytopes. It is known that points, whose fiber under $f$ has codimension one, form a finite set $C_1(f)$ in $\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd6757af8f9d66057e24f6563f95c347
https://doi.org/10.4064/cm8162-8-2020
https://doi.org/10.4064/cm8162-8-2020
Autor:
V. Sh. Roitenberg
Publikováno v:
Sibirskie Elektronnye Matematicheskie Izvestiya. 17:2122-2130
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02322f71b450671b4dec3e3c5a031ae6
https://doi.org/10.33048/semi.2020.17.142
https://doi.org/10.33048/semi.2020.17.142
Publikováno v:
Journal of Algebra and Its Applications. 21
The goal of this paper is to supply an explicit description of the universal factorization algebra of the generic polynomial of degree [Formula: see text] into the product of two monic polynomials, one of degree [Formula: see text], as a representati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8ec1751c295fdad516dd270a1875ea8
https://doi.org/10.1142/s0219498822500724
https://doi.org/10.1142/s0219498822500724
Autor:
Tao Zheng
Publikováno v:
Computer Algebra in Scientific Computing ISBN: 9783030600259
CASC
CASC
The problem of computing the exponent lattice which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all irreducible polynomials w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ea0fd0cdc185595e66af15cce92a12a
https://doi.org/10.1007/978-3-030-60026-6_36
https://doi.org/10.1007/978-3-030-60026-6_36
Autor:
Mojtaba Dehmollaian, Christophe Caloz
This paper introduces a general technique for inter-mapping the complex spatial frequency (or propagation constant) $\gamma=\alpha+j\beta$ and the temporal frequency $\omega = \omega_\text{r}+j\omega_\text{i}$ of an arbitrary electromagnetic structur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::47cf927cd22d3f7d0d84892553f2bb4e
Autor:
Ch. Lamprakis, Th. Theohari-Apostolidi
Publikováno v:
Journal of Algebra. 492:419-456
Let f : G × G ⟶ L be a weak 2-cocycle, where L / K is a finite Galois field extension with Galois group G, and A f = ( L / K , f ) be the associated weak crossed product K-algebra. We associate a partition of G to A f and construct idempotent 2-co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9486c2a66dd4004c8daa7aacfdb69d98
https://doi.org/10.1016/j.jalgebra.2017.09.012
https://doi.org/10.1016/j.jalgebra.2017.09.012
Autor:
Robert C. Valentini
Publikováno v:
Finite Fields and Their Applications. 47:269-275
Let v be the number of distinct values of the polynomial f ( x ) = x 4 + a x 2 + b x , where a and b are elements of the finite field k of size q , where q is odd. When b is 0, an exact formula for v can be given. When b is not 0, as a consequence of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85f62daaa947ac48d15128f4f0bf022d
https://doi.org/10.1016/j.ffa.2017.06.013
https://doi.org/10.1016/j.ffa.2017.06.013
Publikováno v:
International Journal of Advanced Research in Computer Science. :760-766
Multiplicative inverses under an irreducible polynomial over Galois Field GF(p^m) play important role in cryptography. The substitution box of Advanced Encryption Standard is designed in 1999 with multiplicative inverses under the first irreducible p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f17d1ba574cde5f48514b2ee7546522f
https://doi.org/10.26483/ijarcs.v8i7.4397
https://doi.org/10.26483/ijarcs.v8i7.4397