Related papers: Supersolvable lattices of $J$-classes
Let $\rho\colon G\to \mathrm{GL}_n(K)$ be an continuous irreducible representation of a compact group over a complete discretely valued field $K$. Let $W_i,W_j$ be two irreducible subrepresentations of $\overline{\rho}^{ss}$, the…
We show that the number of conjugacy classes of maximal finite subgroups of a lattice in a semisimple Lie group is linearly bounded by the covolume of the lattice. Moreover, for higher rank groups, we show that this number grows sublinearly…
We study congruences of the semigroup $\mathscr{I\!O}\!_{\infty}(\mathbb{Z}^n_{\operatorname{lex}})$ of monotone injective partial selfmaps of the set of $L_n\times_{\operatorname{lex}}\mathbb{Z}$ having co-finite domain and image, where…
We give a complete characterization of generic irreducibility for dispersion polynomials and Bloch varieties of periodic graph operators. More precisely, we prove that for a generic choice of edge weights and potentials, the dispersion…
Infinite hyperplane arrangements whose vertices form a lattice are studied from the point of view of commutative algebra. The quotient of such an arrangement modulo the lattice action represents the minimal free resolution of the associated…
The $M$-polynomial of a graph $G$ is defined as $\sum_{i\le j} m_{i,j}(G)x^iy^j$, where $m_{i,j}(G)$, $i,j\ge 1$, is the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. Knowing the $M$-polynomial, formulas for bond…
In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…
We introduce semidistrim lattices, a simultaneous generalization of semidistributive and trim lattices that preserves many of their common properties. We prove that the elements of a semidistrim lattice correspond to the independent sets in…
The character theory of finite groups has numerous basic questions that are often already quite involved: enumerating of irreducible characters, their character formulas, point-wise product decompositions, and restriction/induction between…
A subresiduated lattice ordered commutative monoid (or srl-monoid for short) is a pair $(\textbf{A},Q)$ where $\textbf{A}=(A,\wedge,\vee,\cdot,e)$ is an algebra of type $(2,2,2,0)$ such that $(A,\wedge,\vee)$ is a lattice, $(A,\cdot,e)$ is…
Uniform bounds on sketched inner products of vectors or matrices underpin several important computational and statistical results in machine learning and randomized algorithms, including the Johnson-Lindenstrauss (J-L) lemma, the Restricted…
Semiconductor superlattices may display dispersions that are degenerate either at the zone center or zone boundary. We show that they are linear upon the wave-vector in the vicinity of the crossing point. This establishes a realisation of…
By means of quantum Monte Carlo simulations we study phase diagrams of dipolar bosons in a square optical lattice. The dipoles in the system are parallel to each other and their orientation can be fixed in any direction of the…
Hochschild lattices are specific intervals in the dexter meet-semilattices recently introduced by Chapoton. A natural geometric realization of these lattices leads to some cell complexes introduced by Saneblidze, called the Hochschild…
This is a survey of characterizations and relationships between some properties of lattices, particularly the modular, Arguesian, linear, and distributive properties, but also some other related properties. The survey emphasizes finite and…
A natural first step in the classification of all `physical' modular invariant partition functions $\sum N_{LR}\,\c_L\,\C_R$ lies in understanding the commutant of the modular matrices $S$ and $T$. We begin this paper extending the work of…
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…
The discrepancy of a point set quantifies how well the points are distributed, with low-discrepancy point sets demonstrating exceptional uniform distribution properties. Such sets are integral to quasi-Monte Carlo methods, which approximate…
For the modular lattice D^4 = {1+1+1+1} associated with the extended Dynkin diagram \tilde{D}_4 (and also for D^r, where r > 4), Gelfand and Ponomarev introduced the notion of admissible and perfect lattice elements and classified them. In…
Given a bounded lattice $L$ with bounds $0$ and $1$, it is well known that the set $\mathsf{Pol}_{0,1}(L)$ of all $0,1$-preserving polynomials of $L$ forms a natural subclass of the set $\mathsf{C}(L)$ of aggregation functions on $L$. The…