Results 81 to 90 of about 2,959 (186)
Supervised Restricted Data Fusion With Common, Local, and Distinct Components
Journal of Chemometrics, Volume 40, Issue 8, August 2026.ABSTRACT In multi‐block data, the dominant sources of variation are not always most relevant to a response of interest, meaning that purely exploratory decompositions may fail to recover subtle but important response‐associated structure. We introduce PESCAR, a supervised extension of Penalised Exponential Simultaneous Component Analysis (PESCA) that ...
Fred T. G. White +6 more
wiley +1 more source
Discrete Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Sonntag, Hanns-Martin Teichert
openaire +2 more sources
Asymmetric Results About Graph Homomorphisms
Random Structures &Algorithms, Volume 69, Issue 1, August 2026.ABSTRACT Many important results in extremal graph theory can be roughly summarized as “if a triangle‐free graph G$$ G $$ has certain properties, then it has a homomorphism to a triangle‐free graph Γ$$ \Gamma $$ of bounded size.” For example, bounds on homomorphism thresholds give such a statement if G$$ G $$ has sufficiently high minimum degree, and ...
Lior Gishboliner +2 more
wiley +1 more source
European Journal of Combinatorics, 2001 Formulas for the cycle index of the representation of the symmetric group of degree \(n\) acting on all subsets of the object set are derived and applied through \(n=7\). These can be used to enumerate hypergraphs with Pólya's enumeration theorem. The approach is similar to that of \textit{E. M. Palmer} [Discrete Math. 6, 377-390 (1973; Zbl 0269.05110)]
openaire +2 more sources
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barry Guiduli, Zoltán Király
openaire +2 more sources
Physical Review E, 2023 Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce complex hypergraphs (chygraphs), bringing together concepts from hypergraphs, multi-layer networks, simplicial ...
openaire +3 more sources
The number of regular simplices in higher dimensions
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract We study the extremal function Sdk(n)$S^k_d(n)$, defined as the maximum number of regular (k−1)$(k-1)$‐simplices spanned by n$n$ points in Rd$\mathbb {R}^d$. For any fixed d⩾2k⩾6$d\geqslant 2k\geqslant 6$, we determine the asymptotic behavior of Sdk(n)$S^k_d(n)$ up to a lower‐order term.
Felix Christian Clemen +2 more
wiley +1 more source
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
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract In 1973, Erdős conjectured the existence of high girth (n,3,2)$(n,3,2)$‐Steiner systems. Recently, Glock, Kühn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erdős' conjecture. Recently, Kwan, Sah, Sawhney, and Simkin proved Erdős' conjecture.
Michelle Delcourt, Luke Postle
wiley +1 more source