English
Related papers

Related papers: Counting chains in the noncrossing partition latti…

200 papers

We construct $\mathbb{Z}_p$-lattices and $\mathbb{F}_q[\![t]\!]$-lattices from cyclic $(f,\sigma)$-codes over finite chain rings, employing quotients of natural nonassociative orders and principal left ideals in carefully chosen…

Rings and Algebras · Mathematics 2025-01-22 Susanne Pumpluen

We develop an algorithm computing the transcendental lattice and the Mordell--Weil group of an extremal elliptic surface. As an example, we compute the lattices of four exponentially large series of surfaces

Algebraic Geometry · Mathematics 2012-05-01 Alex Degtyarev

This is a continuation of our "Lecture on Kac--Moody Lie algebras of the arithmetic type" \cite{25}. We consider hyperbolic (i.e. signature $(n,1)$) integral symmetric bilinear form $S:M\times M \to {\Bbb Z}$ (i.e. hyperbolic lattice),…

alg-geom · Mathematics 2015-06-24 Viacheslav V. Nikulin

Let $W$ be a simply laced Weyl group of finite type and rank $n$. If $W$ has type $E_7$, $E_8$, or $D_n$ for $n$ even, then the root system of $W$ has subsystems of type $nA_1$. This gives rise to an irreducible Macdonald representation of…

Combinatorics · Mathematics 2025-07-09 R. M. Green , Tianyuan Xu

This paper is a sequel to work of Dynkin on subroot lattices of root lattices and to work of Carter on presentations of Weyl group elements as products of reflections. The quotients $L/L_1$ are calculated for all irreducible root lattices…

Representation Theory · Mathematics 2016-04-28 Sven Balnojan , Claus Hertling

The two most fundamental conjectures on the structure of the generic Hecke algebra $\mathcal{H}(W)$ associated with a complex reflection group $W$ state that $\mathcal{H}(W)$ is a free module of rank $|W|$ over its ring of definition, and…

Representation Theory · Mathematics 2022-03-02 Eirini Chavli , Maria Chlouveraki

This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is…

Information Theory · Computer Science 2012-04-10 D. Kapetanovic , H. V. Cheng , W. H. Mow , F. Rusek

This work presents an extension of the Construction $\pi_A$ lattices proposed in \cite{huang2017construction}, to Hurwitz quaternion integers. This construction is provided by using an isomorphism from a version of the Chinese remainder…

Information Theory · Computer Science 2025-05-23 Juliana G. F. Souza , Sueli I. R. Costa , Cong Ling

We study a family of Zariski dense finitely generated discrete subgroups of $\mathrm{Isom}(\mathbb{H}^d)$, $d \geqslant 2$, defined by the following property: any group in this family contains at least one reflection in a hyperplane. As an…

Group Theory · Mathematics 2024-01-18 Nikolay Bogachev , Alexander Kolpakov

A finite irreducible real reflection group of rank l and Coxeter number h has root system of cardinality h*l. It is shown that the fake degree for the permutation action on its roots is divisible by [h]_q = 1+q+q^2+...+q^{h-1}, and that in…

Combinatorics · Mathematics 2012-01-30 Victor Reiner , Zhiwei Yun

We study fast lattice decodability of space-time block codes for $n$ transmit and receive antennas, written very generally as a linear combination $\sum_{i=1}^{2l} s_i A_i$, where the $s_i$ are real information symbols and the $A_i$ are…

Information Theory · Computer Science 2016-11-18 Grégory Berhuy , Nadya Markin , B. A. Sethuraman

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…

Commutative Algebra · Mathematics 2024-03-13 Oleksandra Gasanova , Lisa Nicklasson

We introduce and study the lattice of generalized partitions, called weighted partitions. This lattice possesses similar properties of the lattice of partitions. By use of the pictorial representation of a weighted partition, the total…

Combinatorics · Mathematics 2023-01-02 Keiichi Shigechi

A quasiantichain is a lattice consisting of a maximum, a minimum, and the atoms of the lattice. The width of a quasiantichian is the number of atoms. For a positive integer $w$ ($\ge 3$), a quasiantichain of width $w$ is denoted by…

Group Theory · Mathematics 2017-05-19 Lijian An

Let $V$ be a symplectic space over $\mathbb{C}$, $dim_\mathbb{C} V=2l$, and let $G$ be a finite subgroup of $Sp(V)$. The invariant regular functions $\mathbb{C}[V]^G$ inherit a Poisson algebra structure and so the quotient variety ${\cal…

Rings and Algebras · Mathematics 2007-07-09 Jacques Alev , Loïc Foissy

A Coxeter group W is called reflection independent if its reflections are uniquely determined by W only, independently on the choice of the generating set. We give a new sufficient condition for the reflection independence, and examine this…

Group Theory · Mathematics 2007-05-23 Koji Nuida

We extend the theory of dual Coxeter and Artin groups to all rank-three Coxeter systems, beyond the previously studied spherical and affine cases. Using geometric, combinatorial, and topological techniques, we show that rank-three…

Group Theory · Mathematics 2025-01-15 Emanuele Delucchi , Giovanni Paolini , Mario Salvetti

We define parabolic quasi-Coxeter elements in well generated complex reflection groups. We characterize them in multiple natural ways, and we study two combinatorial objects associated with them: the collections $\operatorname{Red}_W(g)$ of…

Combinatorics · Mathematics 2024-01-01 Theo Douvropoulos , Joel Brewster Lewis , Alejandro H. Morales

An $N\times n$ matrix on $q$ symbols is called $\{w_1,\ldots,w_t\}$-separating if for arbitrary $t$ pairwise disjoint column sets $C_1,\ldots,C_t$ with $|C_i|=w_i$ for $1\le i\le t$, there exists a row $f$ such that $f(C_1),\ldots,f(C_t)$…

Combinatorics · Mathematics 2018-08-21 Gennian Ge , Chong Shangguan , Xin Wang

Given a numerical semigroup S = <a_0, a_1, a_2,..., a_t> and n in S, we consider the factorization n = c_0 a_0 + c_1 a_1 + ... + c_t a_t where c_i >= 0. Such a factorization is maximal if c_0 + c_1 + ... + c_t is a maximum over all such…

Commutative Algebra · Mathematics 2014-07-15 Lance Bryant , James Hamblin