\documentclass[a4paper]{article} \usepackage{amsmath,amsfonts,amssymb,amsthm,epsfig,epstopdf,titling,url,array} \usepackage{framed} \usepackage{hhline} \usepackage{graphicx} \usepackage{pifont} \usepackage{fancyhdr} \pagestyle{fancy} \usepackage{xcolor} %\usepackage{lipsum} \usepackage{xepersian} %\rhead{\begin{picture}(2,2) \put(0,0){\includegraphics[width=3cm]{ipmpict}} \end{picture}} \theoremstyle{plain} \newtheorem{thm}{قضیه}[section] \newtheorem{mthm}[thm]{قضیه‌ی اصلی } \newtheorem{lemma}[thm]{لم} \newtheorem{prop}[thm]{گزاره} \newtheorem{cro}[thm]{نتیجه} \newtheorem{conj}[thm]{حدس} \theoremstyle{definition} \newtheorem{ex}[thm]{مثال} \newtheorem{df}[thm]{تعریف} \newtheorem{notedfn}[thm]{نمادگذاری و تعریف} \newtheorem{exer}[thm]{تمرین} \newtheorem{rem}[thm]{تذکر} \newtheorem{obs}[thm]{بحث} \newtheorem{des}{}[section] \newtheorem{ques}[thm]{پرسش} \newtheorem*{his}{یادداشت تاریخی} \newtheorem{notation}[thm]{نمادگذاری} \newtheorem*{pf}{برهان} \begin{document} \renewenvironment{framed}[1][\hsize] {\MakeFramed{\hsize#1\advance\hsize-\width \FrameRestore}}% {\endMakeFramed} \begin{framed}[1.42\textwidth] \begin{center} \begin{thebibliography}{99} \resetlatinfont \latin \bibitem{ada} W. Adams and P. Loustaunou.: {\em An Introduction to Gr\"obner bases.}, Graduate Studies in Mathematics Vol. 3, American Mathematical Society, 1994. \bibitem{ass} A. Assi, F.J. Castro-Jim\'enez, M. Granger.: {\em The Gr\"obner fan of an An-module.}, Journal of Pure and Applied Algebra, 150, 27-39, 2000. \bibitem{bah} R. Bahloul, N. Takayama.: {\em Local Gr\"obner fans.}, C. R. Acad. Sci. Paris, Ser. I 344, 147–152, 2007. \bibitem{beck} T. Becker and V. Weispfenning.: {\em Gr\"obner bases, A computational approach to commutative algebra.}, Springer-Verlag, New York, 1993. \bibitem{bog} T. Bogart, A. N. Jensen, D. Speyer, B. Sturmfels, and R. Thomas.: {\em Computing tropical varieties.}, Symbolic Comput., 42(1-2):54–73, 2007. \bibitem{buch} B. Buchberger.: {\em An algorithm for finding a basis for the residue class ring of a zero-dimensional polynomial ideal}., PhD-thesis (German),1965. \bibitem{buch2} { B. Buchberger}.: {\it A criterion for detecting unnecessary reductions in the construction of Gr\"obner bases}., { In symbolic and algebraic computation}, volume 72 of { Lecture Notes in Computer Science}, Springer, Berlin, 3-21, 1979. \bibitem{col} S. Collart, M. Kalkbrener, and D. Mall.: {\em Converting bases with the Gr\"obner walk.}, J. Symbolic Comput., 24(3-4), 465–469, 1997. \bibitem{col2} S. Collart, D. Mall.: {\em A result on Gr\"obner fans with an application to universal Gr\"obner bases.}, J. Appl. Alg., Eng. Commun. Comput. 7, 1996. \bibitem{cox1} D. Cox, J. Little, and D. O\'shea.: {\em Ideals, varieties, and algorithms.}, Springer-Verlag, New York, second edition, 1997. \bibitem{cox2} D. Cox, J. Little, and D. O\'shea.: {\em Using Algebraic Geometry.}, Springer-Verlag, New York, 2005. \bibitem{dar} A. Dargys and A. Acus.: {\em Application of Gr\"obner bases in calculation of Wave functions in nanostructures.}, Lithuanian Journal of Physics, 51(4), 335–340, 2011. \bibitem{pfglm} M. Dehghani Darmian and A. Hashemi.: {\em Parametric FGLM algorithm.}, J. Symb. Comput., 82, 38-56, 2017. \bibitem{err} M. Dehghani Darmian, A. Hashemi and A. Montes.: {\em Erratum to “A new algorithm for discussing Gröbner bases with parameters” [J. Symb. Comput. 33 (1–2) (2002) 183–208].}, J. Symb. Comput.46 (10), 1187–1188, 2011. \bibitem{dim} E. S. Dimitrova, A. Jarrah, R. Laubenbacher and B. Stigler.: {\em A Gr\"obner Fan Method for Biochemical Network Modeling.}, ISSAC’07, %July 29–August 1, 2007. \bibitem{dolz}{ A. Dolzmann and T. Sturm.:} {\em Computer algebra meets computer logic}, { ACM SIGSAM Bulletin}., { 31}(2), 2-9, 1997. \bibitem{f4} { J. C. Faug\`ere.:} {\em A new efficient algorithm for computing {G}r\"obner bases (F4).}, {Journal of Pure and Applied Algebra}., { 139}(1-3), 61-88, 1994 . \bibitem{f5} { J. C. Faug\`ere.:} {\em A new efficient algorithm for computing {G}r\"obner bases without reduction to zero (F5).}, { Proceedings of ISSAC'02., ACM Press}., 75-83, 2002 . \bibitem{fau} J. C. Faug\`ere, P. Gianni, D. Lazard, and T. Mora.: {\em Efficient computation of zero-dimensional Gr\"obner bases by change of ordering.}, J. Symbolic Comput., 16(4), 329–344, 1993. \bibitem{fuk1} K. Fukuda, A. N. Jensen, N. Lauritzen, and R. Thomas.: {\em The generic Gr\"obner walk.}, J. Symbolic Comput., 42(3):298–312, 2007. \bibitem{fuk2} K. Fukuda, A. N. Jensen and R. Thomas.: {\em Computing Gr\"obner fans.}, Mathematics of Computation., 76, 2189–2212, 2007. \bibitem{pwalk} A. Hashemi, M. Dehghani Darmian and M. Brkhordar.: {\em Gr\"obner system conversion.}, Math.Comput.Sci., 11(1), 61–77, 2017. \bibitem{hub} B. Huber and R. Thomas.: {\em Computing Gr\"obner fans of toric ideals.}, Experimental Mathematics, 9(3/4), 321–331, 2000. \bibitem{insa} M. Insa and F. Pauer.: {\em Gr\"{o}bner bases in rings of differential operators}., { Cambridge University Press,} 367-380, 1998. \bibitem{jen} A. N. Jensen.: {\em Gfan, a software system for Gr\"obner fans.}, Available at \texttt{http://home.imf.au.dk/ajensen/software/gfan/gfan.html.} \bibitem{jen1} A. N. Jensen.: {\em Algorithmic aspects of Gr\"obner fans and Tropical varieties.}, Ph.D. Dissertation, Department of Mathematical Sciences Faculty of Science, University of Aarhus, July 2007. \bibitem{jen2} A. N. Jensen.: {\em A non-regular Gr\"obner fans.}, Discrete Comput. Geom., 37(3), 443–453, 2007. \bibitem{kalk} {M. Kalkbrenner.:} {\em On the stability of Gr\"{o}bner bases under specialization},. { J. Symbolic Comput.,} { 24},51-58, 1997 . %\bibitem{kap10} %{D. Kapur, Y. Sun and D. Wang .:} {\em An efficient algorithm for computing a comprehensive Gr\"obner system of a parametric polynomial system}., J. Symbolic Comput., 49, %27– 44, 2013. \bibitem{kap1} D. Kapur and Y. Sun and D. Wang. \newblock {\em A new algorithm for computing comprehensive Gr\"obner systems}. \newblock {\it ISSAC'10, ACM Press}, pages 29--36, 2010. \bibitem{lau} {R. Laubenbacher and B. Stigler.:} {\em A computational algebra approach to the reverse engineering of gene regulatory networks.}, J. Theor. Biol., 229, 523–537, 2004. \bibitem{laz} {D. Lazard.:} {\em {G}r\"obner bases Gaussian elimination and resolution of systems of algebraic equations}, { Proceedings of EUROCAL'83 Springer Lecture Notes in Computer Science}., {162}, 146-157, 1983. \bibitem{mal} {D. Mall.:} {\em Covers and fans of polynomial ideals}., Theoretical Computer Science, 187, 167-178, 1997. \bibitem{mm} {H. M{\"o}ller, T. Mora and C. Traverso, C.:} {\em {G}r\"obner bases computation using syzygies.}, {Proceedings of ISSAC'92., ACM Press}, 320-328, 1992. \bibitem{mon} { A. Montes.:} {\em A new algorithm for discussing Gr\"{o}bner bases with parameters.}, { J. Symbolic Comput.,} { 33}(1-2) 183-208, 2002. \bibitem{mon3} { A. Montes and J. Castro.:} {\em Solving the load-flow problem using Gr\"{o}bner bases}., J. SIGSUM Bull., { 29}(1), 1-13, 1995. \bibitem{mor} T. Mora and L. Robbiano.: {\em The Gr\"obner fan of an ideal.}, J. Symbolic Comput., 6(2-3), 183–208, 1988. \bibitem{stu} B. Sturmfels.: {\em Gr\"obner bases and convex polytopes.,} volume 8 of University Lecture Series. American Mathematical Society, 1996. \bibitem{suz} {A. Suzuki and Y. Sato.:} {\em A simple algorithm to compute comprehensive Gr\"{o}bner bases using Gr\"{o}bner bases.}, { Proceedings of ISSAC'06., ACM Press}, 326-331, 2006. \bibitem{wis92} {V. Weispfenning.:} {\em Comprehensive Gr\"{o}bner bases.}, {J. Symbolic Comput.,} { 14}(1), 1-29, 1992. \bibitem{wis03} {V. Weispfenning.:} {\em Canonical comprehensive Gr\"{o}bner bases.}, {J. Symbolic Comput.,} { 36}(3-4), 669-683, 2003. \bibitem{zie} G\"unter Ziegler.: {\em Lectures on Polytopes.}, volume 152, Springer- Verlag, 1994. \end{thebibliography} \end{center} \end{framed} \end{document}