ABSTRACT: In this paper we consider a problem of investigating the dependence of on for every real or complex number with , , and present certain compact generali- zations which, besides yielding some ...

MYPATH:="{path to the code}/": SLV_PATH:=cat(MYPATH,"SLV/"): read cat(MYPATH, "Milne.mpl"): read cat(SLV_PATH, "SLV.mpl"): h1:=2*x^2+3*x*y+y^2-3: h2:=4*x^2+7*y^2+9*y ...

We prove that if $f(x)=\sum _{k=0}^{n-1}a_{k}x^{k}$ is a polynomial with no cyclotomic factors whose coefficients satisfy $a_{k}$ ≡ 1 mod 2 for 0 ≤ k < n, then ...

Abstract: The probabilistic boundary is necessary for safetycritical validation and control in uncertain dynamical systems. This paper addresses the problem of computing minimum-volume polynomial ...

This is a preview. Log in through your library . Abstract We extend the famous diophantine Frobenius problem to a ring of polynomials over a field 𝑘. Similar to the classical problem we show that the ...

A mathematical conundrum that has remained unsolvable for a few hundred years has been finally solved. The mathematician decided to cut off some extra details and had his EUREKA! moment. Science & ...