English
Related papers

Related papers: A point on fixpoints in posets

200 papers

For a given partially ordered set (poset) and a given family of mappings of the poset into itself, we study the problem of the description of joint fixed points of this family. Well-known Tarski's theorem gives the structure of the set of…

Logic · Mathematics 2016-02-05 Dmitrii Serkov

The fixed point property for finite posets of width 3 and 4 is studied in terms of forbidden retracts. The ranked forbidden retracts for width 3 and 4 are determined explicitly. The ranked forbidden retracts for the width 3 case that are…

Combinatorics · Mathematics 2007-05-23 Jonathan David Farley

We study a certain poset on the free monoid on a countable alphabet. This poset is determined by the fact that its total extensions are precisely the standard term orders. We also investigate the poset classifying degree-compatible standard…

Combinatorics · Mathematics 2007-05-23 Jan Snellman

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

Data Structures and Algorithms · Computer Science 2023-04-11 Prateek Bhakta , Ben Cousins , Matthew Fahrbach , Dana Randall

We consider a mixed dimensional elliptic partial differential equation posed in a bulk domain with a large number of embedded interfaces. In particular, we study well-posedness of the problem and regularity of the solution. We also propose…

Numerical Analysis · Mathematics 2023-01-02 Fredrik Hellman , Axel Målqvist , Malin Mosquera

A sectionally pseudocomplemented poset P is one which has the top element and in which every principal order filter is a pseudocomplemented poset. The sectional pseudocomplements give rise to an implication-like operation on P which…

Logic · Mathematics 2013-01-07 J\{=}anis C\=ırulis

The following is shown : Let $S=\{a_1,a_2,..,a_{2n}\}$ be a subset of a totally ordered commutative semi-group $(G,*,\leq)$ with $a_1\leq a_2\leq...\leq a_{2n}$. Provided that a system of $n$ $a_{i_k} * a_{j_k}\ (a_{i_k}, a_{j_k} \in G ;\ 1…

Commutative Algebra · Mathematics 2011-06-21 Susumu Oda

Let $(E,\xi)={\rm ind}(E_n, \xi_n)$ be an inductive limit of a sequence $(E_n, \xi_n)_{n\in N}$ of locally convex spaces and let every step $(E_n, \xi_n)$ be endowed with a partial order by a pointed convex (solid) cone $S_n$. In the…

Functional Analysis · Mathematics 2013-12-11 Jing-Hui Qiu

M. E. Rudin proved under CH that for each P-point there exists another P-point strictly RK-greater (M. E. Rudin, Partial orders on the types of $\beta \mathbb{N}$ , Trans. Amer. Math. Soc., 155 (1971), 353-362). Assuming…

Logic · Mathematics 2020-03-25 Andrzej Starosolski

Let $C$ be a convex subset of a locally convex space. We provide optimal approximate fixed point results for sequentially continuous maps $f\colon C\to\bar{C}$. First we prove that if $f(C)$ is totally bounded, then it has an approximate…

Functional Analysis · Mathematics 2013-02-27 Cleon S. Barroso , Ondřej F. K. Kalenda , Michel P. Rebouças

We present a version of Krasnosel'skii fixed point theorem for operators acting on Cartesian products of normed linear spaces, under cone-compression and cone-expansion conditions of norm type. Our approach, based on the fixed point index…

Functional Analysis · Mathematics 2025-04-04 Laura M Fernández-Pardo , Jorge Rodríguez-López

We study fixpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We show that each lattice operator O has a unique most precise or…

Artificial Intelligence · Computer Science 2007-05-23 Marc Denecker , Victor W. Marek , Miroslaw Truszczynski

Local fixpoint iteration describes a technique that restricts fixpoint iteration in function spaces to needed arguments only. It has been studied well for first-order functions in abstract interpretation and also in model checking. Here we…

Logic in Computer Science · Computer Science 2020-09-24 Florian Bruse , Jörg Kreiker , Martin Lange , Marco Sälzer

We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

Logic · Mathematics 2012-06-12 Andreas Fackler

Linearizing two partial orders to maximize the number of adjacencies and minimize the number of breakpoints is APX-hard. This holds even if one of the two partial orders is already a linear order and the other is an interval order, or if…

Computational Complexity · Computer Science 2021-10-07 Rain Jiang , Kai Jiang , Minghui Jiang

The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is…

Logic · Mathematics 2023-08-23 Ivan Chajda , Helmut Länger

Necessary and sufficient conditions for a measure to be an extreme point of the set of measures (on an abstract measurable space) with prescribed generalized moments are given, as well as an application to extremal problems over such moment…

Optimization and Control · Mathematics 2017-01-17 Iosif Pinelis

We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…

Logic · Mathematics 2020-06-30 Ivan Chajda , Helmut Länger

We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is \sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(\omega)/Fin).

Logic · Mathematics 2017-09-26 Milos S. Kurilic

We discuss the problem where the extremal function in embedding theorem of some (generally speaking, non-integer) order is the constant function. We obtain the necessary and sufficient conditions of this.

Classical Analysis and ODEs · Mathematics 2013-08-13 Alexander I. Nazarov
‹ Prev 1 4 5 6 7 8 10 Next ›