English
Related papers

Related papers: On the removable singularities of complex analytic…

200 papers

We construct self-consistent analytic solutions in the ${\mathbb C}P^{N-1}$ model in the large-$N$ limit, in which more than one Higgs scalar component take values inside a single or multiple soliton on an infinite space or on a ring, or…

High Energy Physics - Theory · Physics 2018-09-21 Muneto Nitta , Ryosuke Yoshii

In earlier work, the author described various stratification conditions for a complex analytic set X in terms of the theory of integral closure of modules. However, even if an analytic set has a reduced structure, often geometric operations…

Complex Variables · Mathematics 2007-05-23 Terence Gaffney

In this paper we give elementary conditions completely characterising when the theory of modules of a Pr\"ufer domain is decidable. Using these results, we show that the theory of modules of the ring of integer valued polynomials is…

Logic · Mathematics 2024-12-17 Lorna Gregory

In this paper, we mainly discuss the separability of $n$-partite quantum states from elements of density matrices. Practical separability criteria for different classes of $n$-qubit and $n$-qudit quantum states are obtained. Some of them…

Quantum Physics · Physics 2011-05-06 Ting Gao , Yan Hong

On a complex symplectic manifold we prove a finiteness result for the global sections of solutions of holonomic DQ-modules in two cases: (a) by assuming that there exists a Poisson compactification (b) in the algebraic case. This extends…

Algebraic Geometry · Mathematics 2021-05-19 Masaki Kashiwara , Pierre Schapira

We call a singularity of a presymplectic form $\omega$ removable in its graph if its graph extends to a smooth Dirac structure over the singularity. An example for this is the symplectic form of a magnetic monopole. A criterion for the…

Symplectic Geometry · Mathematics 2018-10-09 Christian Blohmann

Conjugacy separability of any group of the class of one-relator groups given by the presentation $<a, b; [a^m,b^n]=1>$ ($m,n>1$) is proven.

Group Theory · Mathematics 2007-05-23 D. Tieudjo , D. I. Moldavanskii

We study Medvedev reducibility in the context of set theory -- specifically, forcing and large cardinal hypotheses. Answering a question of Hamkins and Li \cite{HaLi}, we show that the Medvedev degrees of countable ordinals are far from…

Logic · Mathematics 2024-09-02 Noah Schweber

We provide combinatorial/topological formula for the multiplicity of a complex analytic normal surface singularity whenever the analytic structure on the fixed topological type is generic.

Algebraic Geometry · Mathematics 2020-11-05 János Nagy , András Némethi

Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…

Commutative Algebra · Mathematics 2020-08-12 Ezra Miller

We provide sufficient conditions for a set $E\subset\mathbb{R}^n$ to be a non-universal differentiability set, i.e. to be contained in the set of points of non-differentiability of a real-valued Lipschitz function. These conditions are…

Functional Analysis · Mathematics 2017-09-14 Olga Maleva , David Preiss

We prove that the subsets of N^d that are S-recognizable for all abstract numeration systems S are exactly the 1-recognizable sets. This generalizes a result of Lecomte and Rigo in the one-dimensional setting.

Formal Languages and Automata Theory · Computer Science 2010-10-27 Emilie Charlier , Anne Lacroix , Narad Rampersad

The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.

Formal Languages and Automata Theory · Computer Science 2015-09-02 Eric Rowland , Jeffrey Shallit

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…

Logic in Computer Science · Computer Science 2021-01-26 Michał R. Przybyłek

We prove the existence of infinite dense free sets (in the usual topology) for set mappings on the reals, under reasonable assumptions.

Logic · Mathematics 2016-11-15 Shimon Garti

In this paper, we give sufficient conditions for Cauchy-completeness of Kobayashi hyperbolic domains in complex manifolds. The first result gives a sufficient condition for completeness for relatively compact domains in several large…

Complex Variables · Mathematics 2025-04-11 Rumpa Masanta

By using the relative derived categories, we prove that if an Artin algebra $A$ has a module $T$ with ${\rm inj.dim}T<\infty$ such that $^\perp T$ is finite, then the bounded derived category $D^b(A\mbox{-}{\rm mod})$ admits a categorical…

Representation Theory · Mathematics 2014-10-10 Pu Zhang

We give simple necessary and sufficient conditions for the inclusion-exclusion identity to hold for an infinite countable number of sets. In terms of a random variable, whose range are nonnegative integers, this condition is equivalent to…

Probability · Mathematics 2007-05-23 Shmuel Friedland , Elliot Krop

It is proved the existence of single-valued analytic solutions in the unit disk and multivalent analytic solutions in domains bounded by a finite collection of circles for the Riemann-Hilbert problem with coefficients of sigma-finite…

Complex Variables · Mathematics 2015-10-07 A. S. Efimushkin , V. I. Ryazanov

We prove that there exist weakly countably determined spaces of complexity higher than coanalytic. On the other hand, we also show that coanalytic sets can be characterized by the existence of a cofinal adequate family of closed sets.…

Functional Analysis · Mathematics 2009-03-05 Antonio Avilés