Related papers: On g-functions for countable state subshifts
Inspired by a recent novel work of Good and Meddaugh, we establish fundamental connections between shadowing, finite order shifts, and ultrametric complete spaces. We develop a theory of shifts of finite type for infinite alphabets. We call…
Uninorms with continuous underlying t-norm and t-conorm are discussed and properties of the set of discontinuity points of such a uninorm are shown. This set is proved to be a subset of the graph of a special symmetric, surjective,…
We study (relative) $\mathcal K$-Mittag-Leffler modules as was done in the author's habilitation thesis, rephrase old, unpublished results in terms of definable subcategories, and present newer ones, culminating in a characterization of…
This paper outlines an application of iterated version of generalised sequential crossover of two languages (which in some sense, an abstraction of the crossover of chromosomes in living organisms) in studying some classes of the newly…
In this paper we search for conditions on a countably compact (pseudo-compact) topological semigroup under which: (i) each maximal subgroup $H(e)$ in $S$ is a (closed) topological subgroup in $S$; (ii) the Clifford part $H(S)$(i.e. the…
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…
Compounding submodular monotone (i.e. 2-alternating) set functions on a finite set preserves this property, as shown in 2010. A natural generalization to k-alternating functions was presented in 2018, however hardly readable because of page…
Starting from arbitrary Hilbert spaces, we reduce the problem to verify entanglement of any bipartite quantum state to finite dimensional subspaces. Hence, entanglement is a finite dimensional property. A generalization for multipartite…
A subshift of finite type over finitely many symbols can be described as a collection of all infinite walks on a digraph with at most a single edge from a vertex to another. The associated finite set $\F$ of forbidden words is a constraint…
GHZ paradoxes are presented for all even numbers of qubits from four up. They are obtained from proofs of the Kochen-Specker (KS) theorem by showing how the assumption of noncontextuality can be justified on the basis of locality. The…
We show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime. More precisely, we establish a dimensional characterization of…
The Cahill-Glauber approach for quantum mechanics on phase-space is extended to the finite dimensional case through the use of discrete coherent states. All properties and features of the continuous formalism are appropriately generalized.…
This paper considers how to obtain MCMC quantitative convergence bounds which can be translated into tight complexity bounds in high-dimensional {settings}. We propose a modified drift-and-minorization approach, which establishes…
The exact and stable evolutions of generalized coherent states (GCS) for quantum systems are considered by making use of the time-dependent integrals of motion method and of the Klauder approach to the relationship between quantum and…
Moebius number systems represent points using sequences of Moebius transformations. Thorough the paper, we are mainly interested in representing the unit circle (which is equivalent to representing R\cup\{\infty\}). The main aim of the…
We generalize Wagoner's representation of the automorphism group of a two-sided subshifts of finite type as the fundamental group of a certain CW-complex to groupoids having a certain refinement structure. This significantly streamlines the…
Let K be an algebraically closed field, X a K-scheme, and X(K) the set of closed points in X. A constructible set C in X(K) is a finite union of subsets Y(K) for finite type subschemes Y in X. A constructible function f : X(K) --> Q has…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
For an ergodic probability-measure-preserving action $G \curvearrowright (X, \mu)$ of a countable group $G$, we define the Rokhlin entropy $h_G^{\mathrm{Rok}}(X, \mu)$ to be the infimum of the Shannon entropies of countable generating…
This paper provides necessary and sufficient conditions for constructing a universal quantum computer over continuous variables. As an example, it is shown how a universal quantum computer for the amplitudes of the electromagnetic field…