English
Related papers

Related papers: Relative desingularization and principalization of…

200 papers

These are introductional notes to resolution of singularities and Log principalization of ideals over fields of characteristic zero. We refer to `A simplified proof of desingularization and applications', A. Bravo, S. Encinas and O.…

Algebraic Geometry · Mathematics 2007-05-23 O. Villamayor U

Embedded principalization of ideals in smooth schemes, also known as Log-resolutions of ideals, play a central role in algebraic geometry. If two sheaves of ideals, say $I_1$ and $I_2$, over a smooth scheme $V$ have the same integral…

Algebraic Geometry · Mathematics 2008-02-28 Santiago Encinas , Orlando Villamayor

We consider an homogeneous ideal $I$ in the polynomial ring $S=K[x_1,\dots,$ $x_m]$ over a finite field $K=\mathbb{F}_q$ and the finite set of projective rational points $\mathbb{X}$ that it defines in the projective space…

Commutative Algebra · Mathematics 2023-10-24 Philippe Gimenez , Diego Ruano , Rodrigo San-José

Linearizability is the gold standard among algorithm designers for deducing the correctness of a distributed algorithm using implemented shared objects from the correctness of the corresponding algorithm using atomic versions of the same…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-09-21 Wojciech Golab , Lisa Higham , Philipp Woelfel

In this paper, local monomialization theorems are proven for analytic morphisms of complex and real analytic spaces. This gives the generalization of the local monomialization theorem for morphisms of algebraic varieties over a field of…

Algebraic Geometry · Mathematics 2016-12-05 Steven Dale Cutkosky

In this short note, we introduce a generalization of the canonical base property, called transfer of internality on quotients. A structural study of groups definable in theories with this property yields as a consequence infinitely many new…

Logic · Mathematics 2021-06-25 Michael Loesch

In this paper, we investigate abstract homomorphism from the special linear group over complete discrete valuation rings with finite residue field, such as the ring of p-adic integers, into the general linear group over the reals. We find…

Group Theory · Mathematics 2016-08-16 Talia Fernos , Pooja Singla

A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.

Exactly Solvable and Integrable Systems · Physics 2009-11-11 F. Musso , A. Shabat

Let $R$ be a commutative $G$-graded ring with a nonzero unity. In this article, we introduce the concept of graded radically principal ideals. A graded ideal $I$ of $R$ is said to be graded radically principal if $Grad(I)=Grad(\langle…

Commutative Algebra · Mathematics 2021-01-06 Rashid Abu-Dawwas

We introduce the structural resource lambda-calculus, a new formalism in which strongly normalizing terms of the lambda-calculus can naturally be represented, and at the same time any type derivation can be internally rewritten to its…

Logic in Computer Science · Computer Science 2025-03-26 Ugo Dal Lago , Federico Olimpieri

This paper is concerned with the problem of representing and learning a linear transformation using a linear neural network. In recent years, there has been a growing interest in the study of such networks in part due to the successes of…

Optimization and Control · Mathematics 2017-09-28 Amirhossein Taghvaei , Jin W. Kim , Prashant G. Mehta

We consider whether minimizers for total variation regularization of linear inverse problems belong to $L^\infty$ even if the measured data does not. We present a simple proof of boundedness of the minimizer for fixed regularization…

Optimization and Control · Mathematics 2023-06-28 Kristian Bredies , José A. Iglesias , Gwenael Mercier

We present a new method for the quantization of totally constrained systems including general relativity. The method consists in constructing discretized theories that have a well defined and controlled continuum limit. The discrete…

General Relativity and Quantum Cosmology · Physics 2008-11-26 Miguel Campiglia , Cayetano Di Bartolo , Rodolfo Gambini , Jorge Pullin

In parameterized algorithmics, the process of kernelization is defined as a polynomial time algorithm that transforms the instance of a given problem to an equivalent instance of a size that is limited by a function of the parameter. As,…

Computational Complexity · Computer Science 2019-03-01 Jouke Witteveen , Ralph Bottesch , Leen Torenvliet

For a local analytic diffeomorphism of the plane with an irrational elliptic fixed point at 0, we introduce the notion of ``geometric normalization'', which includes the classical formal normalizations as a special case: it is a formal…

Dynamical Systems · Mathematics 2025-06-16 Alain Chenciner , David Sauzin , Qiaoling Wei

We discuss the notion of linearization through examples, which include the Price map, PageRank, representation theory, the Euler characteristic and quantum invariants. We also review categorification, which adds an additional layer of…

Representation Theory · Mathematics 2016-03-29 Mikhail Khovanov

In the foundational logical framework of homotopy-type theory we discuss a natural formalization of secondary integral transforms in stable geometric homotopy theory. We observe that this yields a process of non-perturbative cohomological…

Mathematical Physics · Physics 2014-02-28 Urs Schreiber

We introduce the class of weakly log canonical singularities, a natural generalization of semi-log canonical singularities. Toric varieties (associated to toric face rings, possibly non-normal or reducible) which have weakly (semi-) log…

Algebraic Geometry · Mathematics 2017-11-02 Florin Ambro

We prove the statement/conjecture of M. Kontsevich on the existence of the logarithmic formality morphism. This question was open since 1999, and the main obstacle was the presence of $dr/r$ type singularities near the boundary $r=0$ in the…

Quantum Algebra · Mathematics 2014-01-15 Anton Alekseev , Carlo A. Rossi , Charles Torossian , Thomas Willwacher

Low rank regularization, in essence, involves introducing a low rank or approximately low rank assumption for matrix we aim to learn, which has achieved great success in many fields including machine learning, data mining and computer…

Computer Vision and Pattern Recognition · Computer Science 2020-12-11 Zhanxuan Hu , Feiping Nie , Rong Wang , Xuelong Li