Related papers: Weak Bases of Boolean Co-Clones
We construct a `weak' version EM^w(K) of Lack & Street's 2-category of monads in a 2-category K, by replacing their compatibility constraint of 1-cells with the units of monads by an additional condition on the 2-cells. A relation between…
We classify binary minimal clones into seven categories: affine algebras, rectangular bands, $p$-cyclic groupoids, spirals, non-Taylor partial semilattices, melds, and dispersive algebras. Each category has nice enough properties to…
The goal of this paper is to prove that several variants of deciding whether a poset can be (weakly) embedded into a small Boolean lattice, or to a few consecutive levels of a Boolean lattice, are NP-complete, answering a question of Griggs…
In this paper we study the lattice of restricted subalgebras of a restricted Lie algebra. In particular, we consider those algebras in which this lattice is dually atomistic, lower or upper semimodular, or in which every restricted…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…
A subalgebra B of a Lie algebra L is called a weak c-ideal of L if there is a subideal C of L such that L = B+C and B\cap C \subseteq B_L where B_L is the largest ideal of L contained in B. This is analogous to the concept of weakly c-…
We study clones modulo minor homomorphisms, which are mappings from one clone to another preserving arities of operations and respecting permutation and identification of variables. Minor-equivalent clones satisfy the same sets of…
Classically, there are two model category structures on coalgebras in the category of chain complexes over a field. In one, the weak equivalences are maps which induce an isomorphism on homology. In the other, the weak equivalences are maps…
This is a paper in a series to study vertex algebra-like structures arising from various algebras including quantum affine algebras and Yangians. In this paper, we develop a theory of what we call (weak) quantum vertex $\F((t))$-algebras…
The class of all $\ast$-continuous Kleene algebras, whose description includes an infinitary condition on the iteration operator, plays an important role in computer science. The complexity of reasoning in such algebras - ranging from the…
Let $X$ and $Y$ be separable Banach spaces. Suppose $Y$ either has a shrinking basis or $Y$ is isomorphic to $C(2^\mathbb{N})$ and $A$ is a subset of weakly compact operators from $X$ to $Y$ which is analytic in the strong operator…
An abstract characterization of weakly monotone $C^*$-algebras, namely the concrete $C^*$-algebras generated by creators and annihilators acting on the so-called weakly monotone Fock spaces, is given in terms of (quotient of) suitable…
Existence and uniqueness of weak solutions to the collision-induced breakage and coag-ulation equation are shown when coagulation is the dominant mechanism for small volumes. The collision kernel may feature a stronger singularity for small…
In this paper we study special bases of certain spaces of half-integral weight weakly holomorphic modular forms. We establish a criterion for the integrality of Fourier coefficients of such bases. By using recursive relations between Hecke…
We determine the decomposition numbers of the partition algebra when the characteristic of the ground field is zero or larger than the degree of the partition algebra. This will allow us to determine for which exact values of the parameter…
This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…
Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…
Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…
We survey recent results concerning the complexity of regular languages represented by their minimal deterministic finite automata. In addition to the quotient complexity of the language -- which is the number of its (left) quotients, and…
By describing strong interactions between hadrons via a relativistic supermultiplet scheme and regarding weak interactions as a perturbation thereof, we derive expressions for nonleptonic weak decay amplitudes in terms of constituent quark…