相关论文: A Simplified Proof of Desingularization and Applic…

The characteristic feature of inverse problems is their instability with respect to data perturbations. In order to stabilize the inversion process, regularization methods have to be developed and applied. In this work we introduce and…

In this paper we simplify and otherwise improve the local resolution of singularities algorithm of [G1]-[G3], providing a local resolution of singularities method that works for functions with convergent power series over an arbitrary local…

Dominant areas of computer science and computation systems are intensively linked to the hypercube-related studies and interpretations. This article presents some transformations and analytics for some example algorithms and Boolean domain…

As applied to quantum theories, the program of renormalization is successful for `renormalizable models' but fails for `nonrenormalizable models'. After some conceptual discussion and analysis, an enhanced program of renormalization is…

Bierstone and Parusi\'nski studied the desingularization of $d$-dimensional closed subanalytic sets and in particular of $d$-dimensional closed semialgebraic sets. Their main tools are Hironaka's desingularization of real algebraic sets (to…

In this paper we provide a new method to certify that a nearby polynomial system has a singular isolated root with a prescribed multiplicity structure. More precisely, given a polynomial system f $=(f\_1, \ldots, f\_N)\in C[x\_1, \ldots,…

This note is about promoting singularity subtraction as a helpful tool in the discretization of singular integral operators on curved surfaces. Singular and nearly singular kernels are expanded in series whose terms are integrated on…

We generalize signature Gr\"obner bases, previously studied in the free algebra over a field or polynomial rings over a ring, to ideals in the mixed algebra $R[x_1,...,x_k]\langle y_1,\dots,y_n \rangle$ where $R$ is a principal ideal…

For an untwisted affine Lie algebra we prove an embedding of any higher level Demazure module into a tensor product of lower level Demazure modules (e.g. level one in type A) which becomes in the limit (for anti-dominant weights) the…

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

We discuss the relation between questions regarding the essential normality of finitely generated essentially spherical isometries and some results and conjectures of Arveson and Guo-Wang on the closure of homogeneous ideals in the m-shift…

In this work, we propose an Implicit Regularization Enhancement (IRE) framework to accelerate the discovery of flat solutions in deep learning, thereby improving generalization and convergence. Specifically, IRE decouples the dynamics of…

Towards better understanding of gate elimination, the only method known that can prove complexity lower bounds for explicit functions against unrestricted Boolean circuits, this work contributes: (1) formalizing circuit simplifications as a…

Composite minimization is a powerful framework in large-scale convex optimization, based on decoupling of the objective function into terms with structurally different properties and allowing for more flexible algorithmic design. We…

In this paper we extend a recent idea of formulating and regularizing inverse problems as minimization problems, so without using a forward operator, thus avoiding explicit evaluation of a parameter-to-state map. We do so by rephrasing…

By employing the (de)homogenization technique in a relatively extensive setting, this note studies in detail the relation between non-homogeneous Gr\"obner bases and homogeneous Gr\"obner bases. As a consequence, a general principle of…

Overdetermined systems of first kind integral equations appear in many applications. When the right-hand side is discretized, the resulting finite-data problem is ill-posed and admits infinitely many solutions. We propose a numerical method…

We prove that the integral closedness of any ideal of height at least two is compatible with specialization by a generic element. This opens the possibility for proofs using induction on the height of an ideal. Also, with additional…

In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…

This is a self-contained purely algebraic treatment of desingularization of fields of fractions $\mathbf{L}:=Q(\mathbf{A})$ of $d$-dimensional domains of the form \[\mathbf{A}:=\bar{\mathbf{F}}[\underline{x}]/\langle…