Related papers: Strongly Continuous Domains
In this paper we introduce a new class of domains in complex Euclidean space, called Goldilocks domains, and study their complex geometry. These domains are defined in terms of a lower bound on how fast the Kobayashi metric grows and an…
We show that, under some technical conditions, the Strong Slope Conjecture proposed by Kalfagianni and Tran is closed under connect sums and cabling. As an application, we establish the Strong Slope Conjecture for graph knots.
In the last years it has been shown that some properties of strongly coupled superconductors can be potentially described by classical general relativity living in one higher dimension, which is known as holographic superconductors. This…
The starting assumptions to study the convergence and complexity of gradient-type methods may be the smoothness (also called Lipschitz continuity of gradient) and the strong convexity. In this note, we revisit these two basic properties…
A number of researchers have introduced topological structures on the set of laws of stochastic processes. A unifying goal of these authors is to strengthen the usual weak topology in order to adequately capture the temporal structure of…
We prove a linear upper bound for the number of singular points on the boundary of a quadrature domain, improving a previously known quadratic bound due to Gustafsson \cite{Gus88}. This linear upper bound on the number of boundary double…
In this paper, we study some characterizations of fuzzifying strong compactness including nets and pre-subbases properties. We also introduve new characterizations of locally strong compactness in fuzzifying topology and mappings.
The purpose of this article is twofold. The first aim is to characterize $h$-extendibility of smoothly bounded pseudoconvex domains in $\mathbb C^{n+1}$ by their noncompact automorphism groups. Our second goal is to show that if the…
It is increasingly common for data to possess intricate structure, necessitating new models and analytical tools. Graphs, a prominent type of structure, can encode the relationships between any two entities (nodes). However, graphs neither…
The Classic Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A special beneficial characteristic of the method is the…
We study a topology on a space of functions, called sticking topology, with the property to be the weakest among the topologies preserving continuity. In suitable frameworks, this topology preserves borelianity, local integrability, right…
A family of degenerate domain wall configurations, partially preserving supersymmetry, is discussed in a generalized Wess-Zumino model with two scalar superfields. We establish some general features inherent to the models with continuously…
We introduce cs-topologies, or topologies of open complemented subsets, as a new approach to constructive topology that preserves the duality between open and closed subsets of classical topology. Complemented subsets were used successfully…
Persistent homology is a technique recently developed in algebraic and computational topology well-suited to analysing structure in complex, high-dimensional data. In this paper, we exposit the theory of persistent homology from first…
Characterization of real-world complex systems increasingly involves the study of their topological structure using graph theory. Among global network properties, small-world property, consisting in existence of relatively short paths…
In this article, we give a full description of a topological many-one degree structure of real-valued functions, recently introduced by Day-Downey-Westrick. We also point out that their characterization of the Bourgain rank of a Baire-one…
Square-root topology is a recently emerged subfield describing a class of insulators and superconductors whose topological nature is only revealed upon squaring their Hamiltonians, i.e., the finite energy edge states of the starting…
Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting logical properties. Indeed, the model-checking problem for…
Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising information in a parameterized version of the Betti numbers, i.e. the…
Characterizing accurately chaotic behaviors is not a trivial problem and must allow to determine the properties that two given chaotic invariant sets share or not. The underlying problem is the classification of chaotic regimes, and their…