arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.09548cs.SC
收藏

关于最小和最小圆柱代数分解的进一步结果

Further results on Minimal and Minimum Cylindrical Algebraic Decompositions

University of Liege(列日大学)

Lucas Michel, Pierre Mathonet, Naïm Zénaïdi

AI总结:

本文研究了半代数集的最小和最小圆柱代数分解的存在性,提出了一种计算方法并给出了判定标准。

摘要:

我们考虑圆柱代数分解(CADs)作为表示实数空间R^n中半代数子集的工具。在此框架下,如果给定的集合S是CAD C的单元的并集,则称CAD C适应于S。不同的计算适应CAD的算法可能产生不同的输出,通常包含冗余的单元划分。在本文中,我们分析了去除冗余数据的可能性。因此,我们考虑了有限半代数集族F的CAD^r(r∈N∪{∞,ω})的集合,该集合配备了细化偏序关系,并研究了CAD^r(F)中最小和最小元素的存在性。我们证明,对于每一个这样的F和每一个C∈CAD^r(F),都存在一个适应于F的CAD^r的最小CAD,并且比或等于C更粗。在n=1或n=2的情况下,这一结果通过证明CAD^r(F)中存在最小元素而得到加强。相比之下,对于任何n≥3,我们提供了半代数集的显式例子,其对应的适应CAD的偏序集不包含最小元素。然后,我们引入了一个在CAD^r(F)上的约简关系,以定义计算最小CAD的算法,并通过关联的约简系统的连通性,刻画了那些CAD^r(F)具有最小元素的半代数集F。最后,我们提供了实际的标准,用于决定一个半代数集是否具有最小CAD,并将其应用于描述各种具体的半代数集及其CAD^r的最小CAD。

英文摘要:

We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$. Different algorithms computing an adapted CAD may produce different outputs, usually with redundant cell divisions. In this paper we analyse the possibility to remove the superfluous data. We thus consider the set $\text{CAD}^r(\mathcal{F})$ of CADs of class $C^r$ ($r \in \mathbb{N} \cup \{\infty, ω\}$) that are adapted to a finite family $\mathcal{F}$ of semi-algebraic sets of $\mathbb{R}^n$, endowed with the refinement partial order and we study the existence of minimal and minimum element in $\text{CAD}^r(\mathcal{F})$. We show that for every such $\mathcal{F}$ and every $\mathscr{C} \in \text{CAD}^r(\mathcal{F})$, there is a minimal CAD of class $C^r$ adapted to $\mathcal{F}$ and smaller (i.e. coarser) than or equal to $\mathscr{C}$. In dimension $n=1$ or $n=2$, this result is strengthened by proving the existence of a minimum element in $\text{CAD}^r(\mathcal{F})$. In contrast, for any $n \geq 3$, we provide explicit examples of semi-algebraic sets whose associated poset of adapted CADs does not admit a minimum. We then introduce a reduction relation on $\text{CAD}^r(\mathcal{F})$ in order to define an algorithm for the computation of minimal CADs and we characterise those semi-algebraic sets $\mathcal{F}$ for which $\text{CAD}^r(\mathcal{F})$ has a minimum by means of confluence of the associated reduction system. We finally provide practical criteria for deciding if a semi-algebraic set does admit a minimum CAD and apply them to describe various concrete examples of semi-algebraic sets, along with their minimum CAD of class $C^r$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑