English
Related papers

Related papers: Sandwich theorems and capacity bounds for non-comm…

200 papers

The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables that are needed and sufficient to define the object of…

Discrete Mathematics · Computer Science 2024-02-06 Sandra Kiefer , Daniel Neuen

It is well known that the set of possible degree sequences for a graph on $n$ vertices is the intersection of a lattice and a convex polytope. We show that the set of possible degree sequences for a $k$-uniform hypergraph on $n$ vertices is…

Combinatorics · Mathematics 2012-01-31 Ricky Ini Liu

We study the problem of minimizing or maximizing the fundamental spectral gap of Schr\"odinger operators on metric graphs with either a convex potential or a ``single-well'' potential on an appropriate specified subset. (In the case of…

Spectral Theory · Mathematics 2024-01-10 Mohammed Ahrami , Zakaria El Allali , Evans M Harrell , James B. Kennedy

A graph is alpha-critical if its stability number increases whenever an edge is removed from its edge set. The class of alpha-critical graphs has several nice structural properties, most of them related to their defect which is the number…

Combinatorics · Mathematics 2008-12-15 Jean-Paul Doignon , Samuel Fiorini , Gwenaël Joret

The Glazman-Povzner-Wienholtz theorem states that the completeness of a manifold, when combined with the semiboundedness of the Schr\"odinger operator $-\Delta + q$ and suitable local regularity assumptions on $q$, guarantees its essential…

Spectral Theory · Mathematics 2021-12-30 Aleksey Kostenko , Mark Malamud , Noema Nicolussi

We establish new couplings among several random graph and multigraph models related to the random regular graph $G(n,d)$, including the configuration model and unions of random perfect matchings. As a main result, we verify the…

Combinatorics · Mathematics 2025-10-27 Pu Gao , Mikhail Isaev , Xavier Perez-Gimenez

We introduce the notion of noncommutative complex spheres with partial commutation relations for the coordinates. We compute the corresponding quantum symmetry groups of these spheres, and this yields new quantum unitary groups with partial…

Quantum Algebra · Mathematics 2019-08-02 Simeng Wang

Let $G$ be a graph on $n$ vertices, independence number $\alpha(G)$, Lov\'asz theta function $\vartheta(G)$, and Shannon capacity $\Theta(G)$. We define $n_{\ge0}(G)$ to be the minimum number of non-negative eigenvalues taken over all…

Combinatorics · Mathematics 2025-07-01 Quanyu Tang , Shengtong Zhang , Clive Elphick

In this paper we establish some foundations regarding sheaves of vector spaces on graphs and their invariants, such as homology groups and their limits. We then use these ideas to prove the Hanna Neumann Conjecture of the 1950's; in fact,…

Combinatorics · Mathematics 2011-06-20 Joel Friedman

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

Logic · Mathematics 2015-08-20 M. Malliaris , S. Shelah

A well-known theorem of Lax and Wendroff states that if the sequence of approximate solutions to a system of hyperbolic conservation laws generated by a conservative consistent numerical scheme converges boundedly a.e. as the mesh parameter…

Numerical Analysis · Mathematics 2007-05-23 Volker Elling

Kirkpatrick et al. [ALT 2019] and Fallat et al. [JMLR 2023] introduced non-clashing teaching and proved that it is the most efficient batch machine teaching model satisfying the collusion-avoidance benchmark established in the seminal work…

Computational Complexity · Computer Science 2026-03-25 Sujoy Bhore , Liana Khazaliya , Fionn Mc Inerney

We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on…

Quantum Physics · Physics 2019-06-26 J. R. Yusupov , K. K. Sabirov , M. Ehrhardt , D. U. Matrasulov

We present a short introductory overview of the non-commutative extensions of several classical physical theories. After a general discussion of the reasons that suggest that the non-commutativity is a major issue that will eventually lead…

Mathematical Physics · Physics 2007-05-23 R. Kerner

A fundamental result in the study of graph homomorphisms is Lov\'asz's theorem that two graphs are isomorphic if and only if they admit the same number of homomorphisms from every graph. A line of work extending Lov\'asz's result to more…

Discrete Mathematics · Computer Science 2022-11-28 Ben Young

We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…

Computational Complexity · Computer Science 2009-11-10 Shmuel Friedland

In the 1970s, Gy\H{o}ri and Lov\'{a}sz showed that for a $k$-connected $n$-vertex graph, a given set of terminal vertices $t_1, \dots, t_k$ and natural numbers $n_1, \dots, n_k$ satisfying $\sum_{i=1}^{k} n_i = n$, a connected vertex…

Data Structures and Algorithms · Computer Science 2023-03-31 Katrin Casel , Tobias Friedrich , Davis Issac , Aikaterini Niklanovits , Ziena Zeif

One presents a phase-space noncommutative extension of Quantum Cosmology in the context of a Kantowski-Sachs (KS) minisuperspace model. We obtain the Wheeler-DeWitt (WDW) equation for the noncommutative system through the ADM formalism and…

High Energy Physics - Theory · Physics 2009-07-24 C. Bastos , O. Bertolami , N. Dias , J. Prata

We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…

Differential Geometry · Mathematics 2022-10-04 Bobo Hua , Florentin Münch

We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a Sinkhorn-type algorithm. We use the derangement graph…

Combinatorics · Mathematics 2019-12-03 Simon Schmidt , Chase Vogeli , Moritz Weber