Related papers: Force recurrence near zero
We give extensive characterizations for an open subset of an affine space of arbitrary dimension, resp. of an inverse limit of prime spectra to be quasi-compact. Among other things weak stability, retro-compactness, and cylinder sets…
A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…
Diagonal lines in symbolic recurrence plots are closely related to the identification and characterization of specific biprolongable words within a sequence. In this paper we focus on the recurrence plot of a fixed point of a uniform binary…
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…
Positive $C_0$-semigroups that occur in concrete applications are, more often than not, irreducible. Therefore a deep and extensive theory of irreducibility has been developed that includes characterizations, perturbation analysis, and…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
In this paper, we study (zero) forcing sets which induce connected subgraphs of a graph. The minimum cardinality of such a set is called the connected forcing number of the graph. We provide sharp upper and lower bounds on the connected…
We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and…
Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…
We investigate a slight weakening of the classical property of strong approximation, which we call almost strong approximation, for connected reductive algebraic groups over global fields with respect to special sets of valuations. While…
In the present work we review and refine some results about fixed points of semigroups of quantum channels. Noncommutative potential theory enables us to show that the set of fixed points of a recurrent semigroup is a W*-algebra; aside from…
We initiate the study of pseudofiniteness in continuous logic. We introduce a related concept, namely that of pseudocompactness, and investigate the relationship between the two concepts. We establish some basic properties of…
The Yang-Lee, Fisher and Potts zeros of the one-dimensional Q-state Potts model are studied using the theory of dynamical systems. An exact recurrence relation for the partition function is derived. It is shown that zeros of the partition…
A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…
We discuss the effects of common synaptic inputs in a recurrent neural network. Because of the effects of these common synaptic inputs, the correlation between neural inputs cannot be ignored, and thus the network exhibits sample…
The Skolem Problem asks to determine whether a given integer linear recurrence sequence has a zero term. This problem arises across a wide range of topics in computer science, including loop termination, formal languages, automata theory,…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
Error: Peer-review process exposed an error in Theorem 1 that, unfourtunately, is not repairable. Idempotent semigroups are always finite. See Green and Rees [1952], Siekmann and Szab\'o [1981] for details Anti-unification is a fundamental…
The (disjoint) fort number and fractional zero forcing number are introduced and related to existing parameters including the (standard) zero forcing number. The fort hypergraph is introduced and hypergraph results on transversals and…
This paper clarifies the picture about Dense-choice Counter Machines, which have been less studied than (discrete) Counter Machines. We revisit the definition of "Dense Counter Machines" so that it now extends (discrete) Counter Machines,…