English
Related papers

Related papers: Subspaces with equal closure

200 papers

In this paper, we study formal mappings between smooth generic submanifolds in multidimensional complex space and establish results on finite determination, convergence and local biholomorphic and algebraic equivalence. Our finite…

Complex Variables · Mathematics 2007-05-23 M. S. Baouendi , Nordine Mir , Linda Preiss Rothschild

This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…

High Energy Physics - Theory · Physics 2008-02-03 Israel Gelfand , D. Krob , Alain Lascoux , B. Leclerc , V. S. Retakh , J. -Y. Thibon

We show that the pair given by the power set and by the "Grassmannian"(set of all subgroups) of an arbitrary group behaves very much like the pair given by a projective space and its dual projective space. More precisely, we generalize…

Group Theory · Mathematics 2012-01-31 Wolfgang Bertram

We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…

Logic · Mathematics 2024-12-23 Lorna Gregory

This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…

Programming Languages · Computer Science 2023-12-08 John Cyphert , Zachary Kincaid

Quadratic algebras are generalizations of Lie algebras; they include the symmetry algebras of 2nd order superintegrable systems in 2 dimensions as special cases. The superintegrable systems are exactly solvable physical systems in classical…

Mathematical Physics · Physics 2014-01-07 Ernest G. Kalnins , Willard Miller

Internal preneighbourhood spaces inside any finitely complete category with finite coproducts and proper factorisation structure were first introduced in my earlier paper. This paper proposes a closure operation on internal preneighbourhood…

Category Theory · Mathematics 2022-05-12 Partha Pratim Ghosh

By using the Ringel-Hall algebra approach, we investigate the structure of the Lie algebra $L(\Lambda)$ generated by indecomposable constructible sets in the varieties of modules for any finite dimensional $\mathbb{C}$-algebra $\Lambda.$ We…

Quantum Algebra · Mathematics 2009-02-03 Ming Ding , Jie Xiao , Fan Xu

The universal approximation theorem is generalised to uniform convergence on the (noncompact) input space $\mathbb{R}^n$. All continuous functions that vanish at infinity can be uniformly approximated by neural networks with one hidden…

Machine Learning · Computer Science 2024-03-05 Teun D. H. van Nuland

We generalize the notion of semi-universality in the classical deformation problems to the context of derived deformation theories. A criterion for a formal moduli problem to be semi-prorepresentable is produced. This can be seen as an…

Algebraic Geometry · Mathematics 2023-09-27 An Khuong Doan

The goal of this work is to prove an embedding theorem for compact almost complex manifolds into complex algebraic varieties. It is shown that every almost complex structure can be realized by the transverse structure to an algebraic…

Complex Variables · Mathematics 2016-07-18 Jean-Pierre Demailly , Hervé Gaussier

We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof…

Logic in Computer Science · Computer Science 2018-05-29 Clément Aubert , Marc Bagnol

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

Numerical Analysis · Mathematics 2014-07-01 Victor Y. Pan

We consider Apollonian circle packings of a half Euclidean plane. We give necessary and sufficient conditions for two such packings to be related by a Euclidean similarity (that is, by translations, reflections, rotations and dilations) and…

Metric Geometry · Mathematics 2015-03-18 Michael Ching , John R. Doyle

We introduce the categories of quasi-measurable spaces, which are slight generalizations of the category of quasi-Borel spaces, where we now allow for general sample spaces and less restrictive random variables, spaces and maps. We show…

Probability · Mathematics 2021-09-27 Patrick Forré

It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…

Logic · Mathematics 2013-07-25 Kevin Davila Castellar , Ismael Gutierrez Garcia

Universal approximation theory offers a foundational framework to verify neural network expressiveness, enabling principled utilization in real-world applications. However, most existing theoretical constructions are established by…

Machine Learning · Computer Science 2026-01-27 ZeYu Li , ShiJun Zhang , TieYong Zeng , FengLei Fan

Intrinsic volumes are fundamental geometric invariants generalizing volume, surface area, and mean width for convex bodies. We establish a unified Laplace-Grassmannian representation for intrinsic and dual volumes of convex polynomial…

Metric Geometry · Mathematics 2025-11-04 Trí Minh Lê , Khai-Hoan Nguyen-Dang

We describe generalizations of the universal approximation theorem for neural networks to maps invariant or equivariant with respect to linear representations of groups. Our goal is to establish network-like computational models that are…

Neural and Evolutionary Computing · Computer Science 2018-04-30 Dmitry Yarotsky

Suppose A is a finite set equipped with a probability measure P and let M be a ``mass'' function on A. We give a probabilistic characterization of the most efficient way in which A^n can be almost-covered using spheres of a fixed radius. An…

Probability · Mathematics 2007-07-16 Ioannis Kontoyiannis