English
Related papers

Related papers: First Steps in Relational Lattice

200 papers

As an abstraction and generalization of the integral operator in analysis, integral operators (known as Rota-Baxter operators of weight zero) on associative algebras and Lie algebras have played an important role in mathematics and physics.…

Rings and Algebras · Mathematics 2021-12-17 Aiping Gan , Li Guo

We study the subalgebra of the lattice vertex operator algebra $V_{\sqrt{2}A_2}$ consisting of the fixed points of an automorphism which is induced from an order 3 isometry of the root lattice $A_2$. We classify the simple modules for the…

Quantum Algebra · Mathematics 2013-12-18 Kenichiro Tanabe , Hiromichi Yamada

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

Combinatorics · Mathematics 2018-02-21 Akihiro Higashitani , Mikiya Masuda

Pure gauge lattice QCD at arbitrary D is considered. Exact integration over link variables in an arbitrary D-volume leads naturally to an appearance of a set of surfaces filling the volume and gives an exact expression for functional of…

High Energy Physics - Theory · Physics 2009-10-28 B. Rusakov

In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced…

Computer Vision and Pattern Recognition · Computer Science 2024-02-14 Anvar Kabulov , Alimdzhan Babadzhanov , Islambek Saymanov

J. Lepowsky and R. L. Wilson initiated the approach to combinatorial Rogers-Ramanujan type identities via the vertex operator constructions of representations of affine Lie algebras. In a joint work with Arne Meurman this approach is…

Quantum Algebra · Mathematics 2007-05-23 Mirko Primc

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

Computational Complexity · Computer Science 2017-04-20 Jean-Yves Moyen , Jakob Grue Simonsen

The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…

General Mathematics · Mathematics 2017-02-27 Danica Jakubíková-Studenovská , Reinhard Pöschel , Sándor Radeleczki

In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…

Combinatorics · Mathematics 2022-06-14 Valerii Sopin

Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…

Artificial Intelligence · Computer Science 2013-12-17 Qingyin Li , William Zhu

Methods from algebra and algebraic geometry have been used in various ways to study linkages in kinematics. These methods have failed so far for the study of linkages with helical joints (joints with screw motion), because of the presence…

Robotics · Computer Science 2022-07-22 Hamid Abban , Zijia Li , Josef Schicho

We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…

Combinatorics · Mathematics 2010-08-30 P. Blasiak

We study splittings, or lack of them, in lattices of subvarieties of some logic-related varieties. We present a general lemma, the Non-Splitting Lemma, which when combined with some variety-specific constructions, yields each of our…

Logic · Mathematics 2025-09-16 Brian A. Davey , Tomasz Kowalski , Christopher J. Taylor

Every reduced ring $R$ has a natural partial order defined by $a\le b$ if $a^2=ab$; it generalizes the natural order on a boolean ring. The article examines when $R$ is a lower semi-lattice in this order with examples drawn from weakly Baer…

Rings and Algebras · Mathematics 2018-02-21 W. D. Burgess , R. Raphael

This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…

Logic · Mathematics 2026-04-21 Juanda Kelana Putra , Richard Smolka

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,…

Quantum Algebra · Mathematics 2025-11-11 Felicia Ferraioli

We explore the mathematical consequences of the assumption of a discrete space-time. The fundamental laws of physics have to be translated into the language of discrete mathematics. We find integral transformations that leave the lattice of…

High Energy Physics - Lattice · Physics 2007-05-23 M. Lorente

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Logic · Mathematics 2020-06-17 Laurent De Rudder , Georges Hansoul , Valentine Stetenfeld

Irreducible modules of the 3-permutation orbifold of a rank one lattice vertex operator algebra are listed explicitly. Fusion rules are determined by using the quantum dimensions. The $S$-matrix is also given.

Quantum Algebra · Mathematics 2017-06-27 Chonging Dong , Feng Xu , Nina Yu

Following a characterization [10] of locally tabular logics with finitary (or unitary) unification by their Kripke models we determine the unification types of some intermediate logics (extensions of {\sf INT}). There are exactly four…

Logic · Mathematics 2022-05-24 W. Dzik , S. Kost , P. Wojtylak