English
Related papers

Related papers: Residuation in modular lattices and posets

200 papers

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 show that (for the weak operator topology) the set of unitary operators on a separable infinite-dimensional Hilbert space is residual in the set of all contractions. The analogous result holds for isometries and the strong operator…

Functional Analysis · Mathematics 2014-12-02 Tanja Eisner

In this paper, we introduce the notion of LSat, the left saturation closure of a subset of a module at a subset of the base ring, which generalizes multiple important concepts related to Ore localization. We show its significance in finding…

Rings and Algebras · Mathematics 2019-03-11 Johannes Hoffmann , Viktor Levandovskyy

The residual finite-dimensionality of a $\mathrm{C}^*$-algebra is known to be encoded in a topological property of its space of representations, stating that finite-dimensional representations should be dense therein. We extend this…

Operator Algebras · Mathematics 2023-02-21 Raphaël Clouâtre , Adam Dor-On

We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…

Logic · Mathematics 2020-06-30 Ivan Chajda , Helmut Länger

Posets are discrete mathematical structures which are ubiquitous in a broad range of data analysis and machine learning applications. Research connecting posets to the data science domain has been ongoing for many years. In this paper, a…

Machine Learning · Computer Science 2024-05-28 Arnauld Mesinga Mwafise

In a previous paper I showed how the ideal SLAC derivative and second-derivative operators for an infinite lattice can be obtained in simple closed form in position space, and implemented very efficiently in a stochastic fashion for…

High Energy Physics - Lattice · Physics 2007-05-23 John P. Costella

We show that, for every orthogonal lub-complete poset P, we can introduce multiple-valued implications sharing properties with quantum implications presented for orthomodular lattices by Kalmbach. We call them classical implication,…

Logic · Mathematics 2023-11-22 Kadir Emir , Jan Paseka

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

Modular and reconfigurable robotic systems have been designed to provide a customized solution for the non-repetitive tasks to be performed in a constrained environment. Customized solutions are normally extracted from task-based…

Robotics · Computer Science 2021-11-02 Anubhav Dogra , Sakshay Mahna , Srikant Sekhar Padhee , Ekta Singla

It is known that every function with a finite support over a given field can be interpolated by means of the Lagrangian polynomial. The question is if a similar interpolation is possible if one considers a unitary ring or a Boolean algebra…

Rings and Algebras · Mathematics 2025-08-08 Ivan Chajda , Helmut Länger

It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…

Combinatorics · Mathematics 2025-12-16 Amrita Acharyya

We translate notions and results of decomposition and dimension theories for module categories, into the lattice environment. In particular we translate dimension theory in module categories to complete modular upper-continuous lattices.

Rings and Algebras · Mathematics 2015-12-01 José Ríos Montes , Angel Zaldívar

Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…

Logic in Computer Science · Computer Science 2015-12-31 Mikhail A. Babin , Sergei O. Kuznetsov

An orthogonality space is a set equipped with a symmetric, irreflexive relation called orthogonality. Every orthogonality space has an associated complete ortholattice, called the logic of the orthogonality space. To every poset, we…

Rings and Algebras · Mathematics 2024-11-20 Gejza Jenča

We study three different poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The…

Combinatorics · Mathematics 2007-05-23 Jan Snellman

We investigate the category of ``matricial order operator spaces,'' which generalize operator systems, being equipped with both matricial norms and matricial order. For these objects, we develop duality theory. Taking a cue from the theory…

Functional Analysis · Mathematics 2026-05-22 Roy Araiza , Timur Oikhberg

Canonical extension of finitary ordered structures such as lattices, posets, proximity lattices, etc., is a certain completion which entirely describes the topological dual of the ordered structure and it does so in a purely algebraic and…

Category Theory · Mathematics 2022-05-12 Tomáš Jakl

As an abstraction and generalization of the integral operator in analysis, integral operators (known as Rota-Baxter operators of weight zero) on associative algebras and Lie algebras have played an important role in mathematics and physics.…

Rings and Algebras · Mathematics 2021-12-17 Aiping Gan , Li Guo

Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…

Artificial Intelligence · Computer Science 2013-12-17 Qingyin Li , William Zhu
‹ Prev 1 8 9 10 Next ›