中文
相关论文

相关论文: Graded left modular lattices are supersolvable

200 篇论文

We prove that every finite lattice L can be embedded in a three-generated finite lattice K. We also prove that every algebraic lattice with accessible cardinality is a complete sublattice of an appropriate algebraic lattice K such that K is…

环与代数 · 数学 2015-12-15 Gábor Czédli

We introduce a family of toric algebras defined by maximal chains of a finite distributive lattice. Applying results on stable set polytopes we conclude that every such algebra is normal and Cohen-Macaulay, and give an interpretation of its…

交换代数 · 数学 2024-03-13 Oleksandra Gasanova , Lisa Nicklasson

Using the classification and description of the structure of bisimple monogenic orthodox semigroups obtained in \cite{key10}, we prove that every bisimple orthodox semigroup generated by a pair of mutually inverse elements of infinite order…

环与代数 · 数学 2021-11-04 Simon M. Goberstein

Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…

计算机科学中的逻辑 · 计算机科学 2025-04-18 Zhibo Chen , Frank Pfenning

We prove that the very simple lattices which consist of a largest, a smallest and $2n$ pairwise incomparable elements where $n$ is a positive integer can be realized as the lattices of intermediate subfactors of finite index and finite…

算子代数 · 数学 2009-05-09 Feng Xu

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d…

数论 · 数学 2010-09-16 Werner Bley , Henri Johnston

We give a combinatorial model for the bounded derived category of graded modules over the dual numbers in terms of arcs on the integer line with a point at infinity. Using this model we describe the lattice of thick subcategories of the…

表示论 · 数学 2016-11-08 Sira Gratz , Greg Stevenson

Let $L$ be a lattice. We call a congruence relation $\gQ$ of $L$ isoform, if any two congruence classes of $\gQ$ are isomorphic (as lattices). Let us call the lattice $L$ isoform, if all congruences of $L$ are isoform. G. Gr\"atzer and…

环与代数 · 数学 2013-10-01 G. Grätzer , E. T. Schmidt , R. W. Quackenbush

We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…

逻辑 · 数学 2024-11-20 Richard A. Shore , Bjørn Kjos-Hanssen

Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…

逻辑 · 数学 2022-07-19 Deacon Linkhorn

We completely determine all commutative semigroup varieties that are cancellable elements of the lattice SEM of all semigroup varieties. In particular, we prove that, for commutative varieties, the properties of being cancellable and…

群论 · 数学 2020-01-22 Sergey V. Gusev , Dmitry V. Skokov , Boris M. Vernikov

We prove a representation theorem for totally ordered idempotent monoids via a nested sum construction. Using this representation theorem we obtain a characterization of the subdirectly irreducible members of the variety of semilinear…

环与代数 · 数学 2026-02-16 Simon Santschi

Fixed-size commutative rings are quasi-ordered such that all scalar linearly solvable networks over any given ring are also scalar linearly solvable over any higher-ordered ring. As consequences, if a network has a scalar linear solution…

信息论 · 计算机科学 2018-01-31 Joseph Connelly , Kenneth Zeger

We show that many important varieties and sets of varieties of semigroups may be defined by relatively simple and transparent first-order formulas in the lattice of all semigroup varieties.

群论 · 数学 2010-09-08 B. M. Vernikov

We completely classify all neutral or costandard elements in the lattice $\mathbb{MON}$ of all monoid varieties. Further, we prove that an arbitrary upper-modular element of $\mathbb{MON}$ except the variety of all monoids is either a…

群论 · 数学 2019-11-26 S. V. Gusev

This work proves that the process of gluing finite lattices to form a larger lattice is bijective, that is each lattice is the glued sum of a unique system of finite lattices, provided the class of lattices is constrained to modular,…

组合数学 · 数学 2025-03-19 Dale R. Worley

We show that the set of complex points in the moduli space of polynomials of degree d corresponding to post-critically finite polynomials is a set of algebraic points of bounded height. It follows that for any B, the set of conjugacy…

数论 · 数学 2011-02-15 Patrick Ingram

We prove that the bounded derived category of the lattice of order ideals of the product of two ordered chains is fractionally Calabi-Yau. We also show that these lattices are derived equivalent to higher Auslander algebras of type A. The…

表示论 · 数学 2025-09-09 Tal Gottesman

We completely determine all semigroup varieties satysfiyng a permutational identity of length 3 that are modular elements of the lattice of all semigroup varieties. Using this result, we provide an example of a semigroup variety that is a…

群论 · 数学 2017-09-12 Dmitry V. Skokov , Boris M. Vernikov

Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…

组合数学 · 数学 2009-03-30 Drew Armstrong