Cover Image

Degree-$M$ Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-negative Matrix

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Huang, Yuwen, Kashyap, Navin, Vontobel, Pascal O.
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Double-Cover-Based Analysis of the Bethe Permanent of Block-Structured Positive Matrices
by: Wu, Binghong, et al.
Published: (2026)

Complex-Valued-Matrix Permanents: SPA-based Approximations and Double-Cover Analysis
by: Zhou, Junda, et al.
Published: (2026)

Understanding the ratio of the partition sum to its Bethe approximation via double covers
by: Vontobel, Pascal O.
Published: (2025)

Graph-Cover-based Characterization of the Bethe Partition Function of Double-Edge Factor Graphs
by: Huang, Yuwen, et al.
Published: (2025)

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

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

Bounding and Estimating the Classical Information Rate of Quantum Channels with Memory
by: Cao, Michael X., et al.
Published: (2019)

Bounds on Box Codes
by: Langberg, Michael, et al.
Published: (2025)

Monimial Matrix Analogue of Yoshida's theorem
by: Chakraborty, Ananda
Published: (2025)

Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four: Part I: Problem Formulation and More
by: Liu, Shaocheng, et al.
Published: (2023)

Bounds on $k$-hash distances and rates of linear codes
by: Della Fiore, Stefano, et al.
Published: (2025)

Improved Johnson-type Bounds for Insertion-Deletion Codes
by: Yang, Yulin
Published: (2026)

Improved Rate-versus-Distance Upper Bounds for LDPC Codes
by: Shangguan, Chong, et al.
Published: (2026)

Rank-metric codes over arbitrary fields: Bounds and constructions
by: Neri, Alessandro, et al.
Published: (2026)

PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
by: Hollmann, Henk D. L., et al.
Published: (2024)

Upper Bounds on Multiple $b$-Burst Deletion-Correcting Codes
by: Wang, Chen, et al.
Published: (2026)

Error-Resilient Weakly Constrained Coding via Row-by-Row Coding
by: Mishra, Prachi, et al.
Published: (2024)

Turán-Theoretic Bounds on Several Elementary Trapping Sets in LDPC Codes
by: Zhao, Ziyang, et al.
Published: (2026)

Bounds on Sphere Sizes in the Sum-Rank Metric and Coordinate-Additive Metrics
by: Couvée, Hugo Beeloo-Sauerbier, et al.
Published: (2024)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
by: Chen, Yeyuan, et al.
Published: (2024)

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

A New Construction of Non-Binary Deletion Correcting Codes and their Decoding
by: Schaller, Michael, et al.
Published: (2025)

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
by: Laddha, Aditi, et al.
Published: (2025)

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

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

New Correlation Bound and Construction of Quasi-Complementary Code Sets
by: Sarkar, Palash, et al.
Published: (2022)

On the Range of the Permanent of $(\pm1)$-Matrices
by: Ingram, DeVon, et al.
Published: (2025)

Coded Information Retrieval for Block-Structured DNA-Based Data Storage
by: Bar-Lev, Daniella
Published: (2026)

Focal-free uniform hypergraphs and codes
by: Huang, Xinqi, et al.
Published: (2024)

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

Estimators for Substitution Rates in Genomes from Read Data
by: Rathore, Shiv Pratap Singh, et al.
Published: (2026)

On the Coverage Required for Diploid Genome Assembly
by: Mahajan, Daanish, et al.
Published: (2024)

Trace Reconstruction of First-Order Reed-Muller Codewords Using Run Statistics
by: Rathore, Shiv Pratap Singh, et al.
Published: (2025)

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
by: Alrabiah, Omar, et al.
Published: (2024)

Bounds on MLDR Codes Over ${\mathbb Z}_{p^t}$
by: Alderson, Tim L.
Published: (2024)

Estimating the Weight Enumerators of Reed-Muller Codes via Sampling
by: Jain, Shreyas, et al.
Published: (2024)

On a recent extension of a family of biprojective APN functions
by: Kölsch, Lukas
Published: (2024)

Combinatorial Bounds for List Recovery via Discrete Brascamp--Lieb Inequalities
by: Brakensiek, Joshua, et al.
Published: (2025)

On a conjecture on APN permutations
by: Bartoli, Daniele, et al.
Published: (2021)

New upper bounds on binary linear codes and a $\mathbb Z_4$-code with a better-than-linear Gray image
by: Kiermaier, Michael, et al.
Published: (2015)