English
Related papers

Related papers: A Simplified Proof of Desingularization and Applic…

200 papers

In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Buse , Marc Chardin

A short proof of the "Rigidity theorem" using the sheaf theoretic model for Hilbert modules over polynomial rings is given. The joint kernel for a large class of submodules is described. The completion $[\mathcal I]$ of a homogeneous…

Functional Analysis · Mathematics 2010-03-26 Shibananda Biswas , Gadadhar Misra

Theorem 1.2.6 of [ATW20] provides a relatively functorial logarithmic principalization of ideals on relative logarithmic orbifolds $X\to B$ in characteristic 0, relying on a delicate monomialization theorem for Kummer ideals. The paper…

Algebraic Geometry · Mathematics 2025-03-18 Dan Abramovich , Michael Temkin , Jarosław Włodarczyk

We propose an effective method for primary decomposition of symmetric ideals. Let $K[X]=K[x_1,\ldots,x_n]$ be the $n$-valuables polynomial ring over a field $K$ and $\mathfrak{S}_n$ the symmetric group of order $n$. We consider the…

Commutative Algebra · Mathematics 2024-04-17 Yuki Ishihara

We obtain sealing by forcing over a self-iterable model. The proof is fine-structure free and uses only basic ideas from iteration theory. We believe that such fine-structure free proofs will make the subject more accessible to the general…

Logic · Mathematics 2021-10-14 Grigor Sargsyan , Nam Trang

We consider the formal reduction of a system of linear differential equations and show that, if the system can be block-diagonalised through transformation with a ramified Shearing-transformation and following application of the Splitting…

Symbolic Computation · Computer Science 2019-11-15 Eckhard Pflügel

Universal definitions of irredundance for X-set parameters are presented using blocking sets. This approach is modeled on (domination) irredundance (which uses closed neighborhoods as blocking sets) and zero forcing irredundance (which uses…

Combinatorics · Mathematics 2025-09-24 Bryan Curtis , Mary Flagg , Leslie Hogben

The renormalization group has proven to be a very powerful tool in physics for treating systems with many length scales. Here we show how it can be adapted to provide a new class of algorithms for discrete optimization. The heart of our…

Disordered Systems and Neural Networks · Physics 2009-10-31 J. Houdayer , O. C. Martin

The aim of this article is to establish the specialization method on characteristic ideals for finitely generated torsion modules over a complete local normal domain R that is module-finite over $O[[x_1, ..., x_d]]$, where $O$ is the ring…

Number Theory · Mathematics 2017-06-07 Tadashi Ochiai , Kazuma Shimomoto

We extend two well-known results on primitive ideals in enveloping algebras of semisimple Lie algebras, the `Irreducibility theorem' and `Duflo theorem', to much wider classes of algebras. Our general version of Irreducibility theorem says…

Representation Theory · Mathematics 2012-05-29 Victor Ginzburg

We prove a generic flatness result for the cohomology of thickenings of a projective scheme that is smooth over a Noetherian domain containing a field of characteristic zero. Our study is motivated, in part, by a classical question in…

Algebraic Geometry · Mathematics 2026-03-06 Edoardo Ballico , Yairon Cid-Ruiz , Anurag K. Singh

We study implicit regularization when optimizing an underdetermined quadratic objective over a matrix $X$ with gradient descent on a factorization of $X$. We conjecture and provide empirical and theoretical evidence that with small enough…

Machine Learning · Statistics 2017-05-26 Suriya Gunasekar , Blake Woodworth , Srinadh Bhojanapalli , Behnam Neyshabur , Nathan Srebro

We consider families of schemes over arbitrary fields resp. analytic varieties with finitely many (not necessarily reduced) isolated non-normal singularities, in particular families of generically reduced curves. We define a modified delta…

Algebraic Geometry · Mathematics 2025-12-19 Gert-Martin Greuel , Gerhard Pfister

These expository notes, addressed to non-experts, are intended to present some of Hironaka's ideas on his theorem of resolution of singularities. We focus particularly on those aspects which have played a central role in the constructive…

Algebraic Geometry · Mathematics 2011-07-19 Angélica Benito , Santiago Encinas , Orlando E. Villamayor U

The least-square regression problems or inverse problems have been widely studied in many fields such as compressive sensing, signal processing, and image processing. To solve this kind of ill-posed problems, a regularization term (i.e.,…

Numerical Analysis · Mathematics 2014-05-12 Gang Liu , Ting-Zhu Huang , Xiao-Guang Lv , Jun Liu

It is well known that for a first order system of linear difference equations with rational function coefficients, a solution that is holomorphic in some left half plane can be analytically continued to a meromorphic solution in the whole…

Symbolic Computation · Computer Science 2018-02-06 Moulay A. Barkatou , Maximilian Jaroschek

In Part I of this article we generalize the Linearized Doubling (LD) approach, introduced in earlier work by NK, by proving a general theorem stating that if $\Sigma$ is a closed minimal surface embedded in a Riemannian three-manifold…

Differential Geometry · Mathematics 2022-12-06 Nikolaos Kapouleas , Peter McGrath

We propose a method for inferring \emph{parameterized regular types} for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint systems). Such parameterized regular types generalize…

Logic in Computer Science · Computer Science 2010-02-16 F. Bueno , J. Navas , M. Hermenegildo

In the context of linear inverse problems, we propose and study a general iterative regularization method allowing to consider large classes of regularizers and data-fit terms. The algorithm we propose is based on a primal-dual diagonal…

Optimization and Control · Mathematics 2017-08-04 Guillaume Garrigos , Lorenzo Rosasco , Silvia Villa

Based on the joint bidiagonalization process of a large matrix pair $\{A,L\}$, we propose and develop an iterative regularization algorithm for the large scale linear discrete ill-posed problems in general-form regularization: $\min\|Lx\| \…

Numerical Analysis · Mathematics 2020-07-21 Zhongxiao Jia , Yanfei Yang