Related papers: Operad Structure of Poset Matrices
This note presents a summary and review of various conditions and characterizations for matrix stability (in particular diagonal matrix stability) and matrix stabilizability.
We systematically explore the new method of construction (known as the propus construction) of symmetric Hadamard matrices for small orders, $4v$. In particular we give the first examples of symmetric Hadamard matrices of order $156=4\cdot…
In this article we give a construction of a polynomial 2-monad from an operad and describe the algebras of the 2-monads which then arise. This construction is different from the standard construction of a monad from an operad in that the…
The purpose of this paper is to give an overview of the operator structure of frames, where the operator belongs to certain classes of linear operators and the element belongs to $H$. We discuss the size of the set of such elements. Also,…
In this paper we develop the theory of operads, algebras and modules in cofibrantly generated symmetric monoidal model categories. We give J-semi model strucures, which are a slightly weaker version of model structures, for operads and…
Starting from filters over the set of indices, we introduce structures in a product of sets where the coordinate sets have the given structures.
A review of recent lattice calculations of nucleon structure and matrix elements of operators in nucleons is presented. It primarily covers developments in the calculation of the matrix elements of the scalar, tensor, pseudo-scalar,…
We survey all known examples of finite posets whose order polynomials have product formulas, and we propose the heuristic that these are the same posets with good dynamical behavior. Here the dynamics in question are the actions of…
We provide a formal definition and study the basic properties of partially ordered chains (POC). These systems were proposed to model textures in image processing and to represent independence relations between random variables in…
The proposed article aims at offering a comprehensive tutorial for the computational aspects of structured matrix and tensor factorization. Unlike existing tutorials that mainly focus on {\it algorithmic procedures} for a small set of…
In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small…
We study a composition operator on Lorentz spaces. In particular we provide necessary and sufficient conditions under which a measurable mapping induces a bounded composition operator.
In this paper we propose a procedure which allows the construction of a large family of FIR d x d matrix wavelet filters by exploiting the one-to-one correspondence between QMF systems and orthogonal operators which commute with the shifts…
The notion of disjoint weighing matrices is introduced as a generalization of orthogonal designs. A recursive construction along with a computer search lead to some infinite classes of disjoint weighing matrices, which in turn are shown to…
The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…
In this work we develop some categorical aspects of the double structure of a module.
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…
There is a family of constructions to produce orthomodular structures from modular lattices, lattices that are M and M*-symmetric, relation algebras, the idempotents of a ring, the direct product decompositions of a set or group or…
Choreographies describe possible sequences of interactions among a set of agents. We aim to join two lines of research on choreographies: the use of the shuffle on trajectories operator to design more expressive choreographic languages, and…