Results 51 to 60 of about 467 (189)
Computing metric hulls in graphs [PDF]
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
Approximation Relations on the Posets of Pseudoultrametrics
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 +2 more
doaj +1 more source
A Miyaoka–Yau inequality for hyperplane arrangements in CPn$\mathbb {CP}^n$
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
Phylogenetic Inference via Sequential Monte Carlo [PDF]
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é +59 more
core +3 more sources
A characterization of a pomonoid $S$ all of its cyclic $S$-posets are regular injective [PDF]
This work is devoted to give a charcaterization of a pomonoid $S$ such that all cyclic $S$-posets are regular injective.
Xia Zhang, Wenling Zhang, Ulrich Knauer
doaj
Attribute Implication Bases From Galois Connection Structures
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 +2 more
wiley +1 more source
The saturation number for the diamond is linear
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
Fixed‐point posets of groups and Euler characteristics
Abstract Suppose that G$G$ is a group and Ω$\Omega$ is a G$G$‐set. For X$\mathcal {X}$ a set of subgroups of G$G$, we introduce the fixed‐point poset XΩ$\mathcal {X}_{\Omega }$. A variety of results concerning XΩ$\mathcal {X}_{\Omega }$ are proved as, for example, in the case when p$p$ is a prime and X$\mathcal {X}$ is a non‐empty set of finite non ...
Peter Rowley
wiley +1 more source
Weak Factorization System for Actions of Po-monoids on Posets [PDF]
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
Assembly of constructible factorization algebras
Abstract We provide a toolbox of extension, gluing, and assembly techniques for factorization algebras. Using these tools, we fill various gaps in the literature on factorization algebras on stratified manifolds, the main one being that constructible factorization algebras form a sheaf of symmetric monoidal ∞$\infty$‐categories.
Eilind Karlsson +2 more
wiley +1 more source

