Results 11 to 20 of about 7,886 (170)
Cognitive Networks for Knowledge Modeling: A Gentle Introduction for Data- and Cognitive Scientists. [PDF]
Cognitive network science helps organize associative knowledge—that is, the connections between concepts. These connections play a key role in cognitive processes such as language understanding and context interpretation, even though they are not obvious in language use.
Haim E, Stella M.
europepmc +2 more sources
$L_p$ regular sparse hypergraphs: box norms [PDF]
We consider some variants of the Gowers box norms, introduced by Hatami, and show their relevance in the context of sparse hypergraphs. Our main results are the following. Firstly, we prove a generalized von Neumann theorem for $L_p$ graphons. Secondly, we give natural examples of pseudorandom families, that is, sparse weighted uniform hypergraphs ...
Dodos, P. +2 more
openaire +3 more sources
Decomposition of regular hypergraphs [PDF]
An r-block is a 0, 1-matrix in which every row has sum r. Let Sn be the set of pairs (k, l) such that the columns of any (k+l)-block with n rows split into a k-block and an l-block. We determine Sn for n ≤ 5. In particular, S3 = {(k, l) : 2 | kl}, S4 = {(k, l) : (6 | k or l) and (1 / ∈ {k, l})}, and S5 = {(k, l) : 11 6= min{k, l} > 7 and each value in {
Jeong Ok Choi, Douglas B. West
openaire +1 more source
Regular slices for hypergraphs [PDF]
Abstract We present a ‘Regular Slice Lemma’ which, given a k-graph G , returns a regular ( k − 1 ) -complex J with respect to which G has useful regularity properties. We believe that many arguments in extremal hypergraph theory are made considerably simpler by using this lemma rather than existing forms of the Strong ...
Allen, Peter +3 more
openaire +2 more sources
Double Domination and Regular Domination in Intuitionistic Fuzzy Hypergraph
This study investigates the domination, double domination, and regular domination in intuitionistic fuzzy hypergraph (IFHG), which has enormous application in computer science, networking, chemical, and biological engineering.
P. Aruna Sri +3 more
doaj +1 more source
On characterizing hypergraph regularity [PDF]
AbstractSzemerédi's Regularity Lemma is a well‐known and powerful tool in modern graph theory. This result led to a number of interesting applications, particularly in extremal graph theory. A regularity lemma for 3‐uniform hypergraphs developed by Frankl and Rödl [8] allows some of the Szemerédi Regularity Lemma graph applications to be extended to ...
Dementieva, Y. +3 more
openaire +1 more source
ON THE NORMALITY OF t-CAYLEY HYPERGRAPHS OF ABELIAN GROUPS [PDF]
A t-Cayley hypergraph X = t-Cay(G; S) is called normal for a finite group G, if the right regular representationR(G) of G is normal in the full automorphism group Aut(X) of X. In this paper, we investigate the normality of t-Cayley hypergraphs of abelian
R. Bayat, M. Alaeiyan, S. Firouzian
doaj +1 more source
Steiner Configurations Ideals: Containment and Colouring
Given a homogeneous ideal I⊆k[x0,…,xn], the Containment problem studies the relation between symbolic and regular powers of I, that is, it asks for which pairs m,r∈N, I(m)⊆Ir holds.
Edoardo Ballico +4 more
doaj +1 more source
Sparse SYK and traversable wormholes
We investigate two sparse Sachdev-Ye-Kitaev (SYK) systems coupled by a bilinear term as a holographic quantum mechanical description of an eternal traversable wormhole in the low temperature limit.
Elena Cáceres +2 more
doaj +1 more source
Background: Data-driven event analysis has gradually become the backbone of modern competitive sports analysis. Increasingly, competitive sports data analysis tasks use computer vision and machine learning models for intelligent data analysis.
Zhuo Shi +5 more
doaj +1 more source

