Problems in competitive programming, especially the ones involving enumeration some kind, are often solved by reducing the problem to computing something on polynomials and formal power series. This ...
The Abhyankar-Sathaye Problem asks whether any biregular embedding $\varphi \colon {\Bbb C}^{k}\hookrightarrow {\Bbb C}^{n}$ can be rectified, that is, whether there exists an automorphism α ∈ Aut Cn ...
MUCH use is made in combinatorial problems of generating functions in the form of polynomials and infinite power series, these being obtained by the manipulation of other algebraic expressions. In ...
Abstract: Polynomial methods are an effective method for the synthesis of control systems. The calculation of certain functions with polynomial matrices which are represented by coefficients of ...
Abstract: In this paper we present a polynomial process algebra (PPA) like basic process algebra which can be used to model both polynomial behavior of parallel systems. It provides a nature framework ...
This is a preview. Log in through your library . Abstract An analogue of Hubert's Syzygy Theorem is proved for the algebra 𝕊 n (A) of one-sided inverses of the polynomial algebra A[x₁,... , x n ] ...
PolyF2 is a tiny, educational project that shows how to implement algebra over the binary field F2 using native integer operations. On top of single polynomials over F2 (PolyF2), it builds PF2Int — a ...
We determine the structure of Leavitt path algebras of polynomial growth and discuss their automorphisms and involutions. The significance of Theorem 2 is that it shows that the extensions in Theorem ...
Conjecture 1 (Anick Conjecture). There exists wild automorphisms in AutK〈x, y, z〉. In particular, the Anick automorphism is wild. Conjecture 2 (Strong Anick Conjecture). There exist wild coordinates ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback