Results 131 to 140 of about 6,246 (257)
Noûs, EarlyView.ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure.
Balthasar Grabmayr
wiley +1 more source
Graph Isomorphism Algorithms: Investigation Of The Graph Isomorphism Problem
, 1995 As a precursor to possible applications of graph isomorphism to simulation, IST examined the current status of the computational complexity of graph ...
Franceschini, Robert W. +2 more
core
On computing local monodromy and the numerical local irreducible decomposition
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source
Two graph isomorphism polytopes
, 2009 The convex hull ψn,n of certain (n!)2 tensors was considered recently in connection with graph isomorphism. We consider the convex hull ψn of the n! diagonals among these tensors. We show: 1. The polytope ψn is a face of ψn,n. 2.
Onn, Shmuel
core +1 more source
On the isomorphism testing of graphs
, 2016 Graph Isomorphism is one of the very few classical problems in NP of unsettled complexity status. The families of highly regular structures, for example Steiner 2-designs, strongly regular graphs and primitive coherent configurations, have been perceived as difficult cases for graph isomorphism.
openaire +2 more sources
On the additive image of zeroth persistent homology
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer +3 more
wiley +1 more source
, 1996 Technical report TR96-20. The graph isomorphism problem can be easily stated: check to see if two graphs that look differently are actually the same. The problem occupies a rare position in the world of complexity theory, it is clearly in NP but is not ...
Fortin, Scott
core +1 more source
Graph isomorphism-based algorithm for cross-checking chemical and crystallographic descriptions. [PDF]
J Cheminform, 2023 Merkys A +5 more
europepmc +1 more source
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
Communications on Pure and Applied Mathematics, Volume 79, Issue 8, Page 1973-2102, August 2026.ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source
Predicting treatment response in adolescents and young adults with major depressive episodes from fMRI using graph isomorphism network. [PDF]
Neuroimage Clin, 2023 Duan J +9 more
europepmc +1 more source