Related papers: Lattice operads and operad filtrations
We introduce two topological non-$\Sigma$ operad structures on planar line arrangements subject to a certain geometric order condition, ensuring a well-defined notion of particle ordering on a distinguished line. This is interpreted in…
Algebraic structures with multiple copies of a given type of operations interrelated by various compatibility conditions have long being studied in mathematics and mathematical physics. They are broadly referred as linearly compatible,…
We introduce a novel combinatorial structure called pointed building sets, which can be viewed as families of lattices equipped with compatibility relations. To each pointed building set $\mathsf{B}$, we associate a complete lattice…
Operads were originally defined by May to have right actions of the symmetric groups, but later formulations have also used no groups actions at all or group actions by such families as the braid groups. We call such families action…
This text, based on the author's Bachelor's thesis, introduces the theory of Algebraic Operads, a mathematical formalism that provides a unifying framework for modern algebra. We demonstrate how the fundamental theories of associative,…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
A filter lattice is a distributive lattice formed by all filters of a poset in the anti-inclusion order. We study the combinatorial properties of the Hasse diagrams of filter lattices of certain posets, so called Fibonacci-like cubes, in…
This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…
We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…
The join operad arises from the combinatorial study of the iterated join of simplices. We study a suitable simplicial version of this operad which includes the symmetries given by permutations of the factors of the join. From this…
In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking…
We introduce a generalization of the notion of operad that we call a contractad, whose set of operations is indexed by connected graphs and whose composition rules are numbered by contractions of connected subgraphs. We show that many…
We propose a new unifying framework for Thompson-like groups using a well-known device called operads and category theory as language. We discuss examples of operad groups which have appeared in the literature before. As a first…
We propose an operadic framework suitable for describing algebraic structures with operations being multilinear differential operators of varying orders or, more generally, formal series of such operators. The framework is built upon the…
We argue that operads provide a general framework for dealing with polynomials and combinatory completeness of combinatory algebras, including the classical $\mathbf{SK}$-algebras, linear $\mathbf{BCI}$-algebras, planar…
As algebraic semantics of the logic of quantum mechanics there are usually used orthomodular posets, i.e. bounded posets with a complementation which is an antitone involution and where the join of orthogonal elements exists and the…
We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…
The purpose of this paper is to give a characterisation of divided power algebras over a reduced operad. Such a characterisation is given in terms of polynomial operations, following the classical example of divided power algebras. We…
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…
This paper is an introduction to a series of papers in which we give combinatorial models for certain important operads (including A-infinity and E-infinity operads, the little n-cubes operads, and the framed little disks operad) and…