相关论文: First Steps in Relational Lattice

The set of permutations on a finite set can be given a lattice structure (known as the weak Bruhat order). The lattice structure is generalized to the set of words on a fixed alphabet $\Sigma = \{ x, y, z, ... \}$, where each letter has a…

We continue to develop a research line initiated in \cite{wollic22}, studying I/O logic from an algebraic approach based on subordination algebras. We introduce the classes of slanted (co-)Heyting algebras as equivalent presentations of…

The goal of this paper is to present an algebraic approach to the basic results of the theory of linear recurrence relations. This approach is based on the ideas from the theory of representations of one endomorphisms (a special case of…

Hemi-implicative semilattices (lattices), originally defined under the name of weak implicative semilattices (lattices), were introduced by the second author of the present paper. A hemi-implicative semilattice is an algebra…

In the paper, developing the idea of V. Sokolov et all. (J.Math.Phys. 40 (1999)6473 we construct recursion operators and hereditary algebra of symmetries for many field and lattice systems.

We give structured proofs for five mathematical propositions governing synchronous peer-to-peer computation on a finite grid graph embedded in $\mathbb{Z}^2$. Proposition 1 gives three lower bounds: a transport-work bound $\sum_i a_i \ell_i…

We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…

We consider an SU(2)-lattice gauge model in the tree gauge. Classically, this is a system with symmetries whose configuration space is a direct product of copies of SU(2), acted upon by diagonal inner automorphisms. We derive defining…

The so-called Sasaki projection was introduced by U. Sasaki on the lattice L(H) of closed linear subspaces of a Hilbert space H as a projection of L(H) onto a certain sublattice of L(H). Since L(H) is an orthomodular lattice, the Sasaki…

We introduce two classes of discrete polynomials and construct discrete equations admitting a Lax representation in terms of these polynomials. Also we give an approach which allows to construct lattice integrable hierarchies in its…

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Binary operations on algebras of observables are studied in the quantum as well as in the classical case. It is shown that certain natural compatibility conditions with the associative product imply the properties which usually are…

Let G be a unitary group of a signed-Hermitian form h given over a non-Archimedian local field k of residue characteristic not two. Let V be the vector space on which h is defined. We consider minimal skew-strata, more precisely pairs (b,a)…

Information algebras arise from the idea that information comes in pieces which can be aggregated or combined into new pieces, that information refers to questions and that from any piece of information, the part relevant to a given…

First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…

This paper introduces the tensor representation of a network, here tensors are the primitive structures of the network. In view of tensor chains, two binary operations on tensor sets are defined: chain addition and reducing. Based on the…

We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…

Let G' be a connected reductive group over the complex numbers. We show that the set of conjugacy classes of G' is in natural bijection with the set of two-sided cells associated to a certain algebra.

In this paper it is shown that the lattice of C*-covers of an operator algebra does not contain enough information to distinguish operator algebras up to completely isometric isomorphism. In addition, four natural equivalences of the…

In this paper, we introduce a new combinatorial operation, called a flip, on arbitrary partially ordered sets. We define a mutation to be a flip that maps a lattice to a lattice. We study properties of flips, and give a necessary and…