Results 31 to 40 of about 369 (138)

SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES

Ural Mathematical Journal
For a finite poset (partially ordered set) \(U\) and a natural number \(n\), let \(S(U,n)\) denote the largest number of pairwise unrelated copies of  \(U\) in the powerset lattice (AKA subset lattice) of an \(n\)-element set.
Gábor Czédli
doaj   +1 more source

Subpullbacks and coproducts of $S$-posets [PDF]

Categories and General Algebraic Structures with Applications, 2015
In 2001, S. Bulman-Fleming et al. initiated the study of three flatness properties (weakly kernel flat, principally weakly kernel flat, translation kernel flat) of right acts $A_{S}$ over a monoid $S$ that can be described by means of when the functor ...
Xingliang Liang, Yanfeng Luo
doaj  

New Hopf Structures on Binary Trees [PDF]

Discrete Mathematics & Theoretical Computer Science, 2009
The multiplihedra $\mathcal{M}_{\bullet} = (\mathcal{M}_n)_{n \geq 1}$ form a family of polytopes originating in the study of higher categories and homotopy theory. While the multiplihedra may be unfamiliar to the algebraic combinatorics community, it is
Stefan Forcey, Aaron Lauve, Frank Sottile   +2 more
doaj   +1 more source

On computing local monodromy and the numerical local irreducible decomposition

Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards, Jonathan D. Hauenstein   +1 more
wiley   +1 more source

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

On a criterion of the finiteness of the representation type for families of the categories of injective representations

Науковий вісник Ужгородського університету. Серія: Математика і інформатика, 2022
The representations of posets (partially ordered sets), introduced by L. A. Nazarova and A. V. Roiter in 1972, play an important role in the modern representation theory and its applications. M. M.
В. М. Бондаренко, М. В. Стьопочкіна   +1 more
doaj   +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

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

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

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