相关论文: Positive circuits and maximal number of fixed poin…

We calculate the relaxational dynamical critical behavior of systems of $O(n_\|)\oplus O(n_\perp)$ symmetry by renormalization group method within the minimal subtraction scheme in two loop order. The three different bicritical static…

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…

Macbeath gave a formula for the number of fixed points for each non-identity element of a cyclic group of automorphisms of a compact Riemann surface in terms of the universal covering transformation group of the cyclic group. We observe…

We consider dynamical systems given by interval maps with a finite number of turning points (including critical points, discontinuities) possibly of different critical orders from two sides. If such a map $f$ is continuous and piecewise…

In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…

We discuss the problem of finding an upper bound for the number of equilibrium points of a potential of several fixed point charges in R^n. This question goes back to J.C.Maxwell and M.Morse. Using fewnomial theory we show that for a given…

Let $M$ be a nilmanifold with a fundamental group which is free $2$-step nilpotent on at least 4 generators. We will show that for any nonnegative integer $n$ there exists a self-diffeomorphism $h_n$ of $M$ such that $h_n$ has exactly $n$…

We establish several delay-independent criteria for the existence and stability of positive periodic solutions of n-dimensional nonautonomous functional differential equation by several fixed point theorems. Examples from positive and…

Reaction systems are discrete dynamical systems that model biochemical processes in living cells using finite sets of reactants, inhibitors, and products. We investigate the computational complexity of a comprehensive set of problems…

We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles…

By Northcott's Theorem there are only finitely many algebraic points in affine $n$-space of fixed degree over a given number field and of height at most $X$. For large $X$ the asymptotics of these cardinalities have been investigated by…

The dynamics of a linear dynamical system over a finite field can be described by using the elementary divisors of the corresponding matrix. It is natural to extend the investigation to a general finite commutative ring. In a previous…

The coupling constants of fixed points in the $\epsilon$ expansion at one loop are known to satisfy a quadratic bound due to Rychkov and Stergiou. We refer to fixed points that saturate this bound as extremal fixed points. The theories…

Suppose $f$ is a polynomial in $n$ variables with real coefficients, exactly $n+k$ monomial terms, and Newton polytope of positive volume. Estimating the number of connected components of the positive zero set of $f$ is a fundamental…

The recently introduced continuous Hopfield network (see Ramsauer et al.) exhibits large memorization capabilities, which manifest as attractive fixed points of its update rule -- a differentiable function consisting of two linear mappings…

We study the fixed point set in the ideal boundary of a parabolic isometry of a proper CAT(0)-space. We show that the radius of the fixed point set is at most pi/2, and study its centers. As a consequence, we prove that the set of fixed…

The asymptotic behaviour of deterministic logit dynamics in heterogeneous routing games is analyzed. It is proved that in directed multigraphs with parallel routes, and in series composition of such multigraphs, the dynamics admits a…

The \textit{node reliability} of a graph $G$ is the probability that at least one node is operational and that the operational nodes can all communicate in the subgraph that they induce, given that the edges are perfectly reliable but each…

We develop a necessary condition for the existence of stable fixed points for the general network Kuramoto model, and use it to show that for the complete network the homogeneous model has no non-zero stable fixed point solution. This…

Central configurations play an important role in the dynamics of the $n$-body problem: they occur as relative equilibria and as asymptotic configurations in colliding trajectories. We illustrate how they can be found as projective fixed…