Related papers: Factorizations in Geometric Lattices
It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…
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…
Our aim in this thesis is to use the language of deformation-quantization to understand certain quantized algebras by looking at properties of the corresponding commutative ones, and conversely to obtain results about the commutative…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
The first aim of this work is to characterize when the lattice of all submodules of a module is a direct product of two lattices. In particular, which decompositions of a module $M$ produce these decompositions: the \emph{lattice…
We propose a generalization of the factorization method to the case when $\mathcal{G}$ is a finite dimensional Lie algebra such that $\mathcal{G}=\mathcal{G}_0\oplus M \oplus N$ (direct sum of vector spaces), where $\mathcal{G}_0$ is a…
For $\mathbb B^n$ the unit ball of $\mathbb C^n$, we consider Bergman-Orlicz spaces of holomorphic functions in $L^\Phi_\alpha(\mathbb B^n)$, which are generalizations of classical Bergman spaces. We obtain atomic decomposition for…
We study categories of matrix factorizations. These categories are defined for any regular function on a suitable regular scheme. Our paper has two parts. In the first part we develop the foundations; for example we discuss derived direct…
The matrix LU factorization algorithm is a fundamental algorithm in linear algebra. We propose a generalization of the LU and LEU algorithms to accommodate the case of a commutative domain and its field of quotients. This algorithm…
Let $M$ be a Puiseux monoid, that is, a monoid consisting of nonnegative rationals (under addition). A nonzero element of $M$ is called an atom if its only decomposition as a sum of two elements in $M$ is the trivial decomposition (i.e.,…
$\DeclareMathOperator{\Int}{Int}\DeclareMathOperator{\IntR}{Int{}^\text{R}}$For a domain $D$, the ring $\Int(D)$ of integer-valued polynomials over $D$ is atomic if $D$ satisfies the ascending chain condition on principal ideals. However,…
We study separation axioms for $X$-top-lattices (i.e. lattices $L$ for which a given subset $X\subseteq L\backslash \{1\}$ admits a \emph{Zariski-like topology}). Such spaces are $T_{0}$ and usually far away from being $T_{2}.$% We give…
A real-space formalism for density-functional perturbation theory (DFPT) is derived and applied for the computation of harmonic vibrational properties in molecules and solids. The practical implementation using numeric atom-centered…
The partition function of composite bosons ("cobosons" for short) is calculated in the canonical ensemble, with the Pauli exclusion principle between their fermionic components included in an exact way through the finite temperature…
We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…
The central object of study in this paper are infinite banded Hessenberg matrices admitting factorisations as products of bidiagonal matrices. In the two main novel results of this paper, we show that these Hessenberg matrices are…
Structures involving a lattice and join-endomorphisms on it are ubiquitous in computer science. We study the cardinality of the set $\mathcal{E}(L)$ of all join-endomorphisms of a given finite lattice $L$. In particular, we show for…
We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that may encode specific…
Let $G=(V,E)$ be a simple undirected graph with $n$ vertices then a set partition $\pi=\{V_1, ..., V_k\}$ of the vertex set of $G$ is a connected set partition if each subgraph $G[V_j]$ induced by the blocks $V_j$ of $\pi$ is connected for…
The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining…