Results 11 to 20 of about 6,569 (263)

The number of unimodular roots of some reciprocal polynomials

open access: yesComptes Rendus. Mathématique, 2020
We introduce a sequence $P_{2n}$ of monic reciprocal polynomials with integer coefficients having the central coefficients fixed. We prove that the ratio between number of nonunimodular roots of $P_{2n}$ and its degree $d$ has a limit when $d$ tends to ...
Stankov, Dragan
doaj   +1 more source

Polynomials with minimal value set over Galois rings

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1991
Let GR(pn,m) denote the Galois ring of order pn,m, where p is a prime. In this paper we define and characterize minimal value set polynomials over GR(pn,m).
Maria T. Acosta-De-Orozco   +1 more
doaj   +1 more source

Double Cyclic Codes over \({\mathbb{F}_{q}+v\mathbb{F}_{q}}\)

open access: yesMathematics, 2020
In this paper, an algebraic structure of a type of double cyclic codes is investigated, which covers some existing codes as special cases. The paper presents generic results about the generating polynomials, minimal generating sets, matrices and dual ...
Tenghui Deng, Jing Yang
doaj   +1 more source

An Algorithm for Minimization of Boolean Functions in the Class of Toffoli Reversible Logic Circuits [PDF]

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2018
In this paper, the problem of Boolean function's representation by the reversible circuits constructed of the Toffoli gates is considered. Interest in this problem is connected with actual studies of the possibility for realization of "cold" computations.
A.S. Frantseva
doaj   +1 more source

Minimal polynomials of singular moduli [PDF]

open access: yesMathematics of Computation, 2013
Given a properly normalized parametrization of a genus-0 modular curve, the complex multiplication points map to algebraic numbers called singular moduli. In both cases there are known algorithms for algebraically computing the rational norms of the singular moduli without relying on the the recognition of a decimal or
openaire   +2 more sources

Note on bases in algebras of analytic functions on Banach spaces

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2019
Let $\{P_n\}_{n=0}^\infty$ be a sequenceof continuous algebraically independent  homogeneous polynomials on a complex Banach space $X.$ We consider the following question: Under which conditions polynomials $\{P_1^{k_1}\cdots P_n^{k_n}\}$ form a Schauder
I.V. Chernega, A.V. Zagorodnyuk
doaj   +1 more source

Determination of the Minimal Polynomials of Algebraic Numbers of the Form tg2 (π/n) by the Tschirnhausen Transformation [PDF]

open access: yesУчёные записки Казанского университета: Серия Физико-математические науки, 2015
Solutions of two problems are offered based on the Tschirnhausen transformation. The first problem is connected with the construction of minimal polynomials of the numbers of the form tg2 (π/n) by means of the Tschirnhausen transformation for all natural
I.G. Galyautdinov, E.E. Lavrentyeva
doaj  

On the minimal distance of a polynomial code [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity For a polynomial f(x) is an element of Z(2)[x] it is natural to consider the near-ring code generated by the polynomials f circle x, f circle x(2) ,..., f circle x(k) as a vectorspace.
Peter Pal Pach, Csaba Szabo
openaire   +3 more sources

Geometric properties of the lattice of polynomials with integer coefficients [PDF]

open access: yesOpuscula Mathematica
This paper is related to the classic but still being examined issue of approximation of functions by polynomials with integer coefficients. Let \(r\), \(n\) be positive integers with \(n \ge 6r\).
Artur Lipnicki, Marek J. Śmietański
doaj   +1 more source

IGMRES method for linear systems [PDF]

open access: yesJournal of Mahani Mathematical Research
The Index Generalized Minimal RESidual (IGMRES) algorithm is designed to compute the Drazin-inverse solution of a linear system of equations $Ax=b$, where $A$ is an arbitrary square matrix with index $\gamma$.
Faranges Kyanfar
doaj   +1 more source

Home - About - Disclaimer - Privacy