Related papers: Simple, subdirectly irreducible weakly dicomplemen…
We study the PBW filtration on irreducible finite--dimensional representations for the Lie algebra of type $\tt B_n$. We prove in several cases, including all multiples of the adjoint representation and all irreducible finite--dimensional…
Let $\mathcal W$ be a nontrivial variety of lattices, and let $L$ be a finite lattice in $\mathcal W$. The congruence density of $L$ with respect to $\mathcal W$ is the number of congruences of $L$ divided by the maximum number of…
The purpose of this paper is twofold. Firstly, to emphasise that the class of Lie algebras with chain lattices of ideals are elementary blocks in the embedding or decomposition of Lie algebras with finite lattice of ideals. Secondly, to…
Contrastive Learning (CL) has shown promising performance in collaborative filtering. The key idea is to generate augmentation-invariant embeddings by maximizing the Mutual Information between different augmented views of the same instance.…
Deep neural networks, in particular convolutional neural networks, have become highly effective tools for compressing images and solving inverse problems including denoising, inpainting, and reconstruction from few and noisy measurements.…
The standard perturbative weak-coupling expansions in lattice models are asymptotic. The reason for this is hidden in the incorrect interchange of the summation and integration. However, substituting the Gaussian initial approximation of…
The paper studies the lattice of subgroups of an isotropic reductive group G(R) over a commutative ring R, normalized by the elementary subgroup E(R). We prove the sandwich classification theorem for this lattice under the assumptions that…
A classical result of R.\,P. Dilworth states that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice~$L$. A~sharper form was published in G.~Gr\"atzer and E.\,T. Schmidt in 1962, adding…
Using isophotal radius correlations for a sample of 2MASS ellipticals, we have constructed a series of template surface brightness profiles to describe the profile shapes of ellipticals as a function of luminosity. The templates are a…
Deep architectures consist of tens or hundreds of convolutional layers (CLs) that terminate with a few fully connected (FC) layers and an output layer representing the possible labels of a complex classification task. According to the…
We use the structure lattice, introduced in Part I, to undertake a systematic study of the class $\mathscr S$ consisting of compactly generated, topologically simple, totally disconnected locally compact groups that are non-discrete. Given…
We discuss in this paper the lattice discretizations of all topological defect lines (TDLs) for diagonal, minimal CFTs, using integrable restricted solid-on-solid (RSOS) models. For these CFTs, the TDLs can be labeled by the Kac labels. In…
We study the regularity and the algebraic properties of certain lattice ideals. We establish a map I --> I\~ between the family of graded lattice ideals in an N-graded polynomial ring over a field K and the family of graded lattice ideals…
We construct an infinite series of simply transitive irreducible lattices in PGL_2(F_q((t))) \times PGL_2(F_q((t))) by means of a quaternion algebra over F_q(t). The lattices depend on an odd prime power q = p^r and a parameter \tau\ in…
The main goal of the article is testing a new classification algorithm. To this end we apply it to a relevant problem of describing the integrable cases of a subclass of two-dimensional lattices. By imposing the cut-off conditions…
Let $U_l$ be a quantum group at an $l$th root of unity. Many tilting modules for $U_l$ have been shown to have what we call a balanced semisimple filtration, or a Loewy series whose semisimple layers are symmetric about some middle layer.…
Singular spectrum analysis is developed as a nonparametric spectral decomposition of a time series. It can be easily extended to the decomposition of multidimensional lattice-like data through the filtering interpretation. In this…
We introduce maximal and average coherence on lattices by analogy with these notions on frames in Euclidean spaces. Lattices with low coherence can be of interest in signal processing, whereas lattices with high orthogonality defect are of…
We elaborate on the notion of a filtration of an operad defined in terms of a lattice-valued operad serving as an indexing object. That covers ordinary integer-indexed filtrations of associative algebras and operads as a special case, yet…
In this paper we completely characterize lattice ideals that are complete intersections or equivalently complete intersections finitely generated semigroups of $\bz^n\oplus T$ with no invertible elements, where $T$ is a finite abelian…