English
Related papers

Related papers: Deciding absorption in relational structures

200 papers

In the present paper we obtain the list of algebras, up to isomorphism, such that closure of any complex finite-dimensional algebra contains one of the algebra of the given list.

Rings and Algebras · Mathematics 2013-01-25 A. Kh. Khudoyberdiyev , B. A. Omirov

The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is…

Logic · Mathematics 2023-08-23 Ivan Chajda , Helmut Länger

We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…

Logic · Mathematics 2013-04-03 Tarek Sayed Ahmed

It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…

Logic · Mathematics 2013-07-25 Kevin Davila Castellar , Ismael Gutierrez Garcia

We show that semi-infinite cohomology of a finite dimensional graded algebra (satisfying some additional requirements) are a particular case of a general categorical construction. The motivating example is provided by small quantum groups…

Representation Theory · Mathematics 2007-05-23 Roman Bezrukavnikov

A relation algebra is measurable if the identity element is a sum of atoms, and the square x;1;x of each subidentity atom x is a sum of non-zero functional elements. These functional elements form a group Gx. We prove that a measurable…

Logic · Mathematics 2025-02-12 Hajnal Andréka , Steven Givant

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

We explore the concept of conjugation between subgroupoids, providing several characterizations of the conjugacy relation (Theorem A in {\S}1.2). We show that two finite groupoid-sets, over a locally strongly finite groupoid, are…

Group Theory · Mathematics 2021-06-29 Laiachi El Kaoutit , Leonardo Spinosa

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

We derive some equalities for relations on the algebra A, under the assumption that every subalgebra of A $\times$ A is congruence modular.

Combinatorics · Mathematics 2007-05-23 Paolo Lipparini

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

Classical Analysis and ODEs · Mathematics 2023-05-31 Marcel de Jeu

We prove that any convex-like structure in the sense of Nate Brown is affinely and isometrically isomorphic to a closed convex subset of a Banach space. This answers an open question of Brown. As an intermediate step, we identify Brown's…

Metric Geometry · Mathematics 2015-10-21 Valerio Capraro , Tobias Fritz

The Jacobian conjecture over a field of characteristic zero is considered directly in view of the nonlinear partial differential equations it is associated with. Exploring the integrals of such partial differential equations, this work…

Algebraic Geometry · Mathematics 2025-07-25 Yisong Yang

We show that deformed Heisenberg algebra with reflection emerging in parabosonic constructions is also related to parafermions. This universality is discussed in different algebraic aspects and is employed for the description of spin-j…

High Energy Physics - Theory · Physics 2009-10-30 Mikhail Plyushchay

Classification and invariants, with respect to basis changes, of finite dimensional algebras are considered. An invariant open, dense (in the Zariscki topology) subset of the space of structural constants is defined. The algebras with…

Rings and Algebras · Mathematics 2015-09-24 Ural Bekbaev

We prove that two infinite p-adic semi-algebraic sets are isomorphic (i.e. there exists a semi-algebraic bijection between them) if and only if they have the same dimension.

Logic · Mathematics 2007-05-23 Raf Cluckers

We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into…

Logic in Computer Science · Computer Science 2017-01-11 Thomas Colcombet , Christof Löding

We provide dual sufficient conditions for subtransversality of collections of sets in an Asplund space setting. For the convex case, we formulate a necessary and sufficient dual criterion of subtransversality in general Banach spaces. Our…

Optimization and Control · Mathematics 2018-05-15 Alexander Y. Kruger , D. Russell Luke , Nguyen H. Thao

We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…

Logic in Computer Science · Computer Science 2023-06-22 Khadijeh Keshvardoost , Bartek Klin , Sławomir Lasota , Joanna Ochremiak , Szymon Toruńczyk

Associative conformal algebras of conformal endomorphisms are of essential importance for the study of finite representations of conformal Lie algebras (Lie vertex algebras). We describe all semisimple algebras of conformal endomorphisms…

Quantum Algebra · Mathematics 2019-12-10 P. S. Kolesnikov , R. A. Kozlov