Related papers: Factoriality inside Boolean lattices

Left-modularity is a concept that generalizes modularity in lattice theory. In this paper, we give a characterization of left-modular elements and derive two formulae for the characteristic polynomial of a lattice with such an element, one…

It has been recently observed that fundamental aspects of the classical theory of factorization can be greatly generalized by combining the languages of monoids and preorders. This has led to various theorems on the existence of certain…

We study a numerical semigroup ring as an algebra over another numerical semigroup ring. The complete intersection property of numerical semigroup algebras is investigated using factorizations of monomials into minimal ones. The goal is to…

We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…

Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for…

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.,…

Each restriction semigroup is proved to be embeddable in a factorisable restriction monoid, or, equivalently, in an almost factorisable restriction semigroup. It is also established that each restriction semigroup has a proper cover which…

Let $H$ be a Krull monoid with finite class group $G$ and suppose that each class contains a prime divisor. Then every non-unit $a \in H$ has a factorization into atoms, say $a=u_1 \cdot\ldots \cdot u_k$ where $k$ is the factorization…

The operator level proof of factorization theorem exhibited in [1] is extended to the semi-inclusive deep inelastic scattering process(SIDIS). Factorization theorem can be proved at operator level if there are not detected soft hadrons.

In an additive factorial monoid each element can be represented as a linear combination of irreducible elements (atoms) with uniquely determined coefficients running over all natural numbers. In this paper we develop for a wide class of…

This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…

We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…

We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…

For rings R with identity, we define a class of nonlinear higher order recurrences on unitary left R-modules that include linear recurrences as special cases. We obtain conditions under which a recurrence of order k+1 in this class is…

We devise exact conditions under which a join semilattice with a weak contact relation can be semilattice embedded into a Boolean algebra with an overlap contact relation, equivalently, into a distributive lattice with additive contact…

The application of binary matrices are numerous. Representing a matrix as a mixture of a small collection of latent vectors via low-rank decomposition is often seen as an advantageous method to interpret and analyze data. In this work, we…

Finding a minimal factorization for a generic semigroup can be done by using the Froidure-Pin Algorithm, which is not feasible for semigroups of large sizes. On the other hand, if we restrict our attention to just a particular semigroup, we…

Since Henrik Strietz's 1975 paper proving that the lattice Part($n$) of all partitions of an $n$-element finite set is four-generated, more than half a dozen papers have been devoted to four-element generating sets of this lattice. We prove…

We study centralizer clones of finite lattices and semilattices. For semilattices, we give two characterizations of the centralizer and also derive formulas for the number of operations of a given essential arity in the centralizer. We also…

Factor Analysis is about finding a low-rank plus sparse additive decomposition from a noisy estimate of the signal covariance matrix. In order to get such a decomposition, we formulate an optimization problem using the nuclear norm for the…