中文
相关论文

相关论文: Representable posets and their order components

200 篇论文

We introduce two polynomials (in $q$) associated with a finite poset $P$ that encode some information on the covering relation in $P$. If $P$ is a distributive lattice, and hence $P$ is isomorphic to the poset of dual order ideals in a…

组合数学 · 数学 2012-05-22 Dmitri I. Panyushev

In order theory, partially ordered sets are only equipped with one relation which decides the entire structure/Hasse diagram of the set. In this paper, we have presented how partially ordered sets can be studied under simultaneous partially…

综合数学 · 数学 2023-07-03 Omprakash Atale

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

组合数学 · 数学 2020-10-14 Antoine Abram , Nathan Chapelier-Laget , Christophe Reutenauer

A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…

环与代数 · 数学 2014-09-23 Brian T. Chan

Let $P$ be a poset of size $2^k$ that has a greatest and a least element. We prove that, for sufficiently large $n$, the Boolean lattice $2^{[n]}$ can be partitioned into copies of $P$. This resolves a conjecture of Lonc.

组合数学 · 数学 2016-09-09 Vytautas Gruslys , Imre Leader , István Tomon

Motivated by a recent paper of G. Gr\"atzer, a finite distributive lattice $D$ is said to be fully principal congruence representable if for every subset $Q$ of $D$ containing $0$, $1$, and the set $J(D)$ of nonzero join-irreducible…

环与代数 · 数学 2017-06-13 Gábor Czédli

We construct a canonical irreducible representation for the orthofermion algebra of arbitrary order, and show that every representation decomposes into irreducible representations that are isomorphic to either the canonical representation…

数学物理 · 物理学 2008-11-26 Ali Mostafazadeh

For P a poset or lattice, let Id(P) denote the poset, respectively, lattice, of upward directed downsets in P, including the empty set, and let id(P)=Id(P)-\{\emptyset\}. This note obtains various results to the effect that Id(P) is always,…

环与代数 · 数学 2013-05-10 George M. Bergman

If $L$ is a relational language, then an $L$-structure ${\mathbb X}=\langle X,\bar \rho \rangle$ is reversible iff there is no interpretation $\bar \sigma \varsubsetneq \bar \rho$ such that the structures $\langle X,\bar \sigma \rangle$ and…

逻辑 · 数学 2023-06-27 Miloš S. Kurilić

We prove that p.q.-Baer *-ring forms a pseudo lattice with Conrads partial order and also characterize p.q.-Baer *-rings which are lattices. The initial segments of a p.q.-Baer *-ring with Conrads partial order are shown to be orthomodular…

组合数学 · 数学 2016-12-06 Anil Khairnar , B. N. Waphare

It is elementary and well-known that if an element x of a bounded modular lattice L has a complement in L then x has a relative complement in every interval [a,b] containing x. We show that the relatively strong assumption of modularity of…

组合数学 · 数学 2021-07-13 Ivan Chajda , Helmut Länger

We introduce a new partial order on the set of all antichains of a fixed size in any poset. When applied to minuscule posets, these partial orders give rise to distributive lattices that appear in the branching rules for minuscule…

组合数学 · 数学 2026-02-24 R. M. Green , Tianyuan Xu

In this paper we consider representations of certain combinatorial categories, including the poset $\D$ of positive integers and division, the Young lattice $\mathscr{Y}$ of partitions of finite sets, the opposite category of the orbit…

表示论 · 数学 2024-12-11 Zhenxing Di , Liping Li , Li Liang

The elements of a finite nonempty partially ordered set are exposed at independent uniform times in $[0,1]$ to a selector who, at any given time, can see the structure of the induced partial order on the exposed elements. The selector's…

最优化与控制 · 数学 2010-10-07 Ragnar Freij , Johan Wästlund

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…

逻辑 · 数学 2017-09-26 Milos S. Kurilic

It is known that every relatively pseudocomplemented lattice is residuated and, moreover, it is distributive. Unfortunately, non-distributive lattices with a unary operation satisfying properties similar to relative pseudocomplementation…

逻辑 · 数学 2019-01-23 Ivan Chajda , Helmut Länger

We define a property sub-representability and we give a complete characterisation of sub-representability of posets.

一般拓扑 · 数学 2007-05-23 M. K. Gormley , T. B. M. McMaster

In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…

群论 · 数学 2026-03-09 Sachin Ballal , Tushar Halder

For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…

环与代数 · 数学 2017-08-01 Brett McLean

We investigate the poset (P(X),\subset), where P(X) is the set of isomorphic suborders of a countable ultrahomogeneous partial order X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in…

逻辑 · 数学 2017-09-26 Milos S. Kurilic , Borisa Kuzeljevic