Results 101 to 110 of about 40,185 (227)
The role of twins in computing planar supports of hypergraphs
, 2020 A support or realization of a hypergraph $H$ is a graph $G$ on the same vertex as $H$ such that for each hyperedge of $H$ it holds that its vertices induce a connected subgraph of $G$.
Kanj, Iyad A. +4 more
core
Ce‐LLMs: Status and trends of education‐specific large language models developed in China
Future in Educational Research, Volume 3, Issue 3, Page 505-525, September 2025.Abstract The prevalence of AI hallucination in general‐purpose large language models (LLMs) poses significant pedagogical challenges, particularly in terms of content credibility and reliability. In response, China has launched the development of education‐specific LLMs as a national strategic initiative. However, current reports on Chinese educational
Tao Xie, Yingli Zhou, Jiazhen Yu
wiley +1 more source
Weak hypergraph regularity and linear hypergraphs
Journal of Combinatorial Theory, Series B, 2010 AbstractWe consider conditions which allow the embedding of linear hypergraphs of fixed size. In particular, we prove that any k-uniform hypergraph H of positive uniform density contains all linear k-uniform hypergraphs of a given size. More precisely, we show that for all integers ℓ⩾k⩾2 and every d>0 there exists ϱ>0 for which the following holds: if ...
Vojtěch Rödl +3 more
openaire +2 more sources
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
3-Zero-Divisor Hypergraph with Respect to an Element in Multiplicative Lattice
Cumhuriyet Science Journal, 2019 Let be a multiplicative lattice and be a proper element of . We introduce the3-zero-divisor hypergraph of with respect to which is a hypergraph whose vertices areelements of the set where distinct vertices and are adjacent, that is, is a hyperedge if and
Gülşen Ulucak
doaj +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
Discrete Mathematics, 1978 Let α(H) be the stability number of a hypergraph H = (X, E). T(n, k, α) is the smallest q such that there exists a k-uniform hypergraph H with n vertices, q edges and with α(H) ⩽ α. A k-uniform hypergraph H, with n vertices, T(n, k, α) edges and α(H) ⩽α is a Turan hypergraph. The value of T(n, 2, α) is given by a theorem of Turan.
openaire +2 more sources
iMeta, Volume 4, Issue 4, August 2025.RepliChrom is an interpretable machine learning model that predicts enhancer‐promoter interactions using DNA replication timing across multiple cell types. By integrating replication timing with chromatin interaction data from multiple experimental platforms, it accurately distinguishes true interactions and reveals promoter‐region signals as key ...
Fuying Dao +7 more
wiley +1 more source
Journal of Combinatorial Designs, Volume 33, Issue 8, Page 300-309, August 2025.ABSTRACT We investigate the lazy burning process for Latin squares by studying their associated hypergraphs. In lazy burning, a set of vertices in a hypergraph is initially burned, and that burning spreads to neighboring vertices over time via a specified propagation rule.
Anthony Bonato +3 more
wiley +1 more source
Completion and decomposition of hypergraphs by domination hypergraphs
, 2023 A graph consists of a finite non-empty set of vertices and a set of unordered pairs of vertices, called edges. A dominating set of a graph is a set of vertices D such that every vertex not in D is adjacent to some vertex in D. A hypergraph on a finite set X is a collection of subsets of X, none of which is a proper subset of another.
openaire +4 more sources