Results 51 to 60 of about 16,397 (156)
Webb's conjecture and generalised Harish‐Chandra theory
Bulletin of the London Mathematical Society, Volume 57, Issue 4, Page 1083-1092, April 2025.Abstract Webb's conjecture states that the orbit space of the Brown complex of a finite group at any given prime ℓ$\ell$ is contractible. This conjecture was proved by Symonds in 1998. In this paper, we suggest a generalisation of Webb's conjecture for finite reductive groups.
Damiano Rossi
wiley +1 more source
Hypergraphs with finitely many isomorphism subtypes
, 1989 . Let & = (H, E) be an n-uniform infinite hypergraph such that the number of isomorphism types of induced subgraphs of 2? of cardinality X is finite for some infinite X .
H. Kierstead, P. Nyikos
semanticscholar +1 more source
Lagrangian approximation of totally real concordances
Proceedings of the London Mathematical Society, Volume 130, Issue 4, April 2025.Abstract We show that a two‐dimensional totally real concordance can be approximated by a Lagrangian concordance whose Legendrian boundary has been stabilised both positively and negatively sufficiently many times. The main applications that we provide are constructions of knotted Lagrangian concordances in arbitrary four‐dimensional symplectisations ...
Georgios Dimitroglou Rizell
wiley +1 more source
Goodness‐of‐fit testing based on graph functionals for homogeneous Erdös–Rényi graphs
Scandinavian Journal of Statistics, Volume 52, Issue 1, Page 332-380, March 2025.Abstract The Erdös–Rényi graph is a popular choice to model network data as it is parsimoniously parameterized, straightforward to interpret and easy to estimate. However, it has limited suitability in practice, since it often fails to capture crucial characteristics of real‐world networks. To check its adequacy, we propose a novel class of goodness‐of‐
Barbara Brune +2 more
wiley +1 more source
Subgraph Matching Kernels for Attributed Graphs [PDF]
, 2012 We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be applied to ...
Kriege, Nils, Mutzel, Petra
core
Action planning for graph transition systems [PDF]
, 2005 Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication, object orientation, concurrency, mobility and distribution.
Edelkamp, Stefan +2 more
core +1 more source
GAHLS: an optimized graph analytics based high level synthesis framework. [PDF]
Sci Rep, 2023 Xiao Y, Nazarian S, Bogdan P.
europepmc +1 more source
Temporal networks in biology and medicine: a survey on models, algorithms, and tools. [PDF]
Netw Model Anal Health Inform Bioinform, 2023 Hosseinzadeh MM +3 more
europepmc +1 more source
Homomorphic Preimages of Geometric Cycles
, 2015 A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H.
Cockburn, Sally
core
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. [PDF]
Algorithmica, 2022 Nederlof J, Swennenhuis CMF.
europepmc +1 more source