English
Related papers

Related papers: On the computability of rotation sets and their en…

200 papers

We prove the computability of a version of Whitney Extension, when the input is suitably represented. More specifically, if $F \subseteq \mathbb{R}^n$ is a closed set represented so that the distance function $x \mapsto d(x,F)$ can be…

Logic · Mathematics 2026-04-07 Andrea Brun , Guido Gherardi , Alberto Marcone

Assume that the vertices of a graph $G$ are always operational, but the edges of $G$ fail independently with probability $q \in[0,1]$. The \emph{all-terminal reliability} of $G$ is the probability that the resulting subgraph is connected.…

Combinatorics · Mathematics 2018-10-01 J. I. Brown , C. D. C. DeGagne

We extend rotation theory of circle maps to tiling spaces. Specifically, we consider a 1-dimensional tiling space $\Omega$ with finite local complexity and study self-maps $F$ that are homotopic to the identity and whose displacements are…

Dynamical Systems · Mathematics 2021-08-04 José Aliste-Prieto , Betseygail Rand , Lorenzo Sadun

Let $X$ be an irreducible shift of finite type (SFT) of positive entropy, and let $B_n(X)$ be its set of words of length $n$. Define a random subset $\omega$ of $B_n(X)$ by independently choosing each word from $B_n(X)$ with some…

Probability · Mathematics 2012-04-09 Kevin McGoff

We present the following reflexivity-like result concerning the automorphism group of the $C^*$-algebra B(H), H being a separable Hilbert space. Let $\phi:B(H)\to B(H)$ be a multiplicative map (no linearity or continuity is assumed) which…

Operator Algebras · Mathematics 2007-05-23 Lajos Molnar

We develop the basic properties of an essentially new closure operation on submodules, the \emph{liftable integral closure} of a submodule, including its relationships with the two prevailing notions of integral closure of submodules. We…

Commutative Algebra · Mathematics 2014-07-24 Neil Epstein , Bernd Ulrich

Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational…

Logic in Computer Science · Computer Science 2018-12-11 Akitoshi Kawamura , Donghyun Lim , Svetlana Selivanova , Martin Ziegler

The concept of distinguishability lies at the heart of quantum information theory. We introduce \textit{left-right relative entropy} as a quantitative measure of distinguishability within the space of boundary states in two-dimensional…

High Energy Physics - Theory · Physics 2026-05-26 Mostafa Ghasemi

Given a compact metric space $X$ and an upper semicontinuous function $F\colon X \to 2^X$, we explore the dynamic system $(X,F)$. In this study, we introduce new concepts, demonstrate various results, and provide numerous examples. In…

Dynamical Systems · Mathematics 2025-07-17 Jeison Amorocho , Javier Camargo , Sergio Macías

We discuss some properties of the generalized entropies, called Renyi entropies and their application to the case of continuous distributions. In particular it is shown that these measures of complexity can be divergent, however, their…

Disordered Systems and Neural Networks · Physics 2007-05-23 I. Varga , J. Pipek

We consider a complete metric space $(X,d)$ and a countable number of contractive mappings on $X$, $\mathcal{F}=\{F_i:i\in\mathbb N\}$. We show the existence of a {\em smallest} invariant set (with respect to inclusion) for $\mathcal{F}$.…

Classical Analysis and ODEs · Mathematics 2013-07-04 Maria Fernanda Barrozo , Ursula Molter

In 1991 Llibre and MacKay proved that if $f$ is a 2-torus homeomorphism isotopic to identity and the rotation set of $f$ has a non empty interior then $f$ has positive topological entropy. Here, we give a converselike theorem. We show that…

Dynamical Systems · Mathematics 2015-05-13 Heber Enrich , Nancy Guelman , Audrey Larcanché , Isabelle Liousse

Let $F$ be a nonarchimedean local field and consider the action of the reductive group SO$_3(F)$ on the spherical variety (U$_3$/O$_3)(F)$. We compute the endoscopic orbital integrals of the basic function in this situation. Knowing the…

Number Theory · Mathematics 2022-02-25 Chung-Ru Lee

We prove that there is no algorithm to decide whether a given integer vector is in the closure of the entropic cone $\overline{\Gamma_{n}^{*}}$. Equivalently, there is no decision procedure to determine whether a given integer-valued…

Combinatorics · Mathematics 2025-09-09 Geva Yashfe

We express the entropy of a scalar field phi directly in terms of its spacetime correlation function W(x,y) = <phi(x) phi(y)>, assuming that the higher correlators are of "Gaussian" form. The resulting formula associates an entropy S(R) to…

High Energy Physics - Theory · Physics 2012-05-15 Rafael D. Sorkin

Let $(M,g)$ be a compact manifold with Ricci curvature almost bounded from below and $\pi:\bar{M}\to M$ be a normal, Riemannian cover. We show that, for any nonnegative function $f$ on $M$, the means of $f\o\pi$ on the geodesic balls of…

Differential Geometry · Mathematics 2008-11-26 E. Aubry

For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…

Logic · Mathematics 2013-10-23 Ivan Georgiev , Dimiter Skordev

For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…

Logic in Computer Science · Computer Science 2017-12-05 Lane A. Hemaspaandra , Daniel Rubery

Given an equivalence class $[A]$ in the measure algebra of the Cantor space, let $\hat\Phi([A])$ be the set of points having density 1 in $A$. Sets of the form $\hat\Phi([A])$ are called $\mathcal{T}$-regular. We establish several results…

Logic · Mathematics 2011-05-18 Alessandro Andretta , Riccardo Camerlo

The approximation of natural numbers subsets has always been one of the fundamental issues in computability theory. Computable approximation, $\Delta_2$-approximation, as well as introducing the generically computable sets have been some…

Logic in Computer Science · Computer Science 2019-02-12 Mohsen Mansouri , Farzad Didehvar