English
Related papers

Related papers: Comparable binary relations and the amalgamation p…

200 papers

In this work we generalize standard Decision Theory by assuming that two outcomes can also be incomparable. Two motivating scenarios show how incomparability may be helpful to represent those situations where, due to lack of information,…

Computer Science and Game Theory · Computer Science 2014-04-04 Piero A. Bonatti , Marco Faella , Luigi Sauro

In this paper, we consider five possible extensions of the Pr\"ufer domain notion to the case of commutative rings with zero-divisors. We investigate the transfer of these Pr\"ufer-like properties between a ring $R$ and $R\bowtie I$; his…

Commutative Algebra · Mathematics 2010-12-14 Mohamed Chhiti , Najib Mahdou

The coupling space of perceptrons with continuous as well as with binary weights gets partitioned into a disordered multifractal by a set of $p=\gamma N$ random input patterns. The multifractal spectrum $f(\alpha)$ can be calculated…

Disordered Systems and Neural Networks · Physics 2009-10-28 M. Weigt , A. Engel

When studying the properties of a ring $R$, it is often useful to compare $R$ to other rings whose properties are already known. In this paper, we define three ways in which a subring $R$ might be compared to a larger ring $T$: being…

Commutative Algebra · Mathematics 2025-07-03 Grant Moles

Let $B$ be a Banach algebra. The interest of this article lies in the study of the commutativity of B if certain specific algebraic identities hold over a non-empty open subset of B. The limitations imposed in the hypothesis of our results…

Functional Analysis · Mathematics 2024-11-06 Mohamed Moumen , Lahcen Taoufiq

An $n$-ary associative function is called reducible if it can be written as a composition of a binary associative function. We summarize known results when the function is defined on a chain and is nondecreasing. Our main result shows that…

Rings and Algebras · Mathematics 2018-09-05 Gergely Kiss , Gábor Somlai

We characterize inclusions of compact noncommutative convex sets with the property that every continuous affine function on the smaller set can be extended to a continuous affine function on the larger set with a uniform bound. As an…

Operator Algebras · Mathematics 2025-08-06 Adam Humeniuk , Matthew Kennedy , Nicholas Manor

We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented tangles. Any reflexive object in a ribbon category gives rise…

Logic in Computer Science · Computer Science 2024-05-17 Masahito Hasegawa , Serge Lechenne

We show that any two frames in a separable Hilbert space that are dual to each other have the same excess. Some new relations for the analysis resp. synthesis operators of dual frames are also derived. We then prove that pseudo-dual frames…

Functional Analysis · Mathematics 2016-04-21 Damir Bakić , Tomislav Berić

We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the…

Logic · Mathematics 2007-05-23 Michael Pinsker

We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize…

Logic in Computer Science · Computer Science 2023-02-24 Libor Barto , Bertalan Bodor , Marcin Kozik , Antoine Mottet , Michael Pinsker

Complementarity among species with different traits is one of the basic processes affecting biodiversity, defined as the number of species in the ecosystem. We present here a soluble model ecosystem in which the species are characterized by…

Disordered Systems and Neural Networks · Physics 2009-11-07 Viviane M. de Oliveira , J. F. Fontanari

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

Logic in Computer Science · Computer Science 2024-04-26 Hashimoto Go , Daniel Găină , Ionuţ Ţuţu

In this paper, we address the problem of change in an abstract argumentation system. We focus on a particular change: the addition of a new argument which interacts with previous arguments. We study the impact of such an addition on the…

Artificial Intelligence · Computer Science 2014-01-17 Claudette Cayrol , Florence Dupin de Saint-Cyr , Marie-Christine Lagasquie-Schiex

The property of the conformal algebra to contain the Schr\"odinger algebra in one less space dimension is extended to the supersymmetric case. More precisely, we determine the counterpart of any field theory admissible super conformal…

High Energy Physics - Theory · Physics 2011-01-20 Antonino Sciarrino , Paul Sorba

This work represents an in-depth study of the structural behavior of the Collatz sequences. We consider a finite arithmetic progression with a common difference is 2 and the number of terms in the sequence is equal to 2^n . After, we…

General Mathematics · Mathematics 2021-04-26 Raouf Rajab

We study properties of the category of modules of an algebra object A in a tensor category C. We show that the module category inherits various structures from C, provided that A is a Frobenius algebra with certain additional properties. As…

Category Theory · Mathematics 2007-05-23 J. Fuchs , C. Schweigert

Based on the properties of the poset of those equivalence relations of a multialgebra for which the factor multialgebra is a universal algebra, we give a characterization for the fundamental relations of a multialgebra. We point out the…

Rings and Algebras · Mathematics 2014-12-03 Cosmin Pelea , Ioan Purdea , Liana Stanca

Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…

Logic in Computer Science · Computer Science 2020-04-14 Patrick Cegielski , Serge Grigorieff , Irene Guessarian

A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…

Logic · Mathematics 2025-02-12 S. Givant , H. Andréka