Results 91 to 100 of about 1,405,425 (255)
Journal of Combinatorial Designs, Volume 33, Issue 12, Page 456-470, December 2025.ABSTRACT A family ℱ of subsets of [ n ] = { 1 , 2 , … , n } shatters a set A ⊆ [ n ] if for every A ′ ⊆ A, there is an F ∈ ℱ such that F ∩ A = A '. We develop a framework to analyze f ( n , k , d ), the maximum possible number of subsets of [ n ] of size d that can be shattered by a family of size k.
Noga Alon +2 more
wiley +1 more source
Three hypergraph eigenvector centralities [PDF]
SIAM Journal on Mathematics of Data Science, 2018 Eigenvector centrality is a standard network analysis tool for determining the importance of (or ranking of) entities in a connected system that is represented by a graph.
Austin R. Benson
semanticscholar +1 more source
Hamilton ℓ-cycles in uniform hypergraphs
Journal of Combinatorial Theory, Series A, 2010 v3: corrected very minor error in Lemma 4.6 and the proof of Lemma 6 ...
Kühn, Daniela +2 more
openaire +2 more sources
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
Book free 3-uniform hypergraphs
Discrete MathematicsA $k$-book in a hypergraph consists of $k$ Berge triangles sharing a common edge. In this paper we prove that the number of the hyperedges in a $k$-book-free 3-uniform hypergraph on $n$ vertices is at most $\frac{n^2}{8}(1+o(1))$.
Debarun Ghosh +5 more
openaire +3 more sources
Computer-Aided Civil and Infrastructure Engineering, Volume 40, Issue 29, Page 5625-5648, 9 December 2025.Abstract Multiple sensors are strategically deployed within concrete dams to monitor structural behavior under intricate environmental conditions. The diverse monitoring parameters, spatial configurations, and temporal variations across these sensors often engender performance conflicts.
Xiaosong Shu +8 more
wiley +1 more source
Human Brain Mapping, Volume 46, Issue 16, November 2025.Flowchart for estimating multiway multiscale interactions within brain networks. ABSTRACT Complex biological systems, like the brain, exhibit intricate multiway and multiscale interactions that drive emergent behaviors. In psychiatry, neural processes extend beyond pairwise connectivity, involving higher‐order interactions critical for understanding ...
Qiang Li +5 more
wiley +1 more source
Information-Theoretic Limits and Strong Consistency on Binary Non-uniform Hypergraph Stochastic Block Models [PDF]
, 2023 Hai‐Xiao Wang
openalex +1 more source
Determination of the Optimal Window Size for the Spatial XOR Filter
Software: Practice and Experience, Volume 55, Issue 11, Page 1773-1784, November 2025.ABSTRACT Introduction An XOR filter is a probabilistic data structure representing a set of keys for membership queries. Given a set X⊂𝒰 of n$$ n $$ keys, and hash functions h1,…,hk:𝒰→{1,…,m}, the filter relies on filling in an array H[1,…,m]$$ H\left[1,\dots, m\right] $$ such that, for all x∈X$$ x\in X $$, h1(x)⊕⋯⊕hk(x)$$ {h}_1(x)\oplus \cdots \oplus {
Paulo Diogo Rodrigues Leão +2 more
wiley +1 more source
Monochromatic loose paths in multicolored $k$-uniform cliques [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 For integers $k\ge 2$ and $\ell\ge 0$, a $k$-uniform hypergraph is called a loose path of length $\ell$, and denoted by $P_\ell^{(k)}$, if it consists of $\ell $ edges $e_1,\dots,e_\ell$ such that $|e_i\cap e_j|=1$ if $|i-j|=1$ and $e_i\cap e_j=\emptyset$
Andrzej Dudek, Andrzej Ruciński
doaj +1 more source