English
Related papers

Related papers: Partitions versus sets : a case of duality

200 papers

Blowing up a rational surface singularity in a reflexive module gives a (any) partial resolution dominated by the minimal resolution. The main theorem shows how deformations of the pair (singularity, module) relates to deformations of the…

Algebraic Geometry · Mathematics 2019-01-21 Trond Stølen Gustavsen , Runar Ile

Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are…

Rings and Algebras · Mathematics 2023-06-22 Robin Hirsch , Brett McLean

Codensity monads provide a universal method to generate complex monads from simple functors. Recently, a wide range of important monads in logic, denotational semantics, and probabilistic computation, such as several incarnations of the…

Logic in Computer Science · Computer Science 2026-03-10 Fabian Lenke , Nico Wittrock , Stefan Milius , Henning Urbat

We consider sequences of absolute and relative homology and cohomology groups that arise naturally for a filtered cell complex. We establish algebraic relationships between their persistence modules, and show that they contain equivalent…

Algebraic Topology · Mathematics 2015-05-28 Vin de Silva , Dmitriy Morozov , Mikael Vejdemo-Johansson

In this paper we show how the theory of monads can be used to deduce in a uniform manner several duality theorems involving categories of relations on one side and categories of algebras with homomorphisms preserving only some operations on…

Logic · Mathematics 2013-02-25 Dirk Hofmann , Pedro Nora

Dualities are often supposed to be foundational, but they may come into conflict with background independence, because a hidden fixed structures is needed to define the duality transformation. This conflict can be eliminated by extending a…

High Energy Physics - Theory · Physics 2016-12-21 Lee Smolin

Evidential reasoning is cast as the problem of simplifying the evidence-hypothesis relation and constructing combination formulas that possess certain testable properties. Important classes of evidence as identifiers, annihilators, and…

Artificial Intelligence · Computer Science 2013-04-11 Yizong Cheng , Rangasami L. Kashyap

George Andrews and Mohamed El Bachraoui recently explored identities for two-color partitions. In particular, they studied the connection between two-colored partitions and overpartitions. Their proofs were analytical, but they conjectured…

Number Theory · Mathematics 2026-05-26 Anton Bugleev

Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite…

Logic · Mathematics 2008-02-03 Thomas Jech , Saharon Shelah

Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion.…

Artificial Intelligence · Computer Science 2011-06-10 F. Baader , C. Lutz , H. Sturm , F. Wolter

In a 2022 paper, Dawsey, Just and the present author prove that the set of integer partitions, taken as a monoid under a partition multiplication operation I defined in my Ph.D. work, is isomorphic to the positive integers as a monoid under…

Number Theory · Mathematics 2026-01-21 Robert Schneider

We prove a general theorem on overpartitions with difference conditions that unifies generalisations of Schur's theorem due to Alladi-Gordon, Andrews, Corteel-Lovejoy and the author. This theorem also allows one to give companions and…

Combinatorics · Mathematics 2016-07-01 Jehanne Dousse

Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…

Commutative Algebra · Mathematics 2020-08-12 Ezra Miller

From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models…

Logic · Mathematics 2013-07-01 Steve Awodey , Henrik Forssell

Recently, Andrews and EI Bachraoui discovered several companions for some famous $q$-series formulas, and derived some new identities involving partitions and overpartitions with distinct parts. In this paper, we shall refine their results…

Combinatorics · Mathematics 2025-06-18 Haijun Li

We consider the Deduction Theorem used in the literature of game theory to run a purported proof by contradiction. In the context of game theory, it is stated that if we have a proof of $\phi \vdash \varphi$, then we also have a proof of…

Artificial Intelligence · Computer Science 2021-08-31 Holger I. Meinhardt

Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…

Combinatorics · Mathematics 2025-05-15 Dandan Chen , Rong Chen , Mengjie Zhao

The main purpose of this work is to introduce and analyse some generalizations of diverse superposition rules for first-order differential equations to the setting of second-order differential equations. As a result, we find a way to apply…

Mathematical Physics · Physics 2015-05-27 J. F. Cariñena , J. de Lucas

A semiring generalises the notion of a ring, replacing the additive abelian group structure with that of a commutative monoid. In this paper, we study a notion positioned between a ring and a semiring -- a semiring whose additive monoid is…

Rings and Algebras · Mathematics 2024-11-20 Peter F. Faul , Amartya Goswami , Gideo Joubert , Graham Manuell

The aim of this article is to generalize logics of formal inconsistency ($\textbf{LFI}$s) to systems dealing with the concept of incompatibility, expressed by means of a binary connective. The basic idea is that having two incompatible…

Logic · Mathematics 2022-02-23 Marcelo Esteban Coniglio , Guilherme Vicentin de Toledo