Results 21 to 30 of about 1,639 (93)
Advanced Quantum Technologies, Volume 8, Issue 12, December 2025.The hybrid approach to Quantum Supervised Machine Learning is compatible with Noisy Intermediate Scale Quantum (NISQ) devices but hardly useful. Pure quantum kernels requiring fault‐tolerant quantum computers are more promising. Examples are kernels computed by means of the Quantum Fourier Transform (QFT) and kernels defined via the calculation of ...
Massimiliano Incudini +2 more
wiley +1 more source
Eigenvalues of Non-Regular Linear-Quasirandom Hypergraphs [PDF]
, 2014 Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended this characterization to k-uniform hypergraphs, but only for the so-called ...
Lenz, John, Mubayi, Dhruv
core
On a generalisation of Mantel's theorem to uniformly dense hypergraphs
, 2017 For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$.
Reiher, Christian +2 more
core +1 more source
Journal of Graph Theory, Volume 110, Issue 1, Page 82-91, September 2025.ABSTRACT An inversion of a tournament T is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let inv k ( T ) be the minimum length of a sequence of inversions using sets of size at most k that result in the transitive tournament.
Raphael Yuster
wiley +1 more source
A Weighted Regularity Lemma with Applications
International Journal of Combinatorics, Volume 2014, Issue 1, 2014., 2014 We prove an extension of the regularity lemma with vertex and edge weights which in principle can be applied for arbitrary graphs. The applications involve random graphs and a weighted version of the Erdős‐Stone theorem. We also provide means to handle the otherwise uncontrolled exceptional set.
Béla Csaba +2 more
wiley +1 more source
Homogeneous Multigrid for Hybrid Discretizations: Application to HHO Methods
Numerical Methods for Partial Differential Equations, Volume 41, Issue 5, September 2025.ABSTRACT We prove the uniform convergence of the geometric multigrid V‐cycle for hybrid high‐order (HHO) and other discontinuous skeletal methods. Our results generalize previously established results for HDG methods, and our multigrid method uses standard smoothers and local solvers that are bounded, convergent, and consistent.
Daniele A. Di Pietro +4 more
wiley +1 more source
Characterizations of Semihyperrings by Their (∈γ, ∈γ∨qδ)‐Fuzzy Hyperideals
Journal of Applied Mathematics, Volume 2013, Issue 1, 2013., 2013 The concepts of (∈γ, ∈γ∨qδ)‐fuzzy bi‐hyperideals and (∈γ, ∈γ∨qδ)‐fuzzy quasi‐hyperideals of a semihyperring are introduced, and some related properties of such (∈γ, ∈γ∨qδ)‐fuzzy hyperideals are investigated. In particular, the notions of hyperregular semihyperrings and left duo semihyperrings are given, and their characterizations in terms of ...
Xiaokun Huang +3 more
wiley +1 more source
Hamilton cycles in graphs and hypergraphs: an extremal perspective [PDF]
, 2014 As one of the most fundamental and well-known NP-complete problems, the Hamilton cycle problem has been the subject of intensive research. Recent developments in the area have highlighted the crucial role played by the notions of expansion and quasi ...
Kühn, Daniela, Osthus, Deryk
core +1 more source
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
Journal of Graph Theory, Volume 109, Issue 4, Page 466-480, August 2025.ABSTRACT Given a hypergraph ℋ, the dual hypergraph of ℋ is the hypergraph of all minimal transversals of ℋ. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner hypergraphs are the conformal Sperner hypergraphs, which correspond to the families of maximal cliques of graphs.
Endre Boros +3 more
wiley +1 more source
Combinatorial theorems relative to a random set [PDF]
, 2014 We describe recent advances in the study of random analogues of combinatorial theorems.Comment: 26 pages.
Conlon, David
core +2 more sources