中文
相关论文

相关论文: Monotone Versions of Countable Paracompactness

200 篇论文

Recently, Bercovici has introduced multiplicative convolutions based on Muraki's monotone independence and shown that these convolution of probability measures correspond to the composition of some function of their Cauchy transforms. We…

概率论 · 数学 2021-04-21 Uwe Franz

To study a noncompact Riemannian manifold, it is often useful to find a compactification. We discuss several common compactifications and survey some recent results.

微分几何 · 数学 2010-12-15 Xiaodong Wang

We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesting properties. Our main focus is on properties of the topological derivatives and subpattern posets of these objects. We present a countable…

动力系统 · 数学 2013-10-03 Ville Salo , Ilkka Törmä

We present a Morse-theoretic characterization of collapsibility for 2-dimensional acyclic simplicial complexes by means of the values of normalized optimal combinatorial Morse functions.

代数拓扑 · 数学 2020-12-16 Nicolás A. Capitelli

A short review is given of some theoretical approaches to CPT violation. A potentially realistic possibility is that small apparent breaking of CPT and Lorentz symmetry could arise at the level of the standard model from spontaneous…

高能物理 - 唯象学 · 物理学 2007-05-23 Alan Kostelecky

The purpose of this paper is to characterize the concept of monotonicity according to a direction related to a set of n random variables in terms of its associated n-copula C. We start establishing relationships in the bivariate and…

Various topics concerning the entanglement of composite quantum systems are considered with particular emphasis concerning the strict relations of such a problem with the one of attributing objective properties to the constituents. Most of…

量子物理 · 物理学 2007-05-23 Giancarlo Ghirardi , Luca Marinatto , Tullio Weber

Deviations from statistical isotropy can be modeled in various ways, for instance, anisotropic cosmological models (Bianchi models), compact topologies and presence of primordial magnetic field. Signature of anisotropy manifests itself in…

宇宙学与河外天体物理 · 物理学 2010-05-12 Nidhi Joshi , Sanjay Jhingan , Tarun Souradeep , Amir Hajian

A ccc-generically supercompact cardinal $\kappa$ can be smaller than or equal to the continuum. On the other hand, such a cardinal $\kappa$ still satisfies diverse largeness properties, like that it is a stationary limit of ccc-generically…

逻辑 · 数学 2022-02-17 Sakaé Fuchino , Hiroshi Sakai

Properties of solutions of the tensor complementarity problem (TCP) for structured tensors have been investigated in recent literature. In this paper, we make further contributions on this problem. Specifically, we first derive solution…

最优化与控制 · 数学 2018-07-24 Wen Yu , Chen Ling , Hongjin He

This article focuses on properties of monotone convolutions. A criterion for infinite divisibility and time evolution of convolution semigroups are mainly studied. In particular, we clarify that many analogues of the classical results of…

算子代数 · 数学 2010-08-30 Takahiro Hasebe

Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…

形式语言与自动机理论 · 计算机科学 2025-11-27 A. R. Balasubramanian , Matthew Hague , Rupak Majumdar , Ramanathan S. Thinniyam , Georg Zetzsche

This is a survey of most important results and unsolved problems about homogeneous finite-dimensional metric $ANR$-compacta. We also discuss some partial results and possible ways of solutions.

一般拓扑 · 数学 2020-03-17 Vesko Valov

A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $A = BB^T$. We characterize the interior of the CP cone. A semidefinite algorithm is proposed for checking interiors of the CP…

最优化与控制 · 数学 2014-01-08 Anwa Zhou , Jinyan Fan

We discuss some claims that certain UCOMP devices can perform hypercomputation (compute Turing-uncomputable functions) or perform super-Turing computation (solve NP-complete problems in polynomial time). We discover that all these claims…

新兴技术 · 计算机科学 2017-03-24 Hajo Broersma , Susan Stepney , Goran Wendin

Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues that recent parameterized complexity results provide insight into…

人工智能 · 计算机科学 2015-05-19 Toby Walsh

Spaces of quasi-invariant measures supplied with different topologies are studied. Their embeddings, projective decompositions, conditions for their metrizability are investigated. Theorems about convergence of nets of quasi-invariant…

概率论 · 数学 2016-06-08 Sergey Victor Ludkowski

We consider the conjugacy problem for the automorphism groups of a number of countable homogeneous structures. In each case we find the precise complexity of the conjugacy relation in the sense of Borel reducibility.

逻辑 · 数学 2019-08-16 Samuel Coskey , Paul Ellis

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

经典分析与常微分方程 · 数学 2020-08-05 Karl Dilcher , Maciej Ulas

Compositionality is a widely discussed property of natural languages, although its exact definition has been elusive. We focus on the proposal that compositionality can be assessed by measuring meaning-form correlation. We analyze…

计算与语言 · 计算机科学 2020-12-08 Timothee Mickus , Timothée Bernard , Denis Paperno