English
Related papers

Related papers: Residuation in modular lattices and posets

200 papers

Digital System Research has pioneered the mathematics and design for a new class of computing machine using residue numbers. Unlike prior art, the new breakthrough provides methods and apparatus for general purpose computation using several…

Other Computer Science · Computer Science 2015-12-04 Eric B. Olsen

We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…

Logic in Computer Science · Computer Science 2016-03-04 Zoltan Esik

We characterize supersolvable lattices in terms of a certain modular type relation. McNamara and Thomas earlier characterized this class of lattices as those graded lattices having a maximal chain that consists of left-modular elements. Our…

Combinatorics · Mathematics 2022-01-31 Stephan Foldes , Russ Woodroofe

We construct positional numeral systems that work natively over nonderived polyadic $\left( m,n\right) $-rings whose addition takes $m$ arguments and multiplication takes $n$. In such rings, the length of an admissible additive word and a…

Number Theory · Mathematics 2026-05-04 Steven Duplij

We describe four natural operad structures on the vector space generated by isomorphism classes of finite posets. The three last ones are set-theoretical and can be seen as a simplified version of the first, the same way the NAP operad…

Combinatorics · Mathematics 2016-09-30 Frédéric Fauvet , Loïc Foissy , Dominique Manchon

We introduce the notion of residual intersections of modules and prove their existence. We show that projective dimension one modules have Cohen-Macaulay residual intersections, namely they satisfy the relevant Artin-Nagata property. We…

Commutative Algebra · Mathematics 2022-05-30 Alessandra Costantini , Louiza Fouli , Jooyoun Hong

We associate lattices to the sets of unions and intersections of left and right quotients of a regular language. For both unions and intersections, we show that the lattices we produce using left and right quotients are dual to each other.…

Formal Languages and Automata Theory · Computer Science 2023-09-07 Jason Bell , Daniel Smertnig , Hellis Tamm

In this paper, we introduce a new combinatorial operation, called a flip, on arbitrary partially ordered sets. We define a mutation to be a flip that maps a lattice to a lattice. We study properties of flips, and give a necessary and…

Combinatorics · Mathematics 2026-05-12 Kan Nagano

We reduce the set of classic relational algebra operators to two binary operations: natural join and generalized union. We further demonstrate that this set of operators is relationally complete and honors lattice axioms.

Databases · Computer Science 2007-05-23 Vadim Tropashko

We investigate a certain class of posets arising from semilattice actions. Let $S$ be a semilattice with identity. Let $S$ act on a set $C$. For $c,d\in C$ put $c\leq d$ iff there is some $s\in S$ with $ds=c$. Then $(C,\leq)$ is a poset.…

Logic · Mathematics 2016-09-16 Lawrence Valby

A posteriori error estimators for the symmetric mixed finite element methods for linear elasticity problems of Dirichlet and mixed boundary conditions are proposed. Stability and efficiency of the estimators are proved. Finally, we provide…

Numerical Analysis · Mathematics 2017-05-12 Long Chen , Jun Hu , Xuehai Huang , Hongying Man

In this paper we present some applications of the reticulation of a residuated lattice, in the form of a transfer of properties between the category of bounded distributive lattices and that of residuated lattices through the reticulation…

Logic · Mathematics 2013-11-14 Claudia Mureşan

We study persistence modules defined on commutative ladders. This class of persistence modules frequently appears in topological data analysis, and the theory and algorithm proposed in this paper can be applied to these practical problems.…

Algebraic Topology · Mathematics 2015-04-21 Emerson G. Escolar , Yasuaki Hiraoka

This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…

Combinatorics · Mathematics 2011-02-16 Anders Claesson , Mark Dukes , Martina Kubitzke

The residuated lattices form one of the most important algebras of fuzzy logics and have been heavily studied by people from various different points of view. Sheaf presentations provide a topological approach to many algebraic structures.…

General Topology · Mathematics 2023-06-22 Huarong Zhang , Dongsheng Zhao

It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1,2,...,n without repetition. These labellings are called S_n EL-labellings,…

Combinatorics · Mathematics 2007-05-23 Peter McNamara , Hugh Thomas

The minus partial order is already known for sets of matrices over a field and bounded linear operators on arbitrary Hilbert spaces. Recently, this partial order has been studied on Rickart rings. In this paper, we extend the concept of the…

Rings and Algebras · Mathematics 2024-05-28 Burcu Ungor , Sait Halicioglu , Abdullah Harmanci , Janko Marovt

For Banach spaces X and Y, we establish a natural bijection between preduals of Y and preduals of L(X,Y) that respect the right L(X)-module structure. If X is reflexive, it follows that there is a unique predual making L(X) into a dual…

Functional Analysis · Mathematics 2020-03-09 Eusebio Gardella , Hannes Thiel

We give complete characterisation of topologically injective (bounded below), topologically surjective (open mapping), isometric and coisometric (quotient mapping) multiplication operators between $L_p$ spaces defined on different…

Functional Analysis · Mathematics 2013-09-20 Norbert Nemesh

Two fundamental constructions operating on residuated lattices and partially ordered monoids (pomonoids) are so-called nuclear images and conuclear images. Nuclear images allow us to construct many of the ordered algebras which arise in…

Logic · Mathematics 2023-02-02 Adam Přenosil