N-Way Joint Mutual Exclusion Does Not Imply Any Pairwise Mutual Exclusion for Propositions
Fuente:
arXiv
Saved in:
| Main Author: | Freedman, Roy S. |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Almost Perfect Mutually Unbiased Bases that are Sparse
by: Kumar, Ajeet, et al.
Published: (2024)
by: Kumar, Ajeet, et al.
Published: (2024)
Enumeration of Sets of Mutually Orthogonal Latin Rectangles
by: Jäger, Gerold, et al.
Published: (2019)
by: Jäger, Gerold, et al.
Published: (2019)
On Construction of Approximate Real Mutually Unbiased Bases for an infinite class of dimensions $d \not\equiv 0 \bmod 4$
by: Kumar, Ajeet, et al.
Published: (2025)
by: Kumar, Ajeet, et al.
Published: (2025)
Transitive Sets of Mutually Orthogonal Latin Squares
by: Keita, Amadou, et al.
Published: (2026)
by: Keita, Amadou, et al.
Published: (2026)
Pairwise similarity method for majority domination problem
by: Shushko, N. I., et al.
Published: (2025)
by: Shushko, N. I., et al.
Published: (2025)
Positional Identifiability from Pairwise Collision Data
by: Li, Yun-Han, et al.
Published: (2026)
by: Li, Yun-Han, et al.
Published: (2026)
On Generalizations of Pairwise Compatibility Graphs
by: Calamoneri, Tiziana, et al.
Published: (2021)
by: Calamoneri, Tiziana, et al.
Published: (2021)
A Method to Generate Multi-interval Pairwise Compatibility Graphs
by: Hayat, Seemab, et al.
Published: (2024)
by: Hayat, Seemab, et al.
Published: (2024)
Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete
by: la Tour, Max Dupré, et al.
Published: (2025)
by: la Tour, Max Dupré, et al.
Published: (2025)
Another Way to Lower the Bound for Distinct Squares
by: Tomita, Eitatsu, et al.
Published: (2026)
by: Tomita, Eitatsu, et al.
Published: (2026)
Clustering Coefficient Reflecting Pairwise Relationships within Hyperedges
by: Miyashita, Rikuya, et al.
Published: (2024)
by: Miyashita, Rikuya, et al.
Published: (2024)
On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
by: Gadouleau, Maximilien, et al.
Published: (2024)
by: Gadouleau, Maximilien, et al.
Published: (2024)
The vertex visibility number of graphs
by: Roy, Dhanya, et al.
Published: (2025)
by: Roy, Dhanya, et al.
Published: (2025)
Word-Representability of Shift Graphs
by: Roy, Suchanda, et al.
Published: (2026)
by: Roy, Suchanda, et al.
Published: (2026)
Characterization of Word-Representable Near-Triangulations
by: Roy, Suchanda, et al.
Published: (2026)
by: Roy, Suchanda, et al.
Published: (2026)
On the Word-Representability of 5-Regular Circulant Graphs
by: Roy, Suchanda, et al.
Published: (2025)
by: Roy, Suchanda, et al.
Published: (2025)
Word-Representability of Split Graphs with Independent Set of Size 4
by: Roy, Suchanda, et al.
Published: (2025)
by: Roy, Suchanda, et al.
Published: (2025)
LogicLearner: A Tool for the Guided Practice of Propositional Logic Proofs
by: Inamdar, Amogh, et al.
Published: (2025)
by: Inamdar, Amogh, et al.
Published: (2025)
Mutual-visibility problems on graphs of diameter two
by: Cicerone, Serafino, et al.
Published: (2024)
by: Cicerone, Serafino, et al.
Published: (2024)
RDNF Oriented Analytics to Random Boolean Functions
by: Aslanyan, Levon, et al.
Published: (2024)
by: Aslanyan, Levon, et al.
Published: (2024)
From Tripods to Bipods: Reducing the Queue Number of Planar Graphs Costs Just One Leg
by: Förster, Henry
Published: (2024)
by: Förster, Henry
Published: (2024)
Multi-Agent Search-Type Problems on Polygons
by: Georgiou, Konstantinos, et al.
Published: (2024)
by: Georgiou, Konstantinos, et al.
Published: (2024)
A Novel Approach for Bent Functions with Dillon-like Exponents and Characterizing Three Classes of Bent Functions via Kloosterman Sums
by: Tu, Ziran, et al.
Published: (2024)
by: Tu, Ziran, et al.
Published: (2024)
Morse frames
by: Bertrand, Gilles, et al.
Published: (2024)
by: Bertrand, Gilles, et al.
Published: (2024)
Robust Filter Design for Graph Signals
by: Testa, Lucia, et al.
Published: (2024)
by: Testa, Lucia, et al.
Published: (2024)
Optimal Delivery with a Faulty Drone
by: Coleman, Jared, et al.
Published: (2024)
by: Coleman, Jared, et al.
Published: (2024)
Interval Posets and Polygon Dissections
by: Bagno, Eli, et al.
Published: (2024)
by: Bagno, Eli, et al.
Published: (2024)
The ultrametric backbone is the union of all minimum spanning forests
by: Rozum, Jordan C, et al.
Published: (2024)
by: Rozum, Jordan C, et al.
Published: (2024)
Integrating On-demand Ride-sharing with Mass Transit at-Scale
by: Edirimanna, Danushka, et al.
Published: (2024)
by: Edirimanna, Danushka, et al.
Published: (2024)
On the Hardness of Gray Code Problems for Combinatorial Objects
by: Merino, Arturo, et al.
Published: (2024)
by: Merino, Arturo, et al.
Published: (2024)
Ensuring connectedness for the Maximum Quasi-clique and Densest $k$-subgraph problems
by: Santos, Daniela Scherer dos, et al.
Published: (2024)
by: Santos, Daniela Scherer dos, et al.
Published: (2024)
Symbolic Listings as Computation
by: Sawczuk, Hamilton, et al.
Published: (2024)
by: Sawczuk, Hamilton, et al.
Published: (2024)
Cops & Robber on Periodic Temporal Graphs
by: De Carufel, Jean-Lou, et al.
Published: (2024)
by: De Carufel, Jean-Lou, et al.
Published: (2024)
Study on (r,s)- Generalised Transformation Graphs, A Novel Perspective Based on Transformation Graphs
by: Ali, Parvez, et al.
Published: (2024)
by: Ali, Parvez, et al.
Published: (2024)
Task scheduling for autonomous vehicles in the Martian environment
by: Burzyński, Wojciech, et al.
Published: (2024)
by: Burzyński, Wojciech, et al.
Published: (2024)
Growth Rate of the Number of Empty Triangles in the Plane
by: Bhattacharya, Bhaswar B., et al.
Published: (2024)
by: Bhattacharya, Bhaswar B., et al.
Published: (2024)
Complexity of Deciding the Equality of Matching Numbers
by: Gomes, Guilherme C. M., et al.
Published: (2024)
by: Gomes, Guilherme C. M., et al.
Published: (2024)
A sequential solution to the density classification task using an intermediate alphabet
by: Perrotin, Pacôme, et al.
Published: (2024)
by: Perrotin, Pacôme, et al.
Published: (2024)
Restricted Permutations Enumerated by Inversions
by: Franklín, Atli Fannar, et al.
Published: (2024)
by: Franklín, Atli Fannar, et al.
Published: (2024)
First-Fit Coloring of Forests in Random Arrival Model
by: Bosek, Bartłomiej, et al.
Published: (2024)
by: Bosek, Bartłomiej, et al.
Published: (2024)
Similar Items
-
Almost Perfect Mutually Unbiased Bases that are Sparse
by: Kumar, Ajeet, et al.
Published: (2024) -
Enumeration of Sets of Mutually Orthogonal Latin Rectangles
by: Jäger, Gerold, et al.
Published: (2019) -
On Construction of Approximate Real Mutually Unbiased Bases for an infinite class of dimensions $d \not\equiv 0 \bmod 4$
by: Kumar, Ajeet, et al.
Published: (2025) -
Transitive Sets of Mutually Orthogonal Latin Squares
by: Keita, Amadou, et al.
Published: (2026) -
Pairwise similarity method for majority domination problem
by: Shushko, N. I., et al.
Published: (2025)