Results 41 to 50 of about 142 (135)

A Vulnerability Lens for Intuitive‐Logic Scenarios

FUTURES &FORESIGHT SCIENCE, Volume 8, Issue 1, April 2026.
ABSTRACT Exploration of possibilities by means of intuitive logic is hampered by a large number of scenarios, which easily exceed the limits imposed by human bounded rationality. While many practitioners constrain their scenarios within a 2 × 2 $2\times 2$ matrix by design, more structured approaches point to rationales such as eliminating ...
Guido Fioretti
wiley   +1 more source

Color-critical graphs and hypergraphs with few edges and no short cycles

Discrete Mathematics, 1998
An \(r\)-coloring of a hypergraph \((V, {\mathcal G})\) with vertex set \(V\) and edge set \({\mathcal G}\) is a coloring of its vertices with at most \(r\) colors such that each edge is incident with at least two vertices of different colors. \((V, {\mathcal G})\) is \(r\)-chromatic if \(r\) is the smallest integer for which \((V, {\mathcal G})\) is \(
H. L. Abbott, Donovan R. Hare, Bing Zhou 0004   +2 more
openaire   +1 more source

A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs

CAAI Transactions on Intelligence Technology, Volume 11, Issue 2, Page 396-410, April 2026.
ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie, Chuang Liu, Yang Chen, Zi‐Ke Zhang, Xiaoyang Liu, Xiu‐Xiu Zhan   +5 more
wiley   +1 more source

Hypergraphs with arbitrarily small codegree Turán density

Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.
Abstract The codegree Turán density γ(F)$\gamma (F)$ of a k$k$‐graph F$F$ is the smallest γ∈[0,1)$\gamma \in [0,1)$ such that every k$k$‐graph H$H$ with δk−1(H)⩾(γ+o(1))|V(H)|$\delta _{k-1}(H)\geqslant (\gamma +o(1))\vert V(H)\vert$ contains a copy of F$F$. In this work, we show that for every ε>0$\varepsilon >0$, there is a k$k$‐uniform hypergraph F$F$
Simón Piga, Bjarne Schülke
wiley   +1 more source

Cognitive Networks for Knowledge Modeling: A Gentle Introduction for Data‐ and Cognitive Scientists

WIREs Cognitive Science, Volume 17, Issue 2, March/April 2026.
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.
Edith Haim, Massimo Stella
wiley   +1 more source

Lightweight Hybrid Wafer Defect Pattern Network Based on Feedforward Efficient Attention

CAAI Transactions on Intelligence Technology, Volume 11, Issue 1, Page 149-166, February 2026.
ABSTRACT With the increase of semiconductor integration density, in order to cope with the increase of wafer defect complexity and types, especially the low recognition accuracy of overlapping mixed defects and unknown wafer defects, this study proposes a lightweight model for wafer defect detection called LightWMNet.
Zhiqiang Hu, Yiquan Wu
wiley   +1 more source

Stability Analysis of Different Quaternion‐Valued Impulsive BAM Neural Networks With Unknown Parameters and Time‐Varying Delays

Engineering Reports, Volume 8, Issue 1, January 2026.
This work tackles the unresolved stability problem of heterogeneous quaternion‐valued BAM neural networks plagued by unknown parameters, time‐varying delays, and impulses. By synergizing Lyapunov theory with inequality techniques, we establish rigorous, yet practical, global stability conditions.
Xi Long, Yaqin Li
wiley   +1 more source

Steiner Triple Systems With High Discrepancy

Journal of Combinatorial Designs, Volume 34, Issue 1, Page 5-14, January 2026.
ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 and n ≡ 1 , 3 ( mod 6 ), any r‐colouring of the triples on [ n ] admits a Steiner triple system of order n with discrepancy Ω ( n 2 ).
Lior Gishboliner, Stefan Glock, Amedeo Sgueglia   +2 more
wiley   +1 more source

Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals

Journal of Algebra, 2011
20 pages; v2 contains relatively minor changes in presentation and updated references.
Francisco, Christopher A., Hà, Huy Tài, Van Tuyl, Adam   +2 more
openaire   +3 more sources

Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets

Discrete Mathematics, 1992
The authors give several combinatorial statements all trivially deducible from Rado's compactness principle.
Miroslaw Truszczynski, Zsolt Tuza
openaire   +2 more sources