Related papers: An unexpected application of minimization theory t…
We translate notions and results of decomposition and dimension theories for module categories, into the lattice environment. In particular we translate dimension theory in module categories to complete modular upper-continuous lattices.
We present a practical and powerful new framework for both unconstrained and constrained submodular function optimization based on discrete semidifferentials (sub- and super-differentials). The resulting algorithms, which repeatedly compute…
In this paper, we explain the importance of finite decomposition semigroups and present two theorems related to their structure.
Modular exponentiation is a common mathematical operation in modern cryptography. This, along with modular multiplication at the base and exponent levels (to different moduli) plays an important role in a large number of key agreement…
We present in this paper a general algorithm for solving first-order formulas in particular theories called "decomposable theories". First of all, using special quantifiers, we give a formal characterization of decomposable theories and…
Exponential operator decompositions are an important tool in many fields of physics, for example, in quantum control, quantum computation, or condensed matter physics. In this work, we present a method for obtaining such decompositions,…
The deformation bicomplex of a module-algebra over a bialgebra is constructed. It is then applied to study algebraic deformations in which both the module structure and the algebra structure are deformed. The cases of module-coalgebras,…
We present in this paper the preliminary design of a module system based on a notion of components such as they are found in COM. This module system is inspired from that of Standard ML, and features first-class instances of components,…
We extend the theory of decomposable maps by giving a detailed description of k-positive maps. A relation between transposition and modular theory is established. The structure of positive maps in terms of modular theory (the generalized…
Thin coverings are a method of constructing graded-simple modules from simple (ungraded) modules. After a general discussion, we classify the thin coverings of (quasifinite) simple modules over associative algebras graded by finite abelian…
Submodular functions are relevant to machine learning for at least two reasons: (1) some problems may be expressed directly as the optimization of submodular functions and (2) the lovasz extension of submodular functions provides a useful…
We revisit the classical concept of near-decomposability in complex systems, introduced by Herbert Simon in his foundational article The Architecture of Complexity, by developing an explicit quantitative analysis based on singular…
The main goal of this paper is to introduce a framework for infinitesimal deformation problems, using new methods coming from operadic calculus. We construct an adjunction between infinitesimal deformation problems over some type of…
We explore methods for constructing normal forms of indecomposable quiver representations. The first part of the paper develops homological tools for recursively constructing families of indecomposable representations from indecomposables…
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
We introduce a relational approach to program synthesis. The key idea is to decompose synthesis tasks into simpler relational synthesis subtasks. Specifically, our representation decomposes a training input-output example into sets of input…
In this note we give a precise statement and a detailed proof for reconstruction problem of weak bialgebra maps. As an application we characterize indecomposability of weak algebras in categorical setting.
The aim of this paper is to prove all well-known metrization theorems using partitions of unity. To accomplish this, we first discuss sufficient and necessary conditions for existence of $\mathcal{U}$-small partitions of unity (partitions…
The use of interpolants in verification is gaining more and more importance. Since theories used in applications are usually obtained as (disjoint) combinations of simpler theories, it is important to modularly re-use interpolation…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…