Related papers: The Universal Cardinal Ordering of Fixed Points
New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
We investigate the dynamics of the well-known RSK bijection on permutations when iterated on various reading words of the recording tableau. In the setting of the ordinary (row) reading word, we show that there is exactly one fixed point…
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…
We study the fixed point problem for a system of multivariate operators that are coordinate-wise monotone (i.e., nondecreasing or nonincreasing in each of the variables, independently), in the setting of quasi-ordered sets. We show that…
It might be anticipated that there is statistical universality in the long-time classical dynamics of chaotic systems, corresponding to the universal correspondence of their quantum spectral statistics with random matrix models. We argue…
We present here a new method which applies well ordered symbolic dynamics to find unstable periodic and non-periodic orbits in a chaotic system. The method is simple and efficient and has been successfully applied to a number of different…
The relationship between geometric and variational principles remains central to Nonlinear Analysis. This paper introduces the \textbf{Orbit-Summability Fixed Point Criterion}, a novel, purely dynamical condition, and establishes its…
We consider the $N$-body problem of celestial mechanics in spaces of nonzero constant curvature. Using the concept of locked inertia tensor, we compute the moment of inertia for systems moving on spheres and hyperbolic spheres and show that…
This paper describes an alternative method of generating fixed points of certain substitution systems. This method centres on taking infinite words consisting of one repeated letter per word. These infinite words are then interlaced to form…
Canonical orderings of planar graphs have frequently been used in graph drawing and other graph algorithms. In this paper we introduce the notion of an $(r,s)$-canonical order, which unifies many of the existing variants of canonical…
As it is known various dynamical processes can be modeled through the systems of time-fractional order pseudo-differential equations. In the modeling process one frequently faces with determining the adequate orders of time-fractional…
We introduce the notion of a critical cardinal as the critical point of sufficiently strong elementary embedding between transitive sets. Assuming the axiom of choice this is equivalent to measurability, but it is well-known that choice is…
If we assume the axiom of choice, then every two cardinal numbers are comparable. In the absence of the axiom of choice, this is no longer so. For a few cardinalities related to an arbitrary infinite set, we will give all the possible…
We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…
We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each…
We introduce a notion of natural orderings of elements of finite connected quandles of order $n$. When the elements of such a quandle $Q$ are already ordered naturally, any automophism on $Q$ is a natural ordering. Although there are many…
The paper contains a proof of the conjecture of M. Klin and D. Maru$\breve{\rm s}$i$\breve{\rm c}$ that an automorphism group of a transitive graph contains a permutation, decomposed in cycles of the same length. The proof is based on the…
If every point of a unital is fixed by a non-trivial translation and at least one translation has order two then the unital is classical (i.e., hermitian).
The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…