Imagen de Portada

Generalized Three and Four Person Hat Game

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	van Uem, Theo
Formato:	Preprint
Publicado:	2017
Materias:	Combinatorics Discrete Mathematics Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Bears with Hats and Independence Polynomials
por: Blažej, Václav, et al.
Publicado: (2021)

Universal cycle constructions for k-subsets and k-multisets
por: Campbell, Colin, et al.
Publicado: (2026)

Optimal Erasure Codes and Codes on Graphs
por: Chen, Yeyuan, et al.
Publicado: (2025)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
por: Wang, Shuche, et al.
Publicado: (2024)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
por: Gabrić, Daniel, et al.
Publicado: (2024)

Threshold rates for properties of random codes
por: Guruswami, Venkatesan, et al.
Publicado: (2020)

Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
por: Mizunuma, Yuto, et al.
Publicado: (2026)

The Labeled Coupon Collector Problem
por: Tan, Andrew, et al.
Publicado: (2025)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
por: Gabric, Daniel, et al.
Publicado: (2026)

Reconstructing graphs with subgraph compositions
por: Dailly, Antoine, et al.
Publicado: (2025)

On Average Distance, Level-1 Fourier Weight, and Chang's Lemma
por: Yu, Lei
Publicado: (2025)

Evaluating the Gilbert-Varshamov Bound for Constrained Systems
por: Goyal, Keshav, et al.
Publicado: (2024)

Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
por: Goyal, Keshav, et al.
Publicado: (2024)

Improved Upper Bound for the Size of a Trifferent Code
por: Bhandari, Siddharth, et al.
Publicado: (2024)

On the Codebook Design for NOMA Schemes from Bent Functions
por: Li, Chunlei, et al.
Publicado: (2025)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
por: Alrabiah, Omar, et al.
Publicado: (2023)

Optimal Repair Bandwidth and Repair I/O of $(n,n-2,2)$ MDS Array Codes
por: Wu, Huawei
Publicado: (2026)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
por: Aigner-Horev, Elad, et al.
Publicado: (2023)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
por: Wang, Geyang, et al.
Publicado: (2025)

Recoverable systems and the maximal hard-core model on the triangular lattice
por: Wang, Geyang, et al.
Publicado: (2026)

The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
por: Liang, Xue-Bin
Publicado: (2024)

When does a bent concatenation not belong to the completed Maiorana-McFarland class?
por: Kudin, Sadmir, et al.
Publicado: (2024)

Automated Discovery of Improved Constant Weight Binary Codes
por: Rosin, Christopher D.
Publicado: (2026)

Millions of inequivalent quadratic APN functions in eight variables
por: Beierle, Christof, et al.
Publicado: (2025)

Nearly Orthogonal Sets over Finite Fields
por: Chawin, Dror, et al.
Publicado: (2024)

The Fundamental Limits of Recovering Planted Subgraphs
por: Lee, Daniel, et al.
Publicado: (2025)

Three observations on the Colin de Verdière spectral graph parameter
por: Kaluža, Vojtěch, et al.
Publicado: (2024)

4-tangrams are 4-avoidable
por: Ochem, Pascal, et al.
Publicado: (2025)

A Method for Generating Connected Erdos-Renyi Random Graphs
por: Chinyaev, Boris
Publicado: (2025)

The capacity of a finite field matrix channel
por: Blackburn, Simon R., et al.
Publicado: (2022)

Constructing MRD codes by switching
por: Shi, Minjia, et al.
Publicado: (2022)

On constrained intersection representations of graphs and digraphs
por: Cicalese, Ferdinando, et al.
Publicado: (2025)

Average Case Analysis of Leaf-Centric Binary Tree Sources
por: Benkner, Louisa Seelbach, et al.
Publicado: (2018)

Improved Constructions of Skew-Tolerant Gray Codes
por: Himelfarb, Gabriel Sac, et al.
Publicado: (2024)

Construction of orientable sequences in $O(1)$-amortized time per bit
por: Gabric, Daniel, et al.
Publicado: (2024)

Determining a graph from its reconfiguration graph
por: Berthe, Gaétan, et al.
Publicado: (2025)

A Proof of Bala's General-$m$ Representation of the Harmonic Numbers
por: Niu, Tong
Publicado: (2026)

Poset Positional Games
por: Bagan, Guillaume, et al.
Publicado: (2024)

The Normal Play of the Domination Game
por: Brito, João Marcos, et al.
Publicado: (2025)

Three-chromatic geometric hypergraphs
por: Damásdi, Gábor, et al.
Publicado: (2021)