English
Related papers

Related papers: Finite lattices and Koszul Filtrations

200 papers

In this paper we introduce and study the lattice of normal subgroups of a group $G$ that determine solitary quotients. It is closely connected to the well-known lattice of solitary subgroups of $G$ (see \cite{5}). A precise description of…

Group Theory · Mathematics 2018-06-01 Marius Tărnăuceanu

We prove that an irreducible lattice acting on a product of two or more locally finite, biregular trees is finitely generated.

Group Theory · Mathematics 2010-08-17 Anne Thomas , Kevin Wortman

The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…

Combinatorics · Mathematics 2018-10-18 Xu Wang , Xuxu Zhao , Haiyuan Yao

We give a complete picture of the interaction between Koszul and Ringel dualities for graded standardly stratified algebras (in the sense of Cline, Parshall and Scott) admitting linear tilting (co)resolutions of standard and proper…

Representation Theory · Mathematics 2014-05-16 Volodymyr Mazorchuk

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,…

Combinatorics · Mathematics 2025-03-19 Dale R. Worley

The aim of this article is to provide a complementary understanding to some results of the second author using the machinery of Koszul complexes, and to explain how this approach can provide a new description of projective derived…

Algebraic Geometry · Mathematics 2025-06-27 Tristan Bozec , Julien Grivaux

A poset is called upper homogeneous, or "upho," if every principal order filter of the poset is isomorphic to the whole poset. We study (finite type $\mathbb{N}$-graded) upho lattices, with an eye towards their classification. Any upho…

Combinatorics · Mathematics 2025-02-07 Sam Hopkins

Zilber's Theorem states that a finite lattice $L$ is planar if{}f it has a complementary order relation. We provide a new proof for this crucial result and discuss some applications, including a canonical form for finite planar lattices and…

Rings and Algebras · Mathematics 2021-04-29 Kirby A. Baker , George Grätzer

We classify the factorizations of finite classical groups with nonsolvable factors, completing the classification of factorizations of finite almost simple groups.

Group Theory · Mathematics 2024-07-26 Cai Heng Li , Lei Wang , Binzhou Xia

The problem of constructing lattices such that their quantization noise approaches a desired distribution is studied. It is shown that asymptotically is the dimension, lattice quantization noise can approach a broad family of distribution…

Information Theory · Computer Science 2019-06-06 Tal Gariby , Uri Erez

Separation systems are posets with additional structure that form an abstract setting in which tangle-like clusters in graphs, matroids and other combinatorial structures can be expressed and studied. This paper offers some basic theory…

Combinatorics · Mathematics 2025-05-16 Reinhard Diestel , Jay Lilian Kneip

In this paper subvarieties of pseudocomplemented distributive lattices are classified by their unification type. We determine the unification type of every particular unification problem in each subvariety of pseudocomplemented distributive…

Rings and Algebras · Mathematics 2017-02-22 Leonardo Manuel Cabrer

We observe that for a quasi-compact and quasi-separated scheme the structure sheaf generates the perfect complexes if and only if the lattice of thick subcategories is distributive if and only if the affinization map is 0-affine. Examples…

Algebraic Geometry · Mathematics 2026-04-22 Andy Jiang , Greg Stevenson

Divisibility monoids are a natural lattice-theoretical generalization of Mazurkiewicz trace monoids, namely monoids in which the distributivity of the involved divisibility lattices is kept as an hypothesis, but the relations between the…

General Mathematics · Mathematics 2007-05-23 Matthieu Picantin

We give several characterizations of discrete Sugeno integrals over bounded distributive lattices, as particular cases of lattice polynomial functions, that is, functions which can be represented in the language of bounded lattices using…

Rings and Algebras · Mathematics 2010-01-07 Miguel Couceiro , Jean-Luc Marichal

We study canonical filtrations of finite-dimensional associative algebras and Lie algebras. These filtrations are defined via optimal destabilizing one-parameter subgroups in the sense of geometric invariant theory (GIT), and appear to be a…

Algebraic Geometry · Mathematics 2024-06-18 Trevor Jones

It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…

Combinatorics · Mathematics 2015-10-20 Stuart Margolis , John Rhodes , Pedro V. Silva

In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…

Discrete Mathematics · Computer Science 2013-06-03 Jens Gerlach

We consider limits of equilibrium distributions as temperature approaches zero, for systems of infinitely many particles, and characterize the support of the limiting distributions. Such results are known for particles with positions on a…

Mathematical Physics · Physics 2015-05-13 Jean Bellissard , Charles Radin , Senya Shlosman

Koszul algebras with quadratic Groebner bases, called strong Koszul algebras, are studied. We introduce affine algebraic varieties whose points are in one-to-one correspondence with certain strong Koszul algebras and we investigate the…

Rings and Algebras · Mathematics 2017-02-10 Edward L. Green
‹ Prev 1 4 5 6 7 8 10 Next ›