English
Related papers

Related papers: N-free posets and orthomodularity

200 papers

We prove the existence of infinite dense free sets (in the usual topology) for set mappings on the reals, under reasonable assumptions.

Logic · Mathematics 2016-11-15 Shimon Garti

This paper presents a discrete homotopy theory and a discrete homology theory for finite posets. In particular, the discrete and classical homotopy groups of finite posets are always isomorphic. Moreover, this discrete homology theory is…

Combinatorics · Mathematics 2026-03-05 Jing-Wen Gao , Xiao-Song Yang

In this paper we give convex-ear decompositions for the order complexes of several classes of posets, namely supersolvable lattices with non-zero Mobius functions and rank-selected subposets of such lattices, rank-selected geometric…

Combinatorics · Mathematics 2007-05-23 Jay Schweig

In their recent paper on posets with a pseudocomplementation denoted by * the first and the third author introduced the concept of a *-ideal. This concept is in fact an extension of a similar concept introduced in distributive…

Rings and Algebras · Mathematics 2022-08-03 Ivan Chajda , Miroslav Kolařík , Helmut Länger

A poset is representable if it can be embedded in a field of sets in such a way that existing finite meets and joins become intersections and unions respectively (we say finite meets and joins are preserved). More generally, for cardinals…

Logic · Mathematics 2016-08-31 Rob Egrot

We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset).…

Logic in Computer Science · Computer Science 2014-05-13 Simone Bova , Robert Ganian , Stefan Szeider

We introduce the notion of a \emph{Whitney dual} of a graded poset. Two posets are Whitney duals to each other if (the absolute value of) their Whitney numbers of the first and second kind are interchanged between the two posets. We define…

Combinatorics · Mathematics 2018-03-09 Rafael S. González D'León , Joshua Hallam

A matching is indecomposable if it does not contain a nontrivial contiguous segment of vertices whose neighbors are entirely contained in the segment. We prove a Ramsey-like result for indecomposable matchings, showing that every…

Combinatorics · Mathematics 2011-12-02 James Fairbanks

A poset ${\mathbb{P}}$ is called reversible iff every bijective homomorphism $f:{\mathbb{P}} \rightarrow {\mathbb{P}}$ is an automorphism. Let ${\mathcal{W}}$ and ${\mathcal{W}} ^*$ denote the classes of well orders and their inverses…

Logic · Mathematics 2017-11-21 Miloš S. Kurilić , Nenad Morača

We establish a bijection between the set of finite topological $T_0$-spaces (or partially ordered sets) and equivalence classes of square matrices. The absolute value of the determinant or the rank of these matrices serve as simple homotopy…

Algebraic Topology · Mathematics 2025-12-03 Pedro J. Chocano

Following Welsh, a pre-independence space (pi-space) is a set $M$ together with a non-empty collection $I(M)$ of subsets of $M$, called independent sets, which is closed under taking subsets, and finite independent sets satisfy the exchange…

Combinatorics · Mathematics 2025-08-19 Kevin Ivan Piterman , Volkmar Welker

Using the operators of taking upper and lower cones in a poset with a unary operation, we define operators M(x,y) and R(x,y) in the sense of multiplication and residuation, respectively, and we show that by using these operators, a general…

Logic · Mathematics 2018-09-27 Ivan Chajda , Helmut Länger

We describe some metric properties of incomparability graphs. We consider the problem of the existence of infinite paths, either induced or isometric, in the incomparability graph of a poset. Among other things, we show that if the…

Combinatorics · Mathematics 2022-02-22 Maurice Pouzet , Imed Zaguia

In this paper we discuss the notion of completeness of topologized posets and survey some recent results on closedness properties of complete topologized semilattices.

General Topology · Mathematics 2022-02-08 Taras Banakh , Serhii Bardyla

We give a necessary and sufficient condition for a $P_4$-free graph to be a cograph. This allows us to obtain a simple proof of the fact that finite $P_4$-free graphs are finite cographs. We also prove that $N$-free chain complete posets…

Combinatorics · Mathematics 2023-03-06 Imed Zaguia

A finite ranked poset is called a symmetric chain order if it can be written as a disjoint union of rank-symmetric, saturated chains. If $P$ is any symmetric chain order, we prove that $P^n/\mathbb{Z}_n$ is also a symmetric chain order,…

Combinatorics · Mathematics 2012-12-20 Vivek Dhand

We show that for any two von Neumann algebras $M$ and $N$, the space of non-unital normal homomorphisms $N\to M$ with finite support, modulo conjugation by unitaries in $M$, is Dedekind complete with respect to the partial order coming from…

Operator Algebras · Mathematics 2013-08-01 Alexandru Chirvasitu

In this paper, we use the language of noncommutative differential geometry to formalise discrete differential calculus. We begin with a brief review of inverse limit of posets as an approximation of topological spaces. We then show how to…

Numerical Analysis · Mathematics 2023-04-24 Damien Tageddine , Jean-Christophe Nave

In section 1 we consider a 3-tuple $S=(|S|,\preccurlyeq,E)$ where $|S|$ is a finite set, $\preccurlyeq$ a partial ordering on $|S|,$ and $E$ a set of unordered pairs of distinct members of $|S|,$ and study, as a function of $n\geq 0,$ the…

Combinatorics · Mathematics 2018-06-12 George M. Bergman

Let $X:=\mathrm{Spec}(R)$ be an affine Noetherian scheme, and $\mathcal{M} \subset \mathcal{N}$ be a pair of finitely generated $R$-modules. Denote their Rees algebras by $\mathcal{R}(\mathcal{M})$ and $\mathcal{R}(\mathcal{N})$. Let…

Algebraic Geometry · Mathematics 2018-05-14 Antoni Rangachev