Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
1106 3 |
Ultima descărcare din IBN: 2017-04-27 21:52 |
Căutarea după subiecte similare conform CZU |
512.7+519.6 (3) |
Algebră (400) |
Matematică computațională. Analiză numerică. Programarea calculatoarelor (123) |
SM ISO690:2012 UFNAROVSKI, Victor. Graobner Basis Approach to Some Combinatorial Problems. In: Computer Science Journal of Moldova, 2012, nr. 3(60), pp. 304-312. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | |||||
Numărul 3(60) / 2012 / ISSN 1561-4042 /ISSNe 2587-4330 | |||||
|
|||||
CZU: 512.7+519.6 | |||||
Pag. 304-312 | |||||
|
|||||
Descarcă PDF | |||||
Rezumat | |||||
We consider several simple combinatorial problems and discuss diferent ways to express them using polynomial equations and try to describe the GrÄobner basis of the corresponding ideals.The main instruments are complete symmetric polynomials that help to express diferent conditions in rather compact way. |
|||||
Cuvinte-cheie Grobner basis, zero-dimensional ideal, finite configuration, complete symmetric polynomials. |
|||||
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibn-ResPubl-18982</cfResPublId> <cfResPublDate>2012-07-03</cfResPublDate> <cfVol>60</cfVol> <cfIssue>3</cfIssue> <cfStartPage>304</cfStartPage> <cfISSN>1561-4042</cfISSN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/18982</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>Graobner Basis Approach to Some Combinatorial Problems</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>Grobner basis; zero-dimensional ideal; finite configuration; complete symmetric polynomials.</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'>We consider several simple combinatorial problems and discuss diferent ways to express them using polynomial equations and try to describe the GrÄobner basis of the corresponding ideals.The main instruments are complete symmetric polynomials that help to express diferent conditions in rather compact way.</cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2012-07-03T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2012-07-03T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-29484</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2012-07-03T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-29484</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-29484-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2012-07-03T24:00:00</cfStartDate> <cfFamilyNames>Ufnarovski</cfFamilyNames> <cfFirstNames>Victor</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>