Gert-Martin Greuel
In this survey I should like to introduce some concepts of algebraic geometry and try to demonstrate the fruitful interaction between algebraic geometry and computer algebra and, more generally, between mathematics and computer science. One of the aims of this article is to show, by means of examples, the usefulness of computer algebra to mathematical research.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The survey gives an overview of the achievements in topology of real algebraic varieties in the direction initiated in the early 70th by V.I.Arnold and V.A.Rokhlin. We make an attempt to systematize the principal results in the subject. After an exposition of general tools and results, special attention is paid to surfaces and curves on surfaces.
A short survey on applications of algebraic geometry in topological data analysis.
Grassmann and Flag Varieties in Linear Algebra, Optimization, and Statistics: An Algebraic Perspective
本文从代数视角研究格拉斯曼簇与旗簇，将线性代数与统计问题转化为其上的优化问题，以复临界点数量衡量代数复杂度，阐述流形的代数簇实现并计算了多类优化问题的代数复杂度。
We show that the non-Archimedean skeleton of the $d$-th symmetric power of a smooth projective algebraic curve $X$ is naturally isomorphic to the $d$-th symmetric power of the tropical curve that arises as the non-Archimedean skeleton of $X$. The retraction to the skeleton is precisely the specialization map for divisors. Moreover, we show that the process of tropicalization naturally commutes with the diagonal morphisms and the Abel-Jacobi map and we exhibit a faithful tropicalization for symmetric powers of curves. Finally, we prove a version of the Bieri-Groves Theorem that allows us, under…
While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention from theoretical computer science and scientific computing. We complement this existing body of literature with an algebro-geometric analysis of the set of orthogonally decomposable tensors. More specifically, we prove that they form a real-algebraic variety defined by polynomials of degree at most four. The exact degrees, and the corresponding polynomials, are…
The interplay rich between algebraic geometry and string and gauge theories has recently been immensely aided by advances in computational algebra. However, these symbolic (Gröbner) methods are severely limited by algorithmic issues such as exponential space complexity and being highly sequential. In this paper, we introduce a novel paradigm of numerical algebraic geometry which in a plethora of situations overcomes these short-comings. Its so-called 'embarrassing parallelizability' allows us to solve many problems and extract physical information which elude the symbolic methods. We describe …
The clear understanding of the non-convex landscape of neural network is a complex incomplete problem. This paper studies the landscape of linear (residual) network, the simplified version of the nonlinear network. By treating the gradient equations as polynomial equations, we use algebraic geometry tools to solve it over the complex number field, the attained solution can be decomposed into different irreducible complex geometry objects. Then three hypotheses are proposed, involving how to calculate the loss on each irreducible geometry object, the losses of critical points have a certain ran…
Discrete-time, discrete-state multistate Markov models from the perspective of algebraic statistics
本文从代数统计角度研究离散时间、离散状态多状态马尔可夫模型，通过研究联合路径概率间多项式关系，建立与事件历史分析的联系，推导非齐次和齐次模型相关结论，从两角度研究最大似然估计并给出数据应用。
We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors can be defined be equations of degree 2. This gives a new proof of some of the results of Robeva and Boralevi et al. Orthogonal decompositions over the field of complex numbers had not been studied previously; we give an explicit description of the set of decomposable tensors using polynomial equalities and inequalities, and we begin a study of their closures. The main open problem that arises from this work is to ob…
We present a survey of results on word equations in simple groups, as well as their analogues and generalizations, which were obtained over the past decade using various methods, group-theoretic and coming from algebraic and arithmetic geometry, number theory, dynamical systems and computer algebra. Our focus is on interrelations of these machineries which led to numerous spectacular achievements, including solutions of several long-standing problems.
Approximate Fiber Product: A Preliminary Algebraic-Geometric Perspective on Multimodal Embedding Alignment
本文用离散环多项式与近似纤维积刻画图文嵌入对齐，并提出共享/模态特有正交子空间分解，从代数几何角度揭示鲁棒性、维度与结构的关系。
In this writing we shall address certain beautiful inter-relations between the construction of 4-dimensional supersymmetric gauge theories and resolution of algebraic singularities, from the perspective of String Theory. We review in some detail the requisite background in both the mathematics, such as orbifolds, symplectic quotients and quiver representations, as well as the physics, such as gauged linear sigma models, geometrical engineering, Hanany-Witten setups and D-brane probes. We investigate aspects of world-volume gauge dynamics using D-brane resolutions of various Calabi-Yau singular…
What is... Random Algebraic Geometry?
本文综述随机代数几何，该领域将概率视角引入实代数几何，为希尔伯特第十六问题等经典难题提供现代解决途径。
We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner bases. We present a novel scalable algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over $200 \, 000$, the largest number factored to date using a quantum processor.
Signomials are obtained by generalizing polynomials to allow for arbitrary real exponents. This generalization offers great expressive power, but has historically sacrificed the organizing principle of ``degree'' that is central to polynomial optimization theory. We reclaim that principle here through the concept of signomial rings, which we use to derive complete convex relaxation hierarchies of upper and lower bounds for signomial optimization via sums of arithmetic-geometric exponentials (SAGE) nonnegativity certificates. The Positivstellensatz underlying the lower bounds relies on the conc…
A categorical perspective on non-abelian localization
本文从非阿贝尔局部化视角出发，为具有 $Θ$-分层的代数导出栈建立了虚拟 $K$-理论局部化公式及其范畴升级，并据此证明了普适穿墙公式与一维层栈上同调的有限性定理。
A Perspective on the Foundations of Derived Analytic Geometry
该研究提出在正合范畴中针对单纯对象范畴开展代数几何的方法，由此得到导出解析几何理论，为相关领域提供了新的理论视角。
Combinatorial and algebraic perspectives on the marginal independence structure of Bayesian networks
本文刻画Bayes网络无条件依赖图，利用Gröbner基与二项式关系构建图空间上的MCMC搜索方法GrUES，在合成Gaussian数据上提升真实边际独立结构恢复率并给出可靠后验可信集。
An introduction to the algebraic geometry of the Putman-Wieland conjecture
本文以代数几何视角重释 Putman-Wieland 猜想的既有结果，构造 Jacobian 含高维等平凡同源因子的折纸曲线族，并证明其超椭圆类比失败。
We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a spectrahedron, and to the problem of characterizing the image of the positive definite cone under an arbitrary linear projection. These problems at the interface of statistics and optimization are here examined from the perspective of convex algebraic geometry.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。