Results 51 to 60 of about 467 (189)

Weighted partitions [PDF]

Discrete Mathematics & Theoretical Computer Science, 2013
In this extended abstract we consider the poset of weighted partitions Π _n^w, introduced by Dotsenko and Khoroshkin in their study of a certain pair of dual operads.
Rafael González S. D'León, Michelle L. Wachs   +1 more
doaj   +1 more source

Infinity‐operadic foundations for embedding calculus

Journal of Topology, Volume 19, Issue 2, June 2026.
Abstract Motivated by applications to spaces of embeddings and automorphisms of manifolds, we consider a tower of ∞$\infty$‐categories of truncated right modules over a unital ∞$\infty$‐operad O$\mathcal {O}$. We study monoidality and naturality properties of this tower, identify its layers, describe the difference between the towers as O$\mathcal {O}$
Manuel Krannich, Alexander Kupers
wiley   +1 more source

Approximation Relations on the Posets of Pseudoultrametrics

Axioms, 2023
In this paper we study pseudoultrametrics, which are a natural mixture of ultrametrics and pseudometrics. They satisfy a stronger form of the triangle inequality than usual pseudometrics and naturally arise in problems of classification and recognition ...
Svyatoslav Nykorovych, Oleh Nykyforchyn, Andriy Zagorodnyuk   +2 more
doaj   +1 more source

Phylogenetic Inference via Sequential Monte Carlo [PDF]

, 2012
Bayesian inference provides an appealing general framework for phylogenetic analysis, able to incorporate a wide variety of modeling assumptions and to provide a coherent treatment of uncertainty.
Alexandre Bouchard-Côté, Altekar, Andrieu, Beaumont, Bourque, Cannone, Cappé, Carpenter, Crisan, Doob, Douc, Doucet, Doucet, Drummond, Fan, Felsenstein, Felsenstein, Felsenstein, Feng, Gelman, Griffiths, Görür, Huelsenbeck, Huelsenbeck, Huelsenbeck, Iorio, Keane, Kimura, Kitagawa, Kong, Kuhner, Lakner, Lartillot, Li, Liu, Marjoram, Michael I. Jordan, Moral, Moral, Moral, Neal, Newton, Paul, Penny, Rannala, Redelings, Rivas, Robert, Robinson, Saitou, Semple, Siepel, Sriram Sankararaman, Suchard, Swendsen, Tavaré, Teh, Thorne, Tom, Xie   +59 more
core   +3 more sources

Computing metric hulls in graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2019
We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This implies that there is a polynomial time algorithm to compute the convex hull number of a graph, when all
Kolja Knauer, Nicolas Nisse
doaj   +1 more source

A Miyaoka–Yau inequality for hyperplane arrangements in CPn$\mathbb {CP}^n$

Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.
Abstract Let H$\mathcal {H}$ be a hyperplane arrangement in CPn$\mathbb {CP}^n$. We define a quadratic form Q$Q$ on RH$\mathbb {R}^{\mathcal {H}}$ that is entirely determined by the intersection poset of H$\mathcal {H}$. Using the Bogomolov–Gieseker inequality for parabolic bundles, we show that if a∈RH$\mathbf {a}\in \mathbb {R}^{\mathcal {H}}$ is ...
Martin de Borbon, Dmitri Panov
wiley   +1 more source

Attribute Implication Bases From Galois Connection Structures

Mathematical Methods in the Applied Sciences, Volume 49, Issue 4, Page 2729-2753, 15 March 2026.
ABSTRACT Modeling knowledge systems by determining relationships among key variables have been and currently is a fundamental and nontrivial challenge in real‐world scenarios. Many approaches have been developed to reach this goal, but many of them are heuristic and require of alternative procedures to provide robust and tractable rules.
M. Eugenia Cornejo, Jesús Medina, Francisco José Ocaña   +2 more
wiley   +1 more source

Weak Factorization System for Actions of Po-monoids on Posets [PDF]

, 2015
Let $S$ be a pomonoid. In this paper, {\bf Pos}-$S$, the category of $S$-posets and $S$-poset maps, is considered. One of the main aims of this paper is to draw attention to the notion of weak factorization systems in {\bf Pos}-$S.$ We show that if the ...
Farsad, Farideh, Madanshekaf, Ali
core  

The saturation number for the diamond is linear

Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.
Abstract For a fixed poset P$\mathcal {P}$ we say that a family F⊆P([n])$\mathcal {F}\subseteq \mathcal {P}([n])$ is P$\mathcal {P}$‐saturated if it does not contain an induced copy of P$\mathcal {P}$, but whenever we add a new set to F$\mathcal {F}$, we form an induced copy of P$\mathcal {P}$.
Maria‐Romina Ivan, Sean Jaffe
wiley   +1 more source

Modal operators for meet-complemented lattices [PDF]

, 2020
We investigate some modal operators of necessity and possibility in the context of meet-complemented (not necessarily distributive) lattices. We proceed in stages.
Castiglioni, José Luis, Ertola Biraben, Rodolfo Cristian   +1 more
core