Image de couverture de livre

Tales of Hoffman: from a distance

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Abiad, Aida, Meeus, Jan
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Quantum Physics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Hoffman colorings of graphs
par: Abiad, Aida, et autres
Publié: (2024)

Hoffman colorability of (strongly) regular graphs
par: Abiad, Aida, et autres
Publié: (2025)

Eigenvalue bounds for distance-edge colorings
par: Abiad, Aida, et autres
Publié: (2025)

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
par: Abiad, Aida, et autres
Publié: (2024)

The clique number of the exact distance $t$-power graph: complexity and eigenvalue bounds
par: Abiad, Aida, et autres
Publié: (2024)

Eigenvalue bounds for the quantum chromatic number of graph powers
par: Abiad, Aida, et autres
Publié: (2025)

On the $Z_q$-forcing number: computational approach and exact values
par: Abiad, Aida, et autres
Publié: (2025)

Unified bounds for the independence number of graph powers
par: Abiad, Aida, et autres
Publié: (2024)

An algebraic-combinatorial framework for finding the average hitting times in graphs with high regularity
par: Abiad, Aida, et autres
Publié: (2026)

Propagation processes on (hyper)graphs: where zero forcing and burning meet
par: Abiad, Aida, et autres
Publié: (2026)

A unified framework for the Expander Mixing Lemma for irregular graphs and its applications
par: Abiad, Aida, et autres
Publié: (2024)

Switching graphs and Hadamard matrices
par: Abiad, Aida, et autres
Publié: (2024)

Logical aspects of isomorphism of controllable graphs and cospectrality of distance-regularized graphs
par: Abiad, Aida, et autres
Publié: (2026)

Constructing cospectral hypergraphs
par: Abiad, Aida, et autres
Publié: (2022)

Improved Gilbert-Varshamov bound for sum-rank-metric codes via graph theory
par: Abiad, Aida, et autres
Publié: (2025)

On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
par: Abiad, Aida, et autres
Publié: (2023)

Note on the product of the largest and the smallest eigenvalue of a graph
par: Abiad, Aida, et autres
Publié: (2024)

On the sum of the largest and smallest eigenvalues of odd-cycle free graphs
par: Abiad, Aida, et autres
Publié: (2025)

The Shannon capacity of graph powers
par: Abiad, Aida, et autres
Publié: (2025)

Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
par: Abiad, Aida, et autres
Publié: (2026)

On the existence of small strictly Neumaier graphs
par: Abiad, Aida, et autres
Publié: (2023)

Infinitely many counterexamples to a conjecture of Lovász
par: Abiad, Aida, et autres
Publié: (2025)

The Eigenvalue Method in Coding Theory
par: Abiad, Aida, et autres
Publié: (2025)

A graph energy conjecture through the lenses of semidefinite programming
par: Abiad, Aida, et autres
Publié: (2025)

Counting cospectral graphs obtained via switching
par: Abiad, Aida, et autres
Publié: (2025)

Eigenvalue bounds and alternating rank-metric codes
par: Abiad, Aida, et autres
Publié: (2024)

MUBs from bent functions
par: Kantor, William M.
Publié: (2026)

The inertia bound is far from tight
par: Kwan, Matthew, et autres
Publié: (2023)

Boson-fermion complementarity in a linear interferometer: An identity relating the determinant and permanent of a matrix
par: Jabbour, Michael G., et autres
Publié: (2023)

Simulating NMR Spectra with a Quantum Computer
par: Ossorio-Castillo, Joaquín, et autres
Publié: (2024)

A quantum algorithm for learning a graph of bounded degree
par: Ferber, Asaf, et autres
Publié: (2024)

Simultaneous variances of Pauli strings, weighted independence numbers, and a new kind of perfection of graphs
par: Xu, Zhen-Peng, et autres
Publié: (2025)

A linear programming bound for sum-rank metric codes
par: Abiad, Aida, et autres
Publié: (2024)

Random-projector quantum diagnostics of Ramsey numbers and a prime-factor heuristic for $R(5,5)=45$
par: Tamburini, Fabrizio
Publié: (2025)

A Quantum Encoding of Traveling Salesperson Tours via Route Generation, Cost Phases, and a Valid-Permutation Oracle
par: Stasik, Alexander Johannes, et autres
Publié: (2026)

The Hoffman program for mixed graphs
par: Yu, Yuantian, et autres
Publié: (2024)

Switching methods of level 2 for the construction of cospectral graphs
par: Abiad, Aida, et autres
Publié: (2024)

A Lovász theta lower bound on Quantum Max Cut
par: Huber, Felix
Publié: (2025)

Progress in the study of the (non)existence of genuinely unextendible product bases
par: Demianowicz, Maciej
Publié: (2025)

Quantum circuit for exponentiation of Hamiltonians: an algorithmic description based on tensor products
par: Fleury, Gerard, et autres
Publié: (2025)