Nash conditional independence curve

IF 1.1 4区数学 Q4 COMPUTER SCIENCE, THEORY & METHODS Journal of Symbolic Computation Pub Date : 2023-08-01 DOI:10.1016/j.jsc.2023.102255

Irem Portakal , Javier Sendra–Arranz

{"title":"Nash conditional independence curve","authors":"Irem Portakal , Javier Sendra–Arranz","doi":"10.1016/j.jsc.2023.102255","DOIUrl":null,"url":null,"abstract":"<div>We study the Spohn conditional independence (CI) variety <math><msub><mrow><mi>C</mi></mrow><mrow><mi>X</mi></mrow></msub></math> of an n-player game X for undirected graphical models on n binary random variables consisting of one edge. For a generic game, we show that <math><msub><mrow><mi>C</mi></mrow><mrow><mi>X</mi></mrow></msub></math> is a smooth irreducible complete intersection curve (Nash conditional independence curve) in the Segre variety <math><msup><mrow><mo>(</mo><msup><mrow><mi>P</mi></mrow><mrow><mn>1</mn></mrow></msup><mo>)</mo></mrow><mrow><mi>n</mi><mo>−</mo><mn>2</mn></mrow></msup><mo>×</mo><msup><mrow><mi>P</mi></mrow><mrow><mn>3</mn></mrow></msup></math> and we give an explicit formula for its degree and genus. We prove two universality theorems for <math><msub><mrow><mi>C</mi></mrow><mrow><mi>X</mi></mrow></msub></math>: The product of any affine real algebraic variety with the real line or any affine real algebraic variety in <math><msup><mrow><mi>R</mi></mrow><mrow><mi>m</mi></mrow></msup></math> defined by at most <math><mi>m</mi><mo>−</mo><mn>1</mn></math> polynomials is isomorphic to an affine open subset of <math><msub><mrow><mi>C</mi></mrow><mrow><mi>X</mi></mrow></msub></math> for some game X.</div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"122 ","pages":"Article 102255"},"PeriodicalIF":1.1000,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S074771712300069X","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 1

Abstract

We study the Spohn conditional independence (CI) variety $C_{X}$ of an n-player game X for undirected graphical models on n binary random variables consisting of one edge. For a generic game, we show that $C_{X}$ is a smooth irreducible complete intersection curve (Nash conditional independence curve) in the Segre variety ${(P^{1})}^{n - 2} \times P^{3}$ and we give an explicit formula for its degree and genus. We prove two universality theorems for $C_{X}$ : The product of any affine real algebraic variety with the real line or any affine real algebraic variety in $R^{m}$ defined by at most $m - 1$ polynomials is isomorphic to an affine open subset of $C_{X}$ for some game X.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

纳什条件独立曲线

本文研究了n人博弈X的无向图形模型的Spohn条件独立(CI)变量CX。对于一类泛型博弈，我们证明了CX是Segre变量(P1)n−2×P3上的光滑不可约完全相交曲线(纳什条件无关曲线)，并给出了它的次和属的显式公式。证明了CX的两个普适定理:Rm中由至多m - 1个多项式定义的任何仿射实代数变量与实直线的乘积或任何仿射实代数变量对某对策X同构于CX的仿射开子集。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Journal of Symbolic Computation 工程技术-计算机：理论方法

CiteScore

2.10

自引率

14.30%

发文量

审稿时长

142 days

期刊介绍： An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects. It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.

期刊最新文献

Minimal generating sets of large powers of bivariate monomial ideals Arithmetic properties of partition functions introduced by Pushpa and Vasuki Algebraic and algorithmic methods for computing polynomial loop invariants A computational approach to rational summability and its applications via discrete residues Algorithms for 2-solvable difference equations