Related papers: A Combinatorial Study of the Fixed Point Index
We prove a fixed point theorem that combines the contraction mapping principle and some Knaster-Tarski-like theorem. As a consequence we obtain an existence theorem to initial value problem for ordinary differential equation with…
We study the problem of invariance of indices of thematic factorizations. Such factorizations were introduced in [PY1] for studying superoptimal approximation by bounded analytic matrix functions. As shown in [PY1], the indices may depend…
A Legendre transform of the recently discovered conformal fixed-point equation is constructed, providing an unintegrated equation encoding full conformal invariance within the framework of the effective average action.
We introduce an alternative approach for constrained mathematical programming problems. It rests on two main aspects: an efficient way to compute optimal solutions for unconstrained problems, and multipliers regarded as variables for a…
We give applications of the higher Lefschetz theorems for foliations of [BH10], primarily involving Haefliger cohomology. These results show that the transverse structures of foliations carry important topological and geometric information.…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…
Geometric properties of the fixed point set $Fix(f)$ of a self-mapping $f$ on a metric or a generalized metric space is an attractive issue. The set $Fix(f)$ can contain a geometric figure (a circle, an ellipse, etc.) or it can be a…
This article generalizes the work of Ballmann and \'Swiatkowski to the case of Reflexive Banach spaces and uniformly convex Busemann spaces, thus giving a new fixed point criterion for groups acting on simplicial complexes.
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…
We review some relations occurring between the combinatorial intersection theory on the moduli spaces of stable curves and the asymptotic behavior of the 't Hooft-Kontsevich matrix integrals. In particular, we give an alternative proof of…
In this note, we consider a framework for the analysis of iterative algorithms which can described in terms of a structured set-valued operator. More precisely, at each point in the ambient space, we assume that the value of operator can be…
We use the method of monotone iterations to obtain fixed point and coupled fixed point results for mixed monotone operators in the setting of partially ordered sets, with no additional assumptions on the partial order and with no…
We continue the work of [10], studying properties of digital images determined by fixed point invariants. We introduce pointed versions of invariants that were introduced in [10]. We introduce freezing sets and cold sets to show how the…
The classical Ruckert-Lefschetz scheme of analysis of implicit functions (defined by finite systems of n analytical equations with n unknowns) is studied from the point of view of calculations with finite number coefficients in Taylor…
We employ the derivative expansion of the nonperturbative renormalization group to address the phenomenon of anisotropic scale invariance and the associated functional fixed points, also known as Lifshitz points, in systems characterized by…
The study of fixed point ratios is a classical topic in permutation group theory, with a long history stretching back to the origins of the subject in the 19th century. Fixed point ratios arise naturally in many different contexts, finding…
Index spaces serve as valuable metric models for studying properties relevant to various applications, such as social science or economics. These properties are represented by real Lipschitz functions that describe the degree of association…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
Both the Klein-Williams invariant $\ell_G(f)$ from \cite{KW2} and the generalized equivariant Lefschetz invariant $\lambda_G(f)$ from \cite{weber07} serve as complete obstructions to the fixed point problem in the equivariant setting. The…
Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative…