Results 1 to 10 of about 1,556,595 (219)

Suspended fixed points

open access: yesNuclear Physics B, 2022
We study the orientifold of the ${\mathcal{N}} = 1$ superconformal field theories describing D3-branes probing the Suspended Pinch Point singularity, as well as the orientifolds of non-chiral theories obtained by a specific orbifold $\mathbb{Z}_n$ of SPP.
Andrea Antinucci   +3 more
openaire   +6 more sources

Fixed points and homotopy fixed points

open access: yesCommentarii Mathematici Helvetici, 1988
Let G be a finite group, EG be a free contractible G-space, and define \(X^{hG}=Map_ G(EG,X)\) (equivariant mapping space). The main theorem of this paper proves that the following two statements are equivalent (Theorem A): (1) G is a p-group. (2) For every finite G-simplicial complex X, the fixed point set \(X^ G=\emptyset\) if and only if \(X^{hG ...
Zabrodsky, A., Dror Farjoun, E.
openaire   +1 more source

On fixed points of permutations [PDF]

open access: yesJournal of Algebraic Combinatorics, 2008
The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete classification of the limiting distributions is given.
Diaconis, Persi   +2 more
openaire   +3 more sources

Fixed Point Logics

open access: yesThe Bulletin of Symbolic Logic, 2002
AbstractWe consider fixed point logics, i.e., extensions of first order predicate logic with operators defining fixed points. A number of such operators, generalizing inductive definitions, have been studied in the context of finite model theory, including nondeterministic and alternating operators. We review results established in finite model theory,
Dawar, Anuj, Gurevich, Yuri
openaire   +2 more sources

Fixed point combinators as fixed points of higher-order fixed point generators

open access: yesLogical Methods in Computer Science, 2020
Corrado B\"ohm once observed that if $Y$ is any fixed point combinator (fpc), then $Y(\lambda yx.x(yx))$ is again fpc. He thus discovered the first "fpc generating scheme" -- a generic way to build new fpcs from old. Continuing this idea, define an $\textit{fpc generator}$ to be any sequence of terms $G_1,\dots,G_n$ such that
openaire   +5 more sources

FIXED POINTS AND APPROXIMATE FIXED POINTS IN PRODUCT SPACES

open access: yesTaiwanese Journal of Mathematics, 2001
The paper deals with the general theme of what is known about the existence of fixed points and approximate fixed points for mappings which satisfy geometric conditions in product spaces. In particular it is shown that if X and Y are metric spaces each of which has the fixed point property for nonexpansive mappings, then the product space (X ×Y )∞ has ...
Espínola, R., Kirk, W. A.
openaire   +5 more sources

Bounded Fixed Point Iteration

open access: yesDAIMI Report Series, 1991
In the context of abstract interpretation for languages without higher-order features we study the number of times a functional need to be unfolded in order to give the least fixed point. For the cases of total or monotone functions we obtain an exponential bound and in the case of strict and additive (or distributive) functions we obtain a quadratic ...
Hanne Riis Nielson, Flemming Nielson
openaire   +4 more sources

Intuitionistic fixed point logic [PDF]

open access: yesAnnals of Pure and Applied Logic, 2021
We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract computational content from proofs about abstract structures specified by arbitrary classically true disjunction ...
Ulrich Berger 0001, Hideki Tsuiki
openaire   +3 more sources

On Essential Fixed Points [PDF]

open access: yesProceedings of the American Mathematical Society, 1959
Wenn jede stetige Abbildung des kompakten Hausdorffschen Raumes \(X\) in sich wenigstens einen Fixpunkt hat, so ist \(p \in X\) wesentlicher Fixpunkt von \(f: X \rightarrow p\). [\glqq Wesentlich\grqq{} bedeutet: Zu jeder Umgebung \(U\) von \(p\) gibt es in \(X^X\) (kompakt-offen topologisiert) eine Umgebung \(N\) von \(f\), so daß jedes \(g \in N ...
openaire   +2 more sources

Entropy as a Fixed Point

open access: yesTheoretical Computer Science, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Home - About - Disclaimer - Privacy