中文
相关论文

相关论文: Graded left modular lattices are supersolvable

200 篇论文

Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…

计算机科学中的逻辑 · 计算机科学 2017-03-08 Lidia Tendera

We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…

组合数学 · 数学 2024-10-10 Yongle Luo , Baptiste Rognerud

We study the finite basis problem for additively idempotent semirings satisfying the identity $xy \approx xz$. Let $\mathbf{R}$ denote the variety of all such semirings. Yue et al. (2025, Algebra Universalis, DOI:10.1007/s00012-025-00908-5)…

群论 · 数学 2025-09-23 Mengya Yue , Miaomiao Ren

We show that the subgroup lattice of any finite group satisfies Frankl's Union-Closed Conjecture. We show the same for all lattices with a modular coatom, a family which includes all supersolvable and dually semimodular lattices. A common…

组合数学 · 数学 2020-07-08 Alireza Abdollahi , Russ Woodroofe , Gjergji Zaimi

We show that coalgebras whose lattice of right coideals is distributive are coproducts of coalgebras whose lattice of right coideals is a chain. Those chain coalgebras are characterized as finite duals of noetherian chain rings whose…

环与代数 · 数学 2007-05-23 Christian Lomp , Alveri Sant'Ana

We show that the infinite symmetric product of a connected graded-commutative algebra over the rationals is naturally isomorphic to the free graded-commutative algebra on the positive degree subspace of the original algebra. In particular,…

环与代数 · 数学 2021-11-09 Jiahao Hu , Aleksandar Milivojević

In this paper, the ordered set of rough sets determined by a quasiorder relation $R$ is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different…

环与代数 · 数学 2014-03-26 Jouni Järvinen , Sándor Radeleczki , Laura Veres

F. Escalante and T. Gallai studied in the seventies the structure of different kind of separations and cuts between a vertex pair in a (possibly infinite) graph. One of their results is that if there is a finite separation, then the optimal…

组合数学 · 数学 2019-04-15 Attila Joó

We prove that an inverse-free equation is valid in the variety LG of lattice-ordered groups (l-groups) if and only if it is valid in the variety DLM of distributive lattice-ordered monoids (distributive l-monoids). This contrasts with the…

This paper shows among other things that over a non-commutative Koszul algebra, high truncations of finitely generated graded modules have linear free resolutions.

环与代数 · 数学 2007-05-23 Peter Jorgensen

For a poset $(P,\leqslant)$ we consider the first-order theory, that is defined by set $P$ and relation $\leqslant$. The problem of undecidability of combinatorial theories attracts significant attention. Recently A. Wires proved the…

组合数学 · 数学 2025-09-05 Vsevolod Evtushevsky

We characterize all residuated lattices that have height equal to $3$ and show that the variety they generate has continuum-many subvarieties. More generally, we study unilinear residuated lattices: their lattice is a union of disjoint…

逻辑 · 数学 2023-04-13 Nick Galatos , Xiao Zhuang

We consider the lattice of supercharacter theories, in the sense of Diaconis and Isaacs, of the cyclic group of order n. We find necessary and sufficient conditions on n for that lattice to be upper or lower semimodular.

表示论 · 数学 2012-03-09 Samuel G. Benidt , William R. S. Hall , Anders O. F. Hendrickson

The paper proves finite model property and decidability for a family of modal logics. A binary relation $R$ is called pretransitive, if $R^*=\cup_{i\leq m} R^i$ for some $m\geq 0$, where $R^*$ is the transitive reflexive closure of $R$. By…

逻辑 · 数学 2015-12-01 Andrey Kudinov , Ilya Shapirovsky

We establish one-to-one correspondences between maximal antichains in products of two finite linear orders and other mathematical objects, such as certain alignments of two strings, walks on a grid, lattice paths, words of two or three…

组合数学 · 数学 2024-10-31 Denis Bouyssou , Thierry Marchant , Marc Pirlot

When $G$ is solvable group, we prove that the number of conjugacy classes of elements of prime power order is less than or equal to the number of irreducible characters with values in fields where $\mathbb {Q}$ is extended by prime power…

群论 · 数学 2015-06-29 Mark L. Lewis

Let $G$ be a simple graph on the vertex set $\{v_1,\dots,v_n\}$ with edge set $E$. Let $K$ be a field. The graphical arrangement $\mathcal{A}_G$ in $K^n$ is the arrangement $x_i-x_j=0, v_iv_j \in E$. An arrangement $\mathcal{A}$ is…

组合数学 · 数学 2015-02-02 Lili Mu , Richard P. Stanley

We completely determine all lower-modular elements of the lattice of all semigroup varieties. As a corollary, we show that a lower-modular element of this lattice is modular.

群论 · 数学 2010-05-03 V. Yu. Shaprynskii , B. M. Vernikov

Let $G$ be a connected reductive affine algebraic group defined over $\mathbb C$, and let $\Gamma$ be a cocompact lattice in $G$. We prove that any invariant bundle on $G/\Gamma$ is semistable.

微分几何 · 数学 2011-11-04 Indranil Biswas

A remarkable result due to Kou, Liu & Luo states that the condition of continuity for a dcpo can be split into quasi-continuity and meet-continuity. Their argument contained a gap, however, which is probably why the authors of the monograph…

计算机科学中的逻辑 · 计算机科学 2016-07-08 Weng Kin Ho , Achim Jung , Dongsheng Zhao