Results 51 to 60 of about 40,185 (227)
Discrete Mathematics, 1976 AbstractA t-design T=(X, B), denoted by (λ; t, k, v), is a system B of subsets of size k from a v-set X, such that each t-subset of X is contained in exactly λ elements of B. A hypergraph H=(Y, E) is a finite set Y where E=(Ei: iϵI) is a family of subsets (which we assume here are distinct) of Y such that Ei≠Ø, iϵl, and ⋃Ei=Y.
Earl S. Kramer, Dale M. Mesner
openaire +2 more sources
Journal of Physics: Complexity, 2023 Abstract Most real-world networks are endowed with the small-world property, by means of which the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. The evidence sparkled a wealth of studies trying to reveal possible mechanisms through which the pairwise interactions amongst the ...
Raghav, Tanu +2 more
openaire +4 more sources
Semisupervised Hypergraph Discriminant Learning for Dimensionality Reduction of Hyperspectral Image
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2020 Semisupervised learning is an effective technique to represent the intrinsic features of a hyperspectral image (HSI), which can reduce the cost to obtain the labeled information of samples.
Fulin Luo +4 more
doaj +1 more source
Discrete Mathematics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
CoRoFR: Community Detection of Feature Graph Improves Feature Selection Using Robust Fuzzy Rough Set
Advanced Intelligent Systems, EarlyView.In machine learning, features often function as communities in many tasks, especially in medicine. However, existing feature selection methods struggle to mine feature collaborations, which can boost predictive performance. Moreover, they are noise‐sensitive, leading to suboptimal feature selection and accuracy degradation.
Duanyang Feng +4 more
wiley +1 more source
Humanities & Social Sciences CommunicationsHigher-order relationships exist widely across different disciplines. In the realm of real-world systems, significant interactions involving multiple entities are common.
Bodian Ye +7 more
doaj +1 more source
Multipartite entanglement detection for hypergraph states
, 2017 We study the entanglement properties of quantum hypergraph states of $n$ qubits, focusing on multipartite entanglement. We compute multipartite entanglement for hypergraph states with a single hyperedge of maximum cardinality, for hypergraph states ...
Bruß, Dagmar +4 more
core +1 more source
Steiner Triple Systems With High Discrepancy
Journal of Combinatorial Designs, EarlyView.ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 $r\ge 3$ and n ≡ 1 , 3 ( mod 6 ) $n\equiv 1,3\,(\mathrm{mod}\,6)$, any r $r$‐colouring of the triples on [ n ] $[n]$ admits a Steiner triple system of order n $n$ with discrepancy Ω ( n 2 ) ${\rm{\Omega }}({
Lior Gishboliner +2 more
wiley +1 more source
A Note on Set Systems with no Union of Cardinality 0 modulo m [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Alon, Kleitman, Lipton, Meshulam, Rabin and Spencer (Graphs. Combin. 7 (1991), no. 2, 97-99) proved, that for any hypergraph F ={F 1,F 2,…, F d(q-1)+1 }, where q is a prime-power, and d denotes the maximal degree of the hypergraph, there exists
Vince Grolmusz
doaj +2 more sources
Analysis of quantum error correction with symmetric hypergraph states
, 2018 Graph states have been used to construct quantum error correction codes for independent errors. Hypergraph states generalize graph states, and symmetric hypergraph states have been shown to allow for the correction of correlated errors. In this paper, it
Bruß, Dagmar +2 more
core +1 more source