Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation最新文献

筛选

英文中文

How many zeros of a random sparse polynomial are real? 一个随机稀疏多项式有多少个零是实数?

Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation Pub Date : 2019-11-06 DOI: 10.1145/3373207.3404031

Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos

引用次数: 5

Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices GL(2, Q)和奇异矩阵的平坦有理子集隶属问题的可判定性

Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation Pub Date : 2019-10-05 DOI: 10.1145/3373207.3404038

V. Diekert, I. Potapov, P. Semukhin

{"title":"Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices","authors":"V. Diekert, I. Potapov, P. Semukhin","doi":"10.1145/3373207.3404038","DOIUrl":"https://doi.org/10.1145/3373207.3404038","url":null,"abstract":"This work relates numerical problems on matrices over the rationals to symbolic algorithms on words and finite automata. Using exact algebraic algorithms and symbolic computation, we prove new decidability results for 2 × 2 matrices over Q. Namely, we introduce a notion of flat rational sets: if M is a monoid and N ≤ M is its submonoid, then flat rational sets of M relative to N are finite unions of the form L0g1 L1 ··· gtLt where all Lis are rational subsets of N and gi ∈ M. We give quite general sufficient conditions under which flat rational sets form an effective relative Boolean algebra. As a corollary, we obtain that the emptiness problem for Boolean combinations of flat rational subsets of GL(2, Q) over GL(2, Z) is decidable. We also show a dichotomy for nontrivial group extension of GL(2, Z) in GL(2, Q): if G is a f.g. group such that GL(2, Z) < G ≤ GL(2, Q), then either G ≅ GL(2, Z) × Zk, for some k ≥ 1, or G contains an extension of the Baumslag-Solitar group BS(1, q), with q ≥ 2, of infinite index. It turns out that in the first case the membership problem for G is decidable but the equality problem for rational subsets of G is undecidable. In the second case, decidability of the membership problem is open for every such G. In the last section we prove new decidability results for flat rational sets that contain singular matrices. In particular, we show that the membership problem is decidable for flat rational subsets of M(2, Q) relative to the submonoid that is generated by the matrices from M(2, Z) with determinants 0, ± 1 and the central rational matrices.","PeriodicalId":186699,"journal":{"name":"Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124198599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

A second order cone characterization for sums of nonnegative circuits 非负回路和的二阶锥表征

Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation Pub Date : 2019-06-14 DOI: 10.1145/3373207.3404033

Jie Wang, Victor Magron

引用次数: 21

首页上一页