Results 81 to 90 of about 40,185 (227)

Interval hypergraphs and D-interval hypergraphs

Discrete Mathematics, 1977
AbstractA hypergraph H = (V, E) is called an interval hypergraph if there exists a one-to-one function ƒ mapping the elements of V to points on the real line such that for each edge E, there is an interval I, containing the images of all elements of E, but not the images of any elements not in E1.
openaire   +1 more source

On Universal Hypergraphs

The Electronic Journal of Combinatorics, 2016
A hypergraph $H$ is called universal for a family $\mathcal{F}$ of hypergraphs, if it contains every hypergraph $F \in \mathcal{F}$ as a copy. For the family of $r$-uniform hypergraphs with maximum vertex degree bounded by $\Delta$ and at most $n$ vertices any universal hypergraph has to contain $\Omega(n^{r-r/\Delta})$ many edges.
Olaf Parczyk, Samuel Hetterich, Yury Person   +2 more
openaire   +3 more sources

Hypergraph coverings and Ramanujan Hypergraphs

, 2023
In this paper we investigate Ramanujan hypergraphs by using hypergraph coverings. We first show that the spectrum of a $k$-fold covering $\bar{H}$ of a connected hypergraph $H$ contains the spectrum of $H$, and that it is the union of the spectrum of $H$ and the spectrum of an incidence-signed hypergraph with $H$ as underlying hypergraph if $k=2 ...
Song, Yi-Min, Fan, Yi-Zheng, Miao, Zhengke   +2 more
openaire   +2 more sources

An integrated spatiotemporal trust and consensus fusion framework for dam safety assessment with multi‐sensor anomaly detection

Computer-Aided Civil and Infrastructure Engineering, EarlyView.
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, HaiBo Yang, Fan Wu, Yuhang Zhou, Peng Xu, Xinyi Liu, Jinjun Guo, Yingchun Cai, Jinyu Fan   +8 more
wiley   +1 more source

Finite models for positive combinatorial and exponential algebra

Bulletin of the London Mathematical Society, EarlyView.
Abstract We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of non‐negative integers whose equational theory has no finite axiomatisation, and show this also holds if factorial, fixed base exponentiation and operations for binomial coefficients are adjoined.
Tumadhir Alsulami, Marcel Jackson
wiley   +1 more source

Energies of Hypergraphs

The Electronic Journal of Linear Algebra, 2020
In this paper, energies associated with hypergraphs are studied. More precisely, results are obtained for the incidence and the singless Laplacian energies of uniform hypergraphs. In particular, bounds for the incidence energy are obtained as functions of well known parameters, such as maximum degree, Zagreb index and spectral radius.
Kauê Cardoso, Vilmar Trevisan
openaire   +3 more sources

Legal hypergraphs

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2023
Complexity science provides a powerful framework for understanding physical, biological and social systems, and network analysis is one of its principal tools. Since many complex systems exhibit multilateral interactions that change over time, in recent years, network scientists have become increasingly interested in modelling and ...
Corinna Coupette, Dirk Hartung, Daniel Martin Katz   +2 more
openaire   +3 more sources

Large language models for bioinformatics

Quantitative Biology, Volume 14, Issue 1, March 2026.
Abstract With the rapid advancements in large language model technology and the emergence of bioinformatics‐specific language models (BioLMs), there is a growing need for a comprehensive analysis of the current landscape, computational characteristics, and diverse applications.
Wei Ruan, Yanjun Lyu, Jing Zhang, Jiazhang Cai, Peng Shu, Yang Ge, Yao Lu, Shang Gao, Yue Wang, Peilong Wang, Lin Zhao, Tao Wang, Yufang Liu, Luyang Fang, Ziyu Liu, Zhengliang Liu, Yiwei Li, Zihao Wu, Junhao Chen, Hanqi Jiang, Yi Pan, Zhenyuan Yang, Jingyuan Chen, Shizhe Liang, Wei Zhang, Terry Ma, Yuan Dou, Jianli Zhang, Xinyu Gong, Qi Gan, Yusong Zou, Zebang Chen, Yuanxin Qian, Shuo Yu, Jin Lu, Kenan Song, Xianqiao Wang, Andrea Sikora, Gang Li, Xiang Li, Quanzheng Li, Yingfeng Wang, Lu Zhang, Yohannes Abate, Lifang He, Wenxuan Zhong, Rongjie Liu, Chao Huang, Wei Liu, Ye Shen, Ping Ma, Hongtu Zhu, Yajun Yan, Dajiang Zhu, Tianming Liu   +54 more
wiley   +1 more source

Beyond pairwise clustering [PDF]

, 2005
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the hypergraph partitioning problem.
Agarwal, Sameer, Belongie, Serge, Kriegman, David, Lim, Jongwoo, Perona, Pietro, Zelnik-Manor, Lihi   +5 more
core   +2 more sources

On partitioning of hypergraphs

Discrete Mathematics, 2007
We study edge-isoperimetric problems (EIP) for hypergraphs and extend some technique in this area from graphs to hypergraphs. In particular, we establish some new results on a relationship between the EIP and some extremal poset problems, and apply them to obtain an exact solution of the EIP for certain hypergraph families.
S. Bezrukov, Battiti, Roberto
openaire   +3 more sources