English
Related papers

Related papers: Poset Edge-Labellings and Left Modularity

200 papers

Let $L$ be a finite $n$-element lattice. We prove that if $L$ has at least $83\cdot 2^{n-8}$ sublattices, then $L$ is planar. For $n>8$, this result is sharp since there is a non-planar lattice with exactly $83\cdot 2^{n-8}-1$ sublattices.

Rings and Algebras · Mathematics 2019-07-03 Gábor Czédli

A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…

Rings and Algebras · Mathematics 2011-07-04 Luigi Santocanale , Friedrich Wehrung

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…

Group Theory · Mathematics 2011-12-30 John Shareshian , Russ Woodroofe

In the current paper we study extremal semilattices with respect to their equational properties. In the class $\mathbf{S}_n$ of all semilattices of order $n$ we find semilattices which have maximal (minimal) number of consistent equations.…

Rings and Algebras · Mathematics 2016-10-18 Artem N. Shevlyakov

We review and motivate recently-observed relationships between exactly solvable lattice models and modular representations of Hecke algebras. Firstly, we describe how the set of $n$-regular partitions label both of the following classes of…

q-alg · Mathematics 2008-02-03 Omar Foda , Bernard Leclerc , Masato Okado , Jean-Yves Thibon , Trevor A. Welsh

The exactly integrable systems connected with semisimple series $A$ for arbitrary grading are presented in explicit form. Their general solutions are expressed in terms of the matrix elements of various fundamental representations of $A_n$…

Mathematical Physics · Physics 2009-10-31 A. N. Leznov

The lattice of noncrossing partitions is well-known for its wide variety of combinatorial appearances and properties. For example, the lattice is rank-symmetric and enumerated by the Catalan numbers. In this article, we introduce a large…

Combinatorics · Mathematics 2024-09-17 Stella Cohen , Michael Dougherty , Andrew D. Harsh , Spencer Park Martin

We study chains in an $H$-closed topological partially ordered space. We give sufficient conditions for a maximal chain $L$ in an $H$-closed topological partially ordered space such that $L$ contains a maximal (minimal) element. Also we…

General Topology · Mathematics 2010-02-18 Oleg V. Gutik , Dušan Pagon , Dušan Repovš

We study the poset of d-indivisible noncrossing partitions introduced by M\"uhle, Nadeau and Williams. These are noncrossing partitions such that each block has cardinality 1 modulo d and each block of the dual partition also has…

Combinatorics · Mathematics 2024-10-15 Richard Ehrenborg , Gábor Hetyei

We consider realizations of a graph in the plane such that the distances between adjacent vertices satisfy the constraints given by an edge labeling. If there are infinitely many such realizations, counted modulo rigid motions, the labeling…

Combinatorics · Mathematics 2021-02-05 Georg Grasegger , Jan Legerský , Josef Schicho

Odd, positive-definite, integral, unimodular lattices N of rank 24 were classified by Borcherds. There are 273 isometry classes of such lattices. Associated to them are vertex superalgebras $V_N$ of central charge c=24. We show that at…

Quantum Algebra · Mathematics 2025-10-13 Gerald Höhn , Geoffrey Mason

Finite dimensional modular Lie superalgebras over algebraically closed fields with indecomposable Cartan matrices are classified under some technical, most probably inessential, hypotheses. If the Cartan matrix is invertible, the…

Representation Theory · Mathematics 2009-06-11 Sofiane Bouarroudj , Pavel Grozman , Dimitry Leites

We show that if a graded submodule of a Noetherian module cannot be written as a proper intersection of graded submodules, then it cannot be written as a proper intersection of submodules at all. More generally, we show that a natural…

Commutative Algebra · Mathematics 2016-10-03 Justin Chen , Youngsu Kim

For any finite Coxeter group $W$ of rank $n$ we show that the order complex of the lattice of non-crossing partitions $\mathrm{NC}(W)$ embeds as a connected chamber subcomplex into a spherical building of type $A_{n-1}$. We use this to give…

Combinatorics · Mathematics 2018-05-24 Julia Heller , Petra Schwer

We conjecture an integrability and linearizability test for dispersive Z^2-lattice equations by using a discrete multiscale analysis. The lowest order secularity conditions from the multiscale expansion give a partial differential equation…

Mathematical Physics · Physics 2008-01-24 Rafael Hernandez Heredero , Decio Levi , Matteo Petrera , Christian Scimiterna

Let $B_n$ be the poset generated by the subsets of $[n]$ with the inclusion as relation and let $P$ be a finite poset. We want to embed $P$ into $B_n$ as many times as possible such that the subsets in different copies are incomparable. The…

Combinatorics · Mathematics 2013-10-01 Gyula O. H. Katona , Dániel T. Nagy

Let $\mathbb{F}$ be a field of characteristic zero and let $\mathfrak{g}$ be a non-zero finite-dimensional split semisimple Lie algebra with root system $\Delta$. Let $\Gamma$ be a finite set of integral weights of $\mathfrak{g}$ containing…

Representation Theory · Mathematics 2020-04-01 Hogir Mohammed Yaseen

Let $\Lambda$ be a $\mathbb{Z}$-graded artin algebra. Two classical results of Gordon and Green state that if $\Lambda$ has only finitely many indecomposable gradable modules, up to isomorphism, then $\Lambda$ has finite representation…

Representation Theory · Mathematics 2018-08-07 Alex Dugas

The orthoscheme complex of a graded poset is a metrization of its order complex such that the simplex of each maximal chain is isometric to the Euclidean simplex of vertices $0, e_1,e_1+e_2,\ldots, e_1+e_2+ \cdots + e_n$. This notion was…

Metric Geometry · Mathematics 2019-05-07 Hiroshi Hirai

Let $L$ be a set of $n$ lines in the plane, not necessarily in general position. We present an efficient algorithm for finding all the vertices of the arrangement $A(L)$ of maximum level, where the level of a vertex $v$ is the number of…

Computational Geometry · Computer Science 2020-03-03 Dan Halperin , Sariel Har-Peled , Kurt Mehlhorn , Eunjin Oh , Micha Sharir
‹ Prev 1 3 4 5 6 7 10 Next ›