English
Related papers

Related papers: Grauert's Approximation Theorem in any Characteris…

200 papers

This is the abstract prepared for Workshop on Topology and Geometry (Zhang jiang, China, October 1994), and is a review of my recent works. What kinds of combinations of singularities can appear in small deformation fibers of a fixed…

alg-geom · Mathematics 2008-02-03 Tohsuke Urabe

A duality theorem for the singularity category of a finite dimensional Gorenstein algebra is proved. It complements a duality on the category of perfect complexes, discovered by Happel. One of its consequences is an analogue of Serre…

Representation Theory · Mathematics 2019-05-07 Dave Benson , Srikanth B. Iyengar , Henning Krause , Julia Pevtsova

Many practical problems need the output of a machine learning model to satisfy a set of constraints, $K$. Nevertheless, there is no known guarantee that classical neural network architectures can exactly encode constraints while…

Machine Learning · Computer Science 2022-02-10 Anastasis Kratsios , Behnoosh Zamanlooy , Tianlin Liu , Ivan Dokmanić

In \cite[Section 5, p.32]{Arnold-1998}, Arnold writes: "Classification of singularities of curves can be interpreted in dual terms as a description of 'co-artin' subalgebras of finite co-dimension in the algebra of formal series in a single…

Rings and Algebras · Mathematics 2022-06-17 V. V. Bavula

We give several related versions of global Grothendieck Duality for unbounded complexes on noetherian formal schemes. The proofs, based on a non-trivial adaptation of Deligne's method for the special case of ordinary schemes, are reasonably…

alg-geom · Mathematics 2008-02-03 Leovigildo Alonso , Ana Jeremias , Joseph Lipman

Active contour models based on partial differential equations have proved successful in image segmentation, yet the study of their geometric formulation on arbitrary geometric graphs is still at an early stage. In this paper, we introduce…

Computer Vision and Pattern Recognition · Computer Science 2016-10-25 Christos Sakaridis , Kimon Drakopoulos , Petros Maragos

This paper is a sequel to our previous work, where we proved the ``modularity theorem'' for algebraic Witt vectors over imaginary quadratic fields. This theorem states that, in the case of imaginary quadratic fields $K$, the algebraic Witt…

Number Theory · Mathematics 2024-03-28 Takeo Uramoto

In 1967, Schmidt wrote a seminal paper [10] on heights of subspaces of R n or C n defined over a number field K, and diophantine approximation problems. The going-down Theorem -- one of the main theorems he proved in his paper -- remains…

Number Theory · Mathematics 2017-09-18 Anthony Poels

A universal Gr\"obner basis of an ideal is the union of all its reduced Gr\"obner bases. It is contained in the Graver basis, the set of all primitive elements. Obtaining an explicit description of either of these sets, or even a sharp…

Commutative Algebra · Mathematics 2007-11-22 Sonja Petrović

We give an explicit set of generators for the semigroup of the Gr\"obner degeneration of a toric ideal. This set of generators is used to study algebraic properties of the semigroup it generates: approximation of semigroups,…

Commutative Algebra · Mathematics 2023-04-07 Hernán de Alba Casillas , Daniel Duarte , Raúl Vargas Antuna

The systematic study of neighborhoods of analytic varieties was started by H. Grauert in his celebrated article 1962. In that article he considers a manifold X and a negatively embedded submanifold A subset X. He introduces n-neighborhood,…

Complex Variables · Mathematics 2007-05-23 Cesar Camacho , Hossein Movasati

The universal approximation theorem states that a neural network with one hidden layer can approximate continuous functions on compact sets with any desired precision. This theorem supports using neural networks for various applications,…

Machine Learning · Computer Science 2024-08-13 Marcos Eduardo Valle , Wington L. Vital , Guilherme Vieira

Lattice-theoretic ideals have been used to define and generate non granular rough approximations over general approximation spaces over the last few years by few authors. The goal of these studies, in relation based rough sets, have been to…

Logic · Mathematics 2017-04-20 A Mani

In this article, after recalling and discussing the conventional extremality, local extremality, stationarity and approximate stationarity properties of collections of sets and the corresponding (extended) extremal principle, we focus on…

Optimization and Control · Mathematics 2018-05-15 Hoa T. Bui , Alexander Y. Kruger

In this research, a general theoretical framework for clustering is proposed over specific partial algebraic systems by the present author. Her theory helps in isolating minimal assumptions necessary for different concepts of clustering…

Artificial Intelligence · Computer Science 2021-06-10 A. Mani

Gorenstein rings are important to mathematical areas as diverse as algebraic geometry, where they encode information about singularities of spaces, and homotopy theory, through the concept of model categories. In consequence, the study of…

Rings and Algebras · Mathematics 2007-05-23 Peter Jorgensen

In this paper we introduce a special kind of relative (co)resolutions associated to a pair of classes of objects in an abelian category $\mathcal{C}.$ We will see that, by studying these relative (co)resolutions, we get a possible…

Representation Theory · Mathematics 2024-06-11 Alejandro Argudín Monroy , Octavio Mendoza Hernández

In this work, we provide a fundamental unified convergence theorem used for deriving expected and almost sure convergence results for a series of stochastic optimization methods. Our unified theorem only requires to verify several…

Optimization and Control · Mathematics 2022-10-20 Xiao Li , Andre Milzarek

We revisit Haagerup's enigmatic reduction theorem \cite[Theorems 2.1 \& 3.1]{HJX} showing how that theorem may be extended to general von Neumann algebras $\M$ equipped with an arbitrary faithful normal semifinite weight in a manner which…

Operator Algebras · Mathematics 2025-06-10 Louis Labuschagne , Quanhua Xu

Green, Tao and Ziegler prove ``Dense Model Theorems'' of the following form: if R is a (possibly very sparse) pseudorandom subset of set X, and D is a dense subset of R, then D may be modeled by a set M whose density inside X is…

Combinatorics · Mathematics 2008-06-04 Omer Reingold , Luca Trevisan , Madhur Tulsiani , Salil Vadhan