Results 1 to 10 of about 5,516,012 (291)
Fixed point combinators as fixed points of higher-order fixed point generators [PDF]
Logical 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.
Polonsky, Andrew
core +5 more sources
Proceedings of the American Mathematical Society, 1956 Suppose that space is metric. A chain is a finite collection of open sets d1, d2, * * * , dn such that di intersects dj if and only if I i-jj I 1. If the elements of a chain are of diameter less than a positive number e, that chain is said to be an e-chain.
Eldon Dyer
+4 more sources
Nuclear 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 +5 more sources
Fixed points and homotopy fixed points
Commentarii 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 +2 more sources
Transactions of the American Mathematical Society, 1973 A fixed point structure is a triple ( X , P , F ) (X,\mathcal {P},\mathcal {F}) where X is a set, P \mathcal {P} a collection of subsets of X, and F \mathcal {F} a family of multifunctions on X ...
R. E. Smithson, T. B. Muenzenberger
openaire +3 more sources
On Tarski's fixed point theorem [PDF]
, 2014 A concept of abstract inductive definition on a complete lattice is formulated and studied. As an application, a constructive and predicative version of Tarski's fixed point theorem is obtained.Comment: Proc. Amer. Math.
Curi, Giovanni
core +1 more source
Fixed Point Polynomials of Permutation Groups [PDF]
, 2013 In this paper we study, given a group $G$ of permutations of a finite set, the so-called fixed point polynomial $\sum_{i=0}^{n}f_{i}x^{i}$, where $f_{i}$ is the number of permutations in $G$ which have exactly $i$ fixed points.
Harden, CM, Penman, DB
core +1 more source
FIXED POINTS AND APPROXIMATE FIXED POINTS IN PRODUCT SPACES
Taiwanese 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
Nontrivial fixed point in nonabelian models [PDF]
, 2000 We investigate the percolation properties of equatorial strips in the two-dimensional O(3) nonlinear $\sigma$ model. We find convincing evidence that such strips do not percolate at low temperatures, provided they are sufficiently narrow.
Adrian Patrascioiu +9 more
core +3 more sources
Bulletin of the American Mathematical Society, 1982 A fixed point algebra (FPA) is a pair \(\) of Boolean algebras satisfying the following properties: (1) Each \(\alpha \in B\) is a mapping from A into A; (2) Boolean operations in B are pointwise on A; (3) each constant mapping on A is an element of B; (4) each \(\alpha \in B\) has a fixed point in A.
openaire +3 more sources