Related papers: Fixed points of Boolean networks, guessing graphs,…
A point x is a (bow) tie-point of a space X if X setminus {x} can be partitioned into (relatively) clopen sets each with x in its closure. Tie-points have appeared in the construction of non-trivial autohomeomorphisms of betaN setminus N…
As a result of the interaction of rapid development and competition in information technologies, the reliability of a network and how solid it remains is important. It is called the hat vulnerability of the network to measure the endurance…
We discuss some results concerning fixed point equations in the setting of topological *-algebras of unbounded operators. In particular, an existence result is obtained for what we have called {\em weak $\tau$ strict contractions}, and some…
The topic of fixed points in digital metric spaces has drawn yet more publications with assertions that are incorrect, incorrectly proven, trivial, or incoherently stated. We discuss publications with bad assertions concerning fixed points…
We give a new proof of the result that if f and g are transcendental entire functions, then the composite function f(g) has infinitely many fixed points. The method yields a number of generalization of this result. In particular, it extends…
We prove that the graph of a discontinuous $n$-monomial function $f:\mathbb{R}\to\mathbb{R}$ is either connected or totally disconnected. Furthermore, the discontinuous monomial functions with connected graph are characterized as those…
We recursively define a sequence $\{F_{n,k}\}_{n,k\in\mathbb N }$ and we prove that such sequence contains only the symbols $\{0,1\}.$ We investigate some number-theoretic properties of such sequence and of the way it can be generated. The…
We study the fixed point sets of holomorphic self-maps of a bounded domain in ${\Bbb C}^n$. Specifically we investigate the least number of fixed points in general position in the domain that forces any automorphism (or endomorphism) to be…
A neural network with fixed topology can be regarded as a parametrization of functions, which decides on the correlations between functional variations when parameters are adapted. We propose an analysis, based on a differential geometry…
We define the notion of affine rigidity of a hypergraph and prove a variety of fundamental results for this notion. First, we show that affine rigidity can be determined by the rank of a specific matrix which implies that affine rigidity is…
Previous work in Boolean dynamical networks has suggested that the number of components that must be controlled to select an existing attractor is typically set by the number of attractors admitted by the dynamics, with no dependence on the…
In this paper, considering a wider class of simulation functions some fixed point results for multivalued mappings in $\alpha$-complete metric spaces have been presented. Results obtained in this paper extend and generalize some well-known…
Fixed points for scalar theories in $4-\varepsilon$, $6-\varepsilon$ and $3-\varepsilon$ dimensions are discussed. It is shown how a large range of known fixed points for the four dimensional case can be obtained by using a general…
If $f:[a,b]\to \mathbb{R}$, with $a<b$, is continuous and such that $a$ and $b$ are mapped in opposite directions by $f$, then $f$ has a fixed point in $I$. Suppose that $f:\mathbb{C}\to\mathbb{C}$ is map and $X$ is a continuum. We extend…
In this article, a new class of operators, termed Ad-contractions, is introduced to extend the framework of A-contractions to the setting of dislocated metric spaces. Fixed point results are established for single mappings, sequences of…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
In this paper, we address the formal characterization of targets triggering cellular trans-differentiation in the scope of Boolean networks with asynchronous dynamics. Given two fixed points of a Boolean network, we are interested in all…
The dynamical properties of finite dynamical systems (FDSs) have been investigated in the context of coding theoretic problems, such as network coding and index coding, and in the context of hat games, such as the guessing game and…
In the renormalisation analysis of critical phenomena in quasi-periodic systems, a fundamental role is often played by fixed points of functional recurrences of the form \begin{equation*} f_{n}(x) = \sum_{i=1}^\ell a_i(x) f_{n_i}…
We leverage the framework of hyperplane arrangements to analyze potential regions of (stable) fixed points. We provide an upper bound on the number of fixed points for multi-layer neural networks equipped with piecewise linear (PWL)…