Related papers: Pseudo-jump inversion and SJT-hard sets
We consider the construction of pseudospin bases for a time-reversal and inversion symmetric system, illustrated by a model for Cu:Bi$_2$Se$_3$. Different methods and bases are compared.
The process by which jet algorithms construct jets and subjets is inherently ambiguous and equally well motivated algorithms often return very different answers. The Qjets procedure was introduced by the authors to account for this…
Metastable behavior in dynamical systems may be a significant challenge for a simulation based analysis. In recent years, transfer operator based approaches to problems exhibiting metastability have matured. In order to make these…
Soft sets, as a mathematical tool for dealing with uncertainty, have recently gained considerable attention, including some successful applications in information processing, decision, demand analysis, and forecasting. To construct new soft…
We show that there exists an invertible $\mathcal{U}$-frequently hypercyclic operator on $\ell^p(\mathbb{N})$ ($1\le p <\infty$) whose inverse is not $\mathcal{U}$-frequently hypercyclic.
We prove a precise inversion of adjunction formula for the log pair associated to a non-degenerate hypersurface. As a corollary, the minimal log discrepancies of non-degenerate normal hypersurface singularities are bounded from above by…
We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and…
Our focus will be on the computably enumerable (c.e.) sets and trivial, non-trivial, Friedberg, and non-Friedberg splits of the c.e. sets. Every non-computable set has a non-trivial Friedberg split. Moreover, this theorem is uniform. V. Yu.…
Given a natural number $k\ge 2$ and a $k$-automatic set $S$ of natural numbers, we show that the lower density and upper density of $S$ are recursively computable rational numbers and we provide an algorithm for computing these quantities.…
We show that all countable subsets of any pseudocompact quasitopological group in the form of a Korovin orbit are closed, discrete, and $C^\ast$-embedded. Consequently, any infinite pseudocompact Korovin orbit is not homeomorphic to a…
We prove that a homeomorphism of the torus homotopic to the identity whose rotation set is reduced to a single totally irrational vector is chain-recurrent. In fact, we show that pseudo-orbits can be chosen with a small number of jumps, in…
In combinatorial reconfiguration, the reconfiguration problems on a vertex subset (e.g., an independent set) are well investigated. In these problems, some tokens are placed on a subset of vertices of the graph, and there are three natural…
We construct three different families of commuting pairs of subnormal operators, jointly hyponormal but not admitting commuting normal extensions. Each such family can be used to answer in the negative a 1988 conjecture of R. Curto, P.…
Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions,…
We focus on the geometrical reformulation of free higher spin supermultiplets in $4\rm{D},~\mathcal{N}=1$ flat superspace. We find that there is a de Wit-Freedman like hierarchy of superconnections with simple gauge transformations. The…
We obtain a Disjoint Frequent Hypercyclicity Criterion and show that it characterizes disjoint frequent hypercyclicity for a family of unilateral pseudo-shifts on $c_0(\mathbb{N})$ and $\ell^p(\mathbb{N})$, $1\le p <\infty$. As an…
To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…
In this paper, we prove that a pseudoexponential field has continuum many non-isomorphic countable real closed exponential subfields, each with an order preserving exponential map which is surjective onto the nonnegative elements. Indeed,…
Semi-invertible multiplicative ergodic theorems establish the existence of an Oseledets splitting for cocycles of non-invertible linear operators (such as transfer operators) over an invertible base. Using a constructive approach, we…
Pseudo-random operators consist of sets of operators that exhibit many of the important statistical features of uniformly distributed random operators. Such pseudo-random sets of operators are most useful whey they may be parameterized and…