English
Related papers

Related papers: Deterministic Genericity for Polynomial Ideals

200 papers

We present a non-standard proof of the fact that the existence of a local (i.e. restricted to a point) characteristic-zero, semi-parametric lifting for a variety defined by the zero locus of polynomial equations over the integers is…

Commutative Algebra · Mathematics 2017-07-26 Edisson Gallego , Danny A. J. Gomez-Ramirez , Juan D. Velez

In this article, we review and discuss different aspects of stability and genericity of some properties of space-times which occur in various contexts in the General Theory of Relativity. We also give argument supporting the conclusion that…

General Relativity and Quantum Cosmology · Physics 2016-12-30 R. V. Saraykar

For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…

Algebraic Geometry · Mathematics 2015-01-20 Vladimir L. Popov

In [1], the authors have studied stability of certain causal properties of space-times in general relativity. As a continuation of this work, in the present paper, we review and discuss, some more aspects of stability which occur in various…

General Relativity and Quantum Cosmology · Physics 2017-09-14 R V Saraykar , Sujatha Janardhan

We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…

Symbolic Computation · Computer Science 2017-05-09 Amir Hashemi , Werner M. Seiler

Given a functional for a one-dimensional physical system, a classical problem is to minimize it by finding stationary solutions and then checking the positive definiteness of the second variation. Establishing the positive definiteness is,…

Classical Analysis and ODEs · Mathematics 2017-04-26 Thomas Lessinnes , Alain Goriely

We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…

Commutative Algebra · Mathematics 2014-01-25 Markus Lange-Hegermann

Quasi-stable ideals appear as leading ideals in the theory of Pommaret bases. We show that quasi-stable leading ideals share many of the properties of the generic initial ideal. In contrast to genericity, quasi-stability is a characteristic…

Symbolic Computation · Computer Science 2012-05-31 Amir Hashemi , Michael Schweinfurter , Werner M. Seiler

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

Number Theory · Mathematics 2016-01-19 Eric Y. Chen , J. T. Ferrara , Liam Mazurowski

The goal of this note is to provide a geometric setting in which generalized arithmetic means are best predictors in an appropriate metric. This characterization provides a geometric interpretation to the concept of certainty equivalent.…

Probability · Mathematics 2020-05-19 Henryk Gzyl

Algebraic geometry, although little explored in signal processing, provides tools that are very convenient for investigating generic properties in a wide range of applications. Generic properties are properties that hold "almost…

Algebraic Geometry · Mathematics 2016-07-20 Ignat Domanov , Lieven DeLathauwer

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

Algebraic Geometry · Mathematics 2012-11-22 Robert Krone

We study general nilpotent algebras. The results obtained are new even for the classical algebras, such as associative or Lie algebras. We single out certain generic properties of finite-dimensional algebras, mostly over infinite fields.…

Rings and Algebras · Mathematics 2024-06-25 Yuri Bahturin , Alexander Olshanskii

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…

Rings and Algebras · Mathematics 2011-06-02 Roberto Boldini

In this paper, we present a generic parametrization of generically zero-dimensional parametric polynomial systems. More specifically, we study the specialization properties of the Rational Univariate Representation and derive bounds on the…

Symbolic Computation · Computer Science 2026-02-09 Florent Corniquel

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

Data Structures and Algorithms · Computer Science 2009-02-10 Mahdi Cheraghchi , Amin Shokrollahi

For any finite poset $P$ we have the poset of isotone maps $\text{Hom}(P,\mathbb{N})$, also called $P^{op}$-partitions. To any poset ideal ${\mathcal J}$ in $\text{Hom}(P,\mathbb{N})$, finite or infinite, we associate monomial ideals: the…

Commutative Algebra · Mathematics 2018-04-26 Gunnar Fløystad

In this version small mistakes are corrected and the exposition is changed as suggested by the referee (to appear in Canadian Journal of Mathematics). The first main result of the paper is a criterion for a partially commutative group $\GG$…

Group Theory · Mathematics 2008-07-28 Montserrat Casals-Ruiz , Ilya V. Kazachkov

We make a detailed investigation of the generic properties that polynomial mappings possess. An important starting point is the work by Farnik, Jelonek and Ruas in 2019, where they prove some of those properties in the context of…

Algebraic Geometry · Mathematics 2026-05-19 N. G. Grulha , J. V. Pissolato , M. A. S. Ruas

We introduce a new notion of the stability of computations, which holds under post-processing and adaptive composition. We show that the notion is both necessary and sufficient to ensure generalization in the face of adaptivity, for any…

Machine Learning · Computer Science 2020-01-01 Katrina Ligett , Moshe Shenfeld
‹ Prev 1 2 3 10 Next ›