{"title":"由实根多项式构成的圆角格","authors":"C. Alves, W.L.S. Pinto, A. A. Andrade","doi":"10.12732/ijam.v33i4.10","DOIUrl":null,"url":null,"abstract":"Well-rounded lattices have been a topic of recent studies with applications in wiretap channels and in cryptography. A lattice of full rank in Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. In this paper, we investigate the well-roundedness of lattices coming from polynomials with integer coefficients and real roots. AMS Subject Classification: 11H31, 11H06, 11H71","PeriodicalId":14365,"journal":{"name":"International journal of pure and applied mathematics","volume":"29 1","pages":"663"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"WELL-ROUNDED LATTICES VIA POLYNOMIALS WITH REAL ROOTS\",\"authors\":\"C. Alves, W.L.S. Pinto, A. A. Andrade\",\"doi\":\"10.12732/ijam.v33i4.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Well-rounded lattices have been a topic of recent studies with applications in wiretap channels and in cryptography. A lattice of full rank in Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. In this paper, we investigate the well-roundedness of lattices coming from polynomials with integer coefficients and real roots. AMS Subject Classification: 11H31, 11H06, 11H71\",\"PeriodicalId\":14365,\"journal\":{\"name\":\"International journal of pure and applied mathematics\",\"volume\":\"29 1\",\"pages\":\"663\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of pure and applied mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12732/ijam.v33i4.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of pure and applied mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12732/ijam.v33i4.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
WELL-ROUNDED LATTICES VIA POLYNOMIALS WITH REAL ROOTS
Well-rounded lattices have been a topic of recent studies with applications in wiretap channels and in cryptography. A lattice of full rank in Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. In this paper, we investigate the well-roundedness of lattices coming from polynomials with integer coefficients and real roots. AMS Subject Classification: 11H31, 11H06, 11H71