Image de couverture de livre

Transfer Operators and Independence Polynomials for Strong Powers of Circulant Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Hildebrant, Todd
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Algebraic and Combinatorial Stability of Independence Polynomials in Iterated Strong Products of Cycles
par: Hildebrant, Todd
Publié: (2025)

Polynomials, Divided Differences, and Codes
par: Venkitesh, S.
Publié: (2024)

The Cloud and Flock Polynomials of q-Matroids
par: Gluesing-Luerssen, Heide, et autres
Publié: (2025)

Polynomial Invariants of q-Matroids and Rank-Metric Codes
par: Gluesing-Luerssen, Heide, et autres
Publié: (2025)

Outer Strong Blocking Sets
par: Alfarano, Gianira N., et autres
Publié: (2023)

Polynomial Freiman-Ruzsa, Reed-Muller codes and Shannon capacity
par: Abbe, Emmanuel, et autres
Publié: (2024)

Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
par: Guo, Zeyu, et autres
Publié: (2026)

Advances in the Shannon Capacity of Graphs
par: Lavi, Nitay, et autres
Publié: (2025)

On the Ratio of Shannon Numbers of Graphs
par: Alipour, Sharareh, et autres
Publié: (2023)

On H-Intersecting Graph Families and Counting of Homomorphisms
par: Sason, Igal
Publié: (2025)

Generalized GM-MDS: Polynomial Codes are Higher Order MDS
par: Brakensiek, Joshua, et autres
Publié: (2023)

Explicit Entropic Constructions for Coverage, Facility Location, and Graph Cuts
par: Iyer, Rishabh
Publié: (2026)

Entropy of Exchangeable Random Graphs
par: Skeja, Anda, et autres
Publié: (2023)

Quantifying Multivariate Graph Dependencies: Theory and Estimation for Multiplex Graphs
par: Skeja, Anda, et autres
Publié: (2024)

SASH: Decoding Community Structure in Graphs
par: Beemer, Allison, et autres
Publié: (2025)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
par: Guo, Zeyu, et autres
Publié: (2023)

Partial and Exact Recovery of a Random Hypergraph from its Graph Projection
par: Bresler, Guy, et autres
Publié: (2025)

Optimal Erasure Codes and Codes on Graphs
par: Chen, Yeyuan, et autres
Publié: (2025)

Private Information Retrieval over Graphs
par: Ge, Gennian, et autres
Publié: (2025)

Cluster Synchronization via Graph Laplacian Eigenvectors
par: Timofeyev, Tobias, et autres
Publié: (2025)

Coded Information Retrieval for Block-Structured DNA-Based Data Storage
par: Bar-Lev, Daniella
Publié: (2026)

Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems
par: Jakhar, Gunank, et autres
Publié: (2026)

Triprojective almost perfect nonlinear permutations and functions
par: Göloğlu, Faruk, et autres
Publié: (2026)

On the Number of Subsequences in the Nonbinary Deletion Channel
par: Li, Han, et autres
Publié: (2026)

The Closure of LCD-to-GI Reductions via Generalized Inner Products
par: Ishizuka, Keita
Publié: (2026)

Intersecting Codes and the Connectivity of $q$-Matroids
par: Conca, Fabrizio, et autres
Publié: (2026)

Optimal codes and arcs for the generalized Hamming weights
par: Kurz, Sascha, et autres
Publié: (2026)

Error-detecting solid codes
par: Carruth, Nathan Thomas
Publié: (2026)

Turán-Theoretic Bounds on Several Elementary Trapping Sets in LDPC Codes
par: Zhao, Ziyang, et autres
Publié: (2026)

A generalization of Boppana's entropy inequality
par: Ho, Boon Suan
Publié: (2026)

Improved Rate-versus-Distance Upper Bounds for LDPC Codes
par: Shangguan, Chong, et autres
Publié: (2026)

On the independence number of de Bruijn graphs
par: Majer, Pietro, et autres
Publié: (2026)

The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
par: Xiong, Yanzhen, et autres
Publié: (2026)

Maximal Recoverability: A Nexus of Coding Theory
par: Brakensiek, Joshua, et autres
Publié: (2026)

On the existence of linear rank-metric intersecting codes
par: Borello, Martino, et autres
Publié: (2026)

Semidefinite and linear programming bounds for sum-rank-metric codes and non-existence results
par: Abiad, Aida, et autres
Publié: (2026)

Symmetric Tensor Decompositions over Finite Fields
par: Cotardo, Giuseppe, et autres
Publié: (2026)

Improved Johnson-type Bounds for Insertion-Deletion Codes
par: Yang, Yulin
Publié: (2026)

Geometric construction of k-optimal locally repairable codes
par: Fu, Yi, et autres
Publié: (2026)

Double-Cover-Based Analysis of the Bethe Permanent of Block-Structured Positive Matrices
par: Wu, Binghong, et autres
Publié: (2026)