English
Related papers

Related papers: A point on fixpoints in posets

200 papers

Let $X$ be a finite connected poset and $K$ a field. We study the question, when all Lie automorphisms of the incidence algebra $I(X,K)$ are proper. Without any restriction on the length of $X$ we find only a sufficient condition involving…

Rings and Algebras · Mathematics 2021-08-17 Érica Z. Fornaroli , Mykola Khrypchenko , Ednei A. Santulo

We discuss the solvability of an infinite system of first order ordinary differential equations on the half line, subject to nonlocal initial conditions. The main result states that if the nonlinearities possess a suitable "sub-linear"…

Classical Analysis and ODEs · Mathematics 2015-03-25 Gennaro Infante , Petru Jebelean , Fadila Madjidi

We study two new parameters for finite posets motivated by the problem of efficiently determining the set of successors of a given element. A plane map of a poset $P=(X,\leq)$ is an injective mapping of $X$ into the Cartesian plane…

Combinatorics · Mathematics 2026-05-21 Stefan Felsner , Jędrzej Hodor , Giacomo Ortali , Alexander Wolff

We investigate the partial orderings of the form (P(X),\subset), where X is a countable binary relational structure and P(X) the set of the domains of its isomorphic substructures and show that if the components of X are maximally…

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

The main aim of this paper is to study the functional inequality \begin{equation*} \int_{[0,1]}f\bigl((1-t)x+ty\bigr)d\mu(t)\geq 0, \qquad x,y\in I \mbox{ with } x<y, \end{equation*} for a continuous unknown function $f:I\to{\mathbb R}$,…

Classical Analysis and ODEs · Mathematics 2025-03-28 Zsolt Páles , Tomasz Szostok

A partition of a finite poset into chains places a natural upper bound on the size of a union of k antichains. A chain partition is k-saturated if this bound is achieved. Greene and Kleitman proved that, for each k, every finite poset has a…

Combinatorics · Mathematics 2007-05-23 Glenn G. Chappell

We study the computational problem of checking whether a quantified conjunctive query (a first-order sentence built using only conjunction as Boolean connective) is true in a finite poset (a reflexive, antisymmetric, and transitive directed…

Logic in Computer Science · Computer Science 2014-08-20 Simone Bova , Robert Ganian , Stefan Szeider

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…

Representation Theory · Mathematics 2017-01-17 Peng He , Xue-ping Wang

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…

Combinatorics · Mathematics 2016-11-22 Leonard Kwuida , Erkko Lehtonen

In the present article, we show the existence of a coupled fixed point for an order preserving mapping in a preordered left K-complete quasi-pseudometric space using a preorder induced by an appropriate function. We also define the concept…

General Mathematics · Mathematics 2014-11-14 Yaé Ulrich Gaba

We prove that the model checking problem for the existential fragment of first-order (FO) logic on partially ordered sets is fixed-parameter tractable (FPT) with respect to the formula and the width of a poset (the maximum size of an…

Logic in Computer Science · Computer Science 2017-01-11 Jakub Gajarský , Petr Hliněný , Jan Obdržálek , Sebastian Ordyniak

We consider a category of all finite partial orderings with quotient maps as arrows and construct a Fra\"iss\'e sequence in this category. Then we use commonly known relations between partial orders and lattices to construct a sequence of…

Combinatorics · Mathematics 2022-01-26 Szymon Głcab , Michał Pawlikowski

We consider 'supersaturation' problems in partially ordered sets (posets) of the following form. Given a finite poset $P$ and an integer $m$ greater than the cardinality of the largest antichain in $P$, what is the minimum number of…

Combinatorics · Mathematics 2017-08-29 Jonathan A. Noel , Alex Scott , Benny Sudakov

We study operations on fixpoint equation systems (FES) over arbitrary complete lattices. We investigate under which conditions these operations, such as substituting variables by their definition, and swapping the ordering of equations,…

Logic in Computer Science · Computer Science 2024-08-07 Thomas Neele , Jaco van de Pol

We investigate predicative aspects of order theory in constructive univalent foundations. By predicative and constructive, we respectively mean that we do not assume Voevodsky's propositional resizing axioms or excluded middle. Our work…

Logic · Mathematics 2021-04-22 Tom de Jong , Martín Hötzel Escardó

The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for…

Classical Analysis and ODEs · Mathematics 2020-07-20 Mario Santilli

The k-Young lattice Y^k is a weak subposet of the Young lattice containing partitions whose first part is bounded by an integer k>0. The Y^k poset was introduced in connection with generalized Schur functions and later shown to be…

Combinatorics · Mathematics 2007-05-23 Luc Lapointe , Jennifer Morse

In this paper, we investigate the fixed-point set of an element of a CAT(0) group in its boundary. Suppose that a group $G$ acts geometrically on a CAT(0) space $X$. Let $g\in G$ and let $\mathcal{F}_g$ be the fixed-point set of $g$ in the…

Group Theory · Mathematics 2007-05-23 Tetsuya Hosaka

S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…

Combinatorics · Mathematics 2013-11-05 Jan Hladky , Andras Mathe , Viresh Patel , Oleg Pikhurko

We consider dynamical systems $(X,T,\mu)$ which have exponential decay of correlations for either H\"older continuous functions or functions of bounded variation. Given a sequence of balls $(B_n)_{n=1}^\infty$, we give sufficient conditions…

Dynamical Systems · Mathematics 2021-08-31 Charis Ganotaki , Tomas Persson