中文
相关论文

相关论文: Effective Bounds on Topological Types of Real Alge…

200 篇论文

Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…

代数几何 · 数学 2013-08-01 Salvador Barone

We prove new bounds on the Betti numbers of real varieties and semi-algebraic sets that have a more refined dependence on the degrees of the polynomials defining them than results known before. Our method also unifies several different…

代数几何 · 数学 2017-11-06 Saugata Basu , Anthony Rizzie

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

代数几何 · 数学 2017-05-01 Saugata Basu , Cordian Riener

The purpose of this article is to produce effective versions of some rigidity results in algebra and geometry. On the geometric side, we focus on the spectrum of primitive geodesic lengths (resp., complex lengths) for arithmetic hyperbolic…

几何拓扑 · 数学 2018-11-21 Benjamin Linowitz , D. B. McReynolds , Paul Pollack , Lola Thompson

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

代数几何 · 数学 2007-05-23 J. Maurice Rojas

We prove a characterization of profinite algebras, i.e., topological algebras that are isomorphic to a projective limit of finite discrete algebras. In general profiniteness concerns both the topological and algebraic characteristics of a…

逻辑 · 数学 2020-08-25 Friedrich Martin Schneider , Jens Zumbrägel

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

代数几何 · 数学 2025-06-09 Yifan Zhang , Joe Kileel

Let $\mathrm{R}$ be a real closed field. The problem of obtaining tight bounds on the Betti numbers of semi-algebraic subsets of $\mathrm{R}^k$ in terms of the number and degrees of the defining polynomials has been an important problem in…

代数几何 · 数学 2016-10-06 Saugata Basu , Cordian Riener

The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…

计算复杂性 · 计算机科学 2025-02-04 Prerona Chatterjee , Mrinal Kumar , C Ramya , Ramprasad Saptharishi , Anamay Tengse

The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…

计算机科学中的逻辑 · 计算机科学 2020-07-21 Andrei A. Bulatov

This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…

代数几何 · 数学 2018-09-25 Daniele Alessandrini

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

环与代数 · 数学 2011-06-02 Roberto Boldini

In this paper we provide a framework for quantitative statements on distances and measures when studying algebraic varieties and morphisms of algebraic varieties over local fields. We will concentrate on local fields of the type…

代数几何 · 数学 2026-02-19 Avraham Aizenbud , Dmitry Gourevitch , David Kazhdan , Eitan Sayag

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

计算机科学中的逻辑 · 计算机科学 2016-01-28 Andrei A. Bulatov

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

计算机科学中的逻辑 · 计算机科学 2025-01-16 Andrei A. Bulatov

We prove a complexity lower bound on deciding membership in a semialgebraic set for arithmetic networks in terms of the sum of Betti numbers with respect to "ordinary" (singular) homology. This result complements a similar lower bound by…

计算复杂性 · 计算机科学 2016-07-14 Andrei Gabrielov , Nicolai Vorobjov

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

符号计算 · 计算机科学 2026-01-14 Louis Gaillard

Let $\mathrm{R}$ be a real closed field. We prove that the number of semi-algebraically connected components of a real hypersurface in $\mathrm{R}^n$ defined by a multi-affine polynomial of degree $d$ is bounded by $2^{d-1}$. This bound is…

代数几何 · 数学 2022-04-05 Saugata Basu , Daniel Perrucci

This paper deals with the existence of algebraic structures on compact Nash sets. We introduce the algebraic-topological notion of asymmetric Nash cobordism between compact Nash sets, and we prove that a compact Nash set is…

代数几何 · 数学 2016-11-21 Riccardo Ghiloni , Alessandro Tancredi

We establish the existence of positive solutions to a general class of overdetermined semilinear elliptic boundary problems on suitable bounded open sets $\Omega\subset\mathbb{R}^n$. Specifically, for $n\leq 4$ and under mild technical…

偏微分方程分析 · 数学 2025-07-09 Alberto Enciso , Pablo Hidalgo-Palencia , Xavier Ros-Oton
‹ 上一页 1 2 3 10 下一页 ›