Results 51 to 60 of about 619 (166)
Kleene posets and pseudo-Kleene posets
The concept of a Kleene algebra (sometimes also called Kleene lattice) was already generalized by the first author for non-distributive lattices under the name pseudo-Kleene algebra. We extend these concepts to posets and show how (pseudo-)Kleene posets can be characterized by identities and implications of assigned commutative meet-directoids ...
Chajda, Ivan, Länger, Helmut
openaire +3 more sources
Lattices of Annihilators in Commutative Algebras Over Fields
Let K be any field and L be any lattice. In this note we show that L is a sublattice of annihilators in an associative and commutative K-algebra. If L is finite, then our algebra will be finite dimensional over K.
Jastrzebska M., Krempa J.
doaj +1 more source
Piecewise-linear and birational toggling [PDF]
We define piecewise-linear and birational analogues of toggle-involutions, rowmotion, and promotion on order ideals of a poset $P$ as studied by Striker and Williams.
David Einstein, James Propp
doaj +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
A Torelli theorem for graphs via quasistable divisors
The Torelli theorem establishes that the Jacobian of a smooth projective curve, together with the polarization provided by the theta divisor, fully characterizes the curve.
Alex Abreu, Marco Pacini
doaj +1 more source
Split Hausdorff internal topologies on posets
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
Choice Overload and Height Ranking of Menus in Partially-Ordered Sets
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]
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
Building Emerging Images with Tiled Orders and Posets
We introduce an algorithm based on posets and tiled orders to generate emerging images. Experimental results allow concluding that images obtained with these kinds of tools are easy to detect by human beings.
María Alejandra Osorio Angarita +2 more
doaj +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

