中文
相关论文

相关论文: Distributive and lower-modular elements of the lat…

200 篇论文

We show that if G is a finite group then no chain of modular elements in its subgroup lattice L(G) is longer than a chief series. Also, we show that if G is a nonsolvable finite group then every maximal chain in L(G) has length at least two…

群论 · 数学 2011-12-30 John Shareshian , Russ Woodroofe

We investigate the notion of soficity for monoids. A group is sofic as a group if and only if it is sofic as a monoid. All finite monoids, all commutative monoids, all free monoids, all cancellative one-sided amenable monoids, all…

动力系统 · 数学 2015-05-06 Tullio Ceccherini-Silberstein , Michel Coornaert

In 2012, the second author introduced and examined a new type of algebras as a generalization of De Morgan algebras. These algebras are of type (2,0) with one binary and one nullary operation satisfying two certain specific identities. Such…

群论 · 数学 2020-08-11 S. V. Gusev , H. P. Sankappanavar , B. M. Vernikov

To work more accurately with elements of the semigroup of the Stone Cech compactification of the discrete semigroup of natural numbers N under multiplication. We divided these elements into ultrafilters which are on finite levels and…

一般拓扑 · 数学 2022-08-19 Salahddeen Khalifa

We study the algebraic properties of binary relations whose underlying digraph is smooth, that is has no source or sink. Such objects have been studied as surjective hyper-operations (shops) on the corresponding vertex set, and as binary…

环与代数 · 数学 2021-03-11 Catarina Carvalho , Barnaby Martin

In this paper, we introduce the notion of Autometrized lattice ordered monoids (for short,AL-monoids) as a generalization to DRl-semi groups. We obtain the basic properties of AL-monoids. Also, we prove that Autometrized lattice ordered…

By median we mean a scheme that inputs three element of a lattice, and outputs an element that is an average of the three inputs in a certain sense. The medians of a given finite lattice form a new lattice that is usually larger than the…

组合数学 · 数学 2026-03-19 Leen Aburub , Gergo Gyenizse

Diversities are a generalization of metric spaces, where instead of the non-negative function being defined on pairs of points, it is defined on arbitrary finite sets of points. Diversities have a well-developed theory. This includes the…

度量几何 · 数学 2020-10-23 David Bryant , Raúl Felipe , Mauricio Toledo-Acosta , Paul Tupper

We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to…

逻辑 · 数学 2021-08-27 Peter Jipsen , Olim Tuyt , Diego Valota

Toric varieties associated with distributive lattices arise as a fibre of a flat degeneration of a Schubert variety in a minuscule. The singular locus of these varieties has been studied by various authors. In this article we prove that the…

组合数学 · 数学 2013-12-02 Himadri Mukherjee

We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…

逻辑 · 数学 2014-03-24 Pierre Gillibert

This article focuses on the relationship between pseudo-t-norms and the structure of lattices. First, we establish a necessary and sufficient condition for the existence of a left-continuous t-norm on the ordinal sum of two disjoint…

表示论 · 数学 2025-06-10 Peng He , Xue-ping Wang

The local structures of enveloping semigroups of simple groups are investigated. All J-coirreducible connected stabilizer submonoids are determined. The notion of a navel of a reductive monoid is introduced. The cross-section lattice of the…

代数几何 · 数学 2019-12-16 Mahir Bilen Can

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…

表示论 · 数学 2017-01-17 Peng He , Xue-ping Wang

In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking…

组合数学 · 数学 2007-05-23 Hugh Thomas

We classify minimal transitive subsemigroups of the finitary inverse symmetric semigroup modulo the classification of minimal transitive subgroups of finite symmetric groups; and semitransitive subsemigroups of the finite inverse symmetric…

A distributive lattice with zero is completely normal if its prime ideals form a root system under set inclusion.Every such lattice admits a binary operation (x,y) \mapsto x-y satisfying the rules x \leq y\vee (x-y) and (x-y) \wedge (y-x)=0…

逻辑 · 数学 2023-10-13 Miroslav Ploscica , Friedrich Wehrung

We completely determine all commutative epigroup varieties that are cancellable elements of the lattice EPI of all epigroup varieties. In particular, we verify that a commutative epigroup variety is a cancellable element of the lattice EPI…

群论 · 数学 2018-03-28 Dmitry V. Skokov

We show that the number of conjugacy classes of maximal finite subgroups of a lattice in a semisimple Lie group is linearly bounded by the covolume of the lattice. Moreover, for higher rank groups, we show that this number grows sublinearly…

群论 · 数学 2012-09-13 Iddo Samet

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…

逻辑 · 数学 2008-07-22 Luigi Santocanale