Results 11 to 20 of about 199,681 (176)

Rings of Polynomials [PDF]

open access: yesProceedings of the American Mathematical Society, 1970
For aii algebra R over a field k, with residue field K to be a ring of polyniomials in one variable over k it is necessary that trdeg K/k = 1. We prove that under the hypothesis tr* deg K/k -1, R is a ring of Krtull-dimension at most one. This is used to derive sufficient conditions for R to be a ring of polynomials in one variable over k. 1.
Evyatar, A., Zaks, A.
openaire   +2 more sources

An immanant formulation of the dual canonical basis of the quantum polynomial ring [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2009
We show that dual canonical basis elements of the quantum polynomial ring in $n^2$ variables can be expressed as specializations of dual canonical basis elements of $0$-weight spaces of other quantum polynomial rings.
Mark Skandera, Justin Lambright
doaj   +1 more source

Integer-valued polynomials and binomially Noetherian rings

open access: yesZanco Journal of Pure and Applied Sciences, 2022
for each and i ≥ 0. The polynomial ring of integer-valued in rational polynomial is defined by Int ( an important example for binomial ring and is non-Noetherian ring. In this paper the algebraic structure of binomial rings has been studied by their
Shadman Kareem
doaj   +1 more source

Ideals with linear quotients in Segre products [PDF]

open access: yesOpuscula Mathematica, 2017
We establish that the Segre product between a polynomial ring on a field \(K\) in \(m\) variables and the second squarefree Veronese subalgebra of a polynomial ring on \(K\) in \(n\) variables has the intersection degree equal to three.
Gioia Failla
doaj   +1 more source

Construction of Complex Lattice Codes via Cyclotomic Fields

open access: yesTrends in Computational and Applied Mathematics, 2022
Through algebraic number theory and Construction $A$ we extend an algebraic procedure which generates complex lattice codes from the polynomial ring \mathbb{F}_{2}[x]/(x^{n}-1), where \mathbb{F}_{2}=\{0,1\}, by using ideals from the generalized ...
E. D. Carvalho   +3 more
doaj   +1 more source

LINEAR CODE THROUGH POLYNOMIAL MODULO Z [PDF]

open access: yesمجلة جامعة الانبار للعلوم الصرفة, 2012
A polynomial p(x)= a + a x + …+ a x is said to be a permutation polynomial over a finite ring R If P permute the elements of R . where R is the ring ( Z , + , ) .
MAKARIM ABDULWAHIDE
doaj   +1 more source

Some results on counting roots of polynomials and the Sylvester resultant. [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
We present two results, the first on the distribution of the roots of a polynomial over the ring of integers modulo n and the second on the distribution of the roots of the Sylvester resultant of two multivariate polynomials.
Michael Monagan, Baris Tuncer
doaj   +1 more source

BEBERAPA SIFAT IDEAL GELANGGANG POLINOM MIRING: SUATU KAJIAN PUSTAKA

open access: yesJurnal Matematika, 2012
Let R be a ring with identity 1 and s be an endomorphism of R and d be a left s - derivation . The skew polynomial ring over R in an indeterminate x is: R[x;s ,d ] = { f (x) = anxn +L+ a0 | ai Î R} with xa =s (a)x +d (a) The aim of this research is to ...
AMIR KAMAL AMIR
doaj   +1 more source

Ring-LWE in Polynomial Rings [PDF]

open access: yes, 2012
The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still, the Ring-LWE problem defined in [LPR10] involves the fractional ideal R ∨, the dual of the ring R , which is the source of many theoretical and implementation technicalities. Until now,
Ducas, Léo, Durmus, Alain
openaire   +2 more sources

On Syzygy Modules over Laurent Polynomial Rings

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2020
In this paper, we present a dynamical method for computing the syzygy module of multivariate Laurent polynomials with coefficients in a Dedekind ring (with zero divisors) by reducing the computation over Laurent polynomial rings to calculations over a ...
Morou Amidou, Ousmane Moussa Tessa
doaj   +1 more source

Home - About - Disclaimer - Privacy