中文
相关论文

相关论文: Algebraic duality for partially ordered sets

200 篇论文

In an earlier paper by three of the present authors and Csaba Schneider, it was shown that, for $m\ge2$, a set of $m+1$ partitions of a set $\Omega$, any $m$ of which are the minimal non-trivial elements of a Cartesian lattice, either form…

组合数学 · 数学 2022-10-14 R. A. Bailey , Peter J. Cameron , Michael Kinyon , Cheryl E. Praeger

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

组合数学 · 数学 2026-04-22 Victoria Ironmonger , Nik Ruškuc

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…

组合数学 · 数学 2016-11-22 Leonard Kwuida , Erkko Lehtonen

The dual of a matrix ordered space has a natural matrix ordering that makes the dual space matrix ordered as well. The purpose of these notes is to give a condition that describes when the linear map taking a basis of the n by n matrices to…

量子物理 · 物理学 2015-06-12 Vern I. Paulsen , Fred Shultz

Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…

人工智能 · 计算机科学 2012-09-26 Qingyin Li , William Zhu

An ordered semiring is a commutative semiring equipped with a compatible preorder. Ordered semirings generalise both distributive lattices and commutative rings, and provide a convenient framework to unify certain aspects of lattice theory…

范畴论 · 数学 2023-11-08 Soichiro Fujii

Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary "propositional" logic should in general be the logic of subsets of a given universe set. Partitions on…

逻辑 · 数学 2009-12-30 David Ellerman

On an infinite set some closure operators are finitary (algebraic) while others are not. We can generalize this idea for a complete algebraic lattice letting the compact elements act as the finite sets. With this in mind, we will consider…

环与代数 · 数学 2014-11-25 Martha Lee Hollist Kilpack

The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…

If every block of a (compatible) tolerance (relation) $T$ on a modular lattice $L$ of finite length consists of at most two elements, then we call $T$ a \emph{doubling tolerance} on $L$. We prove that, in this case, $L$ and $T$ determines a…

环与代数 · 数学 2019-12-11 Gábor Czédli

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

逻辑 · 数学 2009-05-19 Jaap van Oosten

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

代数几何 · 数学 2008-05-06 Gennadiy Averkov

In this note, we show that for any harmonic map into a non-compact symmetric space one can find naturally a "dual" harmonic map into a compact symmetric space which can be constructed from the same basic data (called "potentials" in the…

微分几何 · 数学 2024-08-26 Josef F. Dorfmeister , Peng Wang

A partial field is an algebraic object that allows one to simultaneously abstract several different representability properties of matroids. In this paper we study partial fields as algebraic objects in their own right. We characterize the…

组合数学 · 数学 2025-10-17 Nathaniel Vaduthala

One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…

组合数学 · 数学 2014-12-25 Jeremy F. Alm , John W. Snow

The distributive property can be studied through bilinear maps and various morphisms between these maps. The adjoint-morphisms between bilinear maps establish a complete abelian category with projectives and admits a duality. Thus the…

范畴论 · 数学 2012-05-04 James B. Wilson

If $(X, \le_X)$ is a partially ordered set satisfying certain necessary conditions for $X$ to be order-isomorphic to the spectrum of a Noetherian domain of dimension two, we describe a new poset $(\text{str } X, \le_{\text{str } X})$ that…

交换代数 · 数学 2021-02-09 Cory Colbert

Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…

符号计算 · 计算机科学 2024-06-13 Cordian Riener , Robin Schabert , Thi Xuan Vu

We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…

逻辑 · 数学 2023-06-22 Oleg Kudinov , Victor Selivanov

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