Results 61 to 70 of about 4,538 (218)

On the complexity of posets

open access: yesDiscrete Mathematics, 1976
AbstractThe purpose of this paper is to discuss several invariants each of which provides a measure of the intuitive notion of complexity for a finite partially ordered set. For a poset X the invariants discussed include cardinality, width, length, breadth, dimension, weak dimension, interval dimension and semiorder dimension denoted respectively X, W ...
William T. Trotter, Kenneth P. Bogart
openaire   +1 more source

On the additive image of zeroth persistent homology

open access: yesTransactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer   +3 more
wiley   +1 more source

Entropía algebraica de un poset [PDF]

open access: yes, 2017
El propósito de este trabajo es definir la noción de entropía algebraica sobre un poset con el fin de probar algunos resultados clásicos de la teoría de representaciones de posets.
Cubillos Delgado, Alfonso
core  

Poset-valued preference relations [PDF]

open access: yes, 2015
summary:In decision processes some objects may not be comparable with respect to a preference relation, especially if several criteria are considered. To provide a model for such cases a poset valued preference relation is introduced as a fuzzy relation ...
Janiš, Vladimír   +4 more
core   +1 more source

Choice Overload and Height Ranking of Menus in Partially-Ordered Sets

open access: yesEntropy, 2015
When agents face incomplete information and their knowledge about the objects of choice is vague and imprecise, they tend to consider fewer choices and to process a smaller portion of the available information regarding their choices.
Marcello Basili, Stefano Vannucci
doaj   +1 more source

Gelfand―Tsetlin Polytopes and Feigin―Fourier―Littelmann―Vinberg Polytopes as Marked Poset Polytopes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
Stanley (1986) showed how a finite partially ordered set gives rise to two polytopes, called the order polytope and chain polytope, which have the same Ehrhart polynomial despite being quite different combinatorially.
Federico Ardila   +2 more
doaj   +1 more source

Iron Complexes With Proteins, Carbohydrates, and Maillard Products in Dairy Systems: Implication for Fortification, Bioavailability, and Product Functionality

open access: yesComprehensive Reviews in Food Science and Food Safety, Volume 25, Issue 4, July 2026.
ABSTRACT The global prevalence of iron (Fe) deficiency anemia (IDA) continues to pose major public health challenges, necessitating the development of effective fortification strategies. Dairy‐based systems are promising vehicles for Fe fortification and delivery due to their widespread consumption and nutritional value, although their complex matrix ...
Ishara De Silva   +5 more
wiley   +1 more source

Split Hausdorff internal topologies on posets

open access: yesOpen Mathematics, 2019
In this paper, the concepts of weak quasi-hypercontinuous posets and weak generalized finitely regular relations are introduced. The main results are: (1) when a binary relation ρ : X ⇀ Y satisfies a certain condition, ρ is weak generalized finitely ...
Luo Shuzhen, Xu Xiaoquan
doaj   +1 more source

L-Fuzzy Semiprime Ideals of a Poset

open access: yesAdvances in Fuzzy Systems, 2020
In this paper, we introduce the concept of L-fuzzy semiprime ideal in a general poset. Characterizations of L-fuzzy semiprime ideals in posets as well as characterizations of an L-fuzzy semiprime ideal to be L-fuzzy prime ideal are obtained.
Berhanu Assaye Alaba   +1 more
doaj   +1 more source

Graph Orientations and Linear Extensions. [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph, and therefore we can count the number of linear extensions of ...
Benjamin Iriarte
doaj   +1 more source

Home - About - Disclaimer - Privacy