Two representation theorems of three-valued structures by means of binary relations

Luisa Iturrioz

Home/Archive/arXiv

arXiv · 0710.1007

Two representation theorems of three-valued structures by means of binary relations

Luisa Iturrioz

View original source ↗Read source document ↗Export metadata ↓

Abstract

The results here presented are a continuation of the algebraic research line which attempts to find properties of multiple-valued systems based on a poset of two agents. The aim of this paper is to exhibit two relationships between some three-valued structures and binary relations. The established connections are so narrow that two representation theorems are obtained.

Explore related subjects

cs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Luisa Iturrioz. 2007-10-04. Two representation theorems of three-valued structures by means of binary relations. https://arxiv.org/abs/0710.1007

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

New Snake-in-the-Box Records via Snakepit Surgery and Learned Construction

The snake-in-the-box problem asks for a longest induced path in the hypercube graph $Q_n$. We find a length-191 snake in dimension $n=9$, the lowest dimension where the maximum is unknown, improving the previous record of 190 that had stood for 14 years. We also establish new lower bounds in dimensions 10-13. To find these records, we introduce snakepits, collections of disjoint snakes, to expand the search space and open new routes between snakes. This motivates our new Snakepit-in-the-Box benchmark, which seeks maximal edge counts when allowing multiple components. Finally, we introduce Beam Anchor, a search-supervised learned constructor algorithm that finds 100 inequivalent length-190 snakes in dimension 9.

cs.DM↗

arXiv2026

Stability in stochastic hypergraph matching I: necessary and sufficient criteria

Stochastic matching on hypergraphs is an important topic for its versatility in capturing real-life systems, from living donor transplant to ride-hailing. Nevertheless, finding necessary and sufficient criteria for stability is a long-standing problem. One of the key difficulties is the fact that greedy policies, whilst maximally stable for stochastic matching on graphs, no longer achieve maximal stability region on hypergraphs. So far, no alternative families of policies with similar properties have been known. In this work, we introduce online assignment policies, in which each item is assigned to a matching hyperedge type upon arrival. We show that this is a good generalisation to greedy policies, by proving that they are maximally stable. Their natural amenability to analysis allow us to derive several necessary and sufficient criteria for stability, which generalise the known criteria for graphs. Furthermore, the constructive proof gives a maximally stable arrival-rate agnostic policy.

cs.DM↗

arXiv2026

A Graph Theoretic Approach to Spatial Modeling of Post Disaster Shelter Camps Using Rainbow and Roman Domination Parameters

Effective spatial organization of post-disaster shelter camps is essential for ensuring access to basic services while making efficient use of limited space and resources. In this paper, we propose a graph-theoretic framework for shelter-camp facility placement based on rainbow $k$-domination and Roman domination. Rainbow $k$-domination models the simultaneous accessibility of distinct facility types, such as sanitation units, kitchens, water points, and schools, whereas Roman domination is used to represent services with different capacity levels, illustrated through Wi-Fi deployment. We present an $O(nk)$-time algorithm for finding a minimum rainbow $k$-dominating set of a tree with $n$ vertices, which is linear in $n$ for fixed $k$, and computational experiments confirm its scalability on large instances. For general graphs, we establish new lower and upper bounds on the rainbow $k$-domination number. We further investigate its relationship with Roman domination, derive structural properties of graphs attaining the extremal equality between the two parameters, and prove that recognizing such graphs is NP-hard. These results provide a theoretical foundation for domination-based approaches to facility placement in post-disaster shelter planning.

cs.DM↗