English
Related papers

Related papers: Lattice congruences of the weak order

200 papers

The set of all subracks $\mathcal{R}(X)$ of a finite rack $X$ form a lattice under inclusion. We prove that if a rack $X$ satisfies a certain condition then the homotopy type of the order complex of $\mathcal{R}(X)$ is a $(m-2)$-sphere,…

Group Theory · Mathematics 2022-03-29 Selçuk Kayacan

The $1/3$-$2/3$ Conjecture, originally formulated in 1968, is one of the best-known open problems in the theory of posets, stating that the balance constant (a quantity determined by the linear extensions) of any non-total order is at least…

Combinatorics · Mathematics 2024-09-17 Christian Gaetz , Yibo Gao

The aim of this paper is to establish a lattice theoretical framework to study the partially ordered set $\operatorname{\mathsf{tors}} A$ of torsion classes over a finite-dimensional algebra $A$. We show that $\operatorname{\mathsf{tors}}…

Representation Theory · Mathematics 2024-08-13 Laurent Demonet , Osamu Iyama , Nathan Reading , Idun Reiten , Hugh Thomas

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…

Representation Theory · Mathematics 2017-01-17 Peng He , Xue-ping Wang

The Coxeter lattices, which we denote $A_{n/m}$, are a family of lattices containing many of the important lattices in low dimensions. This includes $A_n$, $E_7$, $E_8$ and their duals $A_n^*$, $E_7^*$ and $E_8^*$. We consider the problem…

Information Theory · Computer Science 2016-11-17 Robby G. McKilliam , Warren D. Smith , I. Vaughan L. Clarkson

How the vortex lattice orders at long range in a layered superconductor with weak point pinning centers is studied through a duality analysis of the corresponding frustrated XY model. Vortex-glass order emerges out of the vortex liquid…

Superconductivity · Physics 2007-05-23 J. P. Rodriguez

Given a finite, simple graph $G$, the $k$-component order edge connectivity of $G$ is the minimum number of edges whose removal results in a subgraph for which every component has order at most $k-1$. In general, determining the…

Combinatorics · Mathematics 2023-10-10 Michael Yatauro

In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)=2$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd, $\{s,t\}$ is a…

Group Theory · Mathematics 2007-05-23 Tetsuya Hosaka

Let G be a topological Kac-Moody group of rank 2 with symmetric Cartan matrix, defined over a finite field F_q. An example is G = SL(2,F_q((t^{-1}))). We determine a positive lower bound on the covolumes of cocompact lattices in G, and…

Group Theory · Mathematics 2020-01-21 Inna , Capdeboscq , Anne Thomas

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

Combinatorics · Mathematics 2025-05-20 Joel Brewster Lewis , Jiayuan Wang

The CSP dichotomy conjecture has been recently established, but a number of other dichotomy questions remain open, including the dichotomy classification of list homomorphism problems for signed graphs. Signed graphs arise naturally in many…

Combinatorics · Mathematics 2023-03-06 Jan Bok , Richard Brewster , Pavol Hell , Nikola Jedličková , Arash Rafiey

We establish new general etale versions of theorems of Barth and Sommese. Respectively, we compute the lower etale cohomology of closed subvarieties of $P^N$ of small codimensions and of their preimages with respect to proper morphisms…

Algebraic Geometry · Mathematics 2025-07-10 Sergei I. Arkhipov , Mikhail V. Bondarko

This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…

Rings and Algebras · Mathematics 2013-04-02 G. Grätzer , E. T. Schmidt

Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…

Combinatorics · Mathematics 2020-03-05 Michael Cuntz , Paul Mücksch

A type of directed multigraph called a W-digraph is introduced to model the structure of certain representations of Hecke algebras, including those constructed by Lusztig and Vogan from involutions in a Weyl group. Building on results of…

Representation Theory · Mathematics 2021-07-01 Dean Alvis

We prove that two reflection factorizations of a parabolic quasi-Coxeter element in a finite Coxeter group belong to the same Hurwitz orbit if and only if they generate the same subgroup and have the same multiset of conjugacy classes. As a…

Combinatorics · Mathematics 2024-02-07 Theo Douvropoulos , Joel Brewster Lewis

A problem posed by Erd\H{o}s in 1945 initiated the study of non-separable arrangements of convex bodies. A finite collection of convex bodies in Euclidean $d$-space is called a non-separable family (or NS-family) if every hyperplane…

Metric Geometry · Mathematics 2025-12-30 Károly Bezdek , Zsolt Lángi

In this paper, we investigate boundaries of parabolic subgroups of Coxeter groups. Let $(W,S)$ be a Coxeter system and let $T$ be a subset of $S$ such that the parabolic subgroup $W_T$ is infinite. Then we show that if a certain set is…

Group Theory · Mathematics 2007-05-23 Tetsuya Hosaka

Ceballos and Pons introduced the $s$-weak order on $s$-decreasing trees, for any weak composition $s$. They proved that it has a lattice structure and further conjectured that it can be realized as the $1$-skeleton of a polyhedral…

A set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$, which is not in $D$, has a neighbor in $D$. A set of vertices $D$ in $G$ is convex (respectively, isometric), if all vertices in all shortest paths…

Combinatorics · Mathematics 2017-04-28 Boštjan Brešar , Tanja Gologranc , Tim Kos
‹ Prev 1 8 9 10 Next ›