Related papers: Factorizations in Geometric Lattices
Lattices and periodic point sets are well known objects from discrete geometry. They are also used in crystallography as one of the models of atomic structure of periodic crystals. In this paper we study the embedding properties of spaces…
Let $\{{\cdot},{\cdot}\}_{\boldsymbol{\mathcal{P}}}$ be a variational Poisson bracket in a field model on an affine bundle $\pi$ over an affine base manifold $M^m$. Denote by $\times$ the commutative associative multiplication in the…
The elementary symmetric partition function is a map on the set of partitions. It sends a partition lambda to the partition whose parts are the summands in the evaluation of the elementary symmetric function on the parts of lambda. These…
Matrix factorization is a well-studied task in machine learning for compactly representing large, noisy data. In our approach, instead of using the traditional concept of matrix rank, we define a new notion of link-rank based on a…
We extend the planar Pfaffian formalism for the evaluation of the Ising partition function to lattices of high topological genus g. The 3D Ising model on a cubic lattice, where g is proportional to the number of sites, is discussed in…
First some old as well as new results about P.I. algebras, Ore extensions, and degrees are presented. Then quantized $n\times r$ matrices as well as quantized factor algebras of $M_q(n)$ are analyzed. The latter are the quantized function…
We study the algebra of invariant representative functions over the N-fold Cartesian product of copies of a compact Lie group G modulo the action of conjugation by the diagonal subgroup. We construct a basis of invariant representative…
Purpose: To develop the algebraic foundation of finite commutative ternary $\Gamma$-semirings by identifying their intrinsic invariants, lattice organization, and radical behavior that generalize classical semiring and $\Gamma$-ring…
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…
The N distinct prime numbers that make up a composite number M allow $2^{N-1}$ bi partioning into two relatively prime factors. Each such pair defines a pair of conjugate representations. These pairs of conjugate representations, each of…
The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…
We study quantum dynamics of a wave packet on a class of one dimensional decorated aperiodic lattices, described within a tight binding formalism. We look for the possibility of finding extended single particle states even in the absence of…
This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…
A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…
We provide a new geometric representation of a family of fragmentation processes by nested laminations, which are compact subsets of the unit disk made of noncrossing chords. We specifically consider a fragmentation obtained by cutting a…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
A semidomain is an additive submonoid of an integral domain that is closed under multiplication and contains the identity element. Although atomicity and divisibility in integral domains have been systematically investigated for more than…
We extend the theory of atomized semilattices to the infinite setting. We show that it is well-defined and that every semilattice is atomizable. We also study atom redundancy, focusing on complete and finitely generated semilattices and…
Every lattice is isomorphic to a lattice whose elements are sets of sets, and whose operations are intersection and an operation extending the union of two sets of sets A and B by the set of all sets in which the intersection of an element…
For a finite group $D$, we study categorical factorisation homology on oriented surfaces equipped with principal $D$-bundles, which `integrates' a (linear) balanced braided category $\mathcal{A}$ with $D$-action over those surfaces. For…