Order-A Journal on the Theory of Ordered Sets and Its Applications

Papers
(The median citation count of Order-A Journal on the Theory of Ordered Sets and Its Applications is 0. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-01-01 to 2026-01-01.)
ArticleCitations
$$\mathfrak {m}$$-Baer and $$\mathfrak {m}$$-Rickart Lattices10
Chain Conditions and Optimal Elements in Generalized Union-Closed Families of Sets6
Spaces Determined by their Smyth Hyperspaces with the Scott Topology6
Projective and External Saturation Problem for Posets6
Partially Ordered Fields and Integral Domains6
Promotion Sorting5
Interleaving by Parts: Join Decompositions of Interleavings and Join-Assemblage of Geodesics4
Effective Descent Morphisms of Filtered Preorders4
Characterization of B0-VPG Cocomparability Graphs and a 2D Visualization of their Posets3
Jordan-Hölder Theorem with Uniqueness for Semimodular Lattices3
Existence and Structure of Nash Equilibria for Supermodular Games3
On Nontrivial Weak Dicomplementations and the Lattice Congruences that Preserve Them3
Integral Operators on Lattices3
Construction of Quantum B-algebras over Posets3
An Approximation Algorithm for Random Generation of Capacities2
Notes on Sharp and Principal Elements in Effect Algebras2
Classification of Non-Archimedean Abelian Po-Groups2
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications2
Controlling the C3 Super Class Linearization Algorithm for Large Hierarchies of Classes2
Independent Sets of Non-geometric Lattices and the Maximal Adjoint2
Borel Colouring Bad Rays2
Erdős-Hajnal Problems for Posets1
Well-quasi-ordering and Embeddability of Relational Structures1
Induced Orthogonality in Semilattices with 0 and in Pseudocomplemented Lattices and Posets1
Forbidden Subposets in the Cycle Poset1
General Mixed Lattices1
Chain-dependent Conditions in Extremal Set Theory1
The Canonical Complex of the Weak Order1
Characterization of Order Structures Avoiding Three-term Arithmetic Progressions1
Poset Ramsey Number $$R(P,Q_{n})$$. I. Complete Multipartite Posets1
Boolean Dimension of a Boolean Lattice1
Higher-dimensional Delta-systems1
Truncation Structures1
Interval Posets of Permutations1
Graph Parameters, Universal Obstructions, and WQO1
Sizes of Flat Maximal Antichains of Subsets1
On Finitely-Generated Johansson Algebras1
On the Automorphism Group of the Substructure Ordering of Finite Directed Graphs1
Linearly Shellable Complexes1
The Saturation Spectrum for Antichains of Subsets1
Extension of Sectional Pseudocomplementation in Posets0
Subordinations on Bounded Distributive Lattices0
Reconstruction of the Ranks of the Nonextremal Cards and of Ordered Sets with a Minmax Pair of Pseudo-Similar Points0
On a Problem of Conrad on Riesz Space Structures0
Forcing the Wheel0
A Point-Free Approach to Canonical Extensions of Boolean Algebras and Bounded Archimedean $$\ell$$-Algebras0
Correction: Choice Functions0
Covering Dimension of Finite Distributive Lattices0
The Minor Order of Homomorphisms via Natural Dualities0
Uniform Residuated Lattices and their Cauchy Completions0
Constructions of Codes with Weighted Poset Block Metrics0
Fraïssé’s Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition0
The Comparability Numbers and the Incomparability Numbers0
Order-Preserving Self-Maps of Complete Lattices0
What is $$-Q$$ for a poset Q?0
Two Flags in a Semimodular Lattice Generate an Antimatroid0
Erratum to "Are Chain-Complete Posets Co-Wellpowered?" [Order 39 (2022), 71-76]0
A Symmetric-Difference-Closed Orthomodular Lattice That Is Stateless0
Orthogonality Spaces Associated with Posets0
Geometric Realizations of Tamari Interval Lattices Via Cubic Coordinates0
Poset Ramsey Number $$R(P,Q_n)$$. II. N-Shaped Poset0
Applications of Order Trees in Infinite Graphs0
Pointed Lattice Subreducts of Varieties of Residuated Lattices0
On Ranked and Bounded Kohnert Posets0
Complementary Choice Functions0
The Dedekind-MacNeille Completion of a Poset as a Set of Ideals of the Incidence Algebra0
Left Absorption in Products of Countable Orders0
Higman’s Lemma is Stronger for Better Quasi Orders0
Proof of a Conjecture on the Distributivity of Convolution Lattices0
Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph0
Two-count Interval Representation of a Permutation0
Representations for the Largest Extension of a Closure System0
On the Rigidity of Lattices of Topologies on Vector Spaces0
Combinatorial Results on Barcode Lattices0
Dedekind-MacNeille and Related Completions: Subfitness, Regularity, and Booleanness0
A Proof of the Alternate Thomassé Conjecture for Countable N-Free Posets0
Order-Sensitive Domination in Partially Ordered Sets and Graphs0
On the Equational Theory of Finite Modular Lattices0
The Dimension of Divisibility Orders and Multiset Posets0
Filter Classes of Upsets of Distributive Lattices0
Choice Functions0
Free Algebras in Finitely Generated Varieties of Commutative BCK-algebras0
Antichains in the Bruhat Order for the Classes $$\mathcal {A}(n,k)$$0
Polynomial-time Equational Theory for Lattices with Unary Operators0
Products of Directed Sets with Calibre $$(\omega _1,\omega )$$0
Order Dimension, Grids, and Products0
Characteristic Polynomials of the Weak Order on Classical and Affine Coxeter Groups0
Improved Lower Bounds on the On-line Chain Partitioning of Posets of Bounded Dimension0
On Dually-CPT and Strongly-CPT Posets0
On Some Extensions of Weak Relative Pseudocomplementation in Posets0
Idempotents in the Endomorphism Algebra of a Finite Lattice0
Topological Lax Comma Categories0
On the Number of P-free Set Systems for Tree Posets P0
Length-preserving Extensions of a Semimodular Lattice by Lowering a Join-irreducible Element0
The Coincidence of the Bruhat Order and the Secondary Bruhat Order on $$\mathcal {A}(n,k)$$0
The Category of $$\omega $$-Effect Algebras: Tensor Product and $$\omega $$-Completion0
On the Width of the Cartesian Product of Ordinals0
Continuous Order-Preserving Functions for All Kind of Preorders0
Promotion, Tangled Labelings, and Sorting Generating Functions0
Approximation Spaces Defined by Directed Sets0
Representations of Finite Groups by Posets of Small Height0
Amalgamating Poset Extensions and Generating Free Lattices0
Separability, Boxicity, and Partial Orders0
Standard Completions for Pseudo Ordered Sets0
Partition Rank and Partition Lattices0
Big Ramsey Spectra of Countable Chains0
Sectionable Tournaments: their Topology and Coloring0
Towards a Complete Local-Global Principle0
Weakenings of the Knaster property0
Stability of Boolean Function Classes with Respect to Clones of Linear Functions0
Gluing Residuated Lattices0
F3-Reconstruction and Bi-Founded 2-Structures0
Decomposition of L-algebras0
On Posets, Monomial Ideals, Gorenstein Ideals and their Combinatorics0
A Study of the Small Inductive Dimension in the Area of Finite Lattices0
Algebras, Graphs and Ordered Sets – ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet0
A short note on the characterization of countable chains with finite big Ramsey spectra0
Simplex Faces of Order and Chain Polytopes0
Decidability of Well Quasi-Order and Atomicity for Equivalence Relations Under Embedding Orderings0
Choice Functions on Posets0
A Study on Some Classes of Distributive Lattices with a Generalized Implication0
Injective Hulls are Completions of Ordered Algebras0
Orthogonality Relations and Operators on Bounded Quasi-Implication Algebras0
Polymatroids, Closure Operators and Lattices0
The Interval Posets of Permutations Seen from the Decomposition Tree Perspective0
Monotone-Cevian and Finitely Separable Lattices0
Combinatorics Arising from Lax Colimits of Posets0
On Contextuality and Unsharp Quantum Logic0
Correction: Pointed Lattice Subreducts of Varieties of Residuated Lattices0
Symmetric Maximal Condorcet Domains0
Shattering k-sets with Permutations0
Atomic Boolean Lattice Completions of Ordered Sets0
A Construction for Boolean Cube Ramsey Numbers0
Absolute Retracts for Finite Distributive Lattices and Slim Semimodular Lattices0
The Number of Subuniverses, Congruences, Weak Congruences of Semilattices Defined by Trees0
0.63726401329041