Related papers: Pseudo-jump inversion and SJT-hard sets
Given a differential equation with infinite-dimensional symmetry pseudo-group it is shown, using an example, that it is generally not possible to construct enough joint invariants to form an invariant numerical scheme of the equation. To…
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…
We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…
The purpose of this paper is to study pseudo-Euclidean and symplectic Hom-alternative superalgebras and discuss some of their proprieties and provide construction procedures. We also introduce the notion of Rota-Baxter operators of…
Open sets are central to mathematics, especially analysis and topology, in ways few notions are. In most, if not all, computational approaches to mathematics, open sets are only studied indirectly via their 'codes' or 'representations'. In…
If $T$ is a polynomially bounded operator, $\mathcal M$ is an invariant subspace of $T$, $T|_{\mathcal M}$ is a unilateral shift and $T^*|_{\mathcal M^\perp}$ is subnormal, then $T$ has a nontrivial hyperinvariant subspace. If an operator…
Let $T$ be an absolutely continuous polynomially bounded operator, and let $\theta$ be a singular inner function. It is shown that if $\theta(T)$ is invertible and some additional conditions are fulfilled, then $T$ has nontrivial…
In this note we give answers to questions posed to us by J.Milnor and M.Shub, which shed further light on the structure of non-computable Julia sets.
A differentiable function is pseudoconvex if and only if its restrictions over straight lines are pseudoconvex. A differentiable function depending on one variable, defined on some closed interval $[a,b]$ is pseudoconvex if and only if…
Efficient representations of convex sets are of crucial importance for many algorithms that work with them. It is well-known that sometimes, a complicated convex set can be expressed as the projection of a much simpler set in higher…
We elaborate on the structure of higher-spin $\mathcal{N}=2$ supercurrent multiplets in four dimensions. It is shown that associated with every conformal supercurrent $J_{\alpha(m) \dot{\alpha}(n)}$ (with $m,n$ non-negative integers) is a…
We call an operator algebra A {\em reversible} if A with reversed multiplication is also an abstract operator algebra (in the modern operator space sense). This class of operator algebras is intimately related to the {\em symmetric operator…
It is known that non-commuting observables in quantum mechanics do not have joint probability. This statement refers to the precise (additive) probability model. I show that the joint distribution of any non-commuting pair of variables can…
Theories of rough sets and soft sets are powerful mathematical tools for modelling various types of vagueness. Hybrid model combining a rough set with a soft set which is called soft rough set proposed by Feng et al. [3] in 2010. In this…
Numerical inversion is a general detector calibration technique that is independent of the underlying spectrum. This procedure is formalized and important statistical properties are presented, using high energy jets at the Large Hadron…
Recently a new family of pseudo effect algebras, called kite pseudo effect algebras, was introduced. Such an algebra starts with a po-group $G$, a set $I$ and with two bijections $\lambda,\rho:I \to I.$ Using a clever construction on the…
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior as a typical point of the system. It was proved in [Avigad et al. 2010,…
The Composite Operator Method (COM) is formulated, its internals illustrated in detail and some of its most successful applications reported. COM endorses the emergence, in strongly correlated systems (SCS), of composite operators,…
In comparing well-known CRDTs representing sets that can grow and shrink, we find caveats. In one, the removal of an element cannot be reliably undone. In another, undesirable states are attainable, such as when an element is present -1…
The perfect NOT transformation, probabilistic perfect NOT transformation and conjugate transformation are studied. Perfect NOT transformation criteria on a quantum state set $S$ of a qubit are obtained. Two necessary and sufficient…